Skip to main content
SpringerLink
Log in

An Ω-Based Leader Election Algorithm for Mobile Ad Hoc Networks

  • Conference paper
Book cover Networked Digital Technologies (NDT 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 293))

Included in the following conference series:

Abstract

Leader election is a fundamental control problem in both wired and wireless systems. The classical statement of the leader election problem in distributed systems is to eventually elect a unique leader from a fixed set of nodes. However, in MANETS, many complications may arise due to frequent and unpredictable topological changes. This paper presents a leader election algorithm based on the omega failures detector, where inter-node communication is allowed only among the neighboring nodes along with proofs of correctness. This algorithm ensures that every connected component of the mobile ad hoc network will eventually elect a unique leader, which is the node of the highest priority value from among all nodes within that connected component. The algorithm can tolerate intermittent failures, such as link failures, network partitions, and merging of connected network components.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chettibi, S., Chikhi, S.: Adaptivity condition as the extended Reinforcement Learning for MANETs. Journal of Networking Technology, 122–129 (2011)

    Google Scholar 

  2. Sharma, R.K., Sharma, P.: Data Divergence with Consistency Based Replication in MANETs. Journal of Networking Technology, 157–164 (2010)

    Google Scholar 

  3. Melit, L., Badache, N.: An Energy Efficient Leader Election Algorithm for Mobile Ad Hoc Networks. In: Proceeding of the 10th International Symposium on Programming and Systems, pp. 54–59 (2011)

    Google Scholar 

  4. Vasudevan, S., Kurose, J., Towsley, D.: Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols, pp. 350–360 (2004)

    Google Scholar 

  5. Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of ACM, 225–267 (1996)

    Google Scholar 

  7. Hatzis, K.-P., Pentaris, G.-P., Spirakis, P.-G., Tampakas, V.-T., Tan, R.B.: Fundamental control algorithms in mobile networks. In: Proceeding of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 251–260 (1999)

    Google Scholar 

  8. Malpani, N., Welch, J., Vaidya, N.: Leader election Algorithms for Mobile Ad Hoc Networks. In: Proceedings of 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 93–103 (2000)

    Google Scholar 

  9. Velayutham, A., Chaudhuri, S.: Analysis of a leader election algorithm for mobile ad hoc networks. Technical report. Iowa State University (2003)

    Google Scholar 

  10. Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Transactions on Parallel and Distributed Systems 19(7), 926–939 (2008)

    Article  Google Scholar 

  11. Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: 16th IEEE INFOCOM, pp. 1405–1413 (1997)

    Google Scholar 

  12. Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Information Processing Letters, 1–4 (1980)

    Google Scholar 

  13. Masum, S.M., Ali, A.A., Bhuiyan, M.T.I.: Asynchronous leader election in mobile ad hoc networks. In: Proceedings of the 20th International Conference on Advanced Information Networking and Applications, pp. 827–831 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Jijel University, Algeria

    Leila Melit

  2. Laboratory of Computer Systems, USTHB, Algiers, Algeria

    Nadjib Badache

Authors
  1. Leila Melit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nadjib Badache
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Engineering, Faculty of Engineering, Lakehead University, 955 Oliver Rd., P7B 5E1, Thunder Bay, Ontario, Canada

    Rachid Benlamri

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Melit, L., Badache, N. (2012). An Ω-Based Leader Election Algorithm for Mobile Ad Hoc Networks. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30507-8_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30506-1

  • Online ISBN: 978-3-642-30507-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation