Advertisement

A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks

  • Romain Mellier
  • Jean-Frederic Myoupo
  • Vlady Ravelomanana
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 162)

Abstract

This paper presents a simple mutual exclusion algorithm for ad hoc mobile networks. Our algorithm does not use the token circulation technique. A station which requests a Critical Section (CS) competes in order to be alone to use the unique channel dedicated to this CS. To reach this goal, we derive a Markov process which guarantees that each station will enter the CS. More precisely, we show that, in presence of collision detection, n/ln2 broadcast rounds are necessary in the average case to satisfy n (n unknown) stations wishing to enter the same CS.

Keywords

Mutual Exclusion Ad Hoc Mobile Networks Wireless Networks 

References

  1. [Bertsekas and Gafni, 1981]
    Bertsekas, D. and Gafni, E. (1981). Distributed algorithms for generating loop-free routes in networks with frequently changing topology. In IEEE Transactions on Communications, C-29(1): 11–18.MathSciNetGoogle Scholar
  2. [Bose et al., 1999]
    Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J. (1999). Routing with guaranteed delivery in ad hoc wireless networks. In Proc. of 3rd ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications DIAL M99, Seattle, August 20, 1999, 48–55.Google Scholar
  3. [Chang et al., 1990]
    Chang, Y., Liu, M., and Singhal, M. (1990). A fault tolerant algorithm for distributed mutual exclusion. In Proc. of 9th IEEE Symp. On Reliable Distr. Systems, pp. 146–154.Google Scholar
  4. [Chlebus et al., 2002]
    Chlebus, B.S., Gasienec, L., Gibbons, A., Pelc, A., and Rytter, W. (2002). Deterministic broadcasting in ad hoc networks. Distributed computing, 15:27–38.CrossRefGoogle Scholar
  5. [Comtet, 1974]
    Comtet, L. (1974). Advanced combinatorics. Reidel, Dodrecht.zbMATHGoogle Scholar
  6. [Dhamdhere and Kulkarni, 1994]
    Dhamdhere, D.M. and Kulkarni, S.S. (1994). A token based k-resilient mutual exclusion algorithm for distributed systems. Inform. Process. Letters, (50): 151–157.zbMATHCrossRefGoogle Scholar
  7. [Feller, 1957]
    Feller, W. (1957). An introduction to probability theory and its applications. John Wiley, New-York.zbMATHGoogle Scholar
  8. [Flajolet and Sedgewick, 1996]
    Flajolet, P. and Sedgewick, R. (1996). Introduction to the analysis of algorithms. Addison-Wesley.Google Scholar
  9. [Garg and Wilkes, 1996]
    Garg, V.K. and Wilkes, J.E. (1996). Wireless and personnal communication systems. Prentice-Hall PTR, Upper Saddle River, NJ.Google Scholar
  10. [Hayashi et al., 2000]
    Hayashi, T., Nakano, K., and Olariu, S. (2000). Randomized initialization protocols for ad hoc networks. IEEE Trans. Parallel Distr. Syst., 11:749–759.CrossRefGoogle Scholar
  11. [Knuth, 1973]
    Knuth, D.E. (1973). The art of computer programming, vol 3: Sorting and Searching. Addison-Wesley.Google Scholar
  12. [Lakshdisi et al., 2001]
    Lakshdisi, M., Lin, X., and Stojmenovic, I. (2001). Location based localized alternate, disjoint, multi-path and component routing algorithms for wireless networks. In ACM Symposium on Mobile Ad Hoc Networking And Computing MobiHoc, Long Beach, California, USA, October 4–5, 2001, 287–290.Google Scholar
  13. [Lin and Stojmenovic, 2001]
    Lin, X. and Stojmenovic, I. (2001). Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(10): 1023–1032.CrossRefGoogle Scholar
  14. [Malpani et al., 2000]
    Malpani, N., Vaidya, N., and Welch, J.L. (2000). Leader election algorithms for mobile ad hoc networks. In DIALM for Mobility 2000, pp. 96–103.Google Scholar
  15. [Malpani et al., 2001]
    Malpani, N., Vaidya, N., and Welch, J.L. (2001). Distributed token circulation in mobile ad hoc networks. In Proceedings of the 9th International Conference on Network Protocols (ICNP).Google Scholar
  16. [Myoupo, 2003]
    Myoupo, J.F. (2003). Dynamic initialization protocols for mobile ad hoc networks. In 11th IEEE Intern. Conf. on Networks (ICON2003), Sydney, Australia, pp. 149–154.Google Scholar
  17. [Myoupo et al., 2003]
    Myoupo, J.F., Ravelomanana, V., and Thimonier, L. (2003). Average case analysis based-protocols to initialize packet radio networks. Wireless Communication and Mobile Computing, 3:539–548.CrossRefGoogle Scholar
  18. [Raymond, 1989]
    Raymond, K. (1989). A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Systems, 7:61–77.CrossRefGoogle Scholar
  19. [Vaidya et al., 2001]
    Vaidya, N.H., Walter, J.E., and Welch, J.L. (2001). A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks, 7(6):585–600.zbMATHCrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Romain Mellier
    • 1
  • Jean-Frederic Myoupo
    • 1
  • Vlady Ravelomanana
    • 2
  1. 1.LaRIA, CNRS FRE 2733Université de Picardie Jules VerneAmiensFrance
  2. 2.LIPN, CNRS, UMR 7030Université Paris 13VilletaneuseFrance

Personalised recommendations