An Adaptive-Intelligent Distance-Aware Approach for Dynamic Network Connectivity
DOI:
https://doi.org/10.24237/djes.2026.19110Keywords:
MST, Adaptive Connectivity, RNCA, Distance-Constrained Networks, Dynamic Network TopologiesAbstract
Optimizing network connectivity characterizes a major challenge in different applications, e.g. IoT, where the efficiency of connectivity under constraints like distance and adaptability is essential. The key objective of the Minimum Spanning Tree (MST) methods is to construct a subset of a graph in which every vertex is connected with the least amount of edge weight and without any cycles. As a robust framework for constructing distance-constrained network connectivity, this research proposes a novel algorithm named Recursive Node Connectivity Algorithm (RNCA). RNCA forms a tree-like networking structure motivated by minimum spanning tree (MST) principles, while explicitly considering distance constraints to ensure feasible communications. The RNCA utilizes repeated pruning and reweighting procedures to create cost-effective and distance-compliant network structures that can ensure flexible and scalable connectivity in dynamic contexts. The performance of RNCA is evaluated through conducting simulations with different network scales. The results show that RNCA achieves high adaptability, scalability, and reduced redundancy. RNCA outperforms Kruskal’s and Prim’s MST algorithms by reducing recomputed links during node updates by up to 80%. It also ensures minimum change in network connections when nodes are added or removed from the original network topology. Therefore, it can be considered as a transformative solution for many modern network applications, such as transportation systems, WSNs, and IoT.
Downloads
References
[1] Nešetřil, J., Milková, E., & Nešetřilová, H. (2001). Otakar Borůvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history. Discrete Mathematics, 233(1–3), 3–36. https://doi.org/10.1016/S0012-365X(00)00224-7.
[2] Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48–50. https://doi.org/10.1090/S0002-9939-1956-0078686-7.
[3] Prim, R. C. (1957). Shortest connection networks and some generalizations. The Bell System Technical Journal, 36(6), 1389–1401. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x.
[4] Dadalto, A. P., Usberti, F. L., & Felice, M. C. S. (2023). Exact approaches for the Minimum Subgraph Diameter Problem. Computers & Operations Research, 150, Article 106050. https://doi.org/10.1016/j.cor.2022.106050.
[5] Gouveia, L., Leitner, M., & Ljubić, I. (2020). A polyhedral study of the diameter constrained minimum spanning tree problem. Discrete Applied Mathematics, 285, 364–379. https://doi.org/10.1016/j.dam.2020.05.020.
[6] Vuppuluri, P. P., & Chellapilla, P. (2021). Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem. Expert Systems, 38, Article e12610. https://doi.org/10.1111/exsy.12610.
[7] Jasim, A. M., & Al-Raweshidy, H. (2024). An adaptive SDN-based load balancing method for edge/fog-based real-time healthcare systems. IEEE Systems Journal, 18(2), 1139–1150. https://doi.org/10.1109/JSYST.2024.3402156.
[8] Jasim, A. M., & Al-Raweshidy, H. (2024). Optimal intelligent edge-servers placement in the healthcare field. IET Networks, 13(1), 13–27. https://doi.org/10.1049/ntw2.12097.
[9] Al-Anbagi, H. N., & Vertat, I. (2023). Embracing small satellites into future 6G inclusive IoT coverage: A deployment of diversity-based theoretical framework. IEEE Access, 11, 114602–114612. https://doi.org/10.1109/ACCESS.2023.3324890.
[10] J. S. Abdullah, M. I. Aal-Nouman, and B. Al-Fuhaidi, “Efficient coverage of sensors in a WSN using a modified hybrid PSO and ALO algorithms,” Iraqi Journal of Information and Communication Technology, vol. 8, no. 2, pp. 29–41, 2025, doi: 10.31987/ijict.8.2.309.
[11] Mahdi, S. B., Al-Bayati, H. H. J., & Al-Mahdawi, J. A. (2022). Minimum spanning tree application in COVID-19 network structure analysis in the countries of the Middle East. Journal of Discrete Mathematical Sciences and Cryptography, 25(8), 2723–2728. https://doi.org/10.1080/09720529.2022.2060923.
[12] Gao, Q., Gao, Q. Q., Xiong, Z. Y., Zhang, Y. F., & Zhang, M. (2022). A novel minimum spanning tree clustering algorithm based on density core. Computational Intelligence and Neuroscience, 2022, Article 8496265. https://doi.org/10.1155/2022/8496265.
[13] Kataoka, S., & Yamada, T. (2016). Algorithms for the minimum spanning tree problem with resource allocation. Operations Research Perspectives, 3, 5–13. https://doi.org/10.1016/j.orp.2015.12.001.
[14] Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Raible, D., & Rossmanith, P. (2011). An exact algorithm for the maximum leaf spanning tree problem. Theoretical Computer Science, 412(45), 6290–6302. https://doi.org/10.1016/j.tcs.2011.07.011.
[15] Haouari, M., Chaouachi, J., & Dror, M. (2005). Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. Journal of the Operational Research Society, 56(4), 382–389. https://doi.org/10.1057/palgrave.jors.2601821.
[16] Ekanayake, U., Daundasekara, W., & Perera, P. (2020). An approach for solving minimum spanning tree problem and transportation problem using modified ant colony algorithm. North American Academic Research, 3(9), 28–45. https://doi.org/10.5281/zenodo.4072472.
[17] Pop, C. P., Matei, O., Sabo, C., & Petrovan, A. (2018). A two-level solution approach for solving the generalized minimum spanning tree problem. European Journal of Operational Research, 265(2), 478–487. https://doi.org/10.1016/j.ejor.2017.08.015.
[18] Belaid, E., Limbourg, S., Mostert, M., Rigo, P., & Cools, M. (2016). Bi-objective road and pipe network design for crude oil transport in the Sfax region in Tunisia. Procedia Engineering, 142, 108–115. https://doi.org/10.1016/j.proeng.2016.02.020.
[19] Hassan, R. M. (2012). An efficient method to solve least-cost minimum spanning tree (LC-MST) problem. Journal of King Saud University – Computer and Information Sciences, 24, 101–105. https://doi.org/10.1016/j.jksuci.2011.12.001.
[20] Lichen, J., Cai, L., Li, J., Liu, S., Pan, P., & Wang, W. (2023). Delay-constrained minimum shortest path trees and related problems. Theoretical Computer Science, 941, 191–201. https://doi.org/10.1016/j.tcs.2022.11.014.
[21] Dhouib, S. (2024). Innovative method to solve the minimum spanning tree problem: The Dhouib-Matrix-MSTP (DM-MSTP). Results in Control and Optimization, 14, Article 100359. https://doi.org/10.1016/j.rico.2023.100359.
[22] Zhang, X., Wang, D., Fu, Z., Liu, S., Mao, W., Liu, G., Jiang, Y., & Li, S. (2020). Novel biogeography-based optimization algorithm with hybrid migration and global-best Gaussian mutation. Applied Mathematical Modelling, 86, 74–91. https://doi.org/10.1016/j.apm.2020.05.016.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Ahmed M. Jasim, Haidar N. Al-Anbagi, Saad Al-Azawi, Hamed Al-Raweshidy
This work is licensed under a Creative Commons Attribution 4.0 International License.
