一个基于节点覆盖的簇头选举算法

摘要

A wireless sensor network aims to get the useful information of an area. However, the amount of information obtained depends on the ratio of coverage. Based on some cluster head election algorithms, a new cluster head election algorithm is proposed in this paper. In the scheme, the selected cluster heads do not sense data, and do not affect the coverage of the network even it dies earlier. If the consumption of the transmission is firstly distributed on this kind of nodes, then, the other nodes whose death can affect the coverage of the network can be used to be cluster heads later, and this may postpone the death of nodes, and accordingly, the lifetime of the network can be prolonged. Experiments show that compared with other current algorithms, the proposed algorithm based on the coverage of nodes has a higher ratio of node coverage and lower energy consumption, and thus has a longer network life cycle.%无线传感器网络以获取有用信息为最终目的,而获得的有用信息的多少取决于对网络的覆盖程度.本文在现有的一些簇头选举算法的基础上,提出一个新的簇头选举算法.该算法选举的簇头具有不进行数据感知,优先死亡但不影响网络覆盖的良好性能.如果把传输消耗优先分配在这类簇头节点上,那么死亡后影响覆盖的节点就可以在较晚的时间作为簇头,从而延迟死亡时间,最终延长网络的生命周期.实验结果显示,和现有的相关算法相比,本文提出的基于节点覆盖的簇头选举算法具有较高的网络覆盖率和较少的能量消耗,从而具有较长的网络生命周期.