Brief announcement: polygonal broadcast, secret maturity and the firing sensors

Shlomi Dolev; Ted Herman; Limor Lahiani

doi:10.1145/1011767.1011853

Brief announcement: polygonal broadcast, secret maturity and the firing sensors

Shlomi Dolev, Ted Herman, Limor Lahiani

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Our self-stabilizing broadcast schemes are extended to the case in which the sensors are not uniformly distributed. We use polyg- onal flooding in order to cope with empty or hardly populated ar- eas. The polygonal flooding requires (an additional constant factor) more transmissions and storage of arriving messages in the sensors memory. Then we turn to the cases in which only portions of the network should be notified by presenting polygonal local broadcast and polygonal local flooding

Original language	English
Title of host publication	Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004
Editors	Soma Chaudhuri, Shay Kutten
Publisher	ACM
Pages	391
Number of pages	1
ISBN (Print)	9781581138023
DOIs	https://doi.org/10.1145/1011767.1011853
State	Published - Jun 2004

Keywords

Sensor Network
Self-Stabilization
Stateless Routing

Access to Document

10.1145/1011767.1011853

Cite this

Dolev, S., Herman, T., & Lahiani, L. (2004). Brief announcement: polygonal broadcast, secret maturity and the firing sensors. In S. Chaudhuri, & S. Kutten (Eds.), Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004 (pp. 391). ACM. https://doi.org/10.1145/1011767.1011853

@inproceedings{ee0071f55c4d43fc8868cc9d9fd67e02,

title = "Brief announcement: polygonal broadcast, secret maturity and the firing sensors",

abstract = "Our self-stabilizing broadcast schemes are extended to the case in which the sensors are not uniformly distributed. We use polyg- onal flooding in order to cope with empty or hardly populated ar- eas. The polygonal flooding requires (an additional constant factor) more transmissions and storage of arriving messages in the sensors memory. Then we turn to the cases in which only portions of the network should be notified by presenting polygonal local broadcast and polygonal local flooding",

keywords = "Sensor Network, Self-Stabilization, Stateless Routing",

author = "Shlomi Dolev and Ted Herman and Limor Lahiani",

year = "2004",

month = jun,

doi = "10.1145/1011767.1011853",

language = "English",

isbn = "9781581138023",

pages = "391",

editor = "Soma Chaudhuri and Shay Kutten",

booktitle = "Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004",

publisher = "ACM",

}

Brief announcement: polygonal broadcast, secret maturity and the firing sensors. / Dolev, Shlomi; Herman, Ted; Lahiani, Limor.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004. ed. / Soma Chaudhuri; Shay Kutten. ACM, 2004. p. 391.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - polygonal broadcast, secret maturity and the firing sensors

AU - Dolev, Shlomi

AU - Herman, Ted

AU - Lahiani, Limor

PY - 2004/6

Y1 - 2004/6

N2 - Our self-stabilizing broadcast schemes are extended to the case in which the sensors are not uniformly distributed. We use polyg- onal flooding in order to cope with empty or hardly populated ar- eas. The polygonal flooding requires (an additional constant factor) more transmissions and storage of arriving messages in the sensors memory. Then we turn to the cases in which only portions of the network should be notified by presenting polygonal local broadcast and polygonal local flooding

AB - Our self-stabilizing broadcast schemes are extended to the case in which the sensors are not uniformly distributed. We use polyg- onal flooding in order to cope with empty or hardly populated ar- eas. The polygonal flooding requires (an additional constant factor) more transmissions and storage of arriving messages in the sensors memory. Then we turn to the cases in which only portions of the network should be notified by presenting polygonal local broadcast and polygonal local flooding

KW - Sensor Network

KW - Self-Stabilization

KW - Stateless Routing

U2 - 10.1145/1011767.1011853

DO - 10.1145/1011767.1011853

M3 - Conference contribution

SN - 9781581138023

SP - 391

BT - Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004

A2 - Chaudhuri, Soma

A2 - Kutten, Shay

PB - ACM

ER -

Brief announcement: polygonal broadcast, secret maturity and the firing sensors

Abstract

Keywords

Access to Document

Fingerprint

Cite this