Research and Improvement of LEACH Protocol for Wireless Sensor Networks

2012 ◽  
Vol 562-564 ◽  
pp. 1304-1308 ◽  
Author(s):  
Qing Hui Wang ◽  
Hong Yan Guo ◽  
Yong Huan Ji
Keyword(s):  
Wireless Sensor Networks ◽  
Computer Simulation ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transfer ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Leach Protocol ◽  
Optimal Cluster

The data transfer of wireless sensor network (WSN) can not be separated with routing protocol, Energy efficiency is one of the most important factors in wireless sensor networks. In this paper based on the uneven distribution of the LEACH cluster head and the different lengths and base station communications, we present a improved LEACH algorithm which refers to remaining energy and optimal cluster heads. Computer simulation using NS2 reveals that the proposed protocol reduces the energy consumption compared with the existing LEACH protocol.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

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 A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

scholarly journals Optimized Cluster-Based Dynamic Energy-Aware Routing Protocol for Wireless Sensor Networks in Agriculture Precision

2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Kashif Naseer Qureshi ◽  
Muhammad Umair Bashir ◽  
Jaime Lloret ◽  
Antonio Leon
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Gateway Node ◽  
Agriculture Sector

Wireless sensor networks (WSNs) are becoming one of the demanding platforms, where sensor nodes are sensing and monitoring the physical or environmental conditions and transmit the data to the base station via multihop routing. Agriculture sector also adopted these networks to promote innovations for environmental friendly farming methods, lower the management cost, and achieve scientific cultivation. Due to limited capabilities, the sensor nodes have suffered with energy issues and complex routing processes and lead to data transmission failure and delay in the sensor-based agriculture fields. Due to these limitations, the sensor nodes near the base station are always relaying on it and cause extra burden on base station or going into useless state. To address these issues, this study proposes a Gateway Clustering Energy-Efficient Centroid- (GCEEC-) based routing protocol where cluster head is selected from the centroid position and gateway nodes are selected from each cluster. Gateway node reduces the data load from cluster head nodes and forwards the data towards the base station. Simulation has performed to evaluate the proposed protocol with state-of-the-art protocols. The experimental results indicated the better performance of proposed protocol and provide more feasible WSN-based monitoring for temperature, humidity, and illumination in agriculture sector.

scholarly journals Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5206
Author(s):  
Mudathir F. S. Yagoub ◽  
Othman O. Khalifa ◽  
Abdelzahir Abdelmaboud ◽  
Valery Korotaev ◽  
Sergei A. Kozlov ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Modeling And Analysis ◽  
Cluster Head Election ◽  
Dynamic Cluster ◽  
Leach Protocol

Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy and resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, and making WSNs more efficient. Unfortunately, the WSNs are still immature, and suffering in several aspects. This paper aims to solve some of the downsides in existing routing protocols for WSNs; a Lightweight and Efficient Dynamic Cluster Head Election routing protocol (LEDCHE-WSN) is proposed. The proposed routing algorithm comprises two integrated methods, electing the optimum cluster head, and organizing the re-clustering process dynamically. Furthermore, the proposed protocol improves on others present in the literature by combining the random and periodic electing method in the same round, and the random method starts first at the beginning of each round/cycle. Moreover, both random and periodic electing methods are preceded by checking the remaining power to skip the dead nodes and continue in the same way periodically with the rest of the nodes in the round. Additionally, the proposed protocol is distinguished by deleting dead nodes from the network topology list during the re-clustering process to address the black holes and routing delay problems. Finally, the proposed algorithm’s mathematical modeling and analysis are introduced. The experimental results reveal the proposed protocol outperforms the LEACH protocol by approximately 32% and the FBCFP protocol by 8%, in terms of power consumption and network lifetime. In terms of Mean Package Delay, LEDCHE-WSN improves the LEACH protocol by 42% and the FBCFP protocol by 15%, and regarding Loss Ratio, it improves the LEACH protocol by approximately 46% and FBCFP protocol by 25%.

An Improvement of LEACH Protocol Based on Motes’ Location Information

2010 ◽  
Vol 108-111 ◽  
pp. 1176-1181
Author(s):  
Yu Jiang ◽  
Yan Chun Liang ◽  
Li Li He ◽  
Ying Hui Cao ◽  
Cheng Quan Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Life Cycle ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Location Information ◽  
Leach Protocol ◽  
Entire Network

