On the problem of adding infinitely many values

Shrut Kirti, Anna Scaglione

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

Abstract

Average consensus is a decentralized computation algorithm for calculating the average of the state variables of the nodes in a network. Over wireless networks, it is typically implemented using point-to-point random access scheduling. Wireless communications, however, are interference limited and when the available bandwidth is fixed, the expected delay in achieving a certain precision in the average value increases as the network size scales up. We show that this limitation in large networks disappears if we use specially structured codes. We analyze a combined source and channel coding strategy that uses an incoherent combination of power over orthogonal subchannels for the average consensus protocol. We show that in spite of the bandwidth and power limitations, with our simple strategy the delay and precision can be kept bounded while increasing the number of participants.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Spread Spectrum Techniques and Applications
Pages1-6
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008 - Bologna, Italy
Duration: Aug 25 2008Aug 28 2008

Other

Other2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008
CountryItaly
CityBologna
Period8/25/088/28/08

Fingerprint

Bandwidth
Channel coding
Wireless networks
Scheduling
Network protocols
Channel Coding
Source Coding
Scale-up
Random Access
Communication
Wireless Communication
Decentralized
Wireless Networks
Interference
Vertex of a graph
Strategy

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Kirti, S., & Scaglione, A. (2008). On the problem of adding infinitely many values. In IEEE International Symposium on Spread Spectrum Techniques and Applications (pp. 1-6). [4621365] https://doi.org/10.1109/ISSSTA.2008.6

On the problem of adding infinitely many values. / Kirti, Shrut; Scaglione, Anna.

IEEE International Symposium on Spread Spectrum Techniques and Applications. 2008. p. 1-6 4621365.

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

Kirti, S & Scaglione, A 2008, On the problem of adding infinitely many values. in IEEE International Symposium on Spread Spectrum Techniques and Applications., 4621365, pp. 1-6, 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA2008, Bologna, Italy, 8/25/08. https://doi.org/10.1109/ISSSTA.2008.6
Kirti S, Scaglione A. On the problem of adding infinitely many values. In IEEE International Symposium on Spread Spectrum Techniques and Applications. 2008. p. 1-6. 4621365 https://doi.org/10.1109/ISSSTA.2008.6
Kirti, Shrut ; Scaglione, Anna. / On the problem of adding infinitely many values. IEEE International Symposium on Spread Spectrum Techniques and Applications. 2008. pp. 1-6
@inproceedings{010a5608fd394c7e93994600240dd4da,
title = "On the problem of adding infinitely many values",
abstract = "Average consensus is a decentralized computation algorithm for calculating the average of the state variables of the nodes in a network. Over wireless networks, it is typically implemented using point-to-point random access scheduling. Wireless communications, however, are interference limited and when the available bandwidth is fixed, the expected delay in achieving a certain precision in the average value increases as the network size scales up. We show that this limitation in large networks disappears if we use specially structured codes. We analyze a combined source and channel coding strategy that uses an incoherent combination of power over orthogonal subchannels for the average consensus protocol. We show that in spite of the bandwidth and power limitations, with our simple strategy the delay and precision can be kept bounded while increasing the number of participants.",
author = "Shrut Kirti and Anna Scaglione",
year = "2008",
doi = "10.1109/ISSSTA.2008.6",
language = "English (US)",
isbn = "9781424422043",
pages = "1--6",
booktitle = "IEEE International Symposium on Spread Spectrum Techniques and Applications",

}

TY - GEN

T1 - On the problem of adding infinitely many values

AU - Kirti, Shrut

AU - Scaglione, Anna

PY - 2008

Y1 - 2008

N2 - Average consensus is a decentralized computation algorithm for calculating the average of the state variables of the nodes in a network. Over wireless networks, it is typically implemented using point-to-point random access scheduling. Wireless communications, however, are interference limited and when the available bandwidth is fixed, the expected delay in achieving a certain precision in the average value increases as the network size scales up. We show that this limitation in large networks disappears if we use specially structured codes. We analyze a combined source and channel coding strategy that uses an incoherent combination of power over orthogonal subchannels for the average consensus protocol. We show that in spite of the bandwidth and power limitations, with our simple strategy the delay and precision can be kept bounded while increasing the number of participants.

AB - Average consensus is a decentralized computation algorithm for calculating the average of the state variables of the nodes in a network. Over wireless networks, it is typically implemented using point-to-point random access scheduling. Wireless communications, however, are interference limited and when the available bandwidth is fixed, the expected delay in achieving a certain precision in the average value increases as the network size scales up. We show that this limitation in large networks disappears if we use specially structured codes. We analyze a combined source and channel coding strategy that uses an incoherent combination of power over orthogonal subchannels for the average consensus protocol. We show that in spite of the bandwidth and power limitations, with our simple strategy the delay and precision can be kept bounded while increasing the number of participants.

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

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

U2 - 10.1109/ISSSTA.2008.6

DO - 10.1109/ISSSTA.2008.6

M3 - Conference contribution

SN - 9781424422043

SP - 1

EP - 6

BT - IEEE International Symposium on Spread Spectrum Techniques and Applications

ER -