Multiple Cluster Merging and Multihop Transmission in Wireless Sensor Networks

Wireless sensor networks (WSN) are a yield of advancement in information technology and the requirement of large-scale communication infrastructures. Routing of data via selected paths is a critical task in WSN as process need to be carried on under resource constraint situations. This route identification problem can be better handled by employing appropriate heuristic bio-inspired computational intelligence optimization method. The most frequently applied routing is hierarchical routing algorithm is Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm which has limitations in identifying energy efficient inter and intra route communication, identification of number of cluster head (CH), an eminent node to communicate to CH and Base Station (BS), selection of CH, and computing residual energy level, etc. Hence, researchers are focusing on boosting the capability of LEACH clustering algorithm by applying heuristic bio-inspired computational intelligence optimization methods. The proposed work is an attempt in this direction through applying heuristic bio-inspired Grey Wolf Optimization algorithm (GWO) for improving the performance of LEACH algorithm. In this paper, focus is given to increase the overall network time by adapting two modifications to conventional algorithms (i) selection of vice cluster head (VCH) in addition to CH (VCH node will replace the CH when CH when CH node goes down due to unexpected reasons as sensor node work under critical and uninterruptable environments and (ii) selection of intra and inter relay nodes (intra relay node will enhance the life span during CH data gathering and inter relay node will further enhance the life span of CH by acting as a mediator between CH an BS). The Spyder-py3 tool is used to simulate the proposed algorithms, LEACH Binary Grey Wolf search based Optimization (LEACH-BGWO) and LEACH Discrete Grey Wolf search based Optimization (LEACH-DGWO) protocols. The proposed work is compared with cluster based LEACH algorithm, chain based power-efficient gathering in sensor information systems (PEGASIS) algorithm, bio-inspired GWO and Genetic Algorithm data Aggregation (GADA) LEACH protocols. The results prove that both proposed algorithms outperformed other conventional algorithms in terms of prolonged network lifespan and increased throughput. Among proposed algorithms LEACH-BGWO outperformed LEACH-DGWO

Wireless Sensor Networks (WSNs) is the vast area and developing very speedily now-a-days. This paper gives some of the major applications and critical limitations of WSNs like power and lifespan, communication bandwidth, memory size. Sensor nodes are working by node energy so the energy consumption is the essential issue in WSN. Routing in WSN consumes more energy than any other phase. Various routing techniques in WSNs are discussed and different routing protocols are illustrated. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the popular and feasible hierarchical clustering routing protocols in WSN. Working of LEACH is explained in brief. Furthermore, the descendants of LEACH e.g. LEACH-C (Centralized LEACH), LEACH-B (Balanced LEACH), LEACH-F, Multihop LEACH, MS-LEACH (Multihop and Single hop LEACH), MH-LEACH etc. are discussed in terms of the energy utilization. By analyzing the variants of LEACH, it is observed that the energy requirement in the cluster set up phase or data transmission phase is minimized to minimize the total energy consumption of the WSN. To elect the proper cluster head node, centralized approach is followed. Afterwards, data transmission will use the multihop communication technique. This will help to save some energy when base station is located far away from the cluster head node. Proposed protocol aims to decrease the energy overhead of the sensor nodes. The new approach is proposed entitled PV-LEACH which will save the energy consumption in cluster setup phase and also in data transmission phase of the conventional LEACH protocol. So, this will enhance the performance ratio in terms of energy consumption and life time of the sensor nodes.

Wireless Sensor Networks (WSNs) allow a large area to be monitored with various sensors. WSNs, although useful, are subject to Black Hole attacks. Defenses against attacks typically require more energy which reduces WSN lifetime. This thesis proposes a novel approach to detect and recover from attacks using an improved version of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. LEACH is an energy efficient protocol for groups of battery-operated computers with sensor components in WSNs. This protocol works by having a node become a cluster head responsible for sending data to a sink. The sink can be either an access point or base station. After a set time the cluster heads go back to being regular nodes and a completely new set of nodes become cluster heads. There are secure versions of LEACH such as S-LEACH and MS-LEACH that provide encryption, but LEACH and its encrypted variants do not secure against Black Hole attacks. Our proposed approach, referred to as Anomaly Report Cycling - Low Energy Adaptive Clustering Hierarchy (ARC-LEACH), aims to provide defense from Black Hole attacks while also providing low energy cost. ARC-LEACH does this by absorbing an attack. When an attack occurs, it rotates cluster heads to reestablish communication, then sending a message from the sink to coordinate all nodes against the malicious nodes. ARC-LEACH actively blocks malicious nodes while leveraging the resilience of LEACH by building up stronger resistance to attacks. ARC-LEACH provides more defense capability when under attack from multiple malicious nodes that would otherwise be defenseless by LEACH, with only a limited increase in power consumption. The prototype for ARC-LEACH is implemented to show feasibility of the proposed approach.

Energy efficient routing is the paramount point of significance in any wireless sensor network (WSN) so that the network sustains without any human intervention. Various energy efficient protocols have been proposed, multi-level Low Energy Adaptive Clustering Hierarchy (LEACH) being one among these. The multi-level LEACH protocol involves election of cluster heads at various hierarchical levels. If the area of deployment is large, the farther cluster heads cannot reach the base station directly. In such cases, it is needed to make use of an energy efficient routing technique for communication among cluster heads and forward the data towards the base station. Energy consumption is reduced by adopting routing mechanisms based on multi-hop and inverted tree in this multi-level LEACH protocol. This work deals with multi-level LEACH comprising of 1L-LEACH and 2L-LEACH. Directed diffusion carried out in 1L-LEACH and flat topology are compared with flooding. In directed diffusion, routing is done between a source and a sink optimizing the path taken. NS-3 simulation platform has been used and the results are presented.

Wireless Sensor Network (WSN) is a self-configured network of light-weight nodes, that are used in many applications by sending their data through this network to a Base Station (BS), which in turn, delivers the data to its final destination. In WSN, the sensor node’s energy is usually limited, and thus, the overall power consumption of the network is a real challenge. Numerous methods have been proposed to overcome this challenge by improving the overall power consumption and thus, prolonging the lifetime of the network. Low Energy Adaptive Clustering Hierarchy (LEACH) protocol has been considered as a leading routing protocol in WSN, due to its low power consumption resultant from its cluster-based behavior. However, for dense networks, LEACH suffers from large burden over cluster head (CH), which might result in packet loss due to the induced congestion in the CH. In this paper, an improved algorithm based on LEACH is proposed to maximize the lifetime of WSN, by using another node to relieve CH’s burden. The routing path selection process is refined through selecting a new node that has the highest residual energy in each cluster to be an alternative gateway for the cluster head. Then, the routing path will be decided based on distance. This modified algorithm outperforms the original LEACH by 4.35% increase in the residual energy, which prolongs the network lifetime. However, there is a slight increase in the overhead ratio.

Wireless sensor networks (WSN) usually contains sensors powered by small batteries with limited power. These sensors collect data and transfer it to the base station (BS) where it will be manipulated; the process of data transfer could be direct or indirect depending on the used protocol. The batteries’ limited power will be partially consumed during every data transfer process. In some applications, such as agricultural, military and others, WSN use a large number of these sensors, so the energy consumption should be taken into consideration during the design of such networks as the batteries’ replacement is sometimes very difficult and expensive. Many researchers have been working on inventing the best battery-conserving protocols to extend the lifetime of the network. Low Energy Adaptive Clustering Hierarchy (LEACH) protocol have better power-saving performance in this field, where the network is divided into groups called clusters, and each cluster selects its cluster head (CH). Sensors will transfer its data to the CH that belongs to it which in turn will transfer this data to the BS. However, a selection of CHs that ignores a node's energy change will cause the nodes serving as CHs to die earlier than the other nodes as too much energy is consumed. Also, the high frequency of re-use wastes a certain amount of energy. In order to distribute the power consumption evenly between the different nodes, we intend to classify the CH according to its distance from the BS, one operating at a close distance from the BS and the other at a far distance from it. The CH in the far distance will transfer its data not directly to the BS but through CH near to the BS. We aim with this proposal to distribute the energy consumption evenly between the nodes. Simulation results show that the proposed protocol GE-LEACH gives better results in the lifetime of the node especially in a field with a large area

Wireless Sensor Networks (WSN) is an ever growing field owing to their extensive variety of applications. WSN have limited battery energy, consequently, an energy efficient routing protocol is of major concern. LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the fundamental clustering protocols in WSN that provides high energy efficiency. Many protocols have been derived from LEACH which mostly address a single inherent challenge. Instead of focusing on a single parameter, combining independent techniques can compound gains in energy efficiency. This paper proposes Yet Another LEACH (YA-LEACH) which uses centralised cluster formation to ensure optimal clusters and allow Cluster Heads (CH) to extend operation into multiple rounds to achieve energy savings. Also, the proposed protocol will have an alternative (vice) CH that takes over when CH residual energy reaches a critically low level. The extended protocol was simulated on NS2 with results showing an improvement in network lifetime and overall data throughput.

Improving wireless sensor network lifespan with optimized clustering probabilities, improved residual energy LEACH and energy efficient LEACH for corner-positioned base stations

The traditional LEACH(Low Energy Adaptive Clustering Hierarchy) algorithm has some disadvantages in wireless sensor network,an improved LEACH algorithm is proposed in this paper. In order to analysis the performance of the proposed LEACH algorithm,a network model is designed.The traditional LEACH algorithm and the improved LEACH algorithm in death nodes are simulated and analysed. The data transmission of the traditional LEACH and the improved LEACH are studied. The simulation results show that the proposed LEACH algorithm is effective.The proposed LEACH algorithm is superior to the traditional LEACH algorithm.

This paper proposed a EELP (Energy Efficient LEACH Protocol) routing protocol based on LEACH. LEACH (Low Energy Adaptive Clustering Hierarchy) is seminal work in the area of clustering-based protocol, proposed by W.B. Heinzelman. In EELP, all nodes are organized sequentially in the rooms of the apartments of a multi-story building. In this protocol, cluster head (CH) selection is determined as the highest energy by the base station. Simulation results demonstrated that our protocol is more energy-efficient than the LEACH protocol.

Clustering is an effective approach to hierarchically organizing network topology and to prolong the lifetime of a wireless sensor network. Current clustering protocols usually utilize two techniques: selecting cluster heads with more residual energy and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster. Most of the researches in this field has focused on energy-efficient solutions, but caring less about the communication between Cluster Head (CH) nodes and Base Station (BS). When the sensor field is far away from the base station, the cluster heads are burdened with heavier relay traffic and tend to die much faster. To mitigate the problem, we propose an Energy-Efficient Hierarchical Routing Protocol (EEHRP) for long range transmission in the wireless sensor networks. It uses a number of gateway nodes, which do not engage in clustering, to connect the CHs and base station. They are responsible for transmitting packets received from the CHs to the base station, thus the CHs can preserve some energy in data forwarding and the gateway nodes can ease their burden by not participating in clustering. Simulation results show that EEHRP obviously increases the network lifetime and well balances the energy consumption among the sensor nodes.

These days wireless sensor networks handle a widespread range of monitoring tasks using their sensing and vision capabilities. These tasks may consist of very complex functions and large calculations. In order to make network alive for a long duration, these sensors have to take decision in judicious and efficient manner. The increased lifetime results into increased connectivity. Also, the intellectual use of energy resources provides the nodes better connectivity to the base station. The different clustering protocols such as Low Energy Adaptive Clustering Hierarchy (LEACH) are used in order to gain energy efficiency. The LEACH uses probability as the key attribute to elect the new cluster head. In this paper, a new approach based on the frequency of a node selected as cluster head for the selection of new cluster head is proposed which is also more efficient than the former one. The proposed approach for cluster head selection results in increased lifetime and thus, in increased connectivity. Simulation results show that in terms of different parameters like number of live nodes, dead nodes and residual energy our proposed strategy outperforms existing conventional sensor network protocols.

The lifetime of Wireless Sensor Network (WSN) is based on the energy of each sensor. Therefore, numerous routing protocols have been introduced such as SEP (Stable Election Protocol), LEACH (Low energy adaptive clustering hierarchy) and EAMMH (Energy Aware Multi-hop Multi-path Hierarchical routing protocol) to stable the lifetime of WSN by efficient utilization of energy of the sensors. In WSN networks data is collected and forwarded wirelessly to the base stations. Routing protocols in WSN provide an efficient path for multi-hop communication because the transmission range and battery power storage of nodes is limited. As nodes are usually deployed in remote areas so, they face challenges of long lifetime, network architecture, security issues, and network coverage. Many routing protocols have been developed to increase the efficiency of networks. Out of these clustering algorithms are the best choice to increase the lifetime of the nodes. Each protocol has its limitations in different scenarios. In this paper, we discussed and compared the performance of LEACH, EAMMH and SEP. SEP is an efficient algorithm due to its weighted cluster head (CH) selection method. Simulation results are obtained using MATLAB. Design metrics of energy consumption and network lifetime are under consideration in this research work.

Arranging cluster sizes and transmission ranges for wireless sensor networks

Over the past few years, great importance has been given to wireless sensor networks (WSNs) as they play a significant role in facilitating the world with daily life services like healthcare, military, social products, etc. However, heterogeneous nature of WSNs makes them prone to various attacks, which results in low throughput, and high network delay and high energy consumption. In the WSNs, routing is performed using different routing protocols like low-energy adaptive clustering hierarchy (LEACH), heterogeneous gateway-based energy-aware multi-hop routing (HMGEAR), etc. In such protocols, some nodes in the network may perform malicious activities. Therefore, four deep learning (DL) techniques and a real-time message content validation (RMCV) scheme based on blockchain are used in the proposed network for the detection of malicious nodes (MNs). Moreover, to analyse the routing data in the WSN, DL models are trained on a state-of-the-art dataset generated from LEACH, known as WSN-DS 2016. The WSN contains three types of nodes: sensor nodes, cluster heads (CHs) and the base station (BS). The CHs after aggregating the data received from the sensor nodes, send it towards the BS. Furthermore, to overcome the single point of failure issue, a decentralized blockchain is deployed on CHs and BS. Additionally, MNs are removed from the network using RMCV and DL techniques. Moreover, legitimate nodes (LNs) are registered in the blockchain network using proof-of-authority consensus protocol. The protocol outperforms proof-of-work in terms of computational cost. Later, routing is performed between the LNs using different routing protocols and the results are compared with original LEACH and HMGEAR protocols. The results show that the accuracy of GRU is 97%, LSTM is 96%, CNN is 92% and ANN is 90%. Throughput, delay and the death of the first node are computed for LEACH, LEACH with DL, LEACH with RMCV, HMGEAR, HMGEAR with DL and HMGEAR with RMCV. Moreover, Oyente is used to perform the formal security analysis of the designed smart contract. The analysis shows that blockchain network is resilient against vulnerabilities.