Distributed Estimation and Control of Algebraic Connectivity over Random Graphs

Abstract

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power iteration method that allows each node to estimate and track the algebraic connectivity of the underlying expected graph. Using results from stochastic approximation theory, we prove that the proposed method converges almost surely (a.s.) to the desired value of connectivity even in the presence of imperfect communication scenarios. The estimation strategy is then used as a basic tool to adapt the power transmitted by each node of a wireless network, in order to maximize the network connectivity in the presence of realistic Medium Access Control (MAC) protocols or simply to drive the connectivity toward a desired target value. Numerical results corroborate our theoretical findings, thus illustrating the main features of the algorithm and its robustness to fluctuations of the network graph due to the presence of random link failures.

To appear in IEEE Transactions on Signal Processing

References in corpus (2)

• Sensor Networks with Random Links: Topology Design for Distributed Consensus
• Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels

Cited by in corpus (6)

• Distributed Adaptive Learning of Graph Signals
• Graph Neural Networks for Learning Robot Team Coordination
• How to Stop Consensus Algorithms, locally?
• Decentralized Connectivity-Preserving Deployment of Large-Scale Robot Swarms
• Output Impedance Diffusion into Lossy Power Lines
• Decentralized Connectivity Control in Quadcopters: a Field Study of Communication Performance