Article

Distributed consensus and linear functional calculation in networks: an observability perspective

Authors:

Shreyas Sundaram,

Christoforos N. HadjicostisAuthors Info & Claims

IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks

Pages 99 - 108

https://doi.org/10.1145/1236360.1236374

Published: 25 April 2007 Publication History

Abstract

We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial sensor values at some or all of the sensors. We utilize a linear iteration where, at each time-step, each sensor updates its value to be a weighted average of its own previous value and those of its neighbors. We show that this approach can be viewed as a linear dynamical system, with dynamics that are given by the weight matrix for the linear iteration, and with outputs for each sensor that are captured by the subset of the state vector that is measurable by that sensor. We then cast the fusion and consensus problems as that of observing a linear functional of the initial state vector using only local measurements (that are available at each sensor). When the topology of the network is time-invariant, we show that the weight matrix can be chosen so that each sensor can calculate the desired function as a linear combination of its measurements over a finite number of time-steps.

References

[1]

D. S. Bernstein. Matrix Mathematics. Princeton University Press, 2005.

[2]

V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis. Convergence in multiagent coordination, consensus, and ocking. In Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005, pages 2996--3000, 2005.

[3]

C.-T. Chen. Linear System Theory and Design. Holt, Rinehart and Winston, 1984.

Digital Library

[4]

J. Cortés. Finite-time convergent gradient flows with applications to network consensus. Automatica, 42(11):1993--2000, Nov. 2006.

Digital Library

[5]

A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright. Geographic gossip: Efficient aggregation for sensor networks. In Proceedings of the 5th International Symposium on Information Processing in Sensor Networks (IPSN), pages 69--76, 2006.

Digital Library

[6]

A. Giridhar and P. R. Kumar. Computing and communicating functions over sensor networks. IEEE Journal on Selected Areas in Communications, 23(4):755--764, Apr. 2005.

Digital Library

[7]

R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.

Digital Library

[8]

A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6):988--1001, June 2003.

[9]

D. B. Kingston and R. W. Beard. Discrete-time average-consensus under switching network topologies. In Proceedings of the American Control Conference, pages 3551--3556, 2006.

[10]

N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996.

Digital Library

[11]

R. Olfati-Saber and R. M. Murray. Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 49(9):1520--1533, Sep. 2004.

[12]

R. Olfati-Saber and J. S. Shamma. Consensus filters for sensor networks and distributed sensor fusion. In Proceedings of the 44th IEEE Conference on Decision and Control, pages 6698--6703, 2005.

[13]

W. Ren and R. W. Beard. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control, 50(5):655--661, May 2005.

[14]

W. Ren, R. W. Beard, and E. M. Atkins. A survey of consensus problems in multi-agent coordination. In Proceedings of the American Control Conference, pages 1859--1864, 2005.

[15]

M. Rudelson. Norm of the inverse of a random matrix. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), pages 487--496, 2006.

Digital Library

[16]

J. N. Tsitsiklis. Problems in Decentralized Decision Making and Computation. PhD thesis, Massachusetts Institute of Technology, 1984.

[17]

L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. Systems and Control Letters, 53(1):65--78, Sep. 2004.

[18]

L. Xiao, S. Boyd, and S. Lall. A scheme for robust distributed sensor fusion based on average consensus. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), pages 63--70, 2005.

Digital Library

Cited By

Toulouse MMinh BMinh Q(2019)Invariant Properties and Bounds on a Finite Time Consensus AlgorithmTransactions on Large-Scale Data- and Knowledge-Centered Systems XLI10.1007/978-3-662-58808-6_2(32-58)Online publication date: 7-Feb-2019
https://doi.org/10.1007/978-3-662-58808-6_2
Mustafa AUl Islam MAhmed STufail M(2018)A Novel Approach for Fast Average Consensus Under Unreliable Communication in Distributed Multi Agent NetworksWireless Personal Communications: An International Journal10.1007/s11277-018-5282-899:4(1423-1441)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s11277-018-5282-8
Toulouse MMinh QNguyen T(2017)An Exact Consensus-Based Network Intrusion Detection SystemFuture Data and Security Engineering10.1007/978-3-319-70004-5_25(351-367)Online publication date: 1-Nov-2017
https://doi.org/10.1007/978-3-319-70004-5_25
Show More Cited By

