Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

  • Authors:
  • Reuven Bar-Yehuda;Oded Goldreich;Alon Itai

  • Affiliations:
  • Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel;Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel;Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel

  • Venue:
  • Distributed Computing
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 + log n/ε) log Δ) rounds of 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 that the probability of failure remains ≥ ε. A consequence of the emulation is an efficient randomized algorithm for choosing a leader in a multi-hop network.