FEED: fault tolerant, energy efficient, distributed clustering for WSN

Authors:
Mohammad Mehranil;Jamshid Shanbehzadeh;Abdolhossein Sarrafzadeh;Seyed Javad Mirabedini;Chris Manford
Affiliations:
Islamic Azad University, Dezful Branch, Iran;Department of computer Tarbiat Moallem University, Tehran, Iran;Department of Computing, UNITEC, Auckland, New Zealand;Islamic Azad University, Tehran, Iran;Department of Computing, UNITEC, Auckland, New Zealand
Venue:
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Year:
2010

Citing 7
Cited 0

TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Cluster-Head Election Using Fuzzy Logic for Wireless Sensor Networks

CNSR '05 Proceedings of the 3rd Annual Communication Networks and Services Research Conference
RETT-gen: A globally efficient routing protocol for wireless sensor networks by equalising sensor energy and avoiding energy holes

Ad Hoc Networks
Mobility-aware clustering algorithms with interference constraints in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Constructing special k-dominating sets using variations on the greedy algorithm

Pervasive and Mobile Computing
Fast track article: EEDTC: Energy-efficient dominating tree construction in multi-hop wireless networks

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Increasing network lifetime, scalability and load balancing are important factors for wireless sensor networks. Clustering is a useful technique through which we can effect these factors. In this paper, we propose a new method of clustering which prolongs network lifetime by using energy, density and centrality factors and also the distances between nodes for making clusters. We assume a supervisor node for every cluster head which is to be its replacement when the cluster head fails. This property causes an increase in network lifetime and also helps the network to be fault tolerant. Simulation results demonstrate that using the proposed method offers significant improvement in clustering especially in network lifetime in comparison with the LEACH and HEED methods.