Energy-Efficient and Coverage-Aware Clustering in Wireless Sensor Networks

Abstract

Energy efficiency and sensing coverage are essential metrics for enhancing the lifetime and the utilization of wireless sensor networks. Many protocols have been developed to address these issues, among which, clustering is considered a key technique in minimizing the consumed energy. However, few clustering protocols address the sensing coverage metric. This paper proposes a general framework that addresses both metrics for clustering algorithms in wireless sensor networks. The proposed framework is based on applying the principles of Virtual Field Force on each cluster within the network in order to move the sensor nodes towards proper locations that maximize the sensing coverage and minimize the transmitted energy. Two types of virtual forces are used: an attractive force that moves the nodes towards the cluster head in order to reduce the energy used for communication and a repulsive force that moves the overlapping nodes away from each other such that their sensing coverage is maximized. The performance of the proposed mechanism was evaluated by applying it to the well-known LEACH clustering algorithm. The simulation results demonstrate that the proposed mechanism improves the performance of the LEACH protocol considerably in terms of the achieved sensing coverage, and the network lifetime.