Hierarchical Routing Algorithm For Wireless Sensor Networks Based On Energy Efficient

The wireless sensor networks (WSNs) is composed of large amount of low-priced mini sensor nodes which are deployed in monitoring area. These sensor nodes form a self-organization and multi-hop network system by wireless communication. The energy of wireless sensor nodes energy is limited, so a good kind of routing algorithm will reduce energy consumption. The design of routing algorithm for wireless sensor networks has got the focus in this field.Based on the analysis of several kinds of typical routing algorithm for WSNs, LEACH is studied especially which is the first hierarchical routing algorithm proposed for WSNs. To overcome the disadvantages of LEACH, an area-divided routing algorithm is proposed in this dissertation. It has two advanced points, one is that it divides the surveillance region into many small regions according to the number of cluster heads and the node with the maximum energy will become the clusters head in corresponding small region; the other is that the cluster head use multi-hop way to transmit information rather than one-hop in LEACH algorithm. The area-divided routing algorithm can get over the imbalance distribution of the cluster heads and the problem that some cluster heads may not have enough energy to support the communication of the cycle because of randomly selecting the cluster head. It can balance the energy consumption of the network and extend the network life cycle. It can shorten the distance data transmission between the cluster heads and effectively save energy consumption.The area-divided routing algorithm, LEACH and SEP are simulated by MATLAB in circular area and rectangular area. The network lifetime, energy consumption, transmission of information and the number of packages are simulated. The results adequately show that the improved algorithm can save network energy consumption, extend the network life cycle and so on.