Network’s life cycle and the energy expending rates of mote are important performance criterions for wireless sensor networks (WSN). An improved routing protocol based on LEACH was proposed in this paper to prolong the network’s life cycle. The improved routing protocol took the circumstance into consideration, that is every mote knows the location information of its own and that of the base station. We analyzed that how to use these location information to extend the mote’s life cycle. And then the extension of the entire network life cycle was achieved. Simulation on the NS2-environment was conducted. And the experimental results show that the whole network’s life cycle was extended greatly.

Dynamic Multi-Hop Routing Protocol in Wireless Sensor Networks

2013 ◽  
Vol 442 ◽  
pp. 532-537
Author(s):  
Xian Li Li ◽  
Jia Wei Zhang ◽  
Liang Bing Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Dominant Set ◽  
Leach Protocol ◽  
Balance Energy ◽  
Entire Network

Considering the shortage of LEACH protocol, a novel dynamic multi-hop routing protocol named Balance Energy-efficient and Real-time with Reliable communication protocol based on Connected Dominant Set (BERR-CDS) is proposed in this paper. BERR-CDS protocol fully takes account of the energy consumption of an individual node and entire network, a rational transmission path from source node to sink node is searched, aiming at the network topology changes which are caused by the death of cluster head, the invalidation of cluster member nodes and new nodes joining, BERR-CDS designs the corresponding valid mechanism to respond, and it can rapidly adapt to the topology change of network. Simulation results show that BERR-CDS protocol has better performances in term of energy consumption, network lifetime and reliability, it is an ideal routing protocol in wireless sensor networks.

scholarly journals Energy-Efficient Routing Protocol Based on Zone for Heterogeneous Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Jia Yanfei ◽  
Chen Guangda ◽  
Zhao Liquan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Networks

In heterogeneous wireless sensor networks, sensor nodes are randomly distributed in some regions. In some applications, they may be randomly distributed in different regions. Besides, nodes with the same type have almost the same probability to be selected as cluster head. The cluster head will consume much more energy to receive and transmit data than the other nodes. If nodes with little residual energy have been elected as cluster heads, it will affect the efficiency of the network due to its early death. An improved energy-efficient routing protocol is proposed for heterogeneous wireless sensor networks. Firstly, it supposes that the different types of nodes are distributed in different zones. Secondly, by improving the threshold, nodes with large residual energy have a greater possibility of becoming cluster heads. In the end, it designs a mixed data transmission method. The cluster heads of supper nodes and advance nodes directly transmit data to the base station. The normal nodes adopt single hops and multiple hops mixed methods to transmit data. This can minimize the energy of the communication from cluster head to base station. Simulation results show that this algorithm has achieved a longer lifetime for the wireless sensor network than stable election protocol and threshold-sensitive stable election protocol algorithm.

scholarly journals An Improved Energy-Efficient Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4579 ◽  
Author(s):  
Yang Liu ◽  
Qiong Wu ◽  
Ting Zhao ◽  
Yong Tie ◽  
Fengshan Bai ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Base Station ◽  
Wireless Sensor ◽  
Leach Protocol

Cluster-based hierarchical routing protocols play an essential role in decreasing the energy consumption of wireless sensor networks (WSNs). A low-energy adaptive clustering hierarchy (LEACH) has been proposed as an application-specific protocol architecture for WSNs. However, without considering the distribution of the cluster heads (CHs) in the rotation basis, the LEACH protocol will increase the energy consumption of the network. To improve the energy efficiency of the WSN, we propose a novel modified routing protocol in this paper. The newly proposed improved energy-efficient LEACH (IEE-LEACH) protocol considers the residual node energy and the average energy of the networks. To achieve satisfactory performance in terms of reducing the sensor energy consumption, the proposed IEE-LEACH accounts for the numbers of the optimal CHs and prohibits the nodes that are closer to the base station (BS) to join in the cluster formation. Furthermore, the proposed IEE-LEACH uses a new threshold for electing CHs among the sensor nodes, and employs single hop, multi-hop, and hybrid communications to further improve the energy efficiency of the networks. The simulation results demonstrate that, compared with some existing routing protocols, the proposed protocol substantially reduces the energy consumption of WSNs.

Sign in / Sign up

Export Citation Format

Share Document