A Low-Latency Shortest Path Routing Optimization Algorithm for Self-organizing Networks Based on Volume Kalman Filtering

DOI

10.2991/978-2-38476-507-2_21How to use a DOI?

Keywords

Kalman; Self-organizing network; Low latency; Shortest transmission path; Routing optimization algorithm

Abstract

Aiming at the core problems such as high node energy consumption, significant time cost, shortened network lifetime and high output amplitude in the process of solving the shortest path due to the failure to utilize the cubature Kalman filter to dynamically compensate for data transmission delay in traditional routing algorithms, this paper proposes a low-delay shortest path routing optimization algorithm for self-organizing networks based on cubature Kalman filtering. This algorithm first builds a self-organizing transmission channel model and achieves precise compensation for data transmission delay through cubature Kalman filtering. Based on the filtering control results, the dynamic node deployment strategy DSPR algorithm is adopted to optimize the distribution of routing nodes; finally, the Dijkstra algorithm is combined to complete the calculation of the routing path, achieving efficient acquisition of the low-delay shortest transmission path. Experimental verification shows that compared with the traditional scheme, the proposed algorithm demonstrates significant advantages in key indicators such as node energy consumption, time cost, network lifetime and output amplitude, effectively improving the transmission performance and reliability of self-organizing networks.

Copyright

© 2025 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Xiaoling Li
AU  - Jie Yang
PY  - 2025
DA  - 2025/12/15
TI  - A Low-Latency Shortest Path Routing Optimization Algorithm for Self-organizing Networks Based on Volume Kalman Filtering
BT  - Proceedings of the 2025 4th International Conference on Public Management, Digital Economy and Internet Technology (ICPDI 2025)
PB  - Atlantis Press
SP  - 238
EP  - 249
SN  - 2352-5398
UR  - https://doi.org/10.2991/978-2-38476-507-2_21
DO  - 10.2991/978-2-38476-507-2_21
ID  - Li2025
ER  -