Traditional Low-energy Adaptive Clustering Hierarchy Research Articles

High-Efficiency Clustering Routing Protocol in AUV-Assisted Underwater Sensor Networks.

Currently, underwater sensor networks are extensively applied for environmental monitoring, disaster prediction, etc. Nevertheless, owing to the complicacy of the underwater environment, the limited energy of underwater sensor nodes, and the high latency of hydroacoustic channels, the energy-efficient operation of underwater sensor networks has become an important challenge. In this paper, a high-efficiency clustering routing protocol in AUV-assisted underwater sensor networks (HECRA) is proposed to address the energy limitations and low data transmission reliability in underwater sensor networks. The protocol optimizes the cluster head selection strategy of the traditional low-energy adaptive clustering hierarchy (LEACH) protocol by introducing the residual energy and node degree in the cluster head selection phase and performs some optimizations in the cluster formation and data transmission phases, including selecting clusters for joining by ordinary nodes based on the residual energy of the cluster head nodes and weight computation based on the depth and residual energy of the cluster head nodes to select the optimal message forwarding nodes. In addition, this paper introduces an autonomous underwater vehicle (AUV) as a dynamic relay node to improve network transmission efficiency. According to the simulation results, compared with the existing LEACH, the energy efficient routing protocol based on layers and unequal clusters in underwater wireless sensor networks (EERBLC) and energy-efficient clustering multi-hop routing protocol in a UWSN (EECMR), the HECRA significantly improves network lifetime, the residual node energy, and the number of successfully transmitted packets, which can effectively prolong network lifetime and ensure efficient data transmission.

Ad hoc wireless network implementing BEE-LEACH

Adaptations have been key to the development and advancement of the low energy adaptive clustering hierarchy (LEACH) protocol. Presented is an alteration to the traditional LEACH, low energy adaptive clustering hierarchy, algorithm. This algorithm focuses on the battery life optimization of sensors within a wireless sensor network (WSN). These sensors will be grouped into clusters with the aim of maximizing the battery life of the overall system by sorting each sensor by residual energy and assigning the highest residual energy the role of cluster head. The protocol will then assign sensors to cluster heads based on distance relative to the head. This algorithm achieves the goal of extending battery life and offers itself as a promising alternative to standard LEACH algorithms. The algorithm is tested by comparing sensor battery life, total sensors communicating at a given time, and sensors with residual energy. This paper addresses the strengths and vulnerabilities of the algorithm, as well as proposed work for further implementation for the following groups looking to create their own LEACH protocol.

Clustering based Dynamic Routing Algorithm for Efficient Energy Utilization in Wireless Sensor Networks (WSNs)

The significance of proper and efficient energy utilization is quite high in Wireless Sensor Networks (WSNs). As a result, network lifetime can be massively enhanced. Therefore, Graph enabled Energy Optimized Routing (GEOR) algorithm is adopted to extend the lifetime of the sensor network and minimize energy consumption in WSNs. An efficient solution for lifetime enhancement of sensor network and energy minimization are key objectives of the proposed GEOR algorithm. The proposed GEOR algorithm provides improved performance than the traditional Low Energy Adaptive Clustering Hierarchy (LEACH) approach. Here, the proposed GEOR algorithm enhances cluster size and the CH selection process is performed to elect CHs for multiple clusters present in the sensor network. A detailed solution for the optimization problem in WSNs is also presented. The mobility aspect of the sink node has a massive impact on energy consumption in WSNs. Experimental results are evaluated in terms of sensor network lifetime enhancement (number of alive nodes and number of dead nodes). Cluster formation and CH selection are performed based on the mobility cost function. Throughput and network lifetime results are obtained in terms of residual energy using the proposed GEOR algorithm. The result is compared against the traditional LEACH approach and the proposed GEOR algorithm shows superior performance.

A Secure LEACH Protocol for Efficient CH Selection and Secure Data Communication in WSNs

Due to the applications of wireless sensor networks (WSNs) in distinct fields, like civilian and military, environmental monitoring, and target tracking, etc., it became the important research area for researchers. Therefore, an efficient organization of network topology is needed for multi-hop data aggregation based on the energy constrained WSNs with large scale deployment for making the routing task simpler, balancing the load efficiently, and enhancing the network lifetime. The low-energy adaptive clustering hierarchy (LEACH) is an architecture of application-specific protocol, which is used for WSNs. However, this LEACH protocol suffered from more energy consumption in network without considering the cluster heads (CHs) distribution on a rotation basis. In addition, the complex security mechanisms are not sufficient due to limited bandwidth and other restrictions that the sensor nodes have. Thus, it is essential to improve the energy efficiency, CH stability and secure data transmission in WSN’s, which is the main objective of this work. Motivated from these three challenges, this article proposes a stable and secure LEACH (SS-LEACH), in which a new and improved protocol of LEACH is proposed for enhancing the stability of CH and energy efficiency as it considers the nodes’ consumed energy ratio (CER) for CH selection and random number generation, here after the proposed LEACH is named as CER-LEACH. In addition, it aims to prevent the previously elected CH node and it will get another chance in the current round. This method correlates the threshold used in traditional LEACH with the energy consumption ratio of each node. Further, it also introduces a hybrid reputation-based data transmission (HRDT) scheme for secure data transmission. With the proposed CER-LEACH protocol, WSNs achieves better performance in terms of secured communication, network lifetime, and energy consumption based on the analysis of simulation results as compared to state-of-art approaches.

