Deterministic Radio Broadcasting

Chlebus, Bogdan S.; Gąsieniec, Leszek; Östlin, Anna; Robson, John

doi:10.1007/3-540-45022-x_60

Cited by 95 publications

(74 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A general Ω(D log n) lower bound is proven in [9], even for the case where D = Ω(n), while a trivial upper bound is O(n 2 ). In a sequence of works [10,11,15,17] the upper bound has been improved to O(n log 2 n) [15]. Other deterministic protocols include [8,22].…”

Section: Introductionmentioning

confidence: 99%

Centralized broadcast in multihop radio networks

Gaber

Mansour

2003

Journal of Algorithms

128

108

View full text Add to dashboard Cite

We show that for any radio network there exists a schedule of a broadcast whose time is O(D + log 5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D = Ω(log 5 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.

show abstract

Section: Introductionmentioning

confidence: 99%

Centralized broadcast in multihop radio networks

Gaber

Mansour

2003

Journal of Algorithms

128

108

View full text Add to dashboard Cite

show abstract

“…Hence, in a fault-prone situation, it is impossible to use broadcasting algorithms which are designed for fault-free networks and which rely on the knowledge of topology, such as, e.g, [6,11]. However, the question arises if broadcasting algorithms designed for fault-free networks of unknown topology [2,8,9] should be used in a potentially faulty known network. The answer seems to depend on whether we allow randomization.…”

Section: Previous Workmentioning

confidence: 98%

Fault-Tolerant Broadcasting in Radio Networks

Kranakis

Kriz̧anc

Pełc

2001

Journal of Algorithms

View full text Add to dashboard Cite

“…It is shown by Clementi et al [6] that any deterministic broadcasting algorithms for general unknown network require time. Chlebus et al [4] give an algorithm with running time ; Chrobak et al [5] design an almost optimal algorithm of running time ; and the best known algorithm is given by Czumaj and Rytter which runs in time [7].…”

Section: Related Workmentioning

confidence: 99%