Centralized broadcast in multihop radio networks

Iris Gaber; Yishay Mansour

doi:10.1016/S0196-6774(02)00292-4

Centralized broadcast in multihop radio networks

Iris Gaber
, Yishay Mansour^*

^*Corresponding author for this work

School of Computer Science and AI

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

82 Scopus citations

Abstract

We show that for any radio network there exists a schedule of a broadcast whose time is O(D+log⁵ n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = Ω(log⁵ n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.

Original language	English
Pages (from-to)	1-20
Number of pages	20
Journal	Journal of Algorithms
Volume	46
Issue number	1
DOIs	https://doi.org/10.1016/S0196-6774(02)00292-4
State	Published - Jan 2003

Keywords

Algorithms
Broadcast
Radio networks

Access to Document

10.1016/S0196-6774(02)00292-4

Cite this

@article{18f552a325ef4d67b7bdcae41767d3d0,

title = "Centralized broadcast in multihop radio networks",

abstract = "We show that for any radio network there exists a schedule of a broadcast whose time is O(D+log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.",

keywords = "Algorithms, Broadcast, Radio networks",

author = "Iris Gaber and Yishay Mansour",

year = "2003",

month = jan,

doi = "10.1016/S0196-6774(02)00292-4",

language = "אנגלית",

volume = "46",

pages = "1--20",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - Centralized broadcast in multihop radio networks

AU - Gaber, Iris

AU - Mansour, Yishay

PY - 2003/1

Y1 - 2003/1

N2 - We show that for any radio network there exists a schedule of a broadcast whose time is O(D+log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.

AB - We show that for any radio network there exists a schedule of a broadcast whose time is O(D+log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the rest of the network.

KW - Algorithms

KW - Broadcast

KW - Radio networks

UR - https://www.scopus.com/pages/publications/0037222272

U2 - 10.1016/S0196-6774(02)00292-4

DO - 10.1016/S0196-6774(02)00292-4

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0037222272

SN - 0196-6774

VL - 46

SP - 1

EP - 20

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -

Centralized broadcast in multihop radio networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this