A K-Means Clustered Routing Algorithm with Location and Energy Awareness for Underwater Wireless Sensor Networks

Data delivery in harsh underwater channels consumes a higher transmission power than that in terrestrial networks. However, due to the complexity of the underwater environment, the energy supply of the nodes in underwater wireless sensor networks is usually limited by their required laborious battery replacement. Thus, energy consumption is considered one of the key issues in underwater wireless optical communication. To minimize such consumption for underwater transmission nodes, much research interest has been found on K-Means technology in designing routing algorithms. However, these algorithms have not regarded the located site and the remaining energy of the underwater nodes simultaneously, which might affect their efficiency. In this paper, we propose a clustered routing algorithm, namely the location and energy-aware k-means clustered routing (LE-KCR) algorithm, which applies K-means technology regarding both the located site and the remaining energy of each node. In the proposed LE-KCR algorithm, both the located site and the remaining energy of a candidate cluster-head, as well as the distance between it and its sink node, are considered in cluster-head selection. In addition, given the inaccessibility of some nodes to the whole underwater sensor network resulting from the limited transmission range of their clusters, the dual-hop routing technique is adopted for the edge nodes. The simulation results indicate that the proposed LE-KCR algorithm remarkably reduces the energy consumption and the dead nodes when compared to the traditional low-energy adaptive clustering hierarchy (LEACH) protocol and the optimized LEACH protocol based on K-means clustering technology.

A Novel Approach for Energy-Efficient of WSN Using PEGASIS Protocol

Wireless Sensor Networks (WSNs) have hardware and software limitations and are deployed in hostile environments. The problem of energy consumption in WSNs has become a very important axis of research. To obtain good performance in terms of the lifetime of the WSN, several routing protocols have been proposed. We present in this article a new approach for the energy efficiency of WSN by using the PEGASIS (Power Efficient Gathering In Sensor Information Systems) routing protocol in order to reduce sensor energy consumption and to achieve good performance in terms of the lifetime of the network in WSN. The simulation results have shown that our proposed protocol excels regarding energy consumption in wireless sensor networks, resulting in an extension of a lifetime for the network. We simulated the proposed technique compared with traditional LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol using MATLAB environment.

LEACH‐TLC: a strategy of reducing and uniform energy consumption based on target location constraint

Considering the important applications of wireless sensor networks in target monitoring, it has received attention in the civil and military fields. For the problem that the working nodes die early, the network energy consumption is large, and the node energy distribution is uneven, especially the impact of the monitored target on the network performance, this study is based on the traditional low-energy adaptive clustering hierarchy (LEACH) and target location constraint, an improved LEACH target location constraint (LEACH-TLC) algorithm is proposed. First, under the premise of monitoring accuracy, this study constructs a network monitoring performance parameter model. Second, the wake-up/dormant threshold of the network node is obtained based on the network performance parameter model, and the network node dormant strategy is constructed utilising the threshold, and then the working node set is constructed. Finally, based on the proposed network energy uniform mechanism, combined with the distance factor between the node and target/base station, a new cluster head selection rule is proposed. The simulation results show that the LEACH-TLC algorithm can decrease the number of working nodes, reduce network energy consumption, uniform node energy consumption distribution, and prolong network lifetime.

Smart Clustering LEACH (SC-LEACH) Protocol for Improved Network Survivability in Wireless Sensor Networks

Wireless Sensor Networks (WSN) are becoming increasingly popular by the virtue of its diversified applications. Nevertheless WSN faces various research challenges despite its ease of implementation. One of the major issues of concern is the energy efficiency which is closely related to the lifetime of the network. Low-Energy Adaptive Clustering Hierarchy (LEACH) is proven to be an efficient way to route packets in WSNs. However the performance of the LEACH can be further enhanced by lessening the frequency of cluster reformation. In this paper we propose a novel Smart Clustering LEACH (SC-LEACH) protocol which is an advancement over the traditional LEACH protocol. The results of the proposed algorithm were validated through simulations.

Evolving a clustering algorithm for wireless sensor network using particle swarm optimisation

