Comparative Evaluation of Alternative Path Reliability Under Node Failures in Wireless Multi-Hop Networks
Bildiriler > Tam Metin Bildiri
Yazarlar: Onur Ugurlu, Yeșim Aygül, Vahıd AKRAM, Urfat NURİYEV
2025 6th International Conference on Problems of Cybernetics and Informatics (PCI), , , Uluslararası, Tam Metin Bildiri, ss 1-5
DOI: 10.1109/pci66488.2025.11219847
Özet
Ensuring reliable communication in Wireless Multi-hop Networks is challenging due to their dynamic and decentralized nature. Even a single node failure can disrupt active routes and degrade network performance. One common approach to mitigate this risk is to precompute alternative paths that can be activated upon failure of a primary route. In this paper, we evaluate and compare three practical alternative path selection algorithms -Modified Dijkstra with Penalty, Prioritybased Depth-First Search, and Breadth-First Search-based Exchange Strategy -under node failure scenarios. The performance of the algorithms is evaluated through simulationbased analysis across synthetic topologies generated as geometric random graphs with degree constraints on a Euclidean plane. The results demonstrate that the Modified Dijkstra with Penalty algorithm achieves the highest success rates in maintaining connectivity.