A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

Abstract

SummaryIn wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering-based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked-LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols. KEYWORDScluster head selection, clustering-based protocols, LEACH protocols, wireless sensor networks | INTRODUCTIONWireless sensor networks (WSNs) consider a base station (BS) that communicates with countless of wireless sensor nodes by means of a radio channel. Data transmission and reception process are the major operations that consume power in WSN. Elimination of redundant data is important issue in WSN, because multiple nodes may sense the same overlapped area. This action will reduce the overall power consumption and use the bandwidth usage.Routing protocols in WSNs can be divided according to network structure into 3 categories: location based, data centric, and hierarchical protocols. 1,2 Location-based protocol: location information for all nodes is a major cornerstone during data communication. Energy consumption during data transmission depends on the target position distance. Data are sent not only to the target area but also to whole sensors network, which is known as flooding. Residual energy is not considered for each node, so many nodes will run out of energy, which leads at the end to an accumulative data transmission failure. [3][4][5] Data-centric protocol 6 : data transmission from sensor node to the BS through intermediate nodes. The intermediate node may not have interest in the data it receives-it is known as relay node in this case. This process reduces the number of packet sent from source to the sink, which leads to reduce the power consumption.

An availability predictive trust factor‐based semi‐Markov mechanism for effective cluster head selection in wireless sensor networks

“…The energy utilization of this dynamic CH selection scheme was considered to be improved by 32% compared with the K‐means and LEACH CH selection schemes. A node rank‐based cluster selection scheme was proposed for eliminating the issues that are most common in the process of random selection . This node rank‐based cluster selection scheme prevents unexpected failure of sensor nodes to a maximum degree, thus increases the energy utilization and lifetime of the sensor nodes.…”

“…A node rank-based cluster selection scheme was proposed for eliminating the issues that are most common in the process of random selection. 21 This node rank-based cluster selection scheme prevents unexpected failure of sensor nodes to a maximum degree, thus increases the energy utilization and lifetime of the sensor nodes. The node rank used for CH selection is computed using the reliability factor that combines the impact of link count and path cost.…”

A unified heuristic bat algorithm to optimize the LEACH protocol

“…At present, inspired by the characteristics of wireless sensor networks, a variety of routing protocols have been proposed. The routing protocols are mainly divided into two categories in terms of network topology: flat routing protocol and hierarchical routing protocol (Cluster routing protocol) . The details are described in Figure .…”

“…The routing protocols are mainly divided into two categories in terms of network topology 13 : flat routing protocol 14 and hierarchical routing protocol (Cluster routing protocol). 15 The details are described in Figure 1. LEACH, the first hierarchical wireless sensor routing protocol proposed by Heinzelman et al in 2000, 16 is a representative protocol in routing protocols.…”

An adaptive‐aware energy and queue improvement of AOMDV

“…Tao et al 18 proposed an adaptive energy-aware multipath routing protocol with load balance (AEMRP-LB), by introducing a concept named direction-angle to overcome the deficiency of broadcast and takes into account the trade-off between the residual energy and hop count to establish multiple node-disjoint paths. Taking into account both path cost and number of links between nodes to select the cluster head of each cluster, Al-Baz and El-Sayed et al 19 proposed the improved leach to improve the total network lifetime. Taha et al 20 apply the fitness function to optimize the energy consumption in ad hoc on-demand multipath distance vector (AOMDV) 21 by taking energy consumption in account to improve the network performance.…”