Time-efficient broadcasting in radio networks: A review

David Peleg

doi:10.1007/978-3-540-77115-9_1

Time-efficient broadcasting in radio networks: A review

David Peleg

Weizmann Institute of Science

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

37 Scopus citations

Abstract

Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.

Original language	English
Title of host publication	Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings
Publisher	Springer Verlag
Pages	1-18
Number of pages	18
ISBN (Print)	9783540771128
DOIs	https://doi.org/10.1007/978-3-540-77115-9_1
State	Published - 2007
Externally published	Yes
Event	4th International Conference on Distributed Computing and Internet Technology, ICDCIT 2007 - Bangalore, India Duration: 17 Dec 2007 → 20 Dec 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4882 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Conference on Distributed Computing and Internet Technology, ICDCIT 2007
Country/Territory	India
City	Bangalore
Period	17/12/07 → 20/12/07

Access to Document

10.1007/978-3-540-77115-9_1

Cite this

Peleg, D. (2007). Time-efficient broadcasting in radio networks: A review. In Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings (pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4882 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-77115-9_1

@inproceedings{68191151d60c47529275b9e355d4bd1e,

title = "Time-efficient broadcasting in radio networks: A review",

abstract = "Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.",

author = "David Peleg",

year = "2007",

doi = "10.1007/978-3-540-77115-9_1",

language = "אנגלית",

isbn = "9783540771128",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--18",

booktitle = "Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings",

address = "גרמניה",

note = "4th International Conference on Distributed Computing and Internet Technology, ICDCIT 2007 ; Conference date: 17-12-2007 Through 20-12-2007",

}

Peleg, D 2007, Time-efficient broadcasting in radio networks: A review. in Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4882 LNCS, Springer Verlag, pp. 1-18, 4th International Conference on Distributed Computing and Internet Technology, ICDCIT 2007, Bangalore, India, 17/12/07. https://doi.org/10.1007/978-3-540-77115-9_1

Time-efficient broadcasting in radio networks: A review. / Peleg, David.
Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings. Springer Verlag, 2007. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4882 LNCS).

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

TY - GEN

T1 - Time-efficient broadcasting in radio networks

T2 - 4th International Conference on Distributed Computing and Internet Technology, ICDCIT 2007

AU - Peleg, David

PY - 2007

Y1 - 2007

N2 - Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.

AB - Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibility of knowledge about the network topology, the availability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. The paper reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions.

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

U2 - 10.1007/978-3-540-77115-9_1

DO - 10.1007/978-3-540-77115-9_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:38149023297

SN - 9783540771128

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings

PB - Springer Verlag

Y2 - 17 December 2007 through 20 December 2007

ER -

Peleg D. Time-efficient broadcasting in radio networks: A review. In Distributed Computing and Internet Technology - 4th International Conference, ICDCIT 2007, Proceedings. Springer Verlag. 2007. p. 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-77115-9_1

Time-efficient broadcasting in radio networks: A review

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this