Skip to main content

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

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 392))

Included in the following conference series:

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+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.

Partially supported by Technion V.P.R. Fund — Albert Einstein Research Fund.

Partially supported by grant No. 86-00301 from the United States — Israel Bi-national Science Foundation (BSF), Jerusalem, Israel.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Bar-Yehuda R., Goldreich O. and Itai A., "On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization", 6th Symposium on Principles of Distributed Systems, (Aug. 1987).

    Google Scholar 

  3. Bar-Yehuda R., Israeli A. and Itai A., Multiple Communication in Multi-Hop Radio Networks, 8th Symposium on Principles of Distributed Systems, (Aug. 1989).

    Google Scholar 

  4. Chlamtac, I. and Kutten, S., "On Broadcasting in Radio Networks-Problem Analysis and Protocol Design", December (1985), Vol COM-33, No. 12.

    Google Scholar 

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

    Google Scholar 

  6. Digital-Intel-Xerox, "The Ethernet data link layer and physical layer specification 1.0" (Sept. 1980).

    Google Scholar 

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

    Google Scholar 

  8. Weinstein O., "The wave expansion approach to broadcasting in multihop radio networks", M.Sc. Thesis, Computer Science Dept., Technion, Haifa, Israel, (1987).

    Google Scholar 

  9. Willard D.E., "Log-logarithmic selection resolution protocols in a multiple access channel", SIAM J. on Comput. 15(2), 468–477, (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jean-Claude Bermond Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-51687-5_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51687-3

  • Online ISBN: 978-3-540-46750-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics