A Distributed Energy-Efficient Cluster Formation Protocol for Wireless Sensor Networks

Abstract

Maximizing network lifetime and minimizing energy consumption are among the central concerns in the design of applications and protocols for wireless sensor networks (WSN). Clustering has been proven energy-efficient in sensor networks since data processing, filtering routing and relaying are operated only by cluster heads, thus reducing network load and alleviating the bandwidth. In this paper, we propose a novel distributed clustering algorithm where cluster heads are elected following a three-way message exchange between each sensor and its neighbors. Sensor's eligibility to be elected cluster head is mainly based on its residual energy and its degree. Our protocol has a message exchange complexity of O(1) and a worst-case convergence time complexity of O(N ). Simulations show that our algorithm outperforms EESH, a recently published distributed clustering algorithm, in terms of network lifetime and ratio of elected cluster heads.

BeeWS: Honeybee-inspired, Large-Scale Routing Protocol for Wireless Sensor Networks (WSNs)

“…Therefore, it is not applied to a real environment. Energy-efficient cluster formation protocol (EECF) (Chamam and Pierre, 2009) and energy-efficient strong head clustering (EESH) (Wei et al, 2007) using the method of multi-hop is clustering protocols. Energy efficient hierarchical clustering (EEHC) has been developed by Maria (1997).…”

NEURON: Enabling Autonomicity in Wireless Sensor Networks

“…CHs process, filter and aggregate data sent by cluster members, thus reducing network load and bandwidth utilisation. Besides, non-CH sensors are not involved in routing and relaying data and transmissions are only operated by CHs [ 15 ]. During the clustering process, it is necessary to take into account aspects such as the cluster size and formation, criteria for CHs selection, how to control inter-cluster and intra-cluster collisions and energy saving issues [ 15 ].…”

“…Furthermore, adequate distribution of CHs over the sensor field has to be accomplished [ 4 ]. Finally, since CHs consume more energy in aggregating and routing data, it is essential to have an energy-efficient mechanism for CHs election and rotation [ 15 ].…”

“…Cluster formation is typically based on the energy reserve of sensors and sensor’s proximity to the CH [ 30 ]. Low-Energy Adaptive Clustering Hierarchy (LEACH) [ 15 ] was one of the first clustering algorithms proposed for sensor networks. LEACH is a distributed, proactive, dynamic algorithm that forms clusters of sensors based on the received signal strength and uses local CHs as routers to the sink.…”

“…The transition to an overlay approach for the WSN deployment, operation and management has to be combined with energy efficient techniques, such as clustering and hierarchical routing techniques [ 14 ]. Nodes that are elected to operate as Cluster Heads (CHs) are involved mainly in routing and packet relaying functions while the rest nodes perform a minimum set of operations [ 15 ]. Furthermore, the available routing information may be exploited from upper layer mechanisms and make them more efficient.…”