An Improved Spray And Wait Algorithm Based on the Node Social Tree

In delay-tolerant networks(DTN), the timeliness of the node’s social circle and encounter time between nodes have a different effect in designing router algorithms. Considering these factors, this paper proposes an improved spray and wait algorithm based on the node social tree (TNST). Specifically, we will first combine the node’s own attributes with social ability to calculate the node’s delivery capability value. Followed by it, we build and update the social node tree with the delivery capability for each node. Finally, we will predict the encounter time between nodes, which based on their motion information. The node will select the encounter node as the relay node if the message’s destination node is in the node social tree. Otherwise, the node whose social tree with higher propagation capacity will be selected as the relay node. Simulation results show that the TNST algorithm improves the delivery rate and reduces network overhead.