Adversary Immune Size Approximation of Single-Hop Radio Networks
- 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
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.
Unable to display preview. Download preview PDF.