Multi-hop Low Energy Adaptive Clustering Hierarchy Research Articles

AEr-Aware Data Aggregation in Wireless Sensor Network Using Hybrid Multi-Verse-Optimized Connected Dominant Set

Wireless sensor network (WSN) refers to emerging technology with great promise for different applications in the military and mass public. Sensing technology, when combined with wireless communication and processing power, can make it quite lucrative to be exploited to a great extent in the future. The selection of clustering-based optimal cluster head (CH) in the WSN can be a very efficient technique that is important to improve the lifetime of the network. However, enforcing an optimal CH selection that is based on the stabilization of energy, reduced distance between the sensor nodes, and minimized delay can be a major challenge. Since there is no centralized control or fixed infrastructure for the WSN, there can be a connected dominating set (CDS) that may work in the form of a virtual backbone to ensure efficient connectivity and routing. In this work, an optimized multi-hop low-energy adaptive clustering hierarchy (M-LEACH) protocol for the WSNs was proposed.

Comparison of Different Multi-hop Algorithms to Improve the Efficiency of LEACH Protocol

In the wireless sensor network, several sensor devices are distributed in an environment with a goal to collect data and then forward it to a base station which could be then later used for some study such as changes in the environment. They are distributed across environment and are fitted with a battery. Due to their small size the size of battery is also small. Several protocols are designed to reduce the energy consumption to improve the network life. One of the famous protocols is Low Energy Adaptive Clustering Hierarchy (LEACH). In this paper, our main focus is to make changes to the original LEACH protocol to reduce energy consumption. We designed two algorithms: Modified Multihop (MMH) LEACH and Modified Cluster Head (MCH) LEACH. Both the algorithms perform better than the original LEACH protocol in terms of remaining energy. Network life is also improved when they were distributed in a bigger environment. The energy consumption is reduced than the original LEACH protocol.

A new energy aware cluster head selection for LEACH in wireless sensor networks

Internet of Things (IoTs) as a new network pattern for the intelligent world usually uses wireless sensor networks (WSNs) as a perception layer which consisted of numerous number of sensor nodes scattered in the environment to gather intended information. The selected information then is sent to a base station (BS) to be sent to cloud server for further processing. Since the energy of sensor nodes is limited, the most significant challenge in these networks is reducing the energy consumption of the network. It is proved that dividing the network to clusters can significantly reduce the energy consumption. One of the most popular clustering protocols in WSNs is the Low-Energy Adaptive Clustering Hierarchy (LEACH). In this protocol, cluster heads (CHs) are selected randomly which results in poor performance in real scenarios. In this article, a new energy aware CH selection algorithm is proposed which selects CHs based on the residual energy, the position and centrality of nodes. It uses a variable range upon which the centrality and the number of neighbours of each node are calculated. Simulation results show that the proposed algorithm outperforms LEACH, Multi-hope Routing with LEACH (MR-LEACH) and Enhanced Multi-hop LEACH (EM-LEACH) in terms of reducing energy consumption, increasing network lifetime and improving network reliability.

Mobile routing algorithm with dynamic clustering for energy large‐scale wireless sensor networks

The clustering technique is a key routing method for large-scale wireless sensor networks (WSNs), which strongly extends the network's lifetime and scalability. The fundamental protocol of this technique, which is called low energy adaptive clustering hierarchy (LEACH), is proved as a solution that offers good energy efficiency and consequently expands the network lifetime. As the energy efficiency is deteriorated with the network size, LEACH improvements are becoming so substantial to support the scalability in the large-scale WSNs. The authors propose a new dynamic multi-hop clustering protocol. It exploits both the mobility and the multi-hop communication to prolong the lifetime of the mobile WSN. The proposed protocol, called dynamic multi-hop LEACH (DMH-LEACH), combines the dynamic clustering, multi-hop transmissions, and node mobility to improve the energy efficiency of LEACH. They also study the effect of the traffic and energy heterogeneity on the proposed protocol. Finally, they simulate DMH-LEACH protocol for both homogeneous and heterogeneous scenarios. The simulation results show that the proposed protocol allows to better balance the energy consumption for all sensor nodes and considerably extends the network's lifetime.

Secrecy outage performance of multi-hop LEACH networks using power beacon aided cooperative jamming with jammer selection methods

