A4 Refereed article in a conference publication

A Distributed Algorithm to Establish Strong Connectivity in Spatially Distributed Networks via Estimation of Strongly Connected Components




AuthorsAtman, Made Widhi Surya; Gusrialdi, Azwirman

PublisherIEEE

Publication year2024

Book title 2024 European Control Conference, ECC 2024

First page 2493

Last page2499

ISBN978-3-9071-4410-7

DOIhttps://doi.org/10.23919/ECC64448.2024.10590986

Web address https://researchportal.tuni.fi/en/publications/512753cf-04cc-4e3f-b130-573db13e513d


Abstract
This paper presents a distributed algorithm for ensuring the strong connectivity of spatially distributed networks where the communication network topology depends on both the position and communication range of the nodes. This is achieved by adding new links via adjusting the communication range and/or controlling the position of the nodes. The distributed algorithms rely on the estimation of strongly connected components of a dynamic network topology, accomplished through the utilization of the maximum consensus algorithm. The proposed strategies are scalable and converge in a finite number of steps without requiring information on the overall network topology. Finally, the proposed distributed algorithm is demonstrated through two case studies of ensuring strong connectivity in wireless networks with static and mobile nodes.



Last updated on 2025-22-08 at 09:48