Akademik Veri Yönetim Sistemi
12th IFIP International Conference on New Technologies, Mobility and Security, NTMS 2025, Paris, Fransa, 18 - 20 Haziran 2025, ss.259-264, (Tam Metin Bildiri)
Tactical networks are designed to support robust, high-speed data transfers with minimal latency, catering to a wide array of applications. These networks require strict Quality of Service (QoS) standards, ensuring reliable and efficient performance across diverse operational scenarios. In overloaded network scenarios with hundreds to thousands of nodes and significant hop counts, maintaining network efficiency becomes challenging. For such networks, a hierarchical design is required for scalability in order to keep the control overhead at a reasonable level. In this study, we have utilized Connected Dominating Sets (CDS) from graph theory for this purpose. Besides the clustering framework, we propose a Neighbor Discovery (ND) algorithm that focuses on improving network efficiency and robustness by selecting additional cluster heads (CHs) to reduce the hop distances between clusters. Our proposed ND algorithm enables nodes to quickly discover their single-hop neighboring clusters with the best effort. By achieving this, we are able to construct a more robust and network-efficient backbone that can withstand the fluid and ever-changing nature of tactical settings. The obtained simulation results corroborate that our proposed algorithm is able to discover more single-hop neighbours than the compared methodologies, which in turn meet the high performance requirements of military mobile ad-hoc networks better than the compared methodologies.