Abstract-Hot spots in a wireless sensor network emerge as locations under heavy traffic load. Nodes in such areas quickly deplete energy resources, leading to disruption in network services. This problem is common for data collection scenarios in which Cluster Heads (CH) have a heavy burden of gathering and relaying information. The relay load on CHs especially intensifies as the distance to the sink decreases. To balance the traffic load and the energy consumption in the network, the CH role should be rotated among all nodes and the cluster sizes should be carefully determined at different parts of the network. This paper proposes a distributed clustering algorithm, Energy-efficient Clustering (EC), that determines suitable cluster sizes depending on the hop distance to the data sink, while achieving approximate equalization of node lifetimes and reduced energy consumption levels. We additionally propose a simple energy-efficient multihop data collection protocol to evaluate the effectiveness of EC and calculate the end-to-end energy consumption of this protocol; yet EC is suitable for any data collection protocol that focuses on energy conservation. Performance results demonstrate that EC extends network lifetime and achieves energy equalization more effectively than two wellknown clustering algorithms, HEED and UCR. Index Terms-Energy-efficient, clustering, wireless sensor network, multihop, hot spot issue.
EC (Energy-Efficient Clustering) REF considers the multi-hop data collection scenario and formulates an optimization problem that determines suitable cluster ranges depending on the hop distance to the sink.
An Energy-Efficient Clustering Solution for Wireless Sensor Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Mathematics Computer Science