Coding with side information for rate-constrained consensus

Mehmet Ercan Yildiz, Anna Scaglione

Research output: Contribution to journalArticle

45 Citations (Scopus)

Abstract

Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. They offer a natural tradeoff between the number of messages exchanged among terminals and the accuracy in the computation. Most of the models adopted for the message exchange in the literature, however, neither include explicit rate constraints nor explore the rate distortion tradeoff associated with the algorithm. The contribution of our work is in examining the impact of such constraints and in finding strategies to minimize the communication cost in terms of rate. The main motivation behind the proposed coding strategies is the observation that consensus algorithms offer the perfect example of a network communication problem where there is an increasing correlation between the data exchanged, as the algorithm iterates. Henceforth, it is possible to utilize previously exchanged data and current side information to significantly reduce the demands of quantization bit rate for a certain precision. We analyze the case of a network where the links are assumed to be reliable at a constant bit rate. We explore the conditions on the quantization noise which lead to a consensus value whose mean squared distance from the initial average is bounded. In the case of infinite-length vector coding with Gaussian states, we show that our proposed schemes achieve bounded convergence with vanishing rates as the iteration index tends to infinity.

Original languageEnglish (US)
Pages (from-to)3753-3764
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume56
Issue number8 I
DOIs
StatePublished - Aug 2008
Externally publishedYes

Fingerprint

Communication
Telecommunication networks
Sensors
Costs

Keywords

  • Bounded convergence
  • Coding with side information
  • Distributed average consensus
  • Sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Coding with side information for rate-constrained consensus. / Yildiz, Mehmet Ercan; Scaglione, Anna.

In: IEEE Transactions on Signal Processing, Vol. 56, No. 8 I, 08.2008, p. 3753-3764.

Research output: Contribution to journalArticle

@article{1ef5b6b0d28e4eddb064db9dccc74b29,
title = "Coding with side information for rate-constrained consensus",
abstract = "Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. They offer a natural tradeoff between the number of messages exchanged among terminals and the accuracy in the computation. Most of the models adopted for the message exchange in the literature, however, neither include explicit rate constraints nor explore the rate distortion tradeoff associated with the algorithm. The contribution of our work is in examining the impact of such constraints and in finding strategies to minimize the communication cost in terms of rate. The main motivation behind the proposed coding strategies is the observation that consensus algorithms offer the perfect example of a network communication problem where there is an increasing correlation between the data exchanged, as the algorithm iterates. Henceforth, it is possible to utilize previously exchanged data and current side information to significantly reduce the demands of quantization bit rate for a certain precision. We analyze the case of a network where the links are assumed to be reliable at a constant bit rate. We explore the conditions on the quantization noise which lead to a consensus value whose mean squared distance from the initial average is bounded. In the case of infinite-length vector coding with Gaussian states, we show that our proposed schemes achieve bounded convergence with vanishing rates as the iteration index tends to infinity.",
keywords = "Bounded convergence, Coding with side information, Distributed average consensus, Sensor networks",
author = "Yildiz, {Mehmet Ercan} and Anna Scaglione",
year = "2008",
month = "8",
doi = "10.1109/TSP.2008.919636",
language = "English (US)",
volume = "56",
pages = "3753--3764",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8 I",

}

TY - JOUR

T1 - Coding with side information for rate-constrained consensus

AU - Yildiz, Mehmet Ercan

AU - Scaglione, Anna

PY - 2008/8

Y1 - 2008/8

N2 - Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. They offer a natural tradeoff between the number of messages exchanged among terminals and the accuracy in the computation. Most of the models adopted for the message exchange in the literature, however, neither include explicit rate constraints nor explore the rate distortion tradeoff associated with the algorithm. The contribution of our work is in examining the impact of such constraints and in finding strategies to minimize the communication cost in terms of rate. The main motivation behind the proposed coding strategies is the observation that consensus algorithms offer the perfect example of a network communication problem where there is an increasing correlation between the data exchanged, as the algorithm iterates. Henceforth, it is possible to utilize previously exchanged data and current side information to significantly reduce the demands of quantization bit rate for a certain precision. We analyze the case of a network where the links are assumed to be reliable at a constant bit rate. We explore the conditions on the quantization noise which lead to a consensus value whose mean squared distance from the initial average is bounded. In the case of infinite-length vector coding with Gaussian states, we show that our proposed schemes achieve bounded convergence with vanishing rates as the iteration index tends to infinity.

AB - Average consensus algorithms are protocols to compute the average value of all sensor measurements via near neighbors communications. They offer a natural tradeoff between the number of messages exchanged among terminals and the accuracy in the computation. Most of the models adopted for the message exchange in the literature, however, neither include explicit rate constraints nor explore the rate distortion tradeoff associated with the algorithm. The contribution of our work is in examining the impact of such constraints and in finding strategies to minimize the communication cost in terms of rate. The main motivation behind the proposed coding strategies is the observation that consensus algorithms offer the perfect example of a network communication problem where there is an increasing correlation between the data exchanged, as the algorithm iterates. Henceforth, it is possible to utilize previously exchanged data and current side information to significantly reduce the demands of quantization bit rate for a certain precision. We analyze the case of a network where the links are assumed to be reliable at a constant bit rate. We explore the conditions on the quantization noise which lead to a consensus value whose mean squared distance from the initial average is bounded. In the case of infinite-length vector coding with Gaussian states, we show that our proposed schemes achieve bounded convergence with vanishing rates as the iteration index tends to infinity.

KW - Bounded convergence

KW - Coding with side information

KW - Distributed average consensus

KW - Sensor networks

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

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

U2 - 10.1109/TSP.2008.919636

DO - 10.1109/TSP.2008.919636

M3 - Article

AN - SCOPUS:48849098013

VL - 56

SP - 3753

EP - 3764

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 8 I

ER -