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

Abstract

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