research-article

Public Access

Supervised Average Consensus in Anonymous Dynamic Networks

Authors:

Dariusz R. Kowalski,

Miguel A. MosteiroAuthors Info & Claims

SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures

Pages 307 - 317

https://doi.org/10.1145/3409964.3461811

Published: 06 July 2021 Publication History

Abstract

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.

We propose a deterministic distributed Average Network Consensus algorithm for ADNs that we call isoperimetric Scalable Coordinated Anonymous Local Aggregation (iSCALA), and we analyze its performance for different scenarios, including worst-case (adversarial) and stochastic dynamic topologies. Our solution utilizes supervisor nodes, which have been shown to be necessary for computations in ADNs. The algorithm uses the isoperimetric dynamicity of the network as an input, meaning that only the isoperimetric number parameters (or their lower bound) must be given, but topologies may occur arbitrarily or stochastically as long as they comply with those parameters.

Previous work for adversarial ADNs overestimates the running time to deal with worst-case scenarios. For ADNs with given isoperimetric dynamicity, our analysis shows improved performance for some practical dynamic topologies, with cubic time or better for stochastic ADNs, and our experimental evaluation confirms that such performance is close to what could be achieved if the algorithm had centralized control on stopping conditions; thus, there is no substantial benefit of having centralized stopping control in the ADN system.

References

[1]

Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons.

[2]

Chen Avin. 2006. Random Geometric Graphs: An Algorithmic Perspective . Ph.D. Dissertation. University of California, Los Angeles, Los Angeles, CA. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.456.4720&rep=rep1&type=pdf.

[3]

Chen Avin, Michal Kouckỳ, and Zvi Lotker. 2008. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Automata, languages and programming . Springer, 121--132.

[4]

Roberto Baldoni and Giuseppe A Di Luna. 2016. Counting on Anonymous Dynamic Networks: Bounds and Algorithms. (2016). manuscript.

[5]

Siddhartha Banerjee, Aditya Gopalan, Abhik Kumar Das, and Sanjay Shakkottai. 2014. Epidemic spreading with external agents. IEEE Transactions on Information Theory, Vol. 60, 7 (2014), 4125--4138.

[6]

Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512.

[7]

Itai Benjamini, Simi Haber, Michael Krivelevich, and Eyal Lubetzky. 2008. The isoperimetric constant of the random graph process. Random Structures & Algorithms, Vol. 32, 1 (2008), 101--114.

Digital Library

[8]

Vivek Borkar and Pravin Varaiya. 1982. Asymptotic agreement in distributed estimation. IEEE Trans. Automat. Control, Vol. 27, 3 (1982), 650--655.

[9]

Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah. 2006 a. Randomized gossip algorithms. IEEE Transactions on Information Theory, Vol. 52, 6 (2006), 2508--2530.

Digital Library

[10]

Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah. 2006 b. Randomized gossip algorithms. IEEE/ACM Transactions on Networking, Vol. 14, SI (2006), 2508--2530.

Digital Library

[11]

Peter Buser. 1984. On the bipartition of graphs. Discrete applied mathematics, Vol. 9, 1 (1984), 105--109.

[12]

Ming Cao, Daniel A Spielman, and A Stephen Morse. 2005. A lower bound on convergence of a distributed network consensus algorithm. In Proceedings of the 44th IEEE Conference on Decision and Control. IEEE, 2356--2361.

[13]

Maitri Chakraborty, Alessia Milani, and Miguel A. Mosteiro. 2016. Counting in Practical Anonymous Dynamic Networks is Polynomial. In Proceedings of the 4th International Conference on Networked Systems (Lecture Notes in Computer Science, Vol. 9944). 131--136.

[14]

Maitri Chakraborty, Alessia Milani, and Miguel A. Mosteiro. 2018. A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica, Vol. 80, 11 (2018), 3023--3049.

Digital Library

[15]

Yuxin Chen, Sanjay Shakkottai, and Jeffrey G Andrews. 2013. On the role of mobility for multimessage gossip. IEEE Transactions on Information Theory, Vol. 59, 6 (2013), 3953--3970.

Digital Library

[16]

Bogdan S. Chlebus, Dariusz R. Kowalski, and Jan Olkowski. 2020. Fast Agreement in Networks with Byzantine Nodes. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference (LIPIcs, Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum fü r Informatik, 30:1--30:18.

[17]

Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, and Jedrzej Olkowski. 2021. Consensus in Networks Prone to Link Failures. CoRR, Vol. abs/2102.01251 (2021). arxiv: 2102.01251 https://arxiv.org/abs/2102.01251

[18]

Giuseppe Antonio Di Luna and Roberto Baldoni. 2015. Non Trivial Computations in Anonymous Dynamic Networks. In Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum fü r Informatik).

