Global and Local Reliability-Based Routing Protocol for Wireless Sensor Networks

Abstract

In wireless sensor networks, the node reliability can affect the reliability of data transmission. To analyze the node reliability, this paper defines both betweenness centrality and dependency degree for a node to reflect its global reliability and local reliability, respectively. Based on the above definition, a global and local reliability-based routing (GLRR) protocol is proposed to guarantee the reliability of data transmission between a source and destination node in network. In GLRR, at first, some nodes, usually with greater betweenness centrality among their neighbors in a limited range, will be selected as the backtracking node. Moreover, all backtracking nodes then construct their backtracking paths from themselves to the source node separately, and each node on a backtracking path should calculate the dependency degree on its previous hop node. All the betweenness centrality and dependency degree will be forwarded to the source node along the backtracking paths, and be combined to design the routing metric, based on which, the source node can calculate an optimal backtracking path to forward packets to the corresponding backtracking node, meanwhile, this backtracking node will act as a new source node to launch another routing process until the packets be forwarded to the destination node. At last, the simulation results demonstrate that the proposed protocol is superior to the classical algorithms in terms of the network reliability and the network efficiency.