Skip to main content

An Efficient Leader Election Algorithm for Mobile Ad Hoc Networks

  • Conference paper

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

Abstract

Nodes communicate under peer-to-peer level in ad-hoc mobile networks. To manage the inter-node communication and data exchange among them a leader node is required. In this paper we present a leader election algorithm for distributed mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes along with the correctness of the algorithm. The algorithm uses least amount of wireless resources and does not affect the movement of the nodes.

This is a preview of subscription content, log in via an institution.

Buying options

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. Haas, Z.J., Pearlman, M.R.: The Zone Routing Protocol (ZRP) for Ad Hoc Networks, Internet Draft, draft-ietf-manet-zone-zrp-02.txt (June 1999)

    Google Scholar 

  2. Hatzis, K.P., Pentaris, G.P., Spirakis, P.G., Tampakas, V.B., Tan, R.B.: Fundamental Control Algorithms in Mobile Networks. In: Proc. 11th Annual ACM Symp. on Parallel Algorithms And Architectures

    Google Scholar 

  3. Malpani, N., Welch, J.L., Vaidya, N.H.: Leader Election Algorithms for Mobile Ad Hoc Networks. In: Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston (August 2000)

    Google Scholar 

  4. Royer, E.M., Perkins, C.E.: Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol. In: Proceedings of MobiCom 1999, Seattle, WA, pp. 207–218 (August 1999)

    Google Scholar 

  5. Cheng, C., Kumar, S.P.R.: A loopfree spanning tree protocol in Dynamic topology. In: Proc. 27th Annual Allerton Conference on Communication, Control and Computing, pp. 594–595 (September 1989)

    Google Scholar 

  6. Park, V.D., Corson, M.S.: A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In: Proc. IEEE INFOCOM, April 7-11 (1997)

    Google Scholar 

  7. Acharya, A., Badrinath, B.R., Imielinski, T.: Impact of mobility on distributed computations. Operating Systems Review (April 1993)

    Google Scholar 

  8. Acharya, A., Badrinath, B.R., Imielinski, T.: Structuring distributed algorithms for mobile hosts. In: Proc. Of 14th International Conference on distributed computing systems (June 1994)

    Google Scholar 

  9. Haas, Z.J., Tabrizi, S.: On Some Challenges and Design Choices in Ad-Hoc Communications. In: IEEE MILCOM 1998, Bedford, MA, October 18-21 (1998)

    Google Scholar 

  10. Tsirigos, A., Haas, Z.J.: Multipath Routing in Mobile Ad Hoc Networks or How to Route in the Presence of Topological Changes. In: IEEE MILCOM 2001, Tysons Corner, VA, October 28-31 (2001)

    Google Scholar 

  11. Haas, J., Liang, B.: Ad-Hoc Mobility Management with Randomized Database Groups. In: IEEE ICC 1999, Vancouver, BC, Canada, June 6-10 (1999)

    Google Scholar 

  12. Haas, Z.J., Pearlman, M.R.: The Performance of Query Control Schemes for the Zone Routing Protocol. In: ACM DialM 1999, Seattle, WA, August 20 (1999)

    Google Scholar 

  13. Liang, B., Haas, Z.J.: Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management. In: IEEE INFOCOM 2000, Tel Aviv, Israel, March 26-30 (2000)

    Google Scholar 

  14. LeLann, G.: Distributed Systems: Towards a formal approach. In: Gilchrist, B. (ed.) Proc. Information Processing 1977, North-Holland, Amsterdam (1977)

    Google Scholar 

  15. Fall, K., Varadhan, K.: NS user manual, “The VINT project”. A Collaboration between researches at UC Berkeley, LBL, USC/ISI, and Xerox PARC

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parvathipuram, P., Kumar, V., Yang, GC. (2004). An Efficient Leader Election Algorithm for Mobile Ad Hoc Networks. In: Ghosh, R.K., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2004. Lecture Notes in Computer Science, vol 3347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30555-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30555-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24075-4

  • Online ISBN: 978-3-540-30555-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics