Research On Energy Efficient Clustering Routing Algorithm In Wireless Sensor Network

Wireless sensor network is a self-organizing wireless communication networksystem which is composed of a large number of sensor nodes. As a key part of thenetwork data transmission, routing algorithm is great impact on network performance.In this paper, we classify the routing protocols in wireless sensor networks,in-depth compare and analyze several classic routing protocols, summarize up theadvantages and disadvantages in cluster formation and routing algorithms. Finally,benefitted from the splendid thoughts in these classic routing algorithms, anenergy-efficient clustering routing algorithm EERP has been proposed. The maininnovations are as followed:1. At the cluster set-up phase, EERP comprehensively considers many factors,such as the residual energy of the nodes, the average residual energy of their neighbornodes, the distance between the nodes with their neighbor nodes and so on. EERP usestimers to measure these factors, the time of the nodes with high energy and near theirneighbor nodes is short, so those nodes have high probability to become cluster head.When the node becomes the cluster head, it will broadcast a cluster head message withcommunication radius r, and those nodes which receive the message will give up clusterhead competition. Through this mechanism, it makes the cluster heads distributedreasonable in the network and reduces the energy consumption of the whole network.2. At the inter-cluster routing phase，nodes in the network usually far away fromthe sink node, if the intra-cluster nodes directly communicate with the sink node, theconsumption of their energy is rapid, however, we use the multi-hop transmissionmethod to avoid this problem． Each cluster head node has a routing table to saverouting node information. According to the information of the routing table, each clusterhead computes forwarding factor R, according to the value of the forwarding factor,selects the appropriate node as its next hop. Forwarding factor R comprehensivelyconsiders the distance between the next hop with the node, the residual energy of thenode and so on. So, this multi-hop transmission method can efficiently use and balancethe energy of the nodes in the network, extend the network lifetime. In this article, we use NS2network simulation tools to simulate the EERP andLEACH. Simulation results show that the proposed algorithm EERP performs betterthan LEACH in terms of the stability of the cluster head, network lifetime, network totalenergy consumption, the number of packets the sink node receiving, balance of deathnodes in the network. However, the data packet delay in the EERP is very unstable, andit is the work direction for further improvement.