Energy consumption is a vital problem that faces wireless sensor network (WSN) because sensor nodes are always equipped with batteries that cannot be recharged or replaced. Thus, maximising the lifetime of WSN by means of minimising the energy dissipation is an essential aspect in WSN deployment. In this paper, we propose a novel algorithm to cluster the WSN using particle swarm optimisation, named PSO-VC. The proposed algorithm is designed to obtain the optimal number of clusters, optimum cluster heads and optimum clusters layout. The proposed PSO-VC aimed to maximise the number of transmissions which a CH can perform before the node depletes its energy. Our proposed algorithm was evaluated and compared with traditional Low-Energy Adaptive Clustering Hierarchy (LEACH) clustering protocol. Moreover, the same algorithm is re-implemented using genetic algorithm, named GA-VC. It was found that the proposed PSO-VC preserves more energy and considerably prolongs the network lifetime compared to the GA-VC and LEACH algorithms.

IMPROVED ARCHITECTURE FOR MAXIMIZING SYSTEM LIFETIME OF WIRELESS SENSOR NETWORK USING CLUSTERING ALGORITHM

Real time implementation of Ad-hoc Wireless Sensor Network has increased with great potential. Application areas of WSN’s are military warfare, disaster management, battle field, forest fire detection and other several monitoring area. Key challenge in WSN is to minimize the use of limited battery resources. Several energy efficient routing algorithms have been proposed till date. LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering protocol that divides the network into logical clusters and keeps rotating the cluster head selection to send data to sink. In this paper we propose a new technique of cluster formation based on organizational setup structure. New Network structure proposed will show an efficient increase in minimizing the node energy dissipation of signal transmission and will lead to maximize the system lifetime. We also propose a mix of Round-Robin algorithm into the cluster head selection for data transmission to base station. We compare the newly proposed clustering algorithm with the traditional LEACH algorithm.

A Heterogeneous-aware Cooperative MIMO Transmission Scheme in WSN

A heterogeneous-aware cooperative MIMO transmission scheme (HAMS) is proposed to optimize the network lifetime and save energy for energy heterogeneous wireless sensor networks (WSN). This scheme extends the traditional low-energy adaptive clustering hierarchy (LEACH) protocol to enable the cooperative MIMO transmission between the sink and clusters. Through the adaptive selection of cooperative nodes and the cooperative MIMO transmission, HAMS can gain effective performance improvement in terms of taking advantage of the presence of node heterogeneity. Based on the energy consumption model developed in this paper, the optimal parameter to minimize the overall energy consumption is found. Simulation results exhibit that HAMS can effectively save energy and prolong the network time. Furthermore, HAMS displays more resilient in different degree of heterogeneous wireless sensor networks.

Cluster Head Optimization Strategy for Wireless Sensor Network Based on Univariate Marginal Distribution Algorithm

Low-energy adaptive clustering hierarchy (LEACH) protocol is studied. A cluster head optimization strategy for wireless sensor network (WSN) is proposed by using univariate marginal distribution algorithm (UMDA). The novel routing protocol is named UMDA_LEACH. It considers the overall situation in the effect of all cluster head nodes with the help of probabilistic model. By so doing, it improves the choice method of the cluster head nodes. Thus, to some extent it can find the optimal combination solutions for the cluster head nodes. Simulation results show that UMDA_LEACH has better performance than traditional LEACH protocol.

Protocol for the application of cooperative MIMO based on clustering in sparse wireless sensor networks

Wireless sensor networks (WSN) using cooperative multiple-input multiple-output (MIMO) communication are effective tools to collect data in several environments. However, how to apply cooperative MIMO in WSN remains a critical challenge, especially in sparse WSN. In this article, a novel clustering scheme is proposed for the application of cooperative MIMO in sparse WSN by extending the traditional low-energy adaptive clustering hierarchy (LEACH) protocol. This clustering scheme solves the problem that the cluster heads (CH) cannot find enough secondary cluster heads (SCH), which are used to cooperate and inform multiple-antenna transmitters with CHs. On the basis of this protocol, the overall energy consumption of the networks model is developed, and the optimal number of CHs is obtained. The simulation results show that this protocol is feasible for the sparse WSN. The simulation results also illustrate that this protocol provides significant energy efficiencies, even after allowing for additional overheads.

Virtual MIMO-based cross-layer design for wireless sensor networks

In this paper, a novel multihop virtual multiple-input-multiple-output (MIMO) communication protocol is proposed by the cross-layer design to jointly improve the energy efficiency, reliability, and end-to-end (ETE) QoS provisioning in wireless sensor network (WSN). In the protocol, the traditional low-energy adaptive clustering hierarchy protocol is extended by incorporating the cooperative MIMO communication, multihop routing, and hop-by-hop recovery schemes. Based on the protocol, the overall energy consumption per packet transmission is modeled and the optimal set of transmission parameters is found. Then, the issues of ETE QoS provisioning of the protocol are considered. The ETE latency and throughput of the protocol are modeled in terms of the bit-error-rate (BER) performance of each link. Then, a nonlinear constrained programming model is developed to find the optimal BER performance of each link to meet the ETE QoS requirements with a minimum energy consumption. The particle swarm optimization (PSO) algorithm is employed to solve the problem. Simulation results show the effectiveness of the proposed protocol in energy saving and QoS provisioning