Article

Differential nested lattice encoding for consensus problems

Authors:

Mehmet E. Yildiz,

Anna ScaglioneAuthors Info & Claims

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

Pages 89 - 98

https://doi.org/10.1145/1236360.1236373

Published: 25 April 2007 Publication History

Get Access

Abstract

In this paper we consider the problem of transmitting quantized data while performing an average consensus algorithm. Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. The main motivation for our work is the observation that consensus algorithms offer the perfect example of network communications where there is an increasing correlation between the data exchanged, as the system updates its computations. Henceforth, it is possible to utilize previously exchanged data and current side information to reduce significantly the demands of quantization bit rate for a certain precision. We analyze the case of a network with a topology built as that of a random geometric graph and with links that are assumed to be reliable at a constant bit rate. Numerically we show that in consensus algorithms, increasing number of iterations does not have the effect of increasing the error variance. Thus, we conclude that noisy recursions lead to a consensus if the data correlation is exploited in the messages source encoders and decoders. We briefly state the theoretical results which are parallel to our numerical experiments.

References

[1]

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Mixing times for random walks on geometric random graphs. In Workshop on Analytic Algorithms and Combinatorics Proc., January 2005.

Google Scholar

[2]

M. Feder and N. Shulman. Source broadcasting with unknown amount of receiver side information. In IEEE Proc. of Information Theory Workshop Proc., pages 127--130, Banglore,India, 2005.

Google Scholar

[3]

Z. Lin, S. Cheng, A.D. Liveris, and Z. Xiong. Slepian-wolf coded nested quantization(swc-nq) for wyner-ziv coding: Performance analysis and code design. In Data Compression Conference Proc., pages 322--331, 2004.

Digital Library

Google Scholar

[4]

S.S. Pradhan and K. Ramchandran. Distributed source coding using syndromes (discus): Design and construction. In Data Compression Conference Proc., pages 158--167, March 1999.

Digital Library

Google Scholar

[5]

M. Rabbat, R. Nowak, and J. Bucklew. Generalized consensus computation in networked systems with erasure links. In IEEE Workshop on Signal Processing Advances in Wireless Communications Proc., pages 1088--1092, June 2005.

Crossref

Google Scholar

[6]

W. Ren, R.W. Beard, and D.B. Kingston. Multi-agentkalman consensus with relative uncertanity. In American Control Conference Proc., pages 1865--1870, OR, USA, June 2005.

Google Scholar

[7]

R.O. Saber and R.M. Murray. Agreement problems in networks with directed graphs and switching topology. California Institute of Technology Technical Report, CIT-CDS 03-005, 2003.

Google Scholar

[8]

D. Slepian and J.K. Wolf. Noiseless coding of correlated information sources. IEEE Trans. Inform. Theory, IT-19:471--480, July 1973.

Digital Library

Google Scholar

[9]

A. Vosughi and A. Scaglione. Precoding and decoding paradigms for distributed data compression,. IEEE Transactions on Signal Processing, 2007.

Digital Library

Google Scholar

[10]

A.D. Wyner and J. Ziv. The rate-distortion function for source coding with side information at the decoder. IEEE Trans. Inform. Theory, IT-22:1--10, Jan 1976.

Digital Library

Google Scholar

[11]

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

Crossref

Google Scholar

[12]

L. Xiao, S. Boyd, and S. Kim. Distributed average consensus with least-mean-square deviation. In Mathematical Theory of Networks and Systems Proc., pages 158--167, Kyoto,Japan, July 2006.

Google Scholar

[13]

M.E. Yildiz and A. Scaglione. Practical coding algorithms for consensus problems with zero asymptotic rate. Submitted to IEEE Trans. on Signal Processing, 2007.

Google Scholar

[14]

R. Zamir and S. Shamai. Nested linear/lattice codes for wyner-ziv encoding. In IEEE Inform. Theory Workshop Proc., pages 158--167, Killarney,Ireland, 1998.

Crossref

Google Scholar

Cited By

View all

