ReviewA systematic review on clustering and routing techniques based upon LEACH protocol for wireless sensor networks
Introduction
Wireless Sensor Networks (WSNs) are being used in wide range of potential applications such as environment monitoring, military operations, target tracking and surveillance system, vehicle motion control, earthquake detection, patient monitoring systems, pollution control system etc. These networks consist of SNs which are capable of monitoring and processing the data from a particular geographical location and send the same to remote location which is called as Base Station (BS).
WSNs typically consist of small, inexpensive, resource constrained devices that communicate among each other using a multihop wireless communication. Each node of WSN is called as a SN which contains one sensor, embedded processors, limited memory, low-power radio, and is normally operated with battery. Each SN is responsible for sensing a desired event locally and for relaying a remote event sensed by other SNs so that the event is reported to the destination through BS. As SNs have limited energy so applications and protocols for WSNs should be carefully designed for optimized consumption of energy for prolonging the network lifetime. Figure 1 shows the generalized view of WSNs, which consists of a BS, Cluster Heads (CHs) and SNs deployed in a geographical region (Cook and Das, 2004).
Clustering has been widely used in WSNs for designing various energy efficient protocols in WSNs. One of the most common protocols used in this category is Low Energy Adaptive Clustering Hierarchy (LEACH) (Heinzelman et al., 2000). LEACH is a self-organizing, adaptive clustering protocol which uses equalized energy load distribution among the SNs in the WSN. The operation of LEACH is divided into rounds and each round is divided into two phases namely as: setup and steady-state phase. Steady-state phase is always long compared to the set-up phase to minimize the overhead. In LEACH protocol, the SNs organize themselves into local clusters, with one node acting as the leader and known as cluster head (CH) and rest of the nodes act as ordinary nodes. To prolong the lifetime of the network, LEACH includes randomized rotation of the high-energy CH and performs local data fusion to transmit the amount of data being sent from the CHs to the BS. If BS is far away from the network then the energy of CHs will be affected as only CHs are directly communicating with the BS. Set of clusters will be different for different time interval and the decision to become a CH depends on the amount of energy left at the SN. Figure 2 describes the various units in LEACH protocol consisting of transmitter and receiver.
It also shows various parameters of transmitter and receiver as defined by (Heinzelman et al., 2000) which are defined below. Transmitting radio equations are defined as follows (Heinzelman et al., 2000):
Receiving radio equations are is the radio energy dissipation for transmission and reception and is the amplification factor used for the transmission of k bit message to a distance d.
For cluster formation, each SN decides whether or not to become a CH for the current round. This decision is based on the percentage of CHs for the network and the number of times the SN has been a CH so far. In this process, every SN has to select a random number between 0 and 1. If the number is less than a threshold , the SN becomes a CH for the current round. The threshold is set as follows (Heinzelman et al., 2000):where P is the desired percentage of CHs (e.g., P=0.05), r is the current round, and G is the set of SNs that have not been CHs in the last 1/P rounds. During round 0, every SN has a probability P of becoming a CH. The SNs that are CHs in round 0 cannot be CHs for the next 1/P rounds. Thus the probability that the remaining SNs are CHs must be increased, since there are less SNs that are eligible to become CHs. Using this threshold, each SN will be a CH at some point within 1/P rounds. Table 1 shows the various parameters used in LEACH protocol (Heinzelman., 2000).
Each round of the LEACH protocol is defined by the set-up and steady phases. In set-up phase, CH for the current round broadcasts an advertisement message to the rest of the SNs. The SNs must keep their receivers on and based on the received signal strength of the advertisement, every non-CH node decides to which cluster it belongs for this round. If ties occur then a random CH is selected. In steady phase, the energy of all Cluster Members (CMs) can be reduced using sleep mode activation and now data transmission can begin. Once the CH has all the data from the CMs, the CH aggregates and fused the data to the BS. After a certain time, which is determined a priori, the next round begins with each SN determining if it should be a CH for this round. Figure 3 shows the steps used in the protocol.
Apart from many potential applications of WSNs, there are many constraints such as deployment strategy, optimal energy consumption, computation and storage, scalability, security, fault tolerance, reliability, Quality of Service (QoS), adaptability and bandwidth utilization. Many proposals in the literature are reported based upon the above defined parameters. Keeping in view of the above issues, this paper provides a detailed description of various existing LEACH based routing and clustering protocols which are used to solve many of the above defined issued in WSNs.
Rest of the paper is organized as follows. Section 2 provides the taxonomy of different clustering based routing protocols depending upon various parameters. Section 3 provides the comparison of all LEACH based clustering protocols with respect to various parameters. Section 4 provides the open issues in this area and finally Section 5 concludes the article.
Section snippets
Taxonomy of clustering based protocols
There are several parameters based upon which LEACH protocol has been modified and accordingly various variants of LEACH protocol exist in the literature. Figure 4 describes various parameters based upon which various categories of LEACH based protocols have been developed. The purpose of this paper is to provide the detailed description of all those modified LEACH based protocols according to the categorization shown in Fig. 4.
Comparison and discussion of existing protocols
Table 2 below provides a comparison of all the above protocols with respect to various parameters. As WSNs are applications specific, so we have selected various parameters depending upon applications where these can be applied. The detailed analysis of all the variants of LEACH based routing and clustering protocols with respect to various parameters are listed below in Table 2. Various parameters selected for discussion are data transmission, network type, routing type, latency, deployment
Open issues
In this paper, we have presented various routing clustering protocols based upon LEACH protocol by selecting different parameters. Based upon these parameters, a detailed comparison is provided for various existing protocols. Although we have selected different parameters which are specific to the applications where WSNs can be applied but still there are many open issues which can be further investigated keeping in view of this newly emerging area. One of the open issues is the use of
Conclusions
In WSNs, selection of CH node is very important aspect and the major research going in the direction is focused on how to minimize energy consumption during the process of extracting the essential data as the SNs are powered by batteries which have limited energy. Clustering has been used widely for efficient routing for the data communication from SNs to BS. It has been observed in the literature that Clustering reduces the energy consumption which prolong the life time of WSN. Low Energy
Acknowledgments
Authors would like to thank all anonymous reviewers for their valuable suggestion and comments which improves the overall quality of the paper.
References (77)
- et al.
ECCRA: An energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks
Computer Communications
(2008) - et al.
Linear wireless sensor networks: Classification and applications
Journal of Network and Computer Applications
(2011) - et al.
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Journal of network and computer applications
(2011) - et al.
A power-saving data storage scheme for wireless sensor networks
Journal of Network and Computer Applications
(2012) - et al.
Data aggregation in wireless sensor networks using ant colony algorithm
Journal of Network and Computer Applications
(2008) - et al.
Arranging cluster sizes and transmission ranges for wireless sensor networks
Information Sciences
(2012) - et al.
A distributed energy-efficient clustering algorithm with improved coverage in wireless sensor networks
Future Generation Computer Systems
(2012) - et al.
Sec-LEACH—On the security of clustered sensor networks
Signal Processing
(2007) - et al.
VIBE: an energy efficient routing protocol for dense and mobile sensor networks
Journal of Network and Computer Applications
(2012) - et al.
Performance evaluation of network lifetime spatial-temporal distribution for WSN routing protocols
Journal of Network and Computer Applications
(2012)
On target coverage in wireless heterogeneous sensor networks with multiple sensing units
Journal of Network and Computer Applications
Autonomic hierarchical reconfiguration for wireless access networks
Journal of Network and Computer Applications
Coverage-aware connectivity restoration in mobile sensor networks
Journal of Network and Computer Applications
BARC: a battery aware reliable clustering algorithm for sensor networks
Journal of Network and Computer Applications
PEACH: power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks
Computer Communications
Wireless sensor network key management survey and taxonomy
Journal of Network and Computer Applications
Efficient routing LEACH (ER-LEACH) enhanced on LEACH protocol in wireless sensor networks. Part I
International Journal of Academic Research
An energy efficient cluster formation protocol with low latency in wireless sensor networks
World Academy of Science, Engineering and Technology
Clustering and fault tolerance for target tracking using wireless sensor networks
IET Wireless Sensor Systems
Smart environments: technologies, protocols, and applications
Design and analysis of hybrid indirect transmissions (HIT) for data gathering in wireless micro sensor networks
Mobile Computing and Communications Review
Protocols for local data delivery in wireless microsensor networks.
Mobility-based clustering protocol for wireless sensor networks with mobile nodes
IET Wireless Sensor Systems
Energy balanced routing algorithm based on mobile sink for wireless sensor networks
Journal of Computational Information Systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Low energy adaptive clustering hierarchy with deterministic cluster-head selection
IEEE
Cited by (408)
LEACH-D: A low-energy, low-delay data transmission method for industrial internet of things wireless sensors
2024, Internet of Things and Cyber-Physical SystemsAdaptive multimode transmission in wireless sensor networks with energy harvesting
2023, Physical CommunicationAn energy balance cluster network framework based on Simultaneous Wireless Information and Power Transfer
2023, Nano Communication NetworksA novel method for optimizing energy consumption in wireless sensor network using genetic algorithm
2023, Microprocessors and MicrosystemsGreen Internet of Things (IoT) with dynamic sleep wake-up approach for constrained things
2023, Measurement: SensorsC4O: chain-based cooperative clustering using coati optimization algorithm in WSN
2024, International Journal of Reconfigurable and Embedded Systems