A consensus-based '-Exclusion algorithm for mobile ad hoc networks

This paper addresses the ‘-Exclusion problem for mobile ad hoc networks. The ‘-Exclusion problem, a generalization of distributed mutual exclusion problem, involves a group of processes, each of which intermittently requires access to one of ‘ identical resources or pieces of code called the critical section (CS). This paper presents a consensus-based mobilityaware ‘-Exclusion (LE) algorithm that operates asynchronously and copes explicitly with arbitrary (possibly concurrent) topology changes associated with such networks. The algorithm can tolerate link changes or failures, sudden crashes or recoveries of at most ‘� 1 mobile nodes. The algorithm is based on collection of enough consensuses for a mobile node intending to enter CS, and uses diffusing computations for this purpose. This paper presents a simulation to demonstrate that the proposed algorithm, as compared to the k-Reverse Link (KRL) algorithm, is quite effective to variety of operating conditions, and is highly adaptive to frequent and unpredictable topology changes due to link changes or failures.

[1]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

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

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

[4]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

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

[6]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[7]  Tomasz Imielinski,et al.  Structuring distributed algorithms for mobile hosts , 1994, 14th International Conference on Distributed Computing Systems.

[8]  Allan Borodin,et al.  Resource allocation with immunity to limited process failure , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9]  Abdelmadjid Bouabdallah,et al.  Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview , 2004, OPSR.

[10]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[11]  Vassos Hadzilacos.  A note on group mutual exclusion , 2001, PODC '01.

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

[13]  Leslie Lamport,et al.  The mutual exclusion problem: partII—statement and solutions , 1986, JACM.

[14]  Yu Chen,et al.  Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks , 2005, J. Parallel Distributed Comput..

[15]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[16]  Yu Chen,et al.  Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks , 2002, DIALM '02.

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

[18]  Mukesh Singhal.  A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems , 1989, IEEE Trans. Computers.

[19]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

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

[21]  Roberto Baldoni,et al.  A distributed mutual exclusion algorithm for mobile ad-hoc networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[22]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[23]  Nitin H. Vaidya,et al.  Distributed token circulation in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[24]  Mineo Takai,et al.  Parssec: A Parallel Simulation Environment for Complex Systems , 1998, Computer.

[25]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[26]  A.A. Ali,et al.  Distributed Allocation of Identical Resources in Mobile Ad Hoc Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[27]  Nitin H. Vaidya,et al.  Distributed token circulation in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

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

[29]  Samir Ranjan Das,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 1999, Wirel. Networks.