Mobile routing algorithm with dynamic clustering for energy large‐scale wireless sensor networks

“…For an individual in the CCPEA, its fitness value is calculated based on the fitness function. In this article, the fitness value of the chromosome is calculated by (5). In CCPEA, we calculate the communication energy consumption of each chromosome's fitness value.…”

Section: Fitness Evaluationmentioning

confidence: 99%

“…At present, this kind of network mostly adopts tree-like and star-like structures and seldom arranges the aggregation node; the sensor node can reach the base station directly or through a few hops. Due to the high deployment efficiency of high-density sensors and strong environmental adaptability, they profoundly impact many fields, such as national defense and military, smart home, agricultural engineering, environmental monitoring, and many other fields [5,6].…”

Section: Introductionmentioning

confidence: 99%

Clone Chaotic Parallel Evolutionary Algorithm for Low-Energy Clustering in High-Density Wireless Sensor Networks

Yang

Zhou

2021

Scientific Programming

View full text Add to dashboard Cite

Because the sensors are constrained in energy capabilities, low-energy clustering has become a challenging problem in high-density wireless sensor networks (HDWSNs). Usually, sensor nodes tend to be tiny devices along with constrained clustering abilities. To have a low communication energy consumption, a low-energy clustering scheme should be designed properly. In this work, a new cloned chaotic parallel evolution algorithm (CCPEA) is proposed, and a low-energy clustering model is established to lower the communication energy consumption of HDWSNs. By introducing CCPEA into the low-energy clustering, an objective function is designed for evaluating the communication energy consumption. For this problem, we define a clone operator to minimize the communication energy consumption of HDWSNs, use the chaotic operator to randomly generate the initial population to expand the search range to avoid local optimization, and find the parallel operator to speed up the convergence speed. In the experiment, the effect of CCPEA is compared to heuristic approaches of particle swarm optimization (PSO) and simulated annealing (SA) for the HDWSNs with different numbers of sensors. Simulation experiments demonstrate that the presented CCPEA method achieves a lower communication energy consumption and faster convergence speed than PSO and SA.

show abstract

“…LEACH-based multi-hop protocols include inter-cluster multi-hop protocols, intracluster multi-hop protocols, and combination of intra- and intercluster protocols. There are some multi-hop protocols based on LEACH, such as M-LEFCA [ 17 ], DMH-LEACH [ 18 ], EM-LEACH [ 19 ], LEACH-WM [ 20 ], and more [ 21 , 22 , 23 ]. However LEACH-based multi-hop protocols generally have the problem of unbalanced energy dissipation and data conflicts.…”

Section: Introductionmentioning

confidence: 99%

Centralized Multi-Hop Routing Based on Multi-Start Minimum Spanning Forest Algorithm in the Wireless Sensor Networks

Jin

Fan

Sun

2021

Sensors

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are widely applied in environmental monitoring, target tracking, military, and industrial fields. However, the battery energy of sensor nodes in WSNs is limited, which limits its development. Previous studies have shown that clustering protocols and multi-hop communication are beneficial to reduce nodes energy consumption. The multi-hop protocol based on low energy adaptive clustering hierarchy (LEACH) has been proven to significantly reduce energy dissipation. However, LEACH-based multi-hop protocols generally have the problem of unbalanced energy dissipation and data conflicts. In this paper, we propose a centralized multi-hop routing based on multi-start minimum spanning forest (LEACH-CMF) to optimize LEACH. In order to realize multi-hop communication, we introduced a multi-start minimum spanning tree algorithm to select relay nodes with the minimum relay cost and generate appropriate multi-hop paths. To avoid data collision in multi-hop communication and make nodes including the cluster heads sleep as much as possible in the non-working state, we design a bottom-up continuous time slot allocation method to improve the time division multiple access (TDMA) cycle. We performed simulation in NS2. The simulation results show that the network lifetime is approximately doubled compared to LEACH and centralized low energy adaptive clustering hierarchy (LEACH-C). The simulation results show that the proposed protocol can effectively balance the energy dissipation of nodes and prolong network lifetime.

show abstract

Mobile routing algorithm with dynamic clustering for energy large‐scale wireless sensor networks

Cited by 15 publications

References 21 publications

Energy-eﬀicient virtual infrastructure based geo-nested routing protocol for wireless sensor networks

Energy-eﬀicient virtual infrastructure based geo-nested routing protocol for wireless sensor networks

Clone Chaotic Parallel Evolutionary Algorithm for Low-Energy Clustering in High-Density Wireless Sensor Networks

Centralized Multi-Hop Routing Based on Multi-Start Minimum Spanning Forest Algorithm in the Wireless Sensor Networks

Contact Info

Product

Resources

About