scholarly journals Enhancement of LEACH Based on K-means Algorithm and Stochastic Optimization

2021 ◽  
pp. 406-410
Author(s):  
Tuyen Nguyen Viet ◽  
◽  
Trang Pham Thi Quynh ◽  
Hang Duong Thi
Keyword(s):  
Stochastic Optimization ◽  
Routing Protocol ◽  
Simulation Analysis ◽  
Routing Algorithm ◽  
Bat Algorithm ◽  
Sensor Nodes ◽  
Swarm Optimization ◽  
Adaptive Clustering ◽  
Leach Protocol ◽  
Energy Conservation Measures

In Wireless Sensor Networks (WSNs), maximizing the life of the Sensor Nodes (SNs), and energy conservation measures are essential to enhance the performance of the WSNs. A Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocol has been proposed specifically for WSNs to increase the network lifetime. However, in LEACH protocol the criteria for clustering and selecting Cluster Heads (CHs) nodes were not mentioned. Accordingly, researchers have been focusing on ways to strengthen the LEACH algorithm to make it more efficient. In this paper, we propose to improve the LEACH protocol by combining the use of K-means algorithm for clustering and Slime Mould Algorithm (SMA), a new stochastic optimization to select nodes as CHs. The proposed routing algorithm, called SMA-LEACH, is superior to other algorithms, namely PSO-LEACH, BA-LEACH, which using Particle Swarm Optimization (PSO), Bat Algorithm (BA) to improve LEACH, respectively. Simulation analysis shows that the SMA-LEACH obviously reduces network energy consumption and extends the lifetime of WSNs.

Two Rounds Based LEACH

2017 ◽  
Vol 8 (3) ◽  
pp. 34-44
Author(s):  
Meriem Boumassata ◽  
Mohamed Benmohammed
Keyword(s):  
Low Power ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Electronic Devices ◽  
Cluster Head ◽  
Hierarchical Cluster ◽  
Base Station ◽  
Sensor Nodes ◽  
Adaptive Clustering ◽  
Leach Protocol

Wireless sensor networks (WSNs) are networks formed by a large number of electronic devices called sensor nodes, where each node is capable of measuring environmental or physical values and communicating data, through wireless links, to a base station. The main problem that WSNs routing protocols face, is that sensors are powered with low power batteries, which plays an important role in network lifetime. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical cluster based routing protocol that was proposed as a solution for low power consumption in WSNs. One of LEACH protocol limitations is “Extra Transmissions”. This paper studies LEACH protocol, some of its various enhancements and finally proposes a new clustering and selecting cluster head scheme with the goal of optimizing the energy consumption in WSNs.

scholarly journals Energy-Efficient Clustering Scheme for Flying Ad-Hoc Networks Using an Optimized LEACH Protocol

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6016
Author(s):  
Salil Bharany ◽  
Sandeep Sharma ◽  
Sumit Badotra ◽  
Osamah Ibrahim Khalaf ◽  
Youseef Alotaibi ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Base Station ◽  
Low Energy ◽  
Sensor Nodes ◽  
Threshold Function ◽  
Adaptive Clustering ◽  
Leach Protocol ◽  
Energy Efficient Clustering

A Flying Ad-hoc network constitutes many sensor nodes with limited processing speed and storage capacity as they institute a minor battery-driven device with a limited quantity of energy. One of the primary roles of the sensor node is to store and transmit the collected information to the base station (BS). Thus, the life span of the network is the main criterion for the efficient design of the FANETS Network, as sensor nodes always have limited resources. In this paper, we present a methodology of an energy-efficient clustering algorithm for collecting and transmitting data based on the Optimized Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. The selection of CH is grounded on the new optimized threshold function. In contrast, LEACH is a hierarchical routing protocol that randomly selects cluster head nodes in a loop and results in an increased cluster headcount, but also causes more rapid power consumption. Thus, we have to circumvent these limitations by improving the LEACH Protocol. Our proposed algorithm diminishes the energy usage for data transmission in the routing protocol, and the network’s lifetime is enhanced as it also maximizes the residual energy of nodes. The experimental results performed on MATLAB yield better performance than the existing LEACH and Centralized Low-Energy Adaptive Clustering Hierarchy Protocol in terms of energy efficiency per unit node and the packet delivery ratio with less energy utilization. In addition, the First Node Death (FND) is also meliorated when compared to the LEACH and LEACH-C protocols.

