A routing algorithm on delay-tolerant of wireless sensor network based on the node selfishness

摘要

According to the problem of the intermittent connectivity of the nodes in the delay-tolerant sensor network, considering that the nodes in the network are of social selfishness, we study how to reduce transmission delay and communication overhead on the basis of ensuring the message delivery success rate of the entire network. We present a delay-tolerant routing algorithm based on the node selfishness (DTSNS). Firstly, we divide the activity area into grids. Secondly, we predict the next mobile location of the nodes based on the Markov process and estimate the credibility of the nodes based on the node selfishness in order to reduce the network communication overhead and improve message delivery success rate. Then, we put forward the delay-tolerant algorithm based on delay constraints. Lastly, the simulation results show that the DTSNS has better performance which has higher level of data delivery rate and lower level of message delay and resource, compared with Spray and Focus, Spray and Wait, and Epidemic.