An Assessment of Vertex Cover Based Link Monitoring Algorithms in IoT Networks
Bildiriler > Tam Metin Bildiri
Yazarlar: Miray Kol, Züleyha AKUSTA DAĞDEVİREN
2025 9th International Artificial Intelligence and Data Processing Symposium (IDAP), , , Uluslararası, Tam Metin Bildiri, ss 1-8
DOI: 10.1109/idap68205.2025.11222235
Özet
Link monitoring is a fundamental component of ensuring reliability and robustness in Internet of Things (IoT) networks, particularly in dynamic and resource-constrained environments. Graph-theoretic approaches, especially those based on the vertex cover (VC) problem, have shown promise for efficiently selecting monitoring nodes while minimizing resource consumption. In this study, we provide a comprehensive assessment of VC-based algorithms applied to link monitoring in IoT networks. We survey classical and approximation-based VC algorithms and evaluate their performance with respect to key IoT-specific metrics such as energy efficiency, computational cost, scalability, and network coverage. Our analysis includes both theoretical insights and simulation-based comparisons across a variety of IoT network topologies. We discuss that future research should focus on developing highly scalable, next-generation coverage strategies that can quickly adapt not only to existing network structures but also to changing environmental conditions and dynamic application scenarios. These strategies will play a critical role in maintaining system performance in the face of increasing node density, heterogeneous network topologies, and real-time service requirements.