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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)
108 Downloads (Pure)

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.
Original languageEnglish
Title of host publication2024 European Control Conference, ECC 2024
PublisherIEEE
Number of pages7
ISBN (Electronic)978-3-9071-4410-7
DOIs
Publication statusPublished - 2024
Publication typeA4 Article in conference proceedings
EventEuropean Control Conference - Stockholm, Sweden
Duration: 25 Jun 202428 Jun 2024

Conference

ConferenceEuropean Control Conference
Country/TerritorySweden
CityStockholm
Period25/06/2428/06/24

Publication forum classification

  • Publication forum level 1

Fingerprint

Dive into the research topics of 'A Distributed Algorithm to Establish Strong Connectivity in Spatially Distributed Networks via Estimation of Strongly Connected Components'. Together they form a unique fingerprint.

Cite this