A routing algorithm on delay-tolerant of wireless sensor network based on the node selfishness
- PDF / 283,089 Bytes
- 9 Pages / 595.28 x 793.7 pts Page_size
- 40 Downloads / 218 Views
RESEARCH
Open Access
A routing algorithm on delay-tolerant of wireless sensor network based on the node selfishness Sai Zou1,2*, Wei Wang2 and Wenyong Wang2
Abstract 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. Keywords: Delay-tolerant; Node selfishness; Wireless sensor network; Markov
1. Introduction In recent years, routing has always been a core issue in the studies on wireless sensor network. And the network topology structure is transformed from simple structure (All nodes cannot move.) to not simple, for example, the heterogeneous structure (The monitoring nodes are stationary and the relay nodes are mobile.) and the structure that all nodes in the network move. The problem of the intermittent connectivity due to the random mobility of the nodes in the network brings great challenges to the routing [1]. T Spyropoulos et al. have presented routing for disruption-tolerant networks. It has given routing module that is dependent on the network characteristics exhibited [2]. A Vasilakos et al. have recommended protocols and applications of delaytolerant networks (DTNs) [3]. Wireless sensor network is a typical DTN [1]. A Dvir et al. have presented backpressure-based routing protocol for DTNs [4]. To solve the problem of the intermittent connectivity of the nodes in the DTN, we generally adopt the routing strategy based on carrier transfer. The * Correspondence: [email protected] 1 School of software engineering, Chongqing College of Electronic Engineering, Chongqing 401331, China 2 School of Computer Science and Engineering, University of Electronic Science and Technology, Chengdu 611731, China
nodes carry the message all the time. After encountering the appropriate nodes which are used to relay messages, the initial node delivers the messages in the form of multiple hops to the destination node. Thus, we know that the performance of the routing algorithm depends much on the intermediate nodes [5] and the messages arriving to the destination cost much more time (The delay of the network is large). However, in the application in the delay-tolerant wire
Data Loading...