Sheth VWan YXie JFu SLin ZDas S(2014)On Properties of Quantized Consensus in Layered Sensor NetworksProceedings of the 2014 IEEE International Conference on Distributed Computing in Sensor Systems10.1109/DCOSS.2014.38(217-224)Online publication date: 26-May-2014
https://dl.acm.org/doi/10.1109/DCOSS.2014.38
Sundaram SHadjicostis C(2013)Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent SystemsIEEE Transactions on Automatic Control10.1109/TAC.2012.220415558:1(60-73)Online publication date: Jan-2013
https://doi.org/10.1109/TAC.2012.2204155
Ustebay DCastro RRabbat M(2011)Efficient Decentralized Approximation via Selective GossipIEEE Journal of Selected Topics in Signal Processing10.1109/JSTSP.2011.21576585:4(805-816)Online publication date: Aug-2011
https://doi.org/10.1109/JSTSP.2011.2157658
Show More Cited By

Index Terms

Differential nested lattice encoding for consensus problems
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data layout
        Data compression
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

Recommendations

The k-simultaneous consensus problem

This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is ...
An adaptive module for the consensus reaching process in group decision making problems
MDAI'05: Proceedings of the Second international conference on Modeling Decisions for Artificial Intelligence

In the group decision making (GDM) framework we deal with decision problems where several decision makers try to achieve a common solution about a problem. In the literature, we can find two processes to carry out before obtaining a final solution: the ...
Uniform consensus is harder than consensus

We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be ...

Comments

Information & Contributors

Information

Published In

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

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]

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

13
Total Citations
View Citations
299
Total Downloads

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

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sheth VWan YXie JFu SLin ZDas S(2014)On Properties of Quantized Consensus in Layered Sensor NetworksProceedings of the 2014 IEEE International Conference on Distributed Computing in Sensor Systems10.1109/DCOSS.2014.38(217-224)Online publication date: 26-May-2014
https://dl.acm.org/doi/10.1109/DCOSS.2014.38
Sundaram SHadjicostis C(2013)Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent SystemsIEEE Transactions on Automatic Control10.1109/TAC.2012.220415558:1(60-73)Online publication date: Jan-2013
https://doi.org/10.1109/TAC.2012.2204155
Ustebay DCastro RRabbat M(2011)Efficient Decentralized Approximation via Selective GossipIEEE Journal of Selected Topics in Signal Processing10.1109/JSTSP.2011.21576585:4(805-816)Online publication date: Aug-2011
https://doi.org/10.1109/JSTSP.2011.2157658
Cui YLau V(2010)Convergence-optimal quantizer design of distributed contraction-based iterative algorithms with quantized message passingIEEE Transactions on Signal Processing10.1109/TSP.2010.205586158:10(5196-5205)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1109/TSP.2010.2055861
Kar SMoura J(2010)Distributed consensus algorithms in sensor networksIEEE Transactions on Signal Processing10.1109/TSP.2009.203604658:3(1383-1400)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1109/TSP.2009.2036046
Aysal TBarner K(2010)Convergence of consensus models with stochastic disturbancesIEEE Transactions on Information Theory10.1109/TIT.2010.205094056:8(4101-4113)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.1109/TIT.2010.2050940
Aysal TYildiz MSarwate AScaglione A(2009)Broadcast gossip algorithms for consensusIEEE Transactions on Signal Processing10.1109/TSP.2009.201624757:7(2748-2761)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1109/TSP.2009.2016247
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
Aysal TBarner K(2009)On the Convergence of Perturbed Non-Stationary Consensus AlgorithmsIEEE INFOCOM 200910.1109/INFCOM.2009.5062137(2132-2140)Online publication date: Apr-2009
https://doi.org/10.1109/INFCOM.2009.5062137
Sundaram SHadjicostis C(2009)Information dissemination in networks via linear iterative strategies over finite fieldsProceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference10.1109/CDC.2009.5400694(3781-3786)Online publication date: Dec-2009
https://doi.org/10.1109/CDC.2009.5400694
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.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

The k-simultaneous consensus problem

An adaptive module for the consensus reaching process in group decision making problems

Uniform consensus is harder than consensus

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations