Research And Improvement Of Geographic Routing Algorithm In Wireless Sensor Network

Now wireless sensor network has been widely used in various fields, because it hasthe features as followed: low-cost and large-scale. Wireless sensor network isconsidered to be one of the most important high-tech researches. It is valuable for us todesign routing protocols conforming with the characteristics of wireless sensor network.Geographic routing protocol with characteristics of avoiding flooding, no routing table,a little bit of control overhead and strong expansion, therefore, has drawn most attentionfrom researchers. This essay will highlight two demerits that exist in geographic routing:routing holes and unbalanced energy consumption. We carry out our research from thefollowing two aspects:①By studying the method to solve the routing holes, we find out that though mostexisting geographic routing algorithms can successfully bypass the routing holes, butthe resolutions of bypassing holes always lead to bypassed blindly problems andtriangular problems. A large number of redundant routing paths will be produced. Thispaper is trying to figure out how to reduce the redundant routing paths. An improvedsegmented greedy routing algorithm called EMGR (Easy Modeling Greedy Routing) ispresented in this paper. It is based on the shape of routing holes. The algorithm describethe shape of the routing holes as concave domain and convex domain, according to thedifferent distribution of hole boundary nodes in the virtual coordinate. EMGR find asuitable transit node by the different shapes of holes. Then it uses segment greedyrouting to transmit data packets. EMGR algorithm can reduce the redundant paths andthe energy consumption of network effectively.②But EMGR algorithm did not consider the node energy issues when it decidedwhich node to be the next node to transmit data packets. Normally, geographic routingprotocols adopt greedy algorithm to select the next hop to reduce the number of routinghops and to ensure the data packet can reach the destination node as soon as possible. Inthis paper, the issue of energy-aware has been studied. We present a geographic routingprotocol called Energy and Distance Considered Geographic Routing (EDGR). It isbased on the energy-aware and distance consideration. The EDGR algorithm putsenergy and distance value in the same cost function which we have defined in this paper.The value of cost function is used to choose the next hop among all the neighbor nodes.This routing algorithm takes not only the promotion degree of the node but also the energy of the node into account. Obviously, EDGR can perform better with balancingnetwork energy consumption and extending the network life effectively.The experimental results show the effectiveness of the algorithm. Our research hasconstructed theoretical foundation for further research and application.