In this paper, we evaluate secrecy performance of cooperative jamming (CJ) aided secure transmission for Multi-hop Low-Energy Adaptive Clustering Hierarchy (M-LEACH) networks, where data transmission between a source and a destination is performed via cluster heads (CHs) of intermediate clusters, and is overheard by an eavesdropper. To protect the source information at each hop, each CH selects one or many cluster nodes to realize the CJ technique. We propose energy harvesting (EH) based jammer selection methods named MAX-EH, MAX-IP and ALL-CJ, where the selected jammer(s) has to harvest wireless energy from a dedicated power beacon to generate jamming noises. In MAX-EH, the cluster node obtained the MAXimum Energy Harvested from the power beacon is chosen. In MAX-IP, the selected jammer is the cluster node providing the MAXimum Interference Power to the eavesdropper. In ALL-CJ, ALL cluster nodes in the clusters take part in the CJ operation. For performance evaluation, we derive expressions of the end-to-end (e2e) secrecy outage probability (SOP) for the proposed methods over Rayleigh fading channels. We then perform Monte-Carlo based computer simulations to verify the theoretical results. The results presented that the proposed methods outperform the RANDom jammer selection (RAND) and the corresponding method WithOut using the CJ technique (WO-CJ).

Multi-Hop Leach using the Great Deluge Optimization in Wireless Sensor Optimization

The Wireless Sensor Networks (WSNs) today is gaining plenty of attention due to its wide application range. The reduction of consumption of energy of their sensor nodes has been considered to be a crucial challenge for operating the WSNs in the long run. Low-Energy Adaptive Clustering Hierarchy (LEACH) which is an extremely popular technique which can form several clusters by means of employing a distributed algorithm. The Multi-Hop Low Energy Adaptive Clustering Hierarchy (MH-LEACH) has minimized the consumption of energy at the time of transmission of data among the Cluster Heads (CH) and Base Station (BS). The load is further reduced by multi-hop routing wherein packets are duplicated within the network to improve the efficiency of energy for the WSN. A heuristic method of local search is the Great Deluge Algorithm (GDA) which is employed for solving problems in optimization. In this work, a multi-hop LEACH along with the Great Deluge Algorithm that has been proposed for efficiency in clustering of the WSN.

WM-LEACH - An Improved Network Lifetime LEACH Protocol for Wireless Sensor Networks

Ad hoc network is divided into subcategories in which wireless sensor network (WSN) is one of them, which include several small devices known as sensor nodes (SNs) connected to base stations (BSs). The network lifetime is one of the most vital features as a trustworthy transmission. The low energy adaptive clustering hierarchy (LEACH) is one of the prominent protocols for deploying in the WSN that depends upon a procedure of clustering. Nevertheless, as cluster heads (CHs) share information with a BS openly irrespective of their interior distance, a maximum energy is utilized if the distance between them is too long, which alternatively minimizes the lifetime of the network. To cope with these challenges, various extensions of the LEACH protocol have been designed that send data in two ways, i.e., either in a single hop or multi hop. However, most of these extensions bring extra computational complexity for CHs due to the usage of residual energies. This study proposes an adaptive routing multi-hop LEACH (WM-LEACH) that would minimize the utilization of energy and augment the entire lifetime of the WSN. This rationale of the WM-LEACH is examined in the MATLAB simulator and the obtained outcomes are associated with other routing protocols in terms of network lifetime.

Reliable and energy-efficient multi-hop LEACH-based clustering protocol for wireless sensor networks

Wireless sensor networks (WSNs) are attracting research attention because of their important applications in critical environmental monitoring and target tracking in both civilian and military fields. The large-scale deployment of energy-constrained WSNs and the need for multi-hop data aggregation requires efficient organization of network topology to simplify the routing task, balance the load, and prolong the network lifetime. Clustering has proven to be an effective approach for organizing the network into a connected hierarchy. In this study, we analyze the effectiveness of low-energy adaptive clustering hierarchy (LEACH) and LEACH-based protocols in extending the lifetime for energy-constrained WSNs. An improved LEACH clustering protocol called enhanced multi-hop LEACH is proposed to reduce and balance energy consumption in order to allow increased packet delivery and network lifetime in WSNs. Additionally, this paper presents the weaknesses of the LEACH protocol. First, we introduce new rules for cluster-head selection and round time computing based on the remaining energy. Second, a multi-hop communication model is integrated in the WSN using two operating processes: leveling and generic multi-hop routing.

