A Survey on Clustering and Routing on LEACH for Wireless Sensor Network

2013 ◽  
Vol 336-338 ◽  
pp. 248-252
Author(s):  
Lu Gao ◽  
Zhong Min Li ◽  
Jing Jing Wu
Keyword(s):  
Routing Algorithm ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Factors Affecting ◽  
Adaptive Clustering ◽  
Advantages And Disadvantages ◽  
The Past ◽  
Important Field ◽  
Routing Techniques

In recent years, Wireless Sensor Networks (WSNs) have been promising approaches for a variety of application monitoring and capturing the required data from the environment. Due to the restricted communication range and high density of sensor nodes, routing in WSNs has been considered an important field of research over the past decade. The most popular protocol for clustering in WSNs is Low Energy Adaptive Clustering Hierarchy (LEACH) which is based on adaptive clustering technique. The factors affecting LEACH efficiency include Cluster Head (CH), topology structure and routing algorithm. This paper provides in the past years the taxonomy of various clustering and routing techniques based on LEACH in WSNs. The paper highlights the primary principle of each improved protocol and emphasize on their advantages and disadvantages compared to the LEACH.

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.

A New Clustering Routing Algorithm for WSN Based on PSO

2013 ◽  
Vol 850-851 ◽  
pp. 689-692
Author(s):  
Li Fu Wang ◽  
Jian Ding ◽  
Zhi Kong
Keyword(s):  
Energy Consumption ◽  
Clustering Algorithm ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Pso Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Long Distance ◽  
Wireless Sensor Nodes ◽  
Spatially Distributed

A wireless sensor network (WSN) consists of spatially distributed wireless sensor nodes. The node power constrains the development of WSN. Employing techniques of clustering can reduce energy consumption of wireless sensor nodes and prolong the network lifetime. Therefore, in the study a new clustering routing algorithm is presented. The clustering algorithm uses the double-layer sensor nodes to communicate. And in order to optimize power energy consumption for WSN node energy, PSO algorithm is employed to find cluster head in each layer. Simulation results show that the algorithm not only can equal power energy of node, but also can reduce consumption in the long distance data transmission.

Monitoring System in Pig Farm Based on Improved Zigbee Tree Routing Algorithm

2014 ◽  
Vol 687-691 ◽  
pp. 861-864
Author(s):  
Wei Xing Zhu ◽  
Ai Ping Wang ◽  
Jian Fei Zhang ◽  
Yao Lu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Advantages And Disadvantages ◽  
Tree Routing ◽  
Environment Control ◽  
Improved Algorithm

In view of the fixed testing point and complex wiring in conventional piggery environment control, a new system based on wireless sensor network was designed. This system consisted of the control center with ARM-Linux, executing mechanism nodes and wireless sensor network containing the flexible sensor nodes which could be arbitrarily placed in piggery. In order to make reasonable use of the energy of Zigbee network and prolong the survival time, a improved zigbee tree routing algorithm was proposed. First of all, by analyzing the advantages and disadvantages of the Cluster-tree and AODVjr algorithm in the Zigbee protocol, the neighbor table was introduced into the improved algorithm. Secondly, the scope of the destination node was confirmed to control the radio range of the RREQ and prevented invalid RREQ flooding. Simulation results show that the improved algorithm optimized the overall energy consumption effectively, prolonged the time of the critical nodes, reduced the number of death nodes, balanced the network load and improved the overall performance of the network.

Optimization of Energy Conservation in Wireless Sensor Networks

2020 ◽  
Vol 17 (6) ◽  
pp. 2658-2663
Author(s):  
Anju Rani ◽  
Amit Kumar Bindal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cluster Head ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Network ◽  
Stable Election Protocol

Presently, Wireless Sensor Networks (WSNs) is quickest developing technology which broadly embracing for different application services including; climate observing, traffic expectation, reconnaissance, research and scholastic fields and so on. As the sensor nodes are haphazardly conveyed in remote condition, security measurements turns out to be most encouraging test where correspondence wirelesses systems confronting today. The Stable Election Protocol (SEP) is an enhanced algorithm of Adaptive Clustering Hierarchy (LEACH) with low energy in heterogeneous Wireless Sensor Network (WSN) for improving the life cycle. Be that as it may, the unequal energy circulation of cluster heads and nodes would diminish the lifetime. From one perspective, adding node vitality to cluster head selection to decrease the energy utilization of cluster heads; on the contrary, decline the energy utilization of nodes in cluster through not directly transmitted by interlude nodes. SEP, a protocol of heterogeneous-aware to drag out the time interim before the passing of the first node (we allude to as steady period), which is essential for some applications where the input from the sensor arrange must be solid. SEP depends on weighted election decision probabilities of every node to turn into cluster head as indicated by the rest of the energy in every node. The outcomes show that the E-SEP protocol functions admirably in adjusting the vitality utilization for improving the lifetime looking at LEACH and SEP protocol with enhanced SEP along with proposed E-SEP algorithm using MATLAB.

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 11 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Cluster Head ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Basic Algorithm ◽  
Adaptive Clustering

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.

scholarly journals Cluster Based Techniques LEACH and Modified LEACH using Optimized Technique EHO in WSN

2019 ◽  
Vol 8 (9S) ◽  
pp. 363-372
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Research Work ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Adaptive Clustering ◽  
Long Time ◽  
And Performance

