Skip to main content
SpringerLink
Log in
Book cover

International Conference on High-Performance Computing

HiPC 2003: High Performance Computing - HiPC 2003 pp 130–141Cite as

On Shortest Path Routing Schemes for Wireless Ad Hoc Networks

  • Conference paper

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

Abstract

In this paper, we propose two new distributed algorithms for producing sets of nodes that can be used to form backbones of an ad hoc wireless network. Our focus is on producing small sets that are d-hop connected and d-hop dominating and have a desirable ‘shortest path property’. These algorithms produce sets that are considerably smaller than those produced by an algorithm previously introduced by the authors. One of these two new algorithms has constant-time complexity.

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. Alon, N., Spencer, J.: The Probabilistic Method. John Wiley & Sons, Chichester (2000)

    Book  MATH  Google Scholar 

  2. Johnson, D.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences 9, 256–278 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  3. Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, August 2001, pp. 33–42 (2001)

    Google Scholar 

  4. Lovász, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics 13, 383–390 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  5. Liang, B., Haas, Z.J.: Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management. In: Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. INFOCOM, vol. 3, pp. 1293–1302 (2000)

    Google Scholar 

  6. Rieck, M.Q., Pai, S., Dhar, S.: Distributed Routing Algorithms for Wireless Ad Hoc Networks Using d-hop Connected d-hop Dominating Sets. In: Proceedings of the 6th Intl Conference on High Performance Computing in Asia Pacific, vol. 2, pp. 443–450 (2003)

    Google Scholar 

  7. Wu, J., Li, H.: A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Special issue on Wireless Networks in the Telecommunication Systems Journal 3, 63–84 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. San Jośe State University, San Jośe, CA, 95192, USA

    Subhankar Dhar

  2. Drake University, Des Moines, Iowa, 50311, USA

    Michael Q. Rieck

  3. Microsoft Corporation, Mountain View, CA, 94043, USA

    Sukesh Pai

Authors
  1. Subhankar Dhar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Q. Rieck
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sukesh Pai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Southern California, CA 90089-2562, Los Angeles

    Timothy Mark Pinkston

  2. Department of Electrical Engineering, University of Southern California, CA 90089-2562, Los Angeles, USA

    Viktor K. Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dhar, S., Rieck, M.Q., Pai, S. (2003). On Shortest Path Routing Schemes for Wireless Ad Hoc Networks. In: Pinkston, T.M., Prasanna, V.K. (eds) High Performance Computing - HiPC 2003. HiPC 2003. Lecture Notes in Computer Science, vol 2913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24596-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24596-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20626-2

  • Online ISBN: 978-3-540-24596-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation