Skip to main content
SpringerLink
Log in

Localized Algorithms and Their Applications in Ad Hoc Wireless Networks

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

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

Abstract

An ad hoc wireless network is a special type of wireless multihop network without infrastructure or centralized administration. As a result of the mobility of their nodes, ad hoc wireless networks are characterized by dynamically changing topologies. A localized algorithm is a special distributed algorithm where each node performs an exceedingly simple task based on local information, with no information sequentially propagated globally in the network. The importance of localized algorithms is their scalability in mobile environments. Decisions made based on localized algorithms are adjustable to the change (such as a topological one) due to the mobile node. We discuss a generic framework that can capture many existing localized broadcast algorithms in ad hoc wireless networks. The framework can easily integrate other objectives such as energy-efficient design and reliability that ensures broadcast coverage. In addition, the framework is extensible to cover other collective communication, which includes one-to-many (multicasting), all-to-one (reduction or aggregation), and all-to-all (gossiping).

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. K. M. Alzoubi, P. J. Wan, and O. Prieder. Distributed heuristics for connected dominating sets in wireless ad hoc networks. Journal of Communications and Networks. 4,(1), Mar. 2002, 22–29.

    Google Scholar 

  2. S. Butenko, X. Cheng, D. Z. Du, and P. Pardalos. On the construction of virtual backbone for ad hoc wireless networks. Proc. of the 2nd Conference on Cooperative Control and Optimization, 2002, 43–54.

    Google Scholar 

  3. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics. 86, 1990, 165–177.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Dai and J. Wu. Distributed dominant pruning in ad hoc wireless networks. Technical report. accepted to appear in Proc. of ICC’03, 2003.

    Google Scholar 

  5. J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks: An Engineering Approach. IEEE Computer Society Press. 1997.

    Google Scholar 

  6. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. Proc. of ACM MOBICOM’99. 1999, 263–270.

    Google Scholar 

  7. Z. J. Haas, J. Y. Halpern, and L. Li. Gossip-based ad hoc routing. Proc. of IEEE INFOCOM’02. 3, 2002, 1707–1716.

    Google Scholar 

  8. D. B. Johnson and D. A. Malts. Dynamic source routing in ad-hoc wireless networks. In T. Imielinski, H. Korth, editor, Mobile Computing. Kluwer Academic Publishers. 1996, 153–181.

    Google Scholar 

  9. H. Lim and C. Kim. Flooding in wireless ad hoc networks. Computer Communications Journal. 24,(3–4), 2001, 353–363.

    Article  Google Scholar 

  10. W. Lou and J. Wu. On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile Computing. 1,(2), April–June 2002, 111–122.

    Article  Google Scholar 

  11. V. D. Park and M. S. Corson. Temporally-ordered routing algorithm (TORA) version 1: Functional specification. Internet Draft, 1997.

    Google Scholar 

  12. M. R. Pearlman and Z. J. Haas. Determining the optimal configuration of the zone routing protocol. IEEE Journal on Selected Areas in Communications. 17,(8), Feb. 1999, 1395–1414.

    Article  Google Scholar 

  13. W. Peng and X. Lu. On the reduction of broadcast redundancy in mobile ad hoc networks. Proc. of ACM MOBIHOC’00. 2000, 129–130.

    Google Scholar 

  14. C. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. Proc. of the 2nd IEEE WMCSA. 1999, 90–100.

    Google Scholar 

  15. C. E. Perkins. Ad Hoc Networks. Addison Wesley, 2001.

    Google Scholar 

  16. A. Qayyum, L. Viennot, and A. Laouiti. Multipoint relaying for flooding broad cast message in mobile wireless networks. Proc. of the 35th Hawaii International Conference on System Science (HICSS-35). 2002, (CD-ROM).

    Google Scholar 

  17. I. Stojmenovic, S. Seddigh, and J. Zunic. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems. 13,(1), Jan. 2002, 14–25.

    Article  Google Scholar 

  18. J. Sucec and I. Marsic. An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks. CAIP Technical Report 248, Rutgers University, Sept. 2000.

    Google Scholar 

  19. Y. C. Tseng, S. Y. Ni, Y. S. Chen, and J. P. Sheu. The broadcast storm problem in a mobile ad hoc network. Wireless Networks. 8,(2–3), Mar.–May 2002, 153–167.

    Article  MATH  Google Scholar 

  20. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On constructing minimum spanning trees in k-dimensional spaces and related problems. Proc. of IEEE INFOCOM’00. 2000, 585–594.

    Google Scholar 

  21. B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. Proc. of ACM MOBIHOC’02. 2002, 194–205.

    Google Scholar 

  22. J. Wu and F. Dai. Broadcasting in ad hoc networks based on self-pruning. Proc. of IEEE INFOCOM’03, 2003.

    Google Scholar 

  23. J. Wu and F. Dai. A generic distributed broadcast scheme in ad hoc wireless net works. accepted to appear in Proc. of IEEE Int’l Conf. on Distributed Computing Systems (ICDCS), 2003.

    Google Scholar 

  24. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’99). 1999, 7–14.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, 33431

    Jie Wu

Authors
  1. Jie Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima, 965-8580, Japan

    Minyi Guo

  2. Department of Computer Science, St. Francis Xavier University, Antigonish, NS, B2G 2W5, Canada

    Laurence Tianruo Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, J. (2003). Localized Algorithms and Their Applications in Ad Hoc Wireless Networks. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation