Adversary Immune Size Approximation of Single-Hop Radio Networks

  • J̧edrzej Kabarowski
  • Mirosław Kutyłowski
  • Wojciech Rutkowski
Conference paper

DOI: 10.1007/11750321_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)
Cite this paper as:
Kabarowski J., Kutyłowski M., Rutkowski W. (2006) Adversary Immune Size Approximation of Single-Hop Radio Networks. In: Cai JY., Cooper S.B., Li A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg

Abstract

We design a time and energy efficient algorithm concerning size approximation for single-hop radio networks. The most important feature of the algorithm is that it is immune against an adversary that may scramble a certain number of communication steps. The previous algorithms presented in the literature provide false estimations if an adversary causes certain communication collisions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J̧edrzej Kabarowski
    • 1
  • Mirosław Kutyłowski
    • 1
  • Wojciech Rutkowski
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of Technology 

Personalised recommendations