Distributed average consensus with bounded quantization

Shengyu Zhu, Biao Chen

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

Abstract

This paper considers distributed average consensus using bounded quantizers with potentially unbounded input data. We develop a quantized consensus algorithm based on a distributed alternating direction methods of multipliers (ADMM) algorithm. It is shown that, within finite iterations, all the agent variables either converge to the same quantization point or cycle with a finite period. In the convergent case, we derive a consensus error bound which also applies to that of the unbounded rounding quantizer provided that the desired average lies within quantizer output range. Simulations show that the proposed algorithm almost always converge when the network becomes large and dense.

Original languageEnglish (US)
Title of host publicationSPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Volume2016-August
ISBN (Electronic)9781509017492
DOIs
StatePublished - Aug 9 2016
Event17th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2016 - Edinburgh, United Kingdom
Duration: Jul 3 2016Jul 6 2016

Other

Other17th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2016
CountryUnited Kingdom
CityEdinburgh
Period7/3/167/6/16

Keywords

  • alternating direction method of multipliers (ADMM)
  • bounded quantization
  • distributed averaging algorithm
  • finite-level quantizer
  • Quantized consensus

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Information Systems

Cite this

Zhu, S., & Chen, B. (2016). Distributed average consensus with bounded quantization. In SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications (Vol. 2016-August). [7536852] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPAWC.2016.7536852

Distributed average consensus with bounded quantization. / Zhu, Shengyu; Chen, Biao.

SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. 7536852.

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

Zhu, S & Chen, B 2016, Distributed average consensus with bounded quantization. in SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications. vol. 2016-August, 7536852, Institute of Electrical and Electronics Engineers Inc., 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2016, Edinburgh, United Kingdom, 7/3/16. https://doi.org/10.1109/SPAWC.2016.7536852
Zhu S, Chen B. Distributed average consensus with bounded quantization. In SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications. Vol. 2016-August. Institute of Electrical and Electronics Engineers Inc. 2016. 7536852 https://doi.org/10.1109/SPAWC.2016.7536852
Zhu, Shengyu ; Chen, Biao. / Distributed average consensus with bounded quantization. SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{86ad9c896aec4794b66002ccee53d67c,
title = "Distributed average consensus with bounded quantization",
abstract = "This paper considers distributed average consensus using bounded quantizers with potentially unbounded input data. We develop a quantized consensus algorithm based on a distributed alternating direction methods of multipliers (ADMM) algorithm. It is shown that, within finite iterations, all the agent variables either converge to the same quantization point or cycle with a finite period. In the convergent case, we derive a consensus error bound which also applies to that of the unbounded rounding quantizer provided that the desired average lies within quantizer output range. Simulations show that the proposed algorithm almost always converge when the network becomes large and dense.",
keywords = "alternating direction method of multipliers (ADMM), bounded quantization, distributed averaging algorithm, finite-level quantizer, Quantized consensus",
author = "Shengyu Zhu and Biao Chen",
year = "2016",
month = "8",
day = "9",
doi = "10.1109/SPAWC.2016.7536852",
language = "English (US)",
volume = "2016-August",
booktitle = "SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Distributed average consensus with bounded quantization

AU - Zhu, Shengyu

AU - Chen, Biao

PY - 2016/8/9

Y1 - 2016/8/9

N2 - This paper considers distributed average consensus using bounded quantizers with potentially unbounded input data. We develop a quantized consensus algorithm based on a distributed alternating direction methods of multipliers (ADMM) algorithm. It is shown that, within finite iterations, all the agent variables either converge to the same quantization point or cycle with a finite period. In the convergent case, we derive a consensus error bound which also applies to that of the unbounded rounding quantizer provided that the desired average lies within quantizer output range. Simulations show that the proposed algorithm almost always converge when the network becomes large and dense.

AB - This paper considers distributed average consensus using bounded quantizers with potentially unbounded input data. We develop a quantized consensus algorithm based on a distributed alternating direction methods of multipliers (ADMM) algorithm. It is shown that, within finite iterations, all the agent variables either converge to the same quantization point or cycle with a finite period. In the convergent case, we derive a consensus error bound which also applies to that of the unbounded rounding quantizer provided that the desired average lies within quantizer output range. Simulations show that the proposed algorithm almost always converge when the network becomes large and dense.

KW - alternating direction method of multipliers (ADMM)

KW - bounded quantization

KW - distributed averaging algorithm

KW - finite-level quantizer

KW - Quantized consensus

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

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

U2 - 10.1109/SPAWC.2016.7536852

DO - 10.1109/SPAWC.2016.7536852

M3 - Conference contribution

VL - 2016-August

BT - SPAWC 2016 - 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -