A New Type of Hexagonal Fault-Tolerant Clustering Algorithm

Article Preview

Abstract:

In view of the problem that present most clustering algorithms are given priority to save energy but ignoring fault tolerance, this paper puts forward a new kind of hexagonal fault-tolerant clustering algorithm (HFTC). By increasing the middle management node, which controls nodes rate of false positives and managements topology within the cluster, this algorithm completes nondestructive substitution between nodes. At the same time, the introduction of backup nodes, it also improves the networks fault tolerance. The simulation experiments show that HFTC can guarantee a high fault tolerance in networks, make the network to send more packets, and prolong the network life effectively.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1728-1733

Citation:

Online since:

March 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Li XU, Yongfeng JU, Xue LI. The K-Tolerant Topology Control Method Based on Cluster Nodes Simplify Algorithm[J]. Modern Electronics Technique(2011).

Google Scholar

[2] Jian Cao, Na Pang, Zeliang Zhang, Zhe Zhang. Fault Tolerant Clustering Algorithm for Multimedia Sensor Networks[J]. Computer&Digital Engineering(2012).

Google Scholar

[3] Hongyan Zuo. Research on Fault Tolerance Mechanism based on Clustering in Wireless Sensor Networks[D]. Soochow University(2013).

Google Scholar

[4] Heinzelman W R, Chandrakasan A, Balakrishnan H. Energy-Efficient communic- ation protocol for wireless microsensor networks[J]. Proceedings of the 33th Annual Hawaii Int'l Conf on System Sciences., 2000: 3005−3014.

DOI: 10.1109/hicss.2000.926982

Google Scholar

[5] Mingyu Luo, Mengyang Chen. Hexagonal distributed cluster-base routing protocol based on event triggering[J]. MEIEI(2013), Applied Mechanics and Materials Vols. 427-429.

DOI: 10.4028/www.scientific.net/amm.427-429.2545

Google Scholar