Improving energy utilization using multi hop data aggregation with node switching in wireless sensor network

The WSNs contain several miniature models that have some abilities of perception, communication and computation. For WSNs various energy-efficient relaying schemes have been designed, in which clustering is specifically the most useful relay-based sensor network which requires scalability of more than 1000 nodes. Different cluster-based protocols have been present by examiners in current years that improve the network lifetime. Among these, a self-organizing protocol is Low Energy Adaptive Clustering Hierarchy (LEACH) which can utilize a distributed and cluster formation algorithm. This work deals with an innovative technique which can improve packet delivery and energy efficiency in WSN. This work proposed has been grouped broadly into new Node Switching Multi Hop LEACH that makes use of an average randomization of network energy where the selection of nodes which have a higher average of energy when round is complete. The protocol that is proposed for an improved saving of energy, the Load Balanced Inter Cluster Network Switching Multi Hop LEACH has been proposed. The techniques that have been proposed are compared with Multi Hop LEACH.

Energy Aware Routing Using Improved LEACH Protocol

In this research paper, we propose an energy efficient routing protocol low energy adaptive clustering hierarchy (LEACH) for wireless sensor networks. There are many sensing nodes and sink nodes in wireless sensor network system. Routing protocol and its improvement is a major issue in wireless sensor networks. Our proposed protocol is the modification of LEACH. The main idea is to increase the network life and maximizes the throughput. In this research paper, residual energy is to be considered for the selection of cluster head from various nodes. Time division multiple access (TDMA) technique is used for the communication between common nodes and cluster head. Cluster head (CH) chooses code to be used in its cluster and code division multiple access (CDMA) technique is used between clusters. The comparison between improved versions of LEACH protocol shows that multi-hop LEACH shows significant improvement than energy LEACH (E-LEACH).

Theoretical analysis of the lifetime and energy hole in cluster based wireless sensor networks

Cluster based wireless sensor networks have been widely used due to the good performance. However, in so many cluster based protocols, because of the complexity of the problem, theoretical analysis and optimization remain difficult to develop. This paper studies the performance optimization of four protocols theoretically. They are LEACH (Low Energy Adaptive Clustering Hierarchy), MLEACH (Multi-hop LEACH), HEED (Hybrid Energy-Efficient Distributed Clustering Approach), and UCR (Unequal Cluster based Routing). The maximum FIRST node DIED TIME (FDT) and the maximum ALL node DIED TIME (ADT) are obtained for the first time in this paper, as well as the optimal parameters which maximize the network lifetime. Different from previous analysis of network lifetime, this paper analyzes the node energy consumption in different regions through the differential analysis method. Thus, the optimal parameters which maximize the lifetime can be obtained and the detailed energy consumption in different regions at different time can be also obtained. Moreover, we can obtain the time and space evolution of the network, from a steady state (without any death) to a non-steady state (with some death of nodes), and then to the final situation (all nodes die). Therefore, we are fully aware of the network status from spatial and temporal analysis. Additionally, the correctness of the theoretical analysis in this paper is proved by the Omnet++ experiment results. This conclusion can be an effective guideline for the deployment and optimization of cluster based networks.

Multi-hop communication routing (MCR) protocol for heterogeneous wireless sensor networks

Effective energy management in heterogeneous wireless sensor networks (WSNs) is a more challenging issue compared to homogeneous WSNs. Much of the existing research has often assumed homogeneous sensor nodes in the networks. The energy preservation schemes for the homogeneous WSNs do not perform efficiently when applied to heterogeneous WSNs. In this paper, we have presented an energy-efficient multi-hop communication routing (MCR) protocol in order to address the traditional problem of load balancing, lifetime, stability and energy efficiency in the WSNs. MCR protocol is based on dividing the network into dynamic clusters. The cluster-heads election is based on weighted probability. The cluster's nodes communicate with an elected cluster head node by using single hop communication approach, and then the cluster heads communicate the information to the base station via multi-hop communication approach. Performance studies indicate that MCR effectively solves the problem of load balancing across the network, extends the network lifetime, stability and is more energy efficient in comparison to multi-hop low-energy adaptive clustering hierarchy (M-LEACH) and multilayer energy efficient cluster head communication protocol (MEECHCP).