关键词: 无线传感器网络, 簇头选举算法, pLEACH, LEACHC, 覆盖

Abstract:

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.

Key words: wireless sensor network;cluster head election algorithm;pLEACH;LEACHC;coverage