Decentralized estimation and control of algebraic connectivity of random ad-hoc networks

Author

Di Lorenzo, Paolo ; Barbarossa, S.

Author_Institution

DIET, Sapienza Univ. of Rome, Rome, Italy

fYear

2013

Firstpage

4474

Lastpage

4478

Abstract

In this paper, we propose a decentralized algorithm for the estimation and control of connectivity of random ad hoc networks. First, we introduce a novel stochastic power iteration method that allows each node to estimate and track the expected algebraic connectivity of a random graph. The proposed method is then used to adapt the power transmitted by each node in order to drive the network connectivity toward a desired value. Numerical results illustrate the main features of the algorithm and its robustness to fluctuations of the network graph due to the presence of random link failures.

Keywords

ad hoc networks; estimation theory; graph theory; iterative methods; stochastic processes; algebraic connectivity; decentralized algorithm; decentralized estimation; network connectivity; network graph; random ad-hoc networks; random graph; random link failures; stochastic power iteration method; Ad hoc networks; Convergence; Eigenvalues and eigenfunctions; Estimation; Indexes; Laplace equations; Network topology; Random graph; stochastic power iteration method; topology control;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on

Conference_Location

Vancouver, BC

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.2013.6638506

Filename

6638506