[19]

Giuseppe Antonio Di Luna, Roberto Baldoni, Silvia Bonomi, and Ioannis Chatzigiannakis. 2014a. Conscious and Unconscious Counting on Anonymous Dynamic Networks. In Proc. of the 15th Intl. Conf. on Distributed Computing and Networking (LNCS, Vol. 8314). Springer, 257--271.

Digital Library

[20]

Giuseppe Antonio Di Luna, Roberto Baldoni, Silvia Bonomi, and Ioannis Chatzigiannakis. 2014b. Counting in Anonymous Dynamic Networks under Worst-Case Adversary. In Proc. of the 34th Intl. Conf. on Distributed Computing Systems. IEEE, 338--347.

[21]

Giuseppe Antonio Di Luna, Silvia Bonomi, Ioannis Chatzigiannakis, and Roberto Baldoni. 2014c. Counting in Anonymous Dynamic Networks: An Experimental Perspective. In Proc. of the 9th Algosensors (LNCS, Vol. 8243). Springer, 139--154.

[22]

Jozef Dodziuk. 1984. Difference equations, isoperimetric inequality and transience of certain random walks. Trans. Amer. Math. Soc., Vol. 284, 2 (1984), 787--794. https://doi.org/10.2307/1999107

[23]

Richard Durrett. 2007. Random graph dynamics . Vol. 200. Citeseer.

[24]

P. ErdHos and A. Rényi. 1959. On Random graphs. I. Publicationes Matematicae, Vol. 6 (1959), 290--297.

[25]

M. Farach-Colton, A. Fernández Anta, A. Milani, M. A. Mosteiro, and S. Zaks. 2012. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. In Proc. of the 10th LATIN (Lecture Notes in Computer Science, Vol. 7256). Springer-Verlag, Berlin, 303--314.

[26]

Illés J Farkas, Imre Derényi, Albert-László Barabási, and Tamas Vicsek. 2001. Spectra of “real-world” graphs: Beyond the semicircle law. Physical Review E, Vol. 64, 2 (2001), 026704.

[27]

Antonio Ferná ndez Anta, Alessia Milani, Miguel A. Mosteiro, and Shmuel Zaks. 2012. Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Computing, Vol. 25, 4 (2012), 279--296.

[28]

A. Fernández Anta and M. A. Mosteiro. 2010. Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. Discrete Mathematics, Algorithms and Applications, Vol. 02, 04 (2010), 445--456.

[29]

Antonio Ferná ndez Anta, Miguel A. Mosteiro, and Christopher Thraves. 2013. An early-stopping protocol for computing aggregate functions in Sensor Networks. J. Parallel Distrib. Comput., Vol. 73, 2 (2013), 111--121.

Digital Library

[30]

B. Ghosh and S. Muthukrishnan. 1996. Dynamic Load Balancing by Random Matchings. J. Comput. System Sci., Vol. 53, 3 (1996), 357--370.

Digital Library

[31]

Edgar N Gilbert. 1959. Random graphs. The Annals of Mathematical Statistics, Vol. 30, 4 (1959), 1141--1144.

[32]

Lei Gu, Xiao-Dong Zhang, and Qing Zhou. 2010. Consensus and synchronization problems on small-world networks. J. Math. Phys., Vol. 51, 8 (2010), 082701.

[33]

Shlomo Hoory, Nathan Linial, and Avi Wigderson. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc., Vol. 43, 4 (2006), 439--561. https://doi.org/10.1090/S0273-0979-06-01126--8

[34]

Ali Jadbabaie, Jie Lin, and A Stephen Morse. 2003. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on automatic control, Vol. 48, 6 (2003), 988--1001.

[35]

D. Kempe, A. Dobra, and J. Gehrke. 2003. Gossip-based computation of aggregate information. In Proc. of the 44th IEEE Ann. Symp. on Foundations of Computer Science. 482--491.

[36]

Dariusz R. Kowalski and Miguel A. Mosteiro. 2019. Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader. In Proc. of the 46th International Colloquium on Automata, Languages, and Programming (LIPIcs, Vol. 132). Leibniz-Zentrum fü r Informatik, 147:1--147:15.

[37]

Dariusz R. Kowalski and Miguel A. Mosteiro. 2020. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. J. ACM, Vol. 67, 2, Article 11 (2020), bibinfonumpages17 pages.

[38]

Dariusz R. Kowalski and Miguel A. Mosteiro. 2021. Time and Communication Complexity of Leader Election in Anonymous Networks. In 41st IEEE International Conference on Distributed Computing Systems (ICDCS 2021), accepted for publication .

[39]

