A Cluster Head Election Algorithm Based on the Coverage of Nodes

J4 ›› 2011, Vol. 33 ›› Issue (5): 1-8.

• 论文 • Next Articles

A Cluster Head Election Algorithm Based on the Coverage of Nodes

GAO Tiegang,NIU Weiwei

(School of Software,Nankai University,Tianjin 300071,China)

Received:2010-09-04 Revised:2010-12-15 Online:2011-05-25 Published:2011-05-25

Abstract

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

GAO Tiegang,NIU Weiwei. A Cluster Head Election Algorithm Based on the Coverage of Nodes[J]. J4, 2011, 33(5): 1-8.

References

1］陈林星.无线传感器网络技术与应用［M］.北京:电子工业出版社,2009.
［2］马祖长,孙怡宁,梅涛.无线传感器网络综述［J］.通信学报,2004, 25(4):114124.
［3］Heinzelman W R, Chandrakasan A P,Balakrishnan H.An ApplicationSpecific Protocol Architecture for Wireless Microsensor Networks［J］.IEEE Transactions on Wireless Communications, 2002, 1(4):660670.
［4］Gou Haosong,Yoo Younghwan,Zeng Hongqing.A PartitionBased LEACH Algorithm for Wireless Sensor Networks［C］∥Proc of IEEE the Ninth Int’l Conf on Computer and Information Technology,2009:4045.
［5］Smaragdakis G, Matta I, Bestacros A. A Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks［C］∥Proc of the 2nd Int’l Workshop on Sensor and Actor Network Protocols and Applications (SANPA), 2004:111.
［6］Li Q, Zhu Q X, Wang M W. Design of a Distributed EnergyEfficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks［J］.Computer Communication, 2006, 1(29):22302237.
［7］Younis O, Fahmy S.HEED: A Hybrid, EnergyEfficient, Distributed Clustering Approach for Ad Hoc Sensor Networks［C］∥Proc of the Twentythird Annual Joint Conference of the IEEE Computer and Communications Societies, 2004:660669.
［8］Murata T, Ishibuchi H. Performance Evaluation of Genetic Algorithms for Flowshop Scheduling Problems［C］∥Proc of the 1st IEEE Conf on Evolutionary Computation, 1994:812817.
［9］Estrin D.Tutorial “Wireless Sensor Networks” Part IV: Sensor Network Protocols, Mobicom［EB/OL］.［20021010］.http://nest1.ee.ucla.edu/tutorials/Mobicom02/.
［10］Liaw JiunJian, Dai ChenYi, Wang YiJie.The Steady Clustering Scheme for Heterogeneous Wireless Sensor Networks［C］∥Proc of Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing,2009:336341.
［11］DuarteMelo E J,Liu Mingyan.Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks［C］∥Proc of Global Telecommunications Conf,2002:2125.
［12］Weisstein, Eric W.Prime Spiral［EB/OL］.［20100406］.http://mathworld.wolfram.com/PrimeSpiral.html.
［13］Cheng W F, Liao X K, Shen C X. Maximal Coverage Scheduling in Wireless Directional Sensor Networks［J］.Journal of Software, 2009, 20(4):975984.

A Cluster Head Election Algorithm Based on the Coverage of Nodes

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments