Distributed Estimation of Network Cardinalities

• Main Author: Lucchese, Riccardo
• Format: Others
• Language: English
• Published: Luleå tekniska universitet, Signaler och system 2017
• Subjects: Control Engineering; Reglerteknik
• Online Access: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-62460; http://nbn-resolving.de/urn:isbn:978-91-7583-843-4; http://nbn-resolving.de/urn:isbn:978-91-7583-844-1

In distributed applications knowing the topological properties of the underlying communication network may lead to better performing algorithms. For instance, in distributed regression frameworks, knowing the number of active sensors allows to correctly weight prior information against evidence in the data. Moreover, continuously estimating the number of active nodes or communication links corresponds to monitoring the network connectivity and thus to being able to trigger network reconfiguration strategies. It is then meaningful to seek for estimators of the properties of the communication graphs that sense these properties with the smallest possible computational/communications overheads. Here we consider the problem of distributedly counting the number of agents in a network. This is at the same time a prototypical summation problem and an essential task instrumental to evaluating more complex algebraic expressions such as products and averages which are in turn useful in many distributed control, optimization and estimation problems such as least squares, sensor calibration, vehicle coordination and Kalman filtering. Being interested in generality, we consider computations in anonymous networks, i.e., in frameworks where agents are not ensured to have unique IDs and the network lacks a centralized authority. This setting implies that the set of distributedly computable functions is limited, that there is no size estimation algorithm with uniformly bounded computational complexity that can provide correct estimates with probability one, and thus that scalable size estimators are non-deterministic functions of the true network size. Natural questions are then: which one is the scheme that leads to topology estimators that are optimal in Mean Squared Error (MSE) terms? And what are the fundamental limitations of information aggregation for topology estimation purposes, i.e., what can be estimated and what not? Our focus is then to understand how to distributedly estimate cardinalities given devices with bounded resources (e.g., battery/energy constraints, communication bandwidth, etc.) and how considering different assumptions and trade-offs leads to different optimal strategies. We specifically consider the case of peer-to-peer networks where all the participants are required to: i) share the same final result (and thus the same view of the network) and ii) keep the communication and computational complexity at each node uniformly bounded in time. To this aim, we study four different estimation strategies that consider different tradeoffs between accuracy and convergence speed and characterize their statistical performance in terms of bias and MSE.