Adversary Immune Size Approximation of Single-Hop Radio Networks

  • J̧edrzej Kabarowski
  • Mirosław Kutyłowski
  • Wojciech Rutkowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)


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.


Time Slot Energy Cost Size Approximation Collision Detection Leader Election 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bordim, J.L., Cui, J., Ishii, N., Nakano, K.: Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks. IEICE Transactions on Fundamentals 5, 967–976 (2002)Google Scholar
  2. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Energy-Efficient Size Approximation for Radio Networks with no Collision Detection. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 279–289. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Weak Communication in Single-Hop Radio Networks – Adjusting Algorithms to Industrial Standards. Concurrency and Computation: Practice & Experience 15, 1117–1131 (2003); Preliminary version in: Weak Communication in Radio Networks. Euro-Par 2002, Lecture Notes in Computer Science, vol. 2400 pp. 965-972 Springer-Verlag (2002)zbMATHCrossRefGoogle Scholar
  4. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Efficient Algorithms for Leader Election in Radio Networks. In: ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–57 (2002)Google Scholar
  5. Kabarowski, J., Kutyłowski, M., Rutkowski, W.: Low Bias Size Approximation of Single-Hop Radio Networks, technical reportGoogle Scholar
  6. Kutyłowski, J., Zagórski, F.: Reliable Broadcasting without Collision Detection in an Automotive Scenario. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 389–398. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. Kutyłowski, M., Rutkowski, W.: Adversary Immune Leader Election in ad hoc Radio Networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 397–408. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. Kutyłowski, M., Rutkowski, W.: Secure initialization in Single-Hop Radio Networks. In: Castelluccia, C., Hartenstein, H., Paar, C., Westhoff, D. (eds.) ESAS 2004. LNCS, vol. 3313, pp. 31–41. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. Nakano, K., Olariu, S.: Energy Efficient Initialization Protocols in Radio Networks with no Collision Detection. In: International Conference on Parallel Processing (ICPP), pp. 263–270. IEEE, Los Alamitos (2000)Google Scholar
  10. Nakano, K., Olariu, S.: Randomized Initialization Protocols for Ad-hoc Networks. Transactions on Parallel and Distributed Systems 11, 749–759 (2000)CrossRefGoogle Scholar
  11. Stojmenović, I. (ed.): Handbook of Wireless Networks and Mobile Computing. Wiley, Chichester (2002)Google Scholar

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