WSN-based Greedy Algorithm For Energy Efficient Routing Strategy

Wireless Sensor Network is a new and self-organized wireless network without complex infrastructure. With the development of microelectronics, sensor technology and telecommunication technology, wireless sensor networks develop rapidly, some successful application has been made in the military and civilian aspects. Because of its wide applications, wireless sensor networks have a bright future of development. Compared with traditional networks, sensor networks have the following features:A sensor network typically consists of a large number of nodes with a dense distribution. Each node is impossible to maintain global information. The nodes have very limited energy, storage space and computing ability. Wireless sensor networks usually work in high-risk regions and unable to get close, sensor nodes are likely to be battery powered, and it is often very difficult to change or recharge batteries for these nodes. Of these, energy efficiency for extending network lifetime is one of the most important topics. So it is important to study new routing protocols for wireless sensor networks to extend the lifetime of wireless sensor networks.This article puts forward a routing strategy of the energy efficient data based on the greedy algorithm, provides the update algorithm of residual energy of the current cluster heads to neighbor cluster heads, and the new method avoiding the routing holes. Greedy routing algorithm is a simple and efficient algorithm through path establishment and Greedy Forwarding (GF) is an important routing strategy among those routing protocols based on location information in WSN. The established path is characterized by good direction and optimality. Taking the residual energy of the node into account, but there is routing void problem while using greedy forwarding. The results of the simulation experiment has proved that under the premise of ensuring the good routing direction, this strategy can consume the routing energy averagely on multiple nodes, realizing energy load balance, effectively avoiding routing holes and extending the survival time of the net. Particularly suitable for applications in heterogeneous networks.