In the last few years, the Internet of Things (IoT) and the advance wireless networks are becoming very prominent in various domains. Wireless Sensors are facing problems of frequent energy loss which affects to the lifetime of the entire network. There are number of researchers who are working on such energy losses which occur in the wireless sensor nodes by using various approaches. One such method is Low- energy adaptive clustering hierarchy (LEACH) and its number of methods. Despite of various methods of LEACH, there is still immense scope of research as it is highly used in sensor nodes for different scenarios. The emerging growth of energy aware wireless sensor networks for a long time leads to various problems related to the lifetime of nodes in the wireless environment. In our research paper, a new and performance aware approach named Elephant Herd Optimization based Cluster Head Selection is devised and simulated so that the optimization level can be achieved. The nature inspired soft computing approaches are always beneficial for the use of optimization and reduction of various problems which can occur during energy optimization and this is the main focus which is considered in this research work. The main fundamental concept of the cluster head shuffling using EHO and other methods of key exchange are simulated in Contiki-Cooja which is an open source simulator for wireless sensor networks

scholarly journals An Energy-Balanced Routing Protocol for a Wireless Sensor Network

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Lin Li ◽  
Donghui Li
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Cluster Head ◽  
Low Energy ◽  
Fuzzy Rules ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Energy Balanced Routing

The wireless sensor network is an intelligent self-organizing network which consists of many sensor nodes deployed in the monitoring area. The greatest challenge of designing a wireless sensor network is to balance the energy consumption and prolong the lifetime of the network, seeing that the nodes can be powered only by batteries in most conditions. An energy-balanced routing protocol (EBRP) for wireless sensor networks is proposed in this paper. In EBRP, we divide the network into several clusters by using K-means++ algorithm and select the cluster head by using the fuzzy logical system (FLS). Since the previous researches did not demonstrate how to get the fuzzy rules for different networks, we propose a genetic algorithm (GA) to obtain the fuzzy rules. We code the rules as a chromosome, and the lifetime of the network is treated as a fit function. Then, through the selection, crossover, and mutation of each generation, the best offspring can be decoded as the best rule for each network model. Through the simulation, comparing with the existing routing protocols such as low-energy adaptive clustering hierarchy (LEACH), low-energy adaptive clustering hierarchy-centralized (LEACH-C), and stable election protocol (SEP), the EBRP prolongs the network lifetime (first node dies) by 57%, 63%, and 63%, respectively.

Multipath Ring Routing in Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 701-705 ◽  
Author(s):  
Gui Min Huang ◽  
Wu Jin Tao ◽  
Ping Shan Liu ◽  
Si Yun Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Routing Protocols ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Delivery ◽  
The Past ◽  
Transmission Reliability

In the past years, the routing problems of wireless sensor network (WSN) have attracted great interest, and many routing protocols for WSN have being proposed. However, these routing protocols pay little attention to the transmission reliability. Therefore, this paper proposes a new multipath ring routing algorithm for WSNs. The proposed algorithm utilizes ring level to separate sensor nodes into several sections, which can improve the reliability of the data transmission. Using the multipath ring routing data delivery improves as an average of 27.58% to leach routing and 113.06% to directing routing.

Routing Algorithm based on Clustering for Increasing the Lifetime of Sensor Networks by Using Meta-Heuristic Bee Algorithms

2020 ◽  
Vol 10 (1) ◽  
pp. 25-36
Author(s):  
Mohammad Sedighimanesh ◽  
Hesam Zand Hesami ◽  
Ali Sedighimanesh
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Heuristic Algorithms ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Cost Effective ◽  
Sensor Nodes ◽  
Wireless Sensor

Background: Nowadays, the use of wireless sensor networks is developing rapidly. these networks are applicable in many fields, including military, medical, and environment. these networks use hundreds or thousands of cheap sensor nodes with low power-low and low energy to perform large tasks. These networks have limitations that can lead to inefficiency or not cost - effective. Among these limitations, consumption of energy and issues related to the lifetime of the network. One of the solutions that can assist the load balancing between sensor nodes, increased scalability, improving energy consumption and consequently, increasing network lifetime, clustering of sensor nodes and placing a suitable cluster head in all clusters. Choosing the right cluster head, significantly reduces energy consumption in the network and increases network lifetime. Objective: The purpose of this paper is to increase network lifetime by using the efficient clustering algorithm, which is used in Meta-heuristic bee colony to select the cluster head. Simulation of this paper is performed by MATLB software and the proposed method is compared with LEACH and GACR approaches. Conclusion: The simulation findings in this study show that the intended study has remarkably increased the length of the network lifetime by LEACH and GACR algorithms. Due to the limitation of energy in the wireless sensor network such solutions and using Meta-heuristic algorithms can give rise a remarkable increasing in network lifetime.

Organized Selection Cluster Head on Fuzzy Low-Energy Adaptive Clustering Hierarchy Protocol in Three-Dimensional Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abderrahmane El Aalaoui ◽  
Abderrahmane Hajraoui
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Cluster Head ◽  
Three Dimensional ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Adaptive Clustering ◽  
Development Approach

: In this paper, we propose an enhancement approach to reduce the energy consumption, extend the network lifetime and improve the performance of protocol Fuzzy Low-Energy Adaptive Clustering Hierarchy Algorithm (Fuzzy LEACH). This improvement in order to augment the energy balancing in clusters among all sensor nodes and to minimize the energy dissipation during network communications. The proposed method is based on a cluster head selection method. Moreover, an enhanced organization of this selection has been implemented. Therefore, the development approach indicates a progress in terms of network lifetime, energy consumption and number of packets transferred to BS compared to Low-Energy Adaptive Clustering Hierarchy Algorithm (LEACH) and other related extended spaces protocols. Mathematical analysis and MATLAB 2013a simulation results show the effectiveness of the proposed approach. The new approach reduce the energy consumption of Wireless Sensor Network (WSN) about 0.99% to 5.64%, prolongs the network life cycle by 42% and increases the number of packets sent by 86% to 732%.

Sign in / Sign up

Export Citation Format

Share Document