By Topic

On the Problem of Adding Infinitely Many Values

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shrut Kirti ; Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY ; Anna Scaglione

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.

Published in:

2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications

Date of Conference:

25-28 Aug. 2008