Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Computing

IWDC 2004: Distributed Computing - IWDC 2004 pp 459–470Cite as

Broadcast and Gossiping Algorithms for Mobile Ad Hoc Networks Based on Breadth-First Traversal

  • Conference paper

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

Abstract

We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n + D)Dlog n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sinha, K.: Deterministic Broadcast and Gossiping in Ad hoc Networks, MS Thesis, Clemson University, South Carolina, USA (August 2003)

    Google Scholar 

  2. Sinha, K., Srimani, P.K.: Broadcast algorithms for mobile ad hoc networks based on depth-first traversal. In: Proc. Third International Workshop on Wireless Information Systems (WIS), Porto. Portugal, April 13-14, 2004, pp. 170–177 (2004)

    Google Scholar 

  3. 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. J. computer and System Sci. 45, 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Basagni, S., Bruschi, D., Chlamtac, I.: A mobility transparent deterministic broadcast mechanism for ad hoc networks. IEEE Trans. Networking 7, 799–807 (1999)

    Article  Google Scholar 

  5. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Communications 39, 426–433 (1999)

    Article  Google Scholar 

  6. Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proc. of SODA 2000, pp. 861–870 (2000)

    Google Scholar 

  7. Chlebus, B., Gasieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad hoc radio networks. In: Proc. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2001), pp. 44–51 (2001)

    Google Scholar 

  8. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st IEEE Symp. Found. of Computer Science (FOCS 2000), pp. 575–581 (2000)

    Google Scholar 

  9. Chrobak, M., Gąsieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 483–492. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed multi-broadcast in unknown radio networks. In: Proc. 20th ACM Symp. on Principles of Distributed Computing (PODC 2001), pp. 255–263 (2001)

    Google Scholar 

  11. Clementi, A.E.F., Monti, A., Silvestri, R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 452–463. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  14. Gasieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters 83, 89–93 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 697–704 (2002)

    Google Scholar 

  16. Kushilevitz, E., Mansour, Y.: An \(\Omega(D\log \ n/D)\) lower bound for broadcast in radio networks. SIAM J. Computing 27, 707–712 (1998)

    Google Scholar 

  17. Nakano, K., Olariu, S.: Randomized initialization protocols for ad-hoc networks. IEEE Trans. Parallel and Distributed Systems 11, 749–759 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Arizona, Tucson, AZ, 85719, USA

    Koushik Sinha

  2. Department of Computer Science, Clemson University, Clemson, SC, 29634, USA

    Pradip K. Srimani

Authors
  1. Koushik Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pradip K. Srimani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Informatics, Arizona State University, 85287, Tempe, AZ,  

    Arunabha Sen

  2. Indian Statistical Institute, Kolkata,  

    Nabanita Das

  3. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, 76019, Arlington, TX, USA

    Sajal K. Das

  4. ACM Unit, Indian Statistical Institute, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sinha, K., Srimani, P.K. (2004). Broadcast and Gossiping Algorithms for Mobile Ad Hoc Networks Based on Breadth-First Traversal. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30536-1_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24076-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation