This paper presents an efficient randomized emulation of single-hop radio network with collision detection on multi-hop radio network without collision detection. Each step of the single-hop network is emulated by O((D+logn/ε)logΔ) rounds of the multi-hop network and succeeds with probability ≥1−ɛ. (n is the number of processors, D the diameter and Δ the maximum degree). It is shown how to emulate any polynomial algorithm such the probability of failure remains ≤ɛ. A consequence of the emulation is an efficient randomized algorithm for choosing a leader in a multi-hop network.
CITATION STYLE
Bar-Yehuda, R., Goldreich, O., & Itai, A. (1989). Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 392 LNCS, pp. 24–32). Springer Verlag. https://doi.org/10.1007/3-540-51687-5_29
Mendeley helps you to discover research relevant for your work.