Differential nested lattice encoding for consensus problems

Mehmet E. Yildiz, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationIPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks
Pages89-98
Number of pages10
DOIs
StatePublished - 2007
Externally publishedYes
EventIPSN 2007: 6th International Symposium on Information Processing in Sensor Networks - Cambridge, MA, United States
Duration: Apr 25 2007Apr 27 2007

Other

OtherIPSN 2007: 6th International Symposium on Information Processing in Sensor Networks
CountryUnited States
CityCambridge, MA
Period4/25/074/27/07

Fingerprint

Telecommunication networks
Topology
Communication
Sensors
Experiments

Keywords

  • Average consensus
  • Coding with side information
  • Consensus
  • Nested lattice coding
  • Predictive coding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Yildiz, M. E., & Scaglione, A. (2007). Differential nested lattice encoding for consensus problems. In IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks (pp. 89-98) https://doi.org/10.1145/1236360.1236373

Differential nested lattice encoding for consensus problems. / Yildiz, Mehmet E.; Scaglione, Anna.

IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks. 2007. p. 89-98.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yildiz, ME & Scaglione, A 2007, Differential nested lattice encoding for consensus problems. in IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks. pp. 89-98, IPSN 2007: 6th International Symposium on Information Processing in Sensor Networks, Cambridge, MA, United States, 4/25/07. https://doi.org/10.1145/1236360.1236373
Yildiz ME, Scaglione A. Differential nested lattice encoding for consensus problems. In IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks. 2007. p. 89-98 https://doi.org/10.1145/1236360.1236373
Yildiz, Mehmet E. ; Scaglione, Anna. / Differential nested lattice encoding for consensus problems. IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks. 2007. pp. 89-98
@inproceedings{723cb71929e74fed9ca8c825743e155c,
title = "Differential nested lattice encoding for consensus problems",
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.",
keywords = "Average consensus, Coding with side information, Consensus, Nested lattice coding, Predictive coding",
author = "Yildiz, {Mehmet E.} and Anna Scaglione",
year = "2007",
doi = "10.1145/1236360.1236373",
language = "English (US)",
isbn = "1595936386",
pages = "89--98",
booktitle = "IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks",

}

TY - GEN

T1 - Differential nested lattice encoding for consensus problems

AU - Yildiz, Mehmet E.

AU - Scaglione, Anna

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Average consensus

KW - Coding with side information

KW - Consensus

KW - Nested lattice coding

KW - Predictive coding

UR - http://www.scopus.com/inward/record.url?scp=35348858886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35348858886&partnerID=8YFLogxK

U2 - 10.1145/1236360.1236373

DO - 10.1145/1236360.1236373

M3 - Conference contribution

SN - 1595936386

SN - 9781595936387

SP - 89

EP - 98

BT - IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks

ER -