An enhanced self-assembling network routing algorithm is proposed for the problem of weak connectivity of communication networks caused by factors such as movement or environmental interference in the construction and operation, and the maintenance of construction robot clusters. Firstly, the dynamic forwarding probability is calculated based on the contribution of nodes joining routing paths to network connectivity, and the robust connectivity of the network is achieved by introducing the connectivity feedback mechanism; secondly, the influence of link quality evaluation index Q balanced hop count, residual energy, and load on link stability is used to select appropriate neighbors for nodes as the subsequent hop nodes; finally, the dynamic characteristics of nodes are combined with the topology control technology to eliminate low-quality links and optimize the topology by link maintenance time prediction and to set robot node priority. The simulation results show that the proposed algorithm can guarantee a network connectivity rate above 97% under heavy load, reduce the end-to-end delay, and improve the network survival time, providing a theoretical basis for achieving stable and reliable interconnection between building robot nodes.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10221509 | PMC |
http://dx.doi.org/10.3390/s23104754 | DOI Listing |
Sensors (Basel)
December 2024
School of Cyber Science and Engineering, Liaoning University, Shenyang 110036, China.
Electric vehicles (EVs) are gaining significant attention as an environmentally friendly transportation solution. However, limitations in battery technology continue to restrict EV range and charging speed, resulting in range anxiety, which hampers widespread adoption. While there has been increasing research on EV route optimization, personalized path planning that caters to individual user needs remains underexplored.
View Article and Find Full Text PDFSensors (Basel)
December 2024
Department of Electrical Engineering & Computer Science, Daegu Gyeongbuk Institute of Science and Technology (DGIST), Daegu 42988, Republic of Korea.
In mission-critical environments such as industrial and military settings, the use of unmanned vehicles is on the rise. These scenarios typically involve a ground control system (GCS) and nodes such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs). The GCS and nodes exchange different types of information, including control data that direct unmanned vehicle movements and sensor data that capture real-world environmental conditions.
View Article and Find Full Text PDFSensors (Basel)
December 2024
IT Research Institute, Chosun University, Gwangju 61452, Republic of Korea.
The high mobility and dynamic nature of unmanned aerial vehicles (UAVs) pose significant challenges to clustering and routing in flying ad hoc networks (FANETs). Traditional methods often fail to achieve stable networks with efficient resource utilization and low latency. To address these issues, we propose a hybrid bio-inspired algorithm, HMAO, combining the mountain gazelle optimizer (MGO) and the aquila optimizer (AO).
View Article and Find Full Text PDFSci Rep
January 2025
Department of Economics, Kardan University, Kabul, Afghanistan.
The Internet of Things (IoT) has recently attracted substantial interest because of its diverse applications. In the agriculture sector, automated methods for detecting plant diseases offer numerous advantages over traditional methods. In the current study, a new model is developed to categorize plant diseases within an IoT network.
View Article and Find Full Text PDFEntropy (Basel)
December 2024
Laboratory of Quantum Information Technologies, National University of Science and Technology "MISIS", Moscow 119049, Russia.
We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote nodes, i.e., not directly connected by a QKD link, through multiple non-overlapping paths.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!