Energy-Efficient Size Approximation of Radio Networks with No Collision Detection

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

DOI: 10.1007/3-540-45655-4_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2387)
Cite this paper as:
Jurdziński T., Kutyłowski M., Zatopiański J. (2002) Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. In: Ibarra O.H., Zhang L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg

Abstract

Algorithms for radio networks are studied in two scenarios: (a) the number of active stations is known (or approximately known) (b) the number of active stations is unknown. In the second (more realistic) case it is much harder to design efficient algorithms. For this reason, we design an efficient randomized algorithm for a single-hop radio network that approximately counts the number of its active stations. With probability higher than 1 - 1/n, this approximation is within a constant factor, the algorithm runs in poly-logarithmic time and its energy cost is o(loglogn). This improves the previous O(logn) bound for energy. In particular, our algorithm can be applied to improve energy cost of known leader election and initialization protocols (without loss of time efficiency).

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
  • Jan Zatopiański
    • 2
  1. 1.Institute of Computer ScienceTechnical University ChemnitzUSA
  2. 2.Institute of Computer ScienceWrocław UniversityUSA
  3. 3.Institute of MathematicsWrocław University of TechnologyUSA

Personalised recommendations