Greedy Forwarding Routing Strategy Based on Energy Efficiency in Wireless Sensor Network
Greedy Forwarding (GF) is a kind of simple and efficient routing protocol in wireless sensor network, which is widely applied in the field of data monitoring. In order to prolong the network lifetime and decrease the probability of occurrence of routing void without adding the protocol complexity, the best way is searching optimal commutation radius which can make the network in the best condition. In the present study, a complex mechanism is introduced to solve the routing void problem, which invisibly increases the complexity of GF. With regard to prolonging network lifetime, searching the communication radius for minimum energy consumption is a common method, but the radius for minimum energy consumption is usually inconsistent with the radius for maximum network lifetime. In this paper, two methods are adopted as follows. Firstly, the probability model of occurrence of routing void is established and the optimal radius for no routing void in a certain probability is achieved, so as to avoid the routing void and guarantee the connectivity of the network. Secondly, the optimal radius for maximum network lifetime is achieved by analyzing the lifetime of the first dead node though estimating the position and the total number of packets forwarding of the first dead node. The simulation results show that the model can reflect the variation of network lifetime very well and get the optimal radius