A Distributed Algorithm to Establish Strong Connectivity in Spatially Distributed Networks via Estimation of Strongly Connected Components
Atman, Widhi; Gusrialdi, Azwirman (2024)
Atman, Widhi
Gusrialdi, Azwirman
2024
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202407037496
https://urn.fi/URN:NBN:fi:tuni-202407037496
Kuvaus
Peer reviewed
Tiivistelmä
This paper presents a distributed algorithm forensuring the strong connectivity of spatially distributed networkswhere the communication network topology depends onboth the position and communication range of the nodes. This isachieved by adding new links via adjusting the communicationrange and/or controlling the position of the nodes. The distributedalgorithms rely on the estimation of strongly connectedcomponents of a dynamic network topology, accomplishedthrough the utilization of the maximum consensus algorithm.The proposed strategies are scalable and converge in a finitenumber of steps without requiring information on the overallnetwork topology. Finally, the proposed distributed algorithmis demonstrated through two case studies of ensuring strongconnectivity in wireless networks with static and mobile nodes.
Kokoelmat
- TUNICRIS-julkaisut [25008]