Weak Communication in Radio Networks

  • Tomasz Jurdziński
  • Mirosław Kutyłowski
  • Jan Zatopiański
Conference paper

DOI: 10.1007/3-540-45706-2_137

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2400)
Cite this paper as:
Jurdziński T., Kutyłowski M., Zatopiański J. (2002) Weak Communication in Radio Networks. In: Monien B., Feldmann R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg

Abstract

Quite often algorithms designed for no-collision-detection radio networks use a hidden form of collision detection: it is assumed that a station can simultaneously send and listen. Then, if it cannot hear its own message, then apparently a collision has occurred. IEEE Standard 802.11 says that a station can either send or listen to a radio channel, but not both. So we consider a weak radio network model with no collision detection where a station can either send or receive signals. Otherwise we talk about strong model.

We show that power of weak and strong radio networks differ substantially in deterministic case. On the other hand, we present an efficient simulation of strong by weak ones, with randomized preprocessing of O(n) steps and O(loglogn) energy cost.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Tomasz Jurdziński
    • 1
    • 2
  • Mirosław Kutyłowski
    • 3
    • 4
  • Jan Zatopiański
    • 2
  1. 1.Institute of Computer ScienceTechnical University of ChemnitzGermany
  2. 2.Institute of Computer ScienceWroclaw UniversityPoland
  3. 3.Institute of MathematicsWrocław University of TechnologyPoland
  4. 4.Dept. of Math. and Computer ScienceA. Mickiewicz UniversityPoznańPoland

Personalised recommendations