Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2007: Algorithms and Computation pp 220–231Cite as

Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4835))

Abstract

We study the complexity of distributed protocols for the classical information dissemination problem of distributed gossiping. We consider the model of random geometric networks, one of the main models used to study properties of sensor and ad-hoc networks, where n points are randomly placed in a unit square and two points are connected by an edge/link if they are at at most a certain fixed distance r from each other. To study communication in the network, we consider the ad − hoc radio networks model of communication. We examine various scenarios depending on the local knowledge of each node in the networks, and show that in many settings distributed gossiping in asymptotically optimal time \({\mathcal{O}}(D)\) is possible, where D is the diameter of the network and thus a trivial lower bound for any communication.

Research supported in part by the Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick.

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

Learn about 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 and System Sciences 45(1), 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Capkun, S., Hamdi, M., Hubaux, J.-P.: GPS-free positioning in mobile ad hoc networks. Cluster Computing 5(2), 157–167 (2002)

    Article  Google Scholar 

  3. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science 302, 337–364 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chlebus, B.S., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1), 27–38 (2002)

    Article  Google Scholar 

  5. Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Average-time coplexity of gossiping in radio networks. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 253–267. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms 60(2), 115–143 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Czumaj, A., Wang, X.: Communication problems in random line-of-sight ad-hoc radio networks. In: Proc 4th Symposium on Stochastic Algorithms, Foundations, and Applications (SAGA), pp. 70–81 (2007)

    Google Scholar 

  9. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5(1), 187–201 (2007)

    Article  MathSciNet  Google Scholar 

  10. Elsässer, R., Ga̧sieniec, L.: Radio communication in random graphs. Journal of Computer and System Sciences 72, 490–506 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ga̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th PODC, pp. 129–137 (2005)

    Google Scholar 

  12. Ga̧sieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 397–407. Springer, Heidelberg (2004)

    Google Scholar 

  13. Giordano, S., Stojmenovic, I.: Position based ad hoc routes in ad hoc networks. In: Handbook of Ad Hoc Wireless Networks. ch. 16, pp. 1–14 (2003)

    Google Scholar 

  14. Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pp. 547–566 (1998)

    Google Scholar 

  15. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory IT-46, 388–404 (2000)

    Article  MathSciNet  Google Scholar 

  16. Ko, Y.B., Vaidya, N.H.: Location aided routing (LAR) in mobile adhoc networks. In: Proc 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pp. 66–75 (1998)

    Google Scholar 

  17. Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1), 43–57 (2005)

    Article  Google Scholar 

  18. Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19(3), 185–195 (2007)

    Article  Google Scholar 

  19. Li, X., Shi, H., Shang, Y.: A partial-range-aware localization algorithm for Ad-hoc wireless sensor networks. In: Proc. 29th Annual IEEE International Conference on Local Computer Networks (2004)

    Google Scholar 

  20. Nasipuri, A., Li, K., Sappidi, U.R.: Power consumption and throughput in mobile ad hoc networks using directional antennas. In: Proc. 11th IEEE International Conf. on Computer Communications and Networks (ICCCN), pp. 620–626 (2002)

    Google Scholar 

  21. Penrose, M.D.: Random Geometric Graphs. Oxford University Press, UK (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Warwick, Coventry CV4 7AL, United Kingdom

    Artur Czumaj

  2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102-1982, USA

    Xin Wang

Authors
  1. Artur Czumaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czumaj, A., Wang, X. (2007). Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77120-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77118-0

  • Online ISBN: 978-3-540-77120-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation