Research On Geographic-Based Clustering Routing In Wireless Sensor Networks

Wireless sensor network (WSN) has been widely applied in recent years. It consists of mass tiny nodes with sensing, data processing and wireless communication modules. These battery powered nodes are usually deployed randomly and widely, it is difficult for them to be recharged or changed. Because of limited power, calculation ability and bandwidth, it is important to design the routing algorithm with low energy dissipation and long lifetime.First, the structure, features, application fields is generalized. Second, the current routing protocols of WSN are analyzed, mainly cluster-based routing protocols and geographic routing protocols. A routing algorithm based hierarchical and geographic routing, Optimal Hops-Based Adaptive Clustering Algorithm (OHACA), is represented to solve the disadvantage, such as high energy dissipation and short lifetime. In this algorithm, a process of energy selection is proceeded to make the nodes with less energy are more likely to go to sleep immediately; an adaptive mechanism is introduced to balance energy. A multi-hop routing based both power control and geographic information is adopted to avoid"heat point".Simulation results show that, the OHACA can extend the network lifetime, make a more efficient use of energy and guarantee a smaller delay. The network lifetime is about 1.88 times that of LEACH. Using the same energy, OHACA transmits 4.5 times data the LEACH algorithm transmits. Besides these, the OHACA can lower up to 45.5% delay the LEACH has.