Skip to main content
SpringerLink
Log in

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

  • Published:
Distributed Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Summary

This paper presents an efficient randomized emulation ofsingle-hop radio networkwith collision detection onmulti-hop radio networkwithout collision detection. Each step of the single-hop network is emulated by\(O\left( {\left( {D + \log \frac{n}{\varepsilon }} \right)\log \Delta } \right)\) 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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon N, Bar-Noy A, Linial N, Peleg D: On the complexity of radio communication. 21st STOC (1989) pp 274–285

  2. Bar-Yehuda R, Goldreich O, Itai A: On the time complexity of braodcast in radio networks: an exponential gap between determinism and randomization. 6th Symp on Principles of Distributed Systems (August 1987). To appear in J Comp Syst Sci

  3. Bar-Yehuda R, Israeli A, Itai A: Multiple communication in multi-hop radio networks. 8th Symp on Principles of Distributed Systems (August 1989). To appear in SIAM J Comp

  4. Chlamtac I, Kutten S: On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans Commun COM 33 (12):389–394 (1985)

    Google Scholar 

  5. Chlamtac I, Weinstein O: The wave expansion approach to broadcasting in multihop radio networks. INFOCOM (April 1987)

  6. Digital-Intel-Xerox: The Ethernet data link layer and physical layer specification 1.0. (September 1980)

  7. Gallager R: A perspective on multiaccess channels. IEEE Trans Inf Theory IT 31:124–142 (1985)

    Article  Google Scholar 

  8. Roberts LG: Aloha packet system with an without slots and capture. ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute, Stanford, June 1972

    Google Scholar 

  9. Tanenbaum AC: Computer Networks. Prentice-Hall 1981

  10. Weinstein O: The wave expansion approach to braodcasting in multihop radio networks. M.Sc. Thesis, Computer Science Department, Technion, Haifa, Israel 1987

    Google Scholar 

  11. Willard DE: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J Comput 15(2):468–477 (1986)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion-Israel Institute of Technology, 32000, Haifa, Israel

    Reuven Bar-Yehuda, Oded Goldreich & Alon Itai

Authors
  1. Reuven Bar-Yehuda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oded Goldreich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alon Itai
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Reuven Bar-Yehuda was born in Iran, on July 17th 1951. Received B.A., M.Sc., and D.Sc. in Computer Science from the Technion — Israel Institute of Technology, Haifa, Israel, in 1978, 1980, and 1983, respectively. He is currently a Senior Lecturer of Computer Science at the Technion. From 1984 to 1986, he was a visiting assistant professor in the Computer Science Dept. at the Duke Univesity His research interests include computational geometry, VLSI, graph algorithms and distributed algorithms.

Oded Goldreich was born in Tel-Aviv, Israel, on February 4th 1957. Received B.A., M.Sc., and D.Sc. in Computer Science from the Technion — Israel Institute of Technology, Haifa, Israel, in 1980, 1982, and 1983, respectively. He is currently an Associate Professor of Computer Science at the Technion. From 1983 to 1986, he was a postdoctoral fellow at MIT's Laboratory for Computer Science. His research interests include cryptography and related areas, relation between randomness and algorithms, and distributed computation.

Alon Itai was born in Scotland, on December 12th 1946. Received B.Sc. in Mathematics from the Hebrew University in Jerusalem in 1969. M.Sc., and Ph.D. in Computer Science from the Weizmann Institute of Science, Rehovot, Israel in 1971 and 1976. He is currently an Associate Professor of Computer Science at the Technion. His research interests include randomized and distributed algorithms, computational learning theory and performance evaluation.

The second author was partially supported by grant No. 86-00301 from the United States—Israel Bi-national Science Foundation BSF), Jerusalem, Israel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bar-Yehuda, R., Goldreich, O. & Itai, A. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distrib Comput 5, 67–71 (1991). https://doi.org/10.1007/BF02259748

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02259748

Key words

Search

Navigation