About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
HONET-ICT 2015
Conference paper
A consistent approach towards clustering in low energy adaptive clustering hierarchy protocol
Abstract
Wireless Sensor Networks (WSNs) facilitate efficient and reliable monitoring of specified area for multiple applications. Variety of protocols are designed to increase the effectiveness and lifetime of WSNs. Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of them. LEACH is a hierarchical clustering based protocol where data is transferred to the data evaluation center through an intermediary node i.e., cluster head (CH). Cluster heads (CHs) consume much more energy than normal sensor nodes which requires CH's job to be rotated among all the nodes. CHs are chosen randomly with a predefined probability of fixed update intervals (round) to preserve energy of each node and to increase the lifetime of the whole network. In this paper, we propose an enhancement to the LEACH protocol. The clustering mechanism in LEACH protocol is not efficient to endorse optimal number of CHs. The proposed clustering algorithm selects nearly equal number of CHs in each round to evenly distribute the energy dissipation and therefore delays node failures and increases the network lifetime.