How to reach consensus on an average value in a dynamic crowd without revealing identity? In this work, we study the problem of Average Network Consensus in Anonymous Dynamic Networks (ADN). Network dynamicity is specified by the sequence of topology-graph isoperimetric numbers occurring over time, which we call the isoperimetric dynamicity of the network. The consensus variable is the average of values initially held by nodes, which is customary in the Network-consensus literature. Given that having an algorithm to compute the average one can compute the network size (i.e. the Counting problem) and viceversa, we further focus on the latter.
No takes yet. Share an insight, caveat, or question.
Kowalski et al. (2021) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: