Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence

Mehmet E. Yildiz, Anna Scaglione

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

6 Citations (Scopus)

Abstract

Average consensus algorithms are gossiping protocols for averaging original sensor measurements via near neighbor communications. In this paper, we consider the average consensus algorithm under communication rate constraints. Without any communication rate restrictions, the algorithm ideally allows every node state to converge to the initial average in the limit. Noting that brute force quantization does not guarantee convergence due to error propagation effects, in our recent work we proposed two source coding methods which use side information (predictive coding and Wyner-Ziv coding) to achieve convergence with vanishing quantization rates in the case of block coding. In this work, we focus on a simplified predictive coding scheme with variable quantization rates over the iterations and on a communication network with regular topology. We characterize the asymptotic rate which allows to achieve a bounded convergence in terms of the initial conditions (i.e, the rate at the first iteration, and the initial state correlation), and the connectivity of the network. Moreover, we study the optimal rate allocation among the average consensus iterations subject to the constraints that the total number of quantization bits is fixed.

Original languageEnglish (US)
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Pages2717-2720
Number of pages4
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States
Duration: Mar 31 2008Apr 4 2008

Other

Other2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
CountryUnited States
CityLas Vegas, NV
Period3/31/084/4/08

Fingerprint

coding
Communication
iteration
communication
Telecommunication networks
Topology
Sensors
communication networks
constrictions
topology
propagation
sensors

Keywords

  • Communication systems
  • Distributed algorithms
  • Sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Acoustics and Ultrasonics

Cite this

Yildiz, M. E., & Scaglione, A. (2008). Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (pp. 2717-2720). [4518210] https://doi.org/10.1109/ICASSP.2008.4518210

Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence. / Yildiz, Mehmet E.; Scaglione, Anna.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2008. p. 2717-2720 4518210.

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

Yildiz, ME & Scaglione, A 2008, Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings., 4518210, pp. 2717-2720, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, Las Vegas, NV, United States, 3/31/08. https://doi.org/10.1109/ICASSP.2008.4518210
Yildiz ME, Scaglione A. Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2008. p. 2717-2720. 4518210 https://doi.org/10.1109/ICASSP.2008.4518210
Yildiz, Mehmet E. ; Scaglione, Anna. / Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. 2008. pp. 2717-2720
@inproceedings{e7ca8bb0a88849b9939055799dc7cb07,
title = "Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence",
abstract = "Average consensus algorithms are gossiping protocols for averaging original sensor measurements via near neighbor communications. In this paper, we consider the average consensus algorithm under communication rate constraints. Without any communication rate restrictions, the algorithm ideally allows every node state to converge to the initial average in the limit. Noting that brute force quantization does not guarantee convergence due to error propagation effects, in our recent work we proposed two source coding methods which use side information (predictive coding and Wyner-Ziv coding) to achieve convergence with vanishing quantization rates in the case of block coding. In this work, we focus on a simplified predictive coding scheme with variable quantization rates over the iterations and on a communication network with regular topology. We characterize the asymptotic rate which allows to achieve a bounded convergence in terms of the initial conditions (i.e, the rate at the first iteration, and the initial state correlation), and the connectivity of the network. Moreover, we study the optimal rate allocation among the average consensus iterations subject to the constraints that the total number of quantization bits is fixed.",
keywords = "Communication systems, Distributed algorithms, Sensor networks",
author = "Yildiz, {Mehmet E.} and Anna Scaglione",
year = "2008",
doi = "10.1109/ICASSP.2008.4518210",
language = "English (US)",
isbn = "1424414849",
pages = "2717--2720",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

}

TY - GEN

T1 - Limiting rate behavior and rate allocation strategies for average consensus problems with bounded convergence

AU - Yildiz, Mehmet E.

AU - Scaglione, Anna

PY - 2008

Y1 - 2008

N2 - Average consensus algorithms are gossiping protocols for averaging original sensor measurements via near neighbor communications. In this paper, we consider the average consensus algorithm under communication rate constraints. Without any communication rate restrictions, the algorithm ideally allows every node state to converge to the initial average in the limit. Noting that brute force quantization does not guarantee convergence due to error propagation effects, in our recent work we proposed two source coding methods which use side information (predictive coding and Wyner-Ziv coding) to achieve convergence with vanishing quantization rates in the case of block coding. In this work, we focus on a simplified predictive coding scheme with variable quantization rates over the iterations and on a communication network with regular topology. We characterize the asymptotic rate which allows to achieve a bounded convergence in terms of the initial conditions (i.e, the rate at the first iteration, and the initial state correlation), and the connectivity of the network. Moreover, we study the optimal rate allocation among the average consensus iterations subject to the constraints that the total number of quantization bits is fixed.

AB - Average consensus algorithms are gossiping protocols for averaging original sensor measurements via near neighbor communications. In this paper, we consider the average consensus algorithm under communication rate constraints. Without any communication rate restrictions, the algorithm ideally allows every node state to converge to the initial average in the limit. Noting that brute force quantization does not guarantee convergence due to error propagation effects, in our recent work we proposed two source coding methods which use side information (predictive coding and Wyner-Ziv coding) to achieve convergence with vanishing quantization rates in the case of block coding. In this work, we focus on a simplified predictive coding scheme with variable quantization rates over the iterations and on a communication network with regular topology. We characterize the asymptotic rate which allows to achieve a bounded convergence in terms of the initial conditions (i.e, the rate at the first iteration, and the initial state correlation), and the connectivity of the network. Moreover, we study the optimal rate allocation among the average consensus iterations subject to the constraints that the total number of quantization bits is fixed.

KW - Communication systems

KW - Distributed algorithms

KW - Sensor networks

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

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

U2 - 10.1109/ICASSP.2008.4518210

DO - 10.1109/ICASSP.2008.4518210

M3 - Conference contribution

AN - SCOPUS:51449092180

SN - 1424414849

SN - 9781424414840

SP - 2717

EP - 2720

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

ER -