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 ... © Springer-Verlag 2004.
CITATION STYLE
Erciyes, K. (2004). Cluster based distributed mutual exclusion algorithms for mobile networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3149, 933–940. https://doi.org/10.1007/978-3-540-27866-5_124
Mendeley helps you to discover research relevant for your work.