Wireless Networks

, Volume 7, Issue 6, pp 585–600 | Cite as

A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks

  • Jennifer E. Walter
  • Jennifer L. Welch
  • Nitin H. Vaidya
Article

Abstract

A fault-tolerant distributed mutual exclusion algorithm that adjusts to node mobility is presented, along with proof of correctness and simulation results. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. Experimental results indicate that adaptation to mobility can improve performance over that of similar non-adaptive algorithms when nodes are mobile.

mobile computing ad hoc network mutual exclusion distributed algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Y. Afek, E. Gafni and A. Rosen, The slide mechanism with applications in dynamic networks, in: Proc. of 11th Annual Symp. on Prin. of Dist. Computing (1992) pp. 35–46.Google Scholar
  2. [2]
    B. Awerbuch, Y. Mansour and N. Shavit, Polynomial end to end communication, in: Proc. of 30th Annual Symp. on Found. of Comp. Sci. (1989) pp. 358–363.Google Scholar
  3. [3]
    B.R. Badrinath, A. Acharya and T. Imielinski, Structuring distributed algorithms for mobile hosts, in: Proc. of 14th IEEE Intl. Conf. on Distributed Computing (1994) pp. 21–28.Google Scholar
  4. [4]
    S. Basagni, I. Chlamtac and V.R. Syrotiuk, A distance routing effect algorithm for mobility (DREAM), in: Proc. of 4th ACM/IEEE Intl. Conf. on Mobile Computing and Networking (1998) pp. 76–84.Google Scholar
  5. [5]
    J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in: Proc. of 4th ACM/IEEE Intl. Conf. on Mobile Computing and Networking (1998) pp. 85–97.Google Scholar
  6. [6]
    R. Casteñeda and S.R. Das, Query localization techniques for ondemand routing protocols in ad hoc networks, in: Proc. of 5th ACM/IEEE Intl. Conf. on Mobile Computing and Networking (1999) pp. 186–194.Google Scholar
  7. [7]
    Y. Chang, M. Singhal and M. Liu, A fault tolerant algorithm for distributed mutual exclusion, in: Proc. of 9th IEEE Symp. on Reliable Dist. Systems (1990) pp. 146–154.Google Scholar
  8. [8]
    C. Chiang and M. Gerla, Routing and multicast in multihop, mobile wireless networks, in: Proc. of ICUPC '97 (1997) pp. 546–551.Google Scholar
  9. [9]
    M.S. Corson and A. Ephremides, A distributed routing algorithm for mobile wireless networks, Wireless Networks 1(1) (1997) 61–81.Google Scholar
  10. [10]
    D.M. Dhamdhere and S.S. Kulkarni, A token based k-resilient mutual exclusion algorithm for distributed systems, Information Processing Letters 50 (1994) 151–157.Google Scholar
  11. [11]
    R. Dube, C.D. Rais, K. Wang and S.K. Tripathi, Signal stability based adaptive routing (SSA) for ad-hoc mobile networks, IEEE Personal Communications (February 1997) 36–45.Google Scholar
  12. [12]
    A. Ephremides and T.V. Truong, Scheduling broadcasts in multihop radio networks, IEEE Transactions on Communications 38(4) (1990) 456–460.Google Scholar
  13. [13]
    E. Gafni and D. Bertsekas, Distributed algorithms for generating loopfree routes in networks with frequently changing topology, IEEE Transactions on Communications C-29(1) (1981) 11–18.Google Scholar
  14. [14]
    M. Gerla and T.-C. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks (1995) 255–265.Google Scholar
  15. [15]
    P. Johansson, T. Larsson, N. Hedman, B. Mielczarek and M. Degermark, Scenario-based performance analysis of routing protocols for mobile ad-hoc networks, in: Proc. of 5th ACM/IEEE Intl. Conf. on Mobile Computing and Networking (1999) pp. 195–206.Google Scholar
  16. [16]
    D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic, 1996) pp. 153–181.Google Scholar
  17. [17]
    I. Keidar and D. Dolev, Efficient message ordering in dynamic networks, in: Proc. of 15th Annual Symp. on Prin. of Dist. Computing (1996) pp. 68–76.Google Scholar
  18. [18]
    Y.B. Ko and V.H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, in: Proc. of 4th ACM/IEEE Intl. Conf. on Mobile Computing and Networking (1998) pp. 66–75.Google Scholar
  19. [19]
    P. Krishna, N.H. Vaidya, M. Chatterjee and D.K. Pradhan, A clusterbased approach for routing in dynamic networks, in: Proc. of ACM SIGCOMM Computer Communication Review (1997) pp. 372–378.Google Scholar
  20. [20]
    M.L. Neilsen and M. Mizuno, A DAG-based algorithm for distributed mutual exclusion, in: Proc. of Intl. Conf. on Dist. Comp. Systems (1991) pp. 354–360.Google Scholar
  21. [21]
    E. Pagani and G.P. Rossi, Reliable broadcast in mobile multihop packet networks, in: Proc. of 3rd ACM/IEEE Intl. Conference on Mobile Computing and Networking (1997) pp. 34–42.Google Scholar
  22. [22]
    V. Park and M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proc. of INFOCOM'97 (1997) pp. 1405–1413.Google Scholar
  23. [23]
    C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing for mobile computers, in: Proc. of ACM SIGCOMM Symp. on Communication, Architectures and Protocols (1994) pp. 234–244.Google Scholar
  24. [24]
    C.E. Perkins and E.M. Royer, Ad-hoc on-demand distance vector routing, in: Proc. of 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999) pp. 90–100.Google Scholar
  25. [25]
    K. Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems 7(1) (1989) 61–77.Google Scholar
  26. [26]
    E.M. Royer and C.E. Perkins, Multicast operation of the ad-hoc ondemand distance vector routing protocol, in: Proc. of 5th ACM/IEEE Intl. Conf. on Mobile Computing and Networking (1999) pp. 207–218.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Jennifer E. Walter
    • 1
  • Jennifer L. Welch
    • 1
  • Nitin H. Vaidya
    • 1
  1. 1.Department of Computer ScienceTexas A&M UniversityUSA

Personalised recommendations