Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks

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 Ricart-Agrawala and Token-based algorithms on this architecture. The message complexities for both algorithms are reduced substantially using the proposed architecture . . .

• Type: Conference
• Year: 2004
• Where: EUROPAR
• Authors: Kayhan Erciyes
• Keywords: EUROPAR 2004, Graph Partitioning Algorithm, Mobile Network, Mutual Exclusion Algorithms