Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2387))

Included in the following conference series:

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).

partially supported by KBN, grant 8T11C 04419 and DFG, grant GO 493/1-1, and AXIT Polska

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. Journal of Computer Systems Sciences 45(1) (1992), 104–126

    Article  MATH  MathSciNet  Google Scholar 

  2. Bordim, J.L., Cui, J., Hayashi, T., Nakano, K., Olariu, S.: Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. ISAAC’99, LNCS 741, Springer-Verlag, 1999, 215–224

    Google Scholar 

  3. Chlebus, B.S.: Randomized Communication in Radio Networks. A chapter in „Handbook on Randomized Computing” P. M. Pardalos, S. Rajasekaran, J. H. Reif, J. D. P. Rolim, (Eds.), Kluwer Academic Publishers, to appear

    Google Scholar 

  4. Chlamtac, I., Kutten, S.: On Broadcasting in Radio Networks-Problem Analysis and Protocol Design. IEEE Trans. on Commun. 33 (1985), 1240–1246

    Article  MATH  Google Scholar 

  5. Dessmark, A., Pelc, A.: Deterministic Radio Broadcasting at Low Cost. STACS’2001, LNCS 2010, Springer-Verlag, 158–169

    Google Scholar 

  6. Fifer, W.C., Bruno, F.J.: Low Cost Packet Radio. Proc. of the IEEE 75 (1987), 33–42

    Article  Google Scholar 

  7. Gçsieniec, L., Pelc, A., Peleg, D.: The Wakeup Problem in Synchronous Broadcast Systems. SIAM Journal on Discrete Math. 14(2) (2001), 207–222

    Article  Google Scholar 

  8. Gçsieniec, L., Lingas, A.: On Adaptive Deterministic Gossiping in Ad Hoc Radio Networks. ACM-SIAM SODA’ 2002

    Google Scholar 

  9. Gitman, I., Van Slyke, R.M., Frank, H.: Routing in Packet-Switching Broadcast Radio Networks. IEEE Trans. on Commun. COM-24 (1976), 926–930

    Article  Google Scholar 

  10. Hayashi, T., Nakano, K., Olariu, S.: Randomized Initialization Protocols for Packet Radio Networks. IPPS’1999, IEEE 1999, 544–548

    Google Scholar 

  11. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Weak Communication in Radio Networks. Euro-Par’2002, LNCS, Springer-Verlag (accepted paper)

    Google Scholar 

  12. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Efficient Algorithms for Leader Election in Radio Networks. ACM PODC’2002, (accepted paper)

    Google Scholar 

  13. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Energy-Efficient Size Approximation for Radio Networks with no Collision Detection. Technical Report CSR-02-02, Technische Universität Chemnitz, Fakultät für Informatik, http://www.tu-chemnitz.de/informatik/

  14. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, 1995

    Google Scholar 

  15. Nakano, K., Olariu, S.: Randomized Leader Election Protocols in Radio Networks with No Collision Detection. ISAAC’2000, LNCS 1969, Springer-Verlag, 362–373

    Google Scholar 

  16. Nakano, K., Olariu, S.: Energy Efficient Initialization Protocols for Radio Networks with no Collision Detection. ICPP’2000, IEEE 2000, 263–270

    Google Scholar 

  17. Nakano, K., Olariu, S.: Energy-Efficient Randomized Routing in Radio Networks. Proc. of 4th Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), 35–44

    Google Scholar 

  18. Salkintzis, A.K., Chamzas, C.: An In-band Power-saving Protocol for Mobile Data Networks. IEEE Trans. on Communication, COM-46 (1998), 1194-1205

    Google Scholar 

  19. Willard, D.E.: Log-logarithmic Selection Resolution Protocols in Multiple Access Channel. SIAM Journal on Computing 15 (1986), 468–477

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Technical University Chemnitz, USA

    Tomasz Jurdziński

  2. Institute of Computer Science, Wrocław University, USA

    Tomasz Jurdziński & Jan Zatopiański

  3. Institute of Mathematics, Wrocław University of Technology, USA

    Mirosław Kutyłowski

Authors
  1. Tomasz Jurdziński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mirosław Kutyłowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Zatopiański
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/3-540-45655-4_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation