A Token Forwarding K-Mutual Exclusion Algorithm for Wireless Ad Hoc Networks

A fault-tolerant token based distributed k-mutual exclusion algorithm which adjusts to node mobility is presented. The algorithm requires nodes to communicate with only their current neighbors, making it well-suited to the ad hoc environment. A \token forwarding" modi cation to the basic algorithm is shown to lower the time each node waits to enter the CS by circulating unused tokens among participating processors. Further heuristic modi cations are shown to improve the message complexity of the algorithm.

[1]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[2]  W. Marsden I and J , 2012 .

[3]  Shing-Tsaan Huang,et al.  k-coteries for fault-tolerant k entries to a critical section , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[4]  Mahesh K. Marina,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 2002, Wirel. Networks.

[5]  Mukesh Singhal,et al.  A fault tolerant algorithm for distributed mutual exclusion , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[6]  Pradip K. Srimani,et al.  Another Distributed Algorithm for Multiple Entries to a Critical Section , 1992, Inf. Process. Lett..

[7]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[8]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[9]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[10]  Dhananjay M. Dhamdhere,et al.  A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems , 1994, Inf. Process. Lett..

[11]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[12]  Niki Pissinou,et al.  A token based distributed k mutual exclusion algorithm , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[13]  Kerry Raymond,et al.  A tree-based algorithm for distributed mutual exclusion , 1989, TOCS.

[14]  Mario Gerla,et al.  Routing and multicast in multihop, mobile wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[15]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[16]  Nir Shavit,et al.  Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[17]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[18]  Jennifer E. Walter,et al.  A K-Mutual Exclusion Algorithm for Wireless Ad Hoc Networks , 2001 .

[19]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[20]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[21]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[22]  Yehuda Afek,et al.  The slide mechanism with applications in dynamic networks , 1992, PODC '92.

[23]  Nitin H. Vaidya,et al.  A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks , 2001, Wirel. Networks.

[24]  Idit Keidar,et al.  Efficient message ordering in dynamic networks , 1996, PODC '96.

[25]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[26]  Nitin H. Vaidya,et al.  A distributed K-mutual exclusion algorithm , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[27]  Elena Pagani,et al.  Reliable broadcast in mobile multihop packet networks , 1997, MobiCom '97.

[28]  Kerry Raymond A Distributed Algorithm for Multiple Entries to a Critical Section , 1989, Inf. Process. Lett..