Distributed estimation of diameter, radius and eccentricities in anonymous networks
2012 (English)In: Estimation and Control of Networked Systems, Vol 3. Part 1, IFAC , 2012, 13-18 p.Conference paper (Refereed)
We consider how a set of collaborating agents can distributedly infer some of the properties of the communication network that they form. We specifically focus on estimating quantities that can characterize the performance of other distributed algorithms, namely the eccentricities of the nodes, and the radius and diameter of the network. We propose a strategy that can be implemented in any network, even under anonymity constraints, and has the desirable properties of being fully distributed, parallel and scalable. We analytically characterize the statistics of the estimation error, and highlight how the performance of the algorithm depends on a parameter tuning the communication complexity.
Place, publisher, year, edition, pages
IFAC , 2012. 13-18 p.
Decentralized algorithms for computation over sensor networks; Randomized, gossip, and message passing algorithms. Belief propagation; Coordinated control and estimation over networks
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-111464DOI: 10.3182/20120914-2-US-4030.00040ScopusID: 2-s2.0-84880998312OAI: oai:DiVA.org:kth-111464DiVA: diva2:586465
IFAC Workshop on Estimation and Control of Networked Systems (NECSYS), Santa Barbara, CA, USA
QC 201302122013-02-122013-01-112013-02-12Bibliographically approved