A Group Mutual Exclusion Algorithm for Ad Hoc Mobile Networks

In this paper, we propose a token based algorithm to solve the group mutual exclusion (GME) problem for ad hoc mobile networks. The proposed algorithm is adapted from the RL algorithm in [WWV98] and utilizes the concept of weight throwing in [Tse95]. We prove that the proposed algorithm satisfies the mutual exclusion, the bounded delay, and the concurrent entering properties. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for ad hoc mobile networks.

[1]  Yuh-Jzer Joung,et al.  Asynchronous group mutual exclusion in ring networks , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[2]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[3]  Ajoy Kumar Datta,et al.  Token based group mutual exclusion for asynchronous rings , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[4]  Yu-Chee Tseng,et al.  Detecting Termination by Weight-Throwing in a Faulty Distributed System , 1995, J. Parallel Distributed Comput..

[5]  Yuh-Jzer Joung,et al.  Asynchronous group mutual exclusion (extended abstract) , 1998, PODC '98.

[6]  Sébastien Cantarell,et al.  Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings , 2000, OPODIS.

[7]  Yuh-Jzer Joung,et al.  The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract) , 1999, DISC.

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

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

[10]  Mark Moir,et al.  A Simple Local-Spin Group Mutual Exclusion Algorithm , 2001, IEEE Trans. Parallel Distributed Syst..

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