无线传感器网络中一种能量有效的簇头选举算法

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.