A clustering algorithm based on energy information and cluster heads expectation for wireless sensor networks

Authors:
Aimin Wang;Dailiang Yang;Dayang Sun
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun, Jilin 130012, China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin Un ...;College of Computer Science and Technology, Jilin University, Changchun, Jilin 130012, China and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin Un ...;College of Communication Engineering, Jilin University, Changchun, Jilin 130012, China
Venue:
Computers and Electrical Engineering
Year:
2012

Citing 15
Cited 5

A Configurable Time-Controlled Clustering Algorithm for Wireless Sensor Networks

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Self-Organization Routing Protocol Supporting Mobile Nodes for Wireless Sensor Network

IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
SecLEACH - A Random Key Distribution Solution for Securing Clustered Sensor Networks

NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
A Cluster Maintenance Algorithm Based on LEACH-DCHS Protoclol

NAS '08 Proceedings of the 2008 International Conference on Networking, Architecture, and Storage
Centralized Dynamic Clustering for Wireless Sensor Network

WAINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
BARC: A Battery Aware Reliable Clustering algorithm for sensor networks

Journal of Network and Computer Applications
Context-aware cluster-based hierarchical protocol for Wireless Sensor Networks

International Journal of Ad Hoc and Ubiquitous Computing
Hybrid Routing Protocol for Prolonged Network Lifetime in Large Scale Wireless Sensor Network

ICIMT '09 Proceedings of the 2009 International Conference on Information and Multimedia Technology
Power-efficient clustering routing protocol based on applications in wireless sensor network

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A distributed energy-efficient clustering protocol for wireless sensor networks

Computers and Electrical Engineering
An Energy Balancing LEACH Algorithm for Wireless Sensor Networks

ITNG '10 Proceedings of the 2010 Seventh International Conference on Information Technology: New Generations
MR-LEACH: Multi-hop Routing with Low Energy Adaptive Clustering Hierarchy

SENSORCOMM '10 Proceedings of the 2010 Fourth International Conference on Sensor Technologies and Applications
Network lifetime optimization in wireless sensor networks

IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks

Computers and Electrical Engineering
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

Energy efficient multipath data transfer scheme to mitigate false data injection attack in wireless sensor networks

Computers and Electrical Engineering
Predictable Energy Aware Routing based on Dynamic Game Theory in Wireless Sensor Networks

Computers and Electrical Engineering
An analysis of lifetime-extended algorithm for wireless sensor networks

Computers and Electrical Engineering
The evolution game analysis of clustering for asymmetrical multi-factors in WSNs

Computers and Electrical Engineering
Energy-efficient backbone formation in wireless sensor networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new method is proposed in this paper to improve Low Energy Adaptive Clustering Hierarchy (LEACH) by electing cluster heads according to the residual energy of the nodes dynamically. A sliding window is set up to adjust the electing probability and keep stable the expected number of the cluster heads using two parameters in this method, one is the initial energy information of the nodes and the other is the average energy information of those that have not already been cluster heads in the network. Meanwhile, the number of cluster heads which is fixed in the entire network lifetime in LEACH is modified to be a variable according to the number of the living nodes. Simulations show that the improvement for First Node Dies (FND) and Half of the Nodes Alive (HNA) is 41% and 36%, respectively over LEACH, 17% and 26% for Low Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection (LEACH-DCHS), 22% and 21% for Advanced Low Energy Adaptive Clustering Hierarchy (ALEACH).