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 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 Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

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

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 An energy-efficient unequal clustering routing protocol for wireless sensor networks

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771987938 ◽  
Author(s):  
Fang Zhu ◽  
Junfang Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Rotation Strategy

Wireless sensor networks have drawn tremendous attentions from all fields because of their wide application. Maximizing network lifetime is one of the main problems in wireless sensor networks. This article proposes an energy-efficient routing protocol which adopts unequal clustering technology to solve the hot spots problem and proposes double cluster head strategy to reduce the energy consumption of head nodes in the clusters. In addition, to balance the energy consumption between cluster heads and cluster members, a hybrid cluster head rotation strategy based on time-driven and energy-driven is proposed, which can make the timing of rotation more reasonable and the energy consumption more efficient. Finally, we compare the proposed protocol with LEACH, DEBUC, and UCNPD by simulation experiments. The simulation results prove that our proposed protocol can effectively improve the performance in terms of network lifetime, energy consumption, energy balance, stability, and throughput.

Uneven Cluster-Routing Protocol of Base on Energy for Wireless Sensor Networks

2014 ◽  
Vol 687-691 ◽  
pp. 1823-1826 ◽  
Author(s):  
Duo Peng ◽  
Suo Ping Li
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Data ◽  
Constraint Problem ◽  
Energy Efficient Clustering ◽  
Hot Zone

For severe energy constraint problem of wireless sensor networks, a non-uniform energy efficient clustering routing protocol (EUCRP) is proposed based on the analysis of the existing clustering routing protocol the characteristics and shortcomings. In EUCRP, we use a limiting cluster size optimization formation algorithm to produce clusters in descending order of the size of the cluster. Improved multi-hop inter-cluster data forwarding, saving energy cluster head and energy consumption of inter-cluster is balanced. Propose using “watering pot path” in the last hop to effectively solve the “hot zone” problem caused by uneven load energy. Simulation results show that the protocol can effectively reduce network energy consumption and prolong the network lifetime.

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

Minimizing Energy Consumption in Wireless Sensor Networks by Partition

2016 ◽  
Vol 850 ◽  
pp. 23-29
Author(s):  
Wen Zhi Zhu ◽  
Feng Xu
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Clustering Methods ◽  
Improve Energy Efficiency

In wireless sensor networks, clustering class routing protocol is an important protocol type. Different clustering methods, and cluster head selection method directly affects the energy consumption of the entire network communication. This paper studies the effect of different partition methods of the network energy consumption, and to study the partitioning methods under the conditions of uneven distribution of nodes. We believe that energy efficiency clustering method should adapt the distributed of sensor nodes in order to improve energy efficiency. And according to the partition method we propose a low-power adaptive clustering routing protocol based on node distribution to partition. The protocol can effectively extend the lifetime of a wireless sensor network. Simulation results show that the proposed protocol can effectively prolong the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document