Skip to main content
SpringerLink
Log in

Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks

  • Conference paper
Algorithm Theory - SWAT 2004 (SWAT 2004)

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

Included in the following conference series:

Abstract

We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n 4/3log4 n). The algorithm allows the labels (identifiers) of the nodes to be polynomially large in n, and is based on a novel way of using selective families. The previous best general (i.e., dependent only on n) deterministic upper bounds were O(n 5/3log3 n) for networks with polynomially large node labels [1], and O(n 3/2log2 n) for networks with linearly large node labels [2,3,4].

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ga̧sieniec, L., Pagourtzis, A., Potapov, I.: Deterministic communication in radio networks with large labels. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 512–524. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Chrobak, M., Ga¸sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43, 177–189 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ga̧sieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters 83, 89–94 (2002)

    Article  MathSciNet  Google Scholar 

  4. Xu, Y.: An o(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica 36, 93–96 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chlebus, B., Ga̧sieniec, L., Ostlin, A., Robson, M.: Deterministic radio broadcasting. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 717–728. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 709–718. ACM/SIAM (2001)

    Google Scholar 

  7. Chlebus, B., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 861–870. ACM/SIAM (2000)

    Google Scholar 

  8. Marco, G.D., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters 79, 53–56 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brusci, D., Pinto, M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10, 129–135 (1997)

    Article  Google Scholar 

  10. Christersson, M., Ga̧sieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 377–389. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 340–349. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 492–501. IEEE Computer Society, Los Alamitos (2003)

    Chapter  Google Scholar 

  13. Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proc. 6th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 1995), pp. 577–585. ACM/SIAM (1995)

    Google Scholar 

  14. Diks, K., Kranakis, E., Pelc, A.: The impact of knowledge on broadcasting time in radio networks. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 41–52. Springer, Heidelberg (1999)

    Google Scholar 

  15. Ga̧sieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proc. 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), Information Processing,vol. 223, pp. 193–205. Kluwer, Dordrecht (2002)

    Google Scholar 

  16. Bonis, A.D., Ga̧sieniec, L., Vaccaro, U.: Generalized framework for selectors with applications in optimal group testing. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 81–96. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK

    Leszek Gąsieniec & Qin Xin

  2. Department of Computer Science, King’s College London, London, WC2R 2LS, UK

    Tomasz Radzik

Authors
  1. Leszek Gąsieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomasz Radzik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qin Xin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

  2. Department of Computing, University of Copenhagen, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gąsieniec, L., Radzik, T., Xin, Q. (2004). Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27810-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22339-9

  • Online ISBN: 978-3-540-27810-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation