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

Abstract

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.

ELISE: A Reinforcement Learning Framework to Optimize the Sloftframe Size of the TSCH Protocol in IoT Networks

“…Gamal et al introduced a hybrid PSO and Kmeans clustering strategy [21], extending network lifetime and improving stability. Jin et al presented a multi-hop routing protocol for WSN [22], implementing the minimum spanning forest algorithm for intra-cluster and inter-cluster routing tree construction. Ma et al proposed an adaptive Voronoi diagrambased clustering protocol [23] and a CH selection algorithm based on the weighted sum of the distance to the CH and the residual energy of the nodes.…”

“…The majority of existing protocols ( [9], [10], [4], [11], [14], [15], [16], [17], [18], [20], [22], [23], [13]) have primarily focused on specific aspects, such as modified thresholds, energy optimization, or clustering strategies, but have fallen short in simultaneously optimizing both energy efficiency and control overhead.…”

Innovative DMHS Algorithm Application in Wireless Sensor Networks for Efficient Routing in High-Risk Environments

“…The sink had an ample power supply, and each node was initialized with a constant energy value. As stated in [ 28 ], the energy consumption of nodes is dependent on the data length ( k ) and distance ( d ). …”

Performance Analysis of Multihop Full-Duplex NOMA Systems with Imperfect Interference Cancellation and Near-Field Path-Loss

“…Although both FD and NOMA greatly facilitate the SE of the wireless networks, they suffer from the low signal-to-interference-plus-noise ratio (SINR) owing to strong self-interference [ 17 , 18 ]. Hence, to truly attain benefits from both NOMA and FD, ameliorating the SINR is mandatory, one of the promising solutions is to utilize multihop communications that improve the SINR by shortening the transmission distance [ 19 , 20 ]. Particularly, if the transmission distance is compressed, the intended signals are improved while the self-interference does not remarkably change thus scaling up the SINR.…”