Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks [chapter]

Kayhan Erciyes
2004 Lecture Notes in Computer Science  
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of clusters periodically using a graph partitioning algorithm called Fixed Centered Partitioning first. Each cluster is represented by a coordinator node on the ring which implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents. We show the implementation of
more » ... awala and Token-based algorithms on this architecture. The message complexities for both algorithms are reduced substantially using the proposed architecture . . .
doi:10.1007/978-3-540-27866-5_124 fatcat:a526kory2nernlcivktrxr47ki