Jie Lin, A Stephen Morse, and Brian DO Anderson. 2003. The multi-agent rendezvous problem. In Proc. of the 42nd IEEE Intl. Conf. on Decision and Control, Vol. 2. IEEE, 1508--1513.

[40]

Nancy A Lynch. 1996. Distributed algorithms .Morgan Kauffman.

[41]

Othon Michail, Ioannis Chatzigiannakis, and Paul G Spirakis. 2013. Naming and counting in anonymous unknown dynamic networks. In Stabilization, Safety, and Security of Distributed Systems. Springer, 281--295.

[42]

Alessia Milani and Miguel A. Mosteiro. 2015. A Faster Counting Protocol for Anonymous Dynamic Networks. In Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum fü r Informatik, Vol. 46). 1--13.

[43]

Bojan Mohar. 1989. Isoperimetric numbers of graphs. Journal of combinatorial theory, Series B, Vol. 47, 3 (1989), 274--291.

Digital Library

[44]

Luc Moreau. 2003. Leaderless coordination via bidirectional and unidirectional time-dependent communication. In Proc. of the 42nd IEEE Intl. Conf. on Decision and Control, Vol. 3. IEEE, 3070--3075.

[45]

Damon Mosk-Aoyama and Devavrat Shah. 2008. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory, Vol. 54, 7 (2008), 2997--3007.

Digital Library

[46]

Albert Nijenhuis and Herbert S Wilf. 1978. Combinatorial Algorithms for Computers and Calculators: 2d Ed .Academic Press.

[47]

Reza Olfati-Saber and Richard M Murray. 2004. Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on automatic control, Vol. 49, 9 (2004), 1520--1533.

[48]

M. Penrose. 2003. Random Geometric Graphs .Oxford University Press.

[49]

Y. Rabani, A. Sinclair, and R. Wanka. 1998. Local Divergence of Markov Chains and the Analysis of Iterative Load-balancing Schemes. In Proc. of the 39th IEEE Ann. Symp. on Foundations of Computer Science . 694--703.

[50]

Sujay Sanghavi, Bruce Hajek, and Laurent Massoulié. 2007. Gossiping with multiple messages. IEEE Transactions on Information Theory, Vol. 53, 12 (2007), 4640--4654.

Digital Library

[51]

Atish Das Sarma, Anisur Rahaman Molla, and Gopal Pandurangan. 2015. Distributed computation in dynamic networks via random walks. Theoretical Computer Science, Vol. 581 (2015), 45--66.

Digital Library

[52]

John Tsitsiklis, Dimitri Bertsekas, and Michael Athans. 1986. Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE transactions on automatic control, Vol. 31, 9 (1986), 803--812.

[53]

John Nikolas Tsitsiklis. 1984. Problems in decentralized decision making and computation. Technical Report. Massachusetts Inst of Tech Cambridge Lab for Information and Decision Systems.

[54]

Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of “small-world” networks. nature, Vol. 393, 6684 (1998), 440--442.

Cited By

Parlangeli G(2024)Prescribed-Time Average Consensus Through Data-Driven Leader MotionIEEE Access10.1109/ACCESS.2024.340376012(71970-71981)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3403760
Kamenev AKowalski DMosteiro M(2023)Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic NetworksACM Transactions on Parallel Computing10.1145/359342610:2(1-35)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3593426

Index Terms

Supervised Average Consensus in Anonymous Dynamic Networks
1. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks
How do we 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-...
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks

We study the problem of Counting the number of nodes in Anonymous Dynamic Network: nodes do not have identifiers and the network topology changes frequently. Counting is a fundamental task in distributed computing, for instance, to decide termination. ...
Algebraic Computations in Anonymous VANET
Networked Systems
Abstract
In the area of development of AI/ML applications in Vehicular Adhoc Networks (VANET), a highly dynamic environment, efficient algebraic distributed computations are of utmost importance. On the other hand, there is a growing concern about privacy ...
$^{}$

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures

July 2021

463 pages

ISBN:9781450380706

DOI:10.1145/3409964

General Chair:
Kunal Agrawal
Washington University in St. Louis, USA
,
Program Chair:
Yossi Azar
Tel Aviv University, Israel

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 July 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Polish National Science Center NCN
Pace University
NSF

Conference

SPAA '21

Sponsor:

SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures

July 6 - 8, 2021

Virtual Event, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
197
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)21

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Parlangeli G(2024)Prescribed-Time Average Consensus Through Data-Driven Leader MotionIEEE Access10.1109/ACCESS.2024.340376012(71970-71981)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3403760
Kamenev AKowalski DMosteiro M(2023)Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic NetworksACM Transactions on Parallel Computing10.1145/359342610:2(1-35)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3593426

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten