Average consensus in asymmetric broadcasting wireless sensor networks through gossiping

Ferdinand Peper; Kenji Leibnitz; Tetsuya Shimokawa; Marie Ange Remiche

doi:10.1145/3004010.3004024

Average consensus in asymmetric broadcasting wireless sensor networks through gossiping

Ferdinand Peper, Kenji Leibnitz, Tetsuya Shimokawa, Marie Ange Remiche

Research output: Contribution in Book/Catalog/Report/Conference proceeding › Conference contribution

Abstract

Average consensus algorithms have attracted increasing interest in the last decade because of their potential for use in high-density wireless sensor networks. This paper analyzes an algorithm that is based on a model of asymmetric broadcasting on a random geometric graph, in which nodes broadcast and listen only intermittently. We show that each node can easily estimate its update weight from the degree of silence in its neighborhood, and, after the weights have been assigned in this way, that the consensus algorithm converges to the true average. Both a synchronous and an asynchronous update model are analyzed.

Original language	English
Title of host publication	Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016
Publisher	ACM Press
Pages	171-176
Number of pages	6
Volume	28-November-2016
ISBN (Electronic)	9781450347594
DOIs	https://doi.org/10.1145/3004010.3004024
Publication status	Published - 28 Nov 2016
Event	13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016 - Hiroshima, Japan Duration: 28 Nov 2016 → 1 Dec 2016

Conference

Conference	13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016
Country/Territory	Japan
City	Hiroshima
Period	28/11/16 → 1/12/16

Keywords

Average consensus
Gossiping algorithms
Wireless sensor networks

Access to Document

10.1145/3004010.3004024

Cite this

Peper, F., Leibnitz, K., Shimokawa, T., & Remiche, M. A. (2016). Average consensus in asymmetric broadcasting wireless sensor networks through gossiping. In Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016 (Vol. 28-November-2016, pp. 171-176). ACM Press. https://doi.org/10.1145/3004010.3004024

@inproceedings{82b012d9aca64057b7dfc93b1e157d27,

title = "Average consensus in asymmetric broadcasting wireless sensor networks through gossiping",

abstract = "Average consensus algorithms have attracted increasing interest in the last decade because of their potential for use in high-density wireless sensor networks. This paper analyzes an algorithm that is based on a model of asymmetric broadcasting on a random geometric graph, in which nodes broadcast and listen only intermittently. We show that each node can easily estimate its update weight from the degree of silence in its neighborhood, and, after the weights have been assigned in this way, that the consensus algorithm converges to the true average. Both a synchronous and an asynchronous update model are analyzed.",

keywords = "Average consensus, Gossiping algorithms, Wireless sensor networks",

author = "Ferdinand Peper and Kenji Leibnitz and Tetsuya Shimokawa and Remiche, {Marie Ange}",

year = "2016",

month = nov,

day = "28",

doi = "10.1145/3004010.3004024",

language = "English",

volume = "28-November-2016",

pages = "171--176",

booktitle = "Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016",

publisher = "ACM Press",

address = "United States",

note = "13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016 ; Conference date: 28-11-2016 Through 01-12-2016",

}

Peper, F, Leibnitz, K, Shimokawa, T & Remiche, MA 2016, Average consensus in asymmetric broadcasting wireless sensor networks through gossiping. in Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016. vol. 28-November-2016, ACM Press, pp. 171-176, 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016, Hiroshima, Japan, 28/11/16. https://doi.org/10.1145/3004010.3004024

Average consensus in asymmetric broadcasting wireless sensor networks through gossiping. / Peper, Ferdinand; Leibnitz, Kenji; Shimokawa, Tetsuya et al.
Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016. Vol. 28-November-2016 ACM Press, 2016. p. 171-176.

Research output: Contribution in Book/Catalog/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Average consensus in asymmetric broadcasting wireless sensor networks through gossiping

AU - Peper, Ferdinand

AU - Leibnitz, Kenji

AU - Shimokawa, Tetsuya

AU - Remiche, Marie Ange

PY - 2016/11/28

Y1 - 2016/11/28

N2 - Average consensus algorithms have attracted increasing interest in the last decade because of their potential for use in high-density wireless sensor networks. This paper analyzes an algorithm that is based on a model of asymmetric broadcasting on a random geometric graph, in which nodes broadcast and listen only intermittently. We show that each node can easily estimate its update weight from the degree of silence in its neighborhood, and, after the weights have been assigned in this way, that the consensus algorithm converges to the true average. Both a synchronous and an asynchronous update model are analyzed.

AB - Average consensus algorithms have attracted increasing interest in the last decade because of their potential for use in high-density wireless sensor networks. This paper analyzes an algorithm that is based on a model of asymmetric broadcasting on a random geometric graph, in which nodes broadcast and listen only intermittently. We show that each node can easily estimate its update weight from the degree of silence in its neighborhood, and, after the weights have been assigned in this way, that the consensus algorithm converges to the true average. Both a synchronous and an asynchronous update model are analyzed.

KW - Average consensus

KW - Gossiping algorithms

KW - Wireless sensor networks

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

U2 - 10.1145/3004010.3004024

DO - 10.1145/3004010.3004024

M3 - Conference contribution

AN - SCOPUS:85008180769

VL - 28-November-2016

SP - 171

EP - 176

BT - Adjunct Proceedings of the 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016

PB - ACM Press

T2 - 13th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2016

Y2 - 28 November 2016 through 1 December 2016

ER -

Average consensus in asymmetric broadcasting wireless sensor networks through gossiping

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this