Fast distributed estimation of empirical mass functions over anonymous networks
2013 (English)In: 2013 IEEE 52nd Annual Conference on Decision and Control (CDC), IEEE conference proceedings, 2013, 6771-6777 p.Conference paper (Refereed)
The aggregation and estimation of values over networks is fundamental for distributed applications, such as wireless sensor networks. Estimating the average, minimal and maximal values has already been extensively studied in the literature. In this paper, we focus on estimating empirical distributions of values in a network with anonymous agents. In particular, we compare two different estimation strategies in terms of their convergence speed, accuracy and communication costs. The first strategy is deterministic and based on the average consensus protocol, while the second strategy is probabilistic and based on the max consensus protocol.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 6771-6777 p.
, IEEE Conference on Decision and Control. Proceedings, ISSN 0191-2216
distributed computation, consensus, data aggregation, order statistics
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-127463DOI: 10.1109/CDC.2013.6760962ISI: 000352223507099ScopusID: 2-s2.0-84902324955ISBN: 978-146735717-3OAI: oai:DiVA.org:kth-127463DiVA: diva2:644405
52nd IEEE Conference on Decision and Control, CDC 2013; Florence; Italy; 10 December 2013 through 13 December 2013
FunderEU, FP7, Seventh Framework Programme, 257462Swedish Research CouncilKnut and Alice Wallenberg Foundation
QC 201409172013-08-302013-08-302016-10-26Bibliographically approved