Index Terms

Distributed consensus and linear functional calculation in networks: an observability perspective

Recommendations

Adaptive correctness monitoring for wireless sensor networks using hierarchical distributed run-time invariant checking

This article presents a hierarchical approach for detecting faults in wireless sensor networks (WSNs) after they have been deployed. The developers of WSNs can specify “invariants” that must be satisfied by the WSNs. We present a framework, Hierarchical ...
State estimation and data fusion for multirate sensor networks

This article is concerned with state estimation and data fusion of a linear dynamic system observed by multirate sensors in the environment of wireless sensor networks. The sampling, estimation, and transmission rates in the wireless sensor networks are ...
DICE: Monitoring Global Invariants with Wireless Sensor Networks

Wireless sensor networks (WSNs) enable decentralized architectures to monitor the behavior of physical processes and to detect deviations from a specified “safe” behavior, for example, to check the operation of control loops. Such correct behavior is ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks

April 2007

592 pages

ISBN:9781595936387

DOI:10.1145/1236360

General Chair:
Tarek Abdelzaher
University of Illinois at Urbana-Champaign
,
Program Chairs:
Leo Guibas
Stanford University
,
Matt Welsh
Harvard University

Copyright © 2007 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 April 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

IPSN07

Sponsor:

IPSN07: The 6th International Conference on Information Processing in Sensor Networks

April 25 - 27, 2007

Massachusetts, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 143 of 593 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
476
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Toulouse MMinh BMinh Q(2019)Invariant Properties and Bounds on a Finite Time Consensus AlgorithmTransactions on Large-Scale Data- and Knowledge-Centered Systems XLI10.1007/978-3-662-58808-6_2(32-58)Online publication date: 7-Feb-2019
https://doi.org/10.1007/978-3-662-58808-6_2
Mustafa AUl Islam MAhmed STufail M(2018)A Novel Approach for Fast Average Consensus Under Unreliable Communication in Distributed Multi Agent NetworksWireless Personal Communications: An International Journal10.1007/s11277-018-5282-899:4(1423-1441)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s11277-018-5282-8
Toulouse MMinh QNguyen T(2017)An Exact Consensus-Based Network Intrusion Detection SystemFuture Data and Security Engineering10.1007/978-3-319-70004-5_25(351-367)Online publication date: 1-Nov-2017
https://doi.org/10.1007/978-3-319-70004-5_25
Wan JLiu L(2014)Distributed data association in smart camera networks using belief propagationACM Transactions on Sensor Networks10.1145/253000010:2(1-24)Online publication date: 31-Jan-2014
https://dl.acm.org/doi/10.1145/2530000
KUBO TTAGAMI AHASEGAWA THASEGAWA T(2013)Decentralized Equal-Sized Clustering in Sensor NetworksIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E96.A.916E96.A:5(916-926)Online publication date: 2013
https://doi.org/10.1587/transfun.E96.A.916
Yin Chen Tron RTerzis AVidal R(2011)Accelerated corrective consensus: Converge to the exact average at a faster rateProceedings of the 2011 American Control Conference10.1109/ACC.2011.5991097(3417-3422)Online publication date: Jun-2011
https://doi.org/10.1109/ACC.2011.5991097
Oreshkin BCoates MRabbat M(2010)Optimization and analysis of distributed averaging with short node memoryIEEE Transactions on Signal Processing10.1109/TSP.2010.204312758:5(2850-2865)Online publication date: 1-May-2010
https://dl.acm.org/doi/10.1109/TSP.2010.2043127
Ko CShi L(2009)Scheduling for finite time consensusProceedings of the 2009 conference on American Control Conference10.5555/1702315.1702642(1982-1986)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.5555/1702315.1702642
Aysal TOreshkin BCoates M(2009)Accelerated distributed average consensus via localized node state predictionIEEE Transactions on Signal Processing10.1109/TSP.2008.201037657:4(1563-1576)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1109/TSP.2008.2010376
Kokiopoulou EFrossard P(2009)Polynomial filtering for fast convergence in distributed consensusIEEE Transactions on Signal Processing10.1109/TSP.2008.200614757:1(342-354)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1109/TSP.2008.2006147
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten