Improving the network lifetime of a wireless sensor network using clustering techniques

Abstract

A wireless sensor network (WSN) is a network that consists of spatially distributed autonomous devices that use sensors to monitor the surrounding physical or environmental conditions. As WSNs are generally deployed over large areas or hostile environments, they are difficult to manage and monitor. Furthermore, the batteries cannot be easily recharged or replaced. This is a major drawback of a WSN. Clustering is an important method used for extending the lifetime of a network. It involves a cluster head (CH) which collects data from the cluster members (CMs) present in its cluster, and reports this data to the base station (BS). Thus, energy is conserved by sending data to the CH instead of the sink. An existing clustering technique for WSNs is the Low Adaptive Energy Clustering Hierarchy (LEACH). In this paper, the implementation of LEACH is discussed and an improvement of the LEACH model called Segmented LEACH is proposed. In order to further improve the network lifetime, the application of coalition game theory on a clustering algorithm is implemented. The simulation results show that the game theory model has a higher network lifetime, later first node death and lesser amount of energy consumption per node as compared to LEACH and Segmented LEACH model.