Distributed Connected Dominating Set Based Algorithm for Mobile Ad-Hoc Networks

• Published in: International Conference on Electrical and Electronics Engineering pp. 399 - 403
• Main Authors: Yilmaz, Aziz Can, Erdas, Cagatay Berke
• Format: Conference Proceeding
• Language: English
• Published: IEEE 22.04.2024
• Subjects: Ad hoc networks; Clustering; Clustering algorithms; Connected dominating set; Costs; Distributed algorithm; Distributed algorithms; Energy consumption; Heuristic algorithms; Mobile ad-hoc networks; Peer-to-peer computing; Periodic structures; Routing; Stability criteria
• ISSN: 2694-3646
• DOI: 10.1109/ICEEE62185.2024.10779296

Ad-hoc networks are a communication protocol used in various sectors, particularly in military technologies. Unlike traditional network structures, Ad-hoc networks operate on the principle of peer-to-peer communication. Since the nodes within the network are not connected to a cellular infrastructure, distributed algorithms are required for the communication of nodes. However, it is important to carefully design these distributed algorithms based on essential criteria due to the challenges associated with ad-hoc networks. These criterias are considered to be particularly important when dealing with dynamically variable networks, such as a mobile ad-hoc networks. Mobile ad-hoc networks face significant challenges related to scaling, energy consumption, and stability. To address these challenges, various clustering algorithms employed, each with its own benefits and costs. In this study, a connected dominating set algorithm is proposed for mobile ad hoc networks, which can provide workload balance and protect the backbone structure relatively against mobility and can be an alternative solution to the congestion occurring on a single backbone by creating multiple backbone structures.