An Energy-efficient Cluster Head Election Algorithm in Wireless Sensor Networks

In the two-tiered wireless sensor networks(WSN),how to design a more efficient distributed cluster head election algorithm is a crucial problem.In all algorithms proposed before,some depend on random greatly,and others only take homogeneous into account.On the basis of them,this paper proposes a new practical approach,in which the old cluster head,as to the power information,chooses the two nodes which supply the cluster with the maximum lifetime if they are elected as the new cluster head and the new one’s assistant.The simulation performance results demonstrate the efficiency of the method compared with the random choosing algorithm in much longer network lifetime.