Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Invariant Properties of Linear-Iterative Distributed Averaging Algorithms and Application to Error Detection (2403.06007v1)

Published 9 Mar 2024 in cs.MA

Abstract: We consider the problem of average consensus in a distributed system comprising a set of nodes that can exchange information among themselves. We focus on a class of algorithms for solving such a problem whereby each node maintains a state and updates it iteratively as a linear combination of the states maintained by its in-neighbors, i.e., nodes from which it receives information directly. Averaging algorithms within this class can be thought of as discrete-time linear time-varying systems without external driving inputs and whose state matrix is column stochastic. As a result, the algorithms exhibit a global invariance property in that the sum of the state variables remains constant at all times. In this paper, we report on another invariance property for the aforementioned class of averaging algorithms. This property is local to each node and reflects the conservation of certain quantities capturing an aggregate of all the values received by a node from its in-neighbors and all the values sent by said node to its out-neighbors (i.e., nodes to which it sends information directly) throughout the execution of the averaging algorithm. We show how this newly-discovered invariant can be leveraged for detecting errors while executing the averaging algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)
  1. J. Tsitsiklis, “Problems in decentralized decision making and computation,” Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1984.
  2. C. N. Hadjicostis, A. D. Domínguez-García, and T. Charalambous, “Distributed averaging and balancing in network systems, with applications to coordination and control,” Foundations and Trends® in Systems and Control, vol. 5, no. 3–4, 2018.
  3. R. Olfati-Saber and R. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Trans. on Automatic Control, vol. 49, no. 9, pp. 1520–1533, September 2004.
  4. J. Cortés, “Distributed algorithms for reaching consensus on general functions,” Automatica, vol. 44, no. 3, pp. 726–737, March 2008.
  5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Randomized gossip algorithms,” IEEE Trans. on Information Theory, vol. 52, no. 6, pp. 2508–2530, June 2006.
  6. D. Kempe, A. Dobra, and J. Gehrke, “Gossip-based computation of aggregate information,” in Proc. of Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 482–491.
  7. F. Bénézit, V. Blondel, P. Thiran, J. Tsitsiklis, and M. Vetterli, “Weighted gossip: Distributed averaging using non-doubly stochastic matrices,” in Proc. of IEEE International Symposium on Information Theory (ISIT), 2010, pp. 1753–1757.
  8. A. D. Domínguez-García and C. N. Hadjicostis, “Coordination and control of distributed energy resources for provision of ancillary services,” in Proc. of IEEE International Conference on Smart Grid Communications, 2010, pp. 537–542.
  9. A. D. Domínguez-García, C. N. Hadjicostis, and N. H. Vaidya, “Resilient networked control of distributed energy resources,” IEEE Journal on Selected Areas in Communications, vol. 30, no. 6, pp. 1137–1148, July 2012.
  10. C. N. Hadjicostis, N. H. Vaidya, and A. D. Domínguez-García, “Robust distributed average consensus via exchange of running sums,” IEEE Trans. on Automatic Control, vol. 61, no. 6, pp. 1492–1507, June 2016.
  11. L. Yuan and H. Ishii, “Resilient consensus with distributed fault detection,” IFAC-PapersOnLine, vol. 52, no. 20, pp. 285–290, 2019.
  12. ——, “Resilient consensus with multi-hop communication,” in Proc. of 60th IEEE Conference on Decision and Control (CDC), 2021, pp. 2696–2701.
  13. ——, “Secure consensus with distributed detection via two-hop communication,” Automatica, vol. 131, p. 109775, 2021.
  14. A. D. Domínguez-García and C. N. Hadjicostis, “Distributed matrix scaling and application to average consensus in directed graphs,” IEEE Trans. on Automatic Control, vol. 58, no. 3, pp. 667–681, March 2013.
  15. F. Pasqualetti, A. Bicchi, and F. Bullo, “Distributed intrusion detection for secure consensus computations,” in Proc. of 46th IEEE Conference on Decision and Control (CDC), 2007, pp. 5594–5599.
  16. S. Sundaram and C. N. Hadjicostis, “Distributed function calculation via linear iterative strategies in the presence of malicious agents,” IEEE Trans. on Automatic Control, vol. 56, no. 7, pp. 1495–1508, July 2011.
  17. R. J. Patton and J. Chen, “A review of parity space approaches to fault diagnosis,” IFAC Proceedings Volumes, vol. 24, no. 6, pp. 65–81, 1991.
  18. C. N. Hadjicostis, “Nonconcurrent error detection and correction in fault-tolerant discrete-time LTI dynamic systems,” IEEE Trans. on Circuits and Systems I: Fundamental Theory and Applications, vol. 50, no. 1, pp. 45–55, January 2003.
  19. C. N. Hadjicostis and A. D. Domínguez-García, “Identification of malicious activity in distributed average consensus via non-concurrent checking,” IEEE Control Systems Letters, vol. 7, pp. 1927–1932, 2023.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now