scholarly journals Pengembangan mekanisme grid based clustering untuk peningkatan kinerja LEACH pada lingkungan Wireless Sensor Network

2019 ◽  
Vol 5 (2) ◽  
pp. 164
Author(s):  
Kristoforus Fallo ◽  
Waskitho Wibisono ◽  
Kun Nursyaful Priyo Pamungkas
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Center ◽  
Adaptive Clustering ◽  
Leach Protocol ◽  
Grid Based

Development of a grid-based clustering mechanism to improve LEACH performance in the Wireless Sensor Network environmentLow Energy Adaptive Clustering Hierarchy (LEACH) merupakan algoritma routing pada Wireless Sensor Network (WSN) berbasis cluster. LEACH memilih sebuah node sebagai cluster head (CH) yang tugasnya untuk melakukan komunikasi dengan sink maupun guna mengumpulkan data dari member node. Persebaran CH pada LEACH yang dikatakan acak, kadang mengalami masalah mengingat rumus probabilitas pada tiap round. Hal ini akan menyebabkan CH yang terpilih bisa berada di tepi area, juga terjadinya pemborosan energi karena jalur yang terbentuk akan menjadi panjang. Oleh karena itu, kami ingin mengembangkan routing protocol G-LEACH menggunakan teknik merge CH dalam suatu area (grid) disertai beberapa parameter yang relevan, seperti posisi node, node dengan sisa energi terbesar, dan jarak yang dihitung dalam tiga jarak yaitu jarak node menuju cluster center, jarak node menuju merge CH, dan jarak merge CH menuju sink. Hasil pengujian menunjukan bahwa dengan menggabungkan cluster (merge CH) pada transmisi data menuju sink pada protokol G-LEACH dapat menghasilkan masa hidup jaringan yang lebih lama pada seluruh operasi node, energi yang dibutuhkan pada semua node lebih rendah, dan lebih banyak paket data yang dikirim dan diterima oleh sink. Low Energy Adaptive Clustering Hierarchy (LEACH) is a routing algorithm in a cluster-based Wireless Sensor Network (WSN). LEACH selects a node as a cluster head (CH) whose responsibility is for communicating with sinks and collect data from the node members. The distribution of CH on LEACH, which is basically random, sometimes has a problem in remembering the probability formula on each round. This may make the selected CH on the edge of the area as well as generate energy waste because the pathway formed will be lengthy. Therefore, we would like to develop the G-LEACH routing protocol using a merge CH technique in one area (grid) with several relevant parameters, such as the position of the node, the node with the largest remaining energy, and the distance calculated in three distances: the distance of the node to the clustercenter, the distance of the node to the merge CH, and the distance of the merge CH to the sink. The test result showed that combining clusters (merge CH) in the data transmission to the sink in the G-LEACH protocol could produce a longer network life on all node operations, lower energy required for all nodes, and more data package sent and received by the sink.

LEACH-EO: A More Energy-Efficient LEACH Protocol for WSN

2014 ◽  
Vol 644-650 ◽  
pp. 3108-3111
Author(s):  
Jing Zhang ◽  
Han Yan ◽  
Yi Cui ◽  
Hui Rong ◽  
Jian Ping Wang
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Adaptive Clustering ◽  
Energy Consumption Optimization ◽  
Leach Protocol ◽  
Reduce Energy Consumption ◽  
Selection Of

The sensor nodes in WSN are generally limited in energy, and the communication between nodes consumes most power. Therefore, it is the key point to reduce energy consumption and network traffic when designing routing protocols for WSN. The Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is a widely used and studied WSN routing protocol. In this paper, an improved LEACH based on energy-consumption optimization (LEACH-EO) was proposed against the deficiencies of LEACH. LEACH-EO implemented some improvements on the cluster-head selection of LEACH, meanwhile, the data redundancy of WSN was exploited to optimize the data transmission according to the characteristics of WSN. The simulation results show that LEACH-EO increases network lifetime and reduces energy consumption in comparison to LEACH.

scholarly journals Improved uplink throughput and energy efficiency of LoRaWAN using 2-hop LEACH protocol

2021 ◽  
Vol 24 (3) ◽  
pp. 1557
Author(s):  
Yassine Oukessou ◽  
Mohamed Baslam ◽  
Mohamed Oukessou
Keyword(s):  
Routing Protocol ◽  
Simulation Analysis ◽  
Wide Area ◽  
Wide Area Networks ◽  
Adaptive Clustering ◽  
Wide Range ◽  
Leach Protocol ◽  
Energy Constrained ◽  
Iot Devices ◽  
Battery Energy

The low power wide area networks (LPWAN) is the new connectivity technology that is geared towards energy constrained internet of things (IoT) devices, is starting to become one of the drivers of the re-accelerating IoT market and has one goal: ensure the wide range distance while reducing the battery energy consumption. We focus in this paper on the evaluation of the uplink throughput of the long-range wide area networks (LoRaWAN) then we attempt optimize the throughput and power dissipation using low energy adaptive clustering hierarchy (LEACH) protocol. Therefore, we exploit a novel module developed in NS-3 simulator for obtaining the first measurements scenario, then the LEACH algorithm for the second optimization case. As result, the simulation analysis will help us to add a new LoRaWAN routing protocol feature.

scholarly journals The Improvement of LEACH Algorithm in Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 46 ◽  
Author(s):  
Shujuan Dong ◽  
Cong Li
Keyword(s):  
Routing Algorithm ◽  
Critical Evaluation ◽  
Life Time ◽  
Correlated Data ◽  
Sensor Nodes ◽  
Time Simulation ◽  
Leach Protocol ◽  
Frame Work ◽  
Network Life Time ◽  
Almost All

This paper covers a novel routing algorithm called Multi-Group based LEACH (MG-LEACH) that has been utilized the redundant deployed sensor nodes to improve the network life time. It has been suppressing the correlated data gathered by the sensor nodes by monitoring the similar event. Thus reduces not only the data transmission inside the clusters but also conserve the energy of deployed sensor nodes consequently improve the overall network lifetime. This is a simple idea that has been implemented over LEACH protocol however it is valid for almost all clustering based routing algorithms/protocols specially those variants based upon frame work of LEACH. The proposed routing algorithm has been simulated using MATLAB to verify the efficiency in enhancing network life time. A critical evaluation of routing algorithm is conducted to determine the relevance and applicability in increasing network life time. Simulation results confirmed that it has performed better than LEACH and enhanced network life time up to approximately 90%.

A STATIC-LEACH WSNs for Hazardous Materials Monitoring

2012 ◽  
Vol 463-464 ◽  
pp. 261-265
Author(s):  
Fei Hui ◽  
Xiao Le Wang ◽  
Xin Shi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Low Cost ◽  
Hazardous Materials ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hazardous Materials Transportation ◽  
Adaptive Clustering

In this paper, hazardous materials transportation monitoring system is designed, implemented, and tested using Wireless Sensor Networks (WSNs). According to energy consumption and response time during clustering of Wireless Sensor Networks LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, we proposed STATIC-LEACH routing protocol based on static clustering, it can effectively reduce energy consumption of the wireless sensor nodes and reduce network latency of cluster. With WSN and GSM/GPRS, low cost and easy deployment remote monitoring is possible without interfering with the operation of the transportation.

scholarly journals Enhancing Energy Saving in Smart Farming through Aggregation and Partition Aware IoT Routing Protocol

Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2760 ◽  
Author(s):  
Karim Fathallah ◽  
Mohamed Abid ◽  
Nejib Ben Hadj-Alouane
Keyword(s):  
Low Power ◽  
Energy Saving ◽  
Routing Protocol ◽  
Precision Agriculture ◽  
Routing Algorithm ◽  
High Energy ◽  
Sensor Nodes ◽  
Personal Area Networks ◽  
Lossy Networks ◽  
Smart Farming

Internet of things (IoT) for precision agriculture or Smart Farming (SF) is an emerging area of application. It consists essentially of deploying wireless sensor networks (WSNs), composed of IP-enabled sensor nodes, in a partitioned farmland area. When the surface, diversity, and complexity of the farm increases, the number of sensing nodes increases, generating heavy exchange of data and messages, and thus leading to network congestion, radio interference, and high energy consumption. In this work, we propose a novel routing algorithm extending the well known IPv6 Routing Protocol for Low power and Lossy Networks (RPL), the standard routing protocol used for IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN). It is referred to as the Partition Aware-RPL (PA-RPL) and improves the performance of the standard RPL. In contrast to RPL, the proposed technique builds a routing topology enabling efficient in-network data aggregation, hence dramatically reducing data traffic through the network. Performance analysis of a typical/realistic precision agriculture case, considering the potato pest prevention from the well-known late blight disease, shows that PA-RPL improves energy saving up to 40 % compared to standard RPL.

scholarly journals EFFICIENT ROUTING PROTOCOL ALGORITHM FOR WIRELESS SENSOR NETWORKS

2018 ◽  
Vol 44 (1) ◽  
pp. 11-17
Author(s):  
Sayed Seno ◽  
Doaa Abd Ali ◽  
Mohammed Mohammed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transfer ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Energy Consuming ◽  
Effective Transfer

Recently, different applications of wireless sensor networks (WSNs) in the industry fields using different data transfer protocols has been developed. As the energy of sensor nodes is limited, prolonging network lifetime in WSNs considered a significant occurrence. To develop network permanence, researchers had considered energy consuming in routing protocols of WSNs by using modified Low Energy Adaptive Clustering Hierarchy. This article presents a developed effective transfer protocols for autonomic WSNs. An efficient routing scheme for wireless sensor network regarded as significant components of electronic devices is proposed. An optimal election probability of a node to be cluster head has being presented. In addition, this article uses a Voronoi diagram, which decomposes the nodes into zone around each node. This diagram used in management architecture for WSNs.

scholarly journals Design and Implementation of EOICHD Based Clustered Routing Protocol Variants for Wireless Sensor Networks

2021 ◽  
Vol 4 (2) ◽  
pp. 25
Author(s):  
Anupkumar Bongale ◽  
Arunkumar Bongale ◽  
Satish Kumar ◽  
Rahul Joshi ◽  
Kishore Bhamidipati
Keyword(s):  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Data Packets ◽  
Adaptive Clustering ◽  
Network Cluster ◽  
Leach Protocol

Efficient energy utilization and network life prolongation are primary objectives to be considered when designing a Wireless Sensor Network. Cluster-based routing protocols are most suitable for achieving such goals. Energy and Optimal Inter Cluster Head Distance (EOICHD) is a cluster-based hierarchical routing protocol inspired by the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. EOICHD resolves the problems associated with LEACH protocol, such as selecting cluster head nodes in close proximity. By carefully selecting the cluster head nodes based on residual energy and optimal inter-cluster head distance, EOICHD ensures that selected cluster head nodes are separated by a certain optimal distance. This approach ensures uniform distribution of cluster head nodes across the entire network. The study of the EOICHD protocol presented so far is not sufficient. Hence, in this paper, we propose three variants of EOICHD protocol to understand its behavior in a better manner. A comparative analysis of all three EOICHD variants, LEACH and LEACH-central constrained (LEACH-C) protocol, is performed by considering comparative parameters such as alive nodes, cumulative network energy, data packets arrived at the base station, and stability of the network.

Sign in / Sign up

Export Citation Format

Share Document