A Hierarchical Routing Protocol Based on Location Information for Wireless Sensor Networks

For the limitation of energy of wireless sensor network node, this paper combine with the characteristics of hierarchical routing protocols and location-based routing protocols, proposed a hierarchical routing protocol based on the geographical location (HRBGR). In the HRBGR algorithm, the coverage of the sensor network is divided into some areas based on nodes location information evenly, then self-organized clusters according to local information in each area and decide the CH and the agent independently in each cluster. All of the cluster head nodes construct a routing tree by the way of seeking the help of the principle of minimum spanning tree algorithm of prim and transfer the data to the base station by means of multi-hop communications. Theory and simulation analysis shows that the algorithm extends the whole network's life cycle at lower level energy consumption and reduces delay, improves network load balance.