A power- and coverage-aware clustering scheme for wireless sensor networks

Authors:
Liang Xue;Xin-Ping Guan;Zhi-Xin Liu;Qing-Chao Zheng
Affiliations:
Research Office of Networking Control, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004;Research Office of Networking Control, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004 and School of Electronic, Information and Electrical Engineering, Shanghai J ...;Research Office of Networking Control, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004;Research Office of Networking Control, Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004
Venue:
International Journal of Automation and Computing
Year:
2010

Citing 6
Cited 1

Multicluster, mobile, multimedia radio network

Wireless Networks
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
Distributed Clustering for Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

IEEE Transactions on Mobile Computing
Cluster head election techniques for coverage preservation in wireless sensor networks

Ad Hoc Networks
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

A novel adaptive cooperative location algorithm for wireless sensor networks

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many upper layer network functions. This study concentrates on how to form clusters with high uniformity while prolonging the network lifetime. A novel clustering scheme named power- and coverage- aware clustering (PCC) is proposed, which can adaptively select cluster heads according to a hybrid of the nodes' residual energy and loyalty degree. Additionally, the PCC scheme is independent of node distribution or density, and it is free of node hardware limitations, such as self-locating capability and time synchronization. Experiment results show that the scheme performs well in terms of cluster size (and its standard deviation), number of nodes alive over time, total energy consumption, etc.