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%.

The Study and Realization of Energy-Aware Routing Algorithm of Wireless Sensor Networks

2012 ◽  
Vol 201-202 ◽  
pp. 767-772
Author(s):  
Hai Yan Hu ◽  
You Qiao Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Test Bed ◽  
Energy Aware ◽  
Cluster Head Election ◽  
Dynamic Cluster ◽  
Energy Aware Routing

Based on the analysis of routing algorithm of typical wireless sensor networks, the author puts forward with the objectives of routing algorithm and designs energy-aware routing algorithm to reduce energy consumption and extend life cycle of the whole network. The algorithm constitutes four modules: clustering module, dynamic cluster head election module, dormant state module and inter-cluster routing module. Aiming at effectively using the energy of sensor nodes, the paper makes use of honeycomb-like two-level clustering structure to increase coverage rate of nodes. Also, studies of routing are discussed on the two aspects, being the inter-clustering dynamic cluster head election and introduction of dormant mechanism, and secondly, the inter-clustering reliable routing.The routing algorithm has its prototype realized and effectively verified on the test bed provided by the laboratory.

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 Evaluation of Stable Cluster Head Election (SCHE) routing protocol for Wireless Sensor Networks

2008 ◽  
Author(s):  
Wan Norsyafizan W. Muhamad ◽  
Kaharudin Dimyati ◽  
Roslina Mohamad ◽  
Muhamad Adib Haron ◽  
Suzi Seroja Sarnin ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Stable Cluster ◽  
Cluster Head Election

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.

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 A grid-based reliable multi-hop routing protocol for energy-efficient wireless sensor networks

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876596 ◽  
Author(s):  
Zhansheng Chen ◽  
Hong Shen
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Data Forwarding ◽  
Reliable Transmission ◽  
Grid Based

Due to the limited energy and the non-equivalence of wireless sensor network nodes, it is imperative to reduce and rationally use the energy consumption of the nodes to prolong the network lifetime. Clustering routing algorithm can address the problem efficiently. In this article, a grid-based reliable multi-hop routing approach for wireless sensor networks is proposed. In order to minimize and balance the energy consumption, our proposed protocol, grid-based reliable multi-hop routing protocol, optimizes the cluster head election process by combining individual ability which consists of node’s residual energy and node’s location, and local cognition which can balance energy consumption among clusters via a consultative mechanism based on cluster head’s lifetime expectancy, while considering data forwarding delay and reliable transmission of data. Simulation results show that grid-based reliable multi-hop routing protocol has improved stability period as compared to other protocols. Meanwhile, grid-based reliable multi-hop routing protocol has better performance in energy efficiency, data forwarding delay, and reliable transmission of data.

scholarly journals Dynamic Cluster Based Routing Protocol with Sink Mobility Support for Underwater Wireless Sensor Networks

2018 ◽  
Vol 7 (3.16) ◽  
pp. 57
Author(s):  
Anandalatchoumy S ◽  
Sivaradje G
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Mobility Support ◽  
Mobile Sinks ◽  
Dynamic Cluster

Underwater wireless sensor networks are energy resource constrained due to the scarce battery capacity. Energy efficient routing protocol is highly demanded to be developed for such networks. It is indeed a challenging task to design routing protocol that can achieve energy efficiency due to the dynamic and harsh underwater environment. A dynamic cluster based routing protocol coupled with sink mobility support (DCMMS) is proposed. Two schemes are combined together in the protocol. One is the formation of  clusters and two is the mobile sink management. The cluster formation includes cluster head election process and member           association process. Each cluster member sends the sensed data to the cluster head. Multiple mobile sinks are deployed to gather data directly from cluster heads. Finally, mobile sinks send the collected data after proper aggregation to the static sinks located at the surface. Thus, sink mobility and the dynamic clustering technique together help to balance the load among the nodes thereby       minimizing energy consumption to a significant extent and extending the network life span. Analytical simulations are extensively carried out to attest how the proposed protocol (DCMMS) achieves better performance with minimum energy consumption, less end to end delay and higher packet delivery ratio than its counterpart existing protocol (AA-RP).  

Sign in / Sign up

Export Citation Format

Share Document