Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
- 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
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).
Unable to display preview. Download preview PDF.