Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 703414, 15 pages
http://dx.doi.org/10.1155/2013/703414
Research Article

A Hybrid Distributed Mutual Exclusion Algorithm for Cluster-Based Systems

1International Computer Institute, Ege University, 35100 Izmir, Turkey
2Department of Computer Engineering, Shabestar Branch, Islamic Azad University, 53815 Shabestar, Iran
3Department of Computer Engineering, Izmir University, 35140 Izmir, Turkey

Received 26 April 2013; Accepted 10 June 2013

Academic Editor: Guanghui Wen

Copyright © 2013 Moharram Challenger et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Mou, W. Zhou, T. Wang, C. Ji, and D. Tong, “Consensus of the distributed varying scale wireless sensor networks,” Mathematical Problems in Engineering, vol. 2013, Article ID 862518, 9 pages, 2013. View at Publisher · View at Google Scholar
  2. D. Y. Kim and M. Jeon, “Robust distributed Kalman filter for wireless sensor networks with uncertain communication channels,” Mathematical Problems in Engineering, vol. 2012, Article ID 238597, 12 pages, 2012. View at Publisher · View at Google Scholar
  3. L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Communications of the ACM, vol. 21, no. 7, pp. 558–565, 1978. View at Publisher · View at Google Scholar · View at Scopus
  4. G. Ricart and A. K. Agrawala, “An optimal algorithm for mutual exclusion in computer networks,” Communications of the ACM, vol. 24, no. 1, pp. 9–17, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  5. I. Suzuki and T. Kasami, “A distributed mutual exclusion algorithm,” ACM Transactions on Computer Systems, vol. 3, no. 4, pp. 344–349, 1985. View at Google Scholar · View at Scopus
  6. K. Raymond, “A tree-based algorithm for distributed mutual exclusion,” ACM Transactions on Computer Systems, vol. 7, no. 1, pp. 61–77, 1989. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Singhal, “A heuristically-aided algorithm for mutual exclusion for distributed systems,” IEEE Transactions on Computers, vol. 38, no. 5, pp. 70–78, 1989. View at Google Scholar
  8. M. Maekawa, “A root N algorithm for mutual exclusion in decentralized systems,” ACM Transactions on Computer Systems, vol. 3, no. 2, pp. 145–159, 1985. View at Google Scholar · View at Scopus
  9. D. Agrawal and A. El Abbadi, “An efficient solution to the distributed mutual exclusion problem,” ACM Transactions on Computer Systems, vol. 9, no. 1, pp. 1–20, 1991. View at Google Scholar
  10. S. Lodha and A. Kshemkalyani, “A fair distributed mutual exclusion algorithm,” IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 6, pp. 537–549, 2000. View at Publisher · View at Google Scholar · View at Scopus
  11. O. S. F. Carvalho and G. Roucairol, “On mutual exclusion in computer networks,” Communications of the ACM, vol. 26, no. 2, pp. 146–147, 1983. View at Google Scholar
  12. A. Goscinski, “Two algorithms for mutual exclusion in real-time distributed computer systems,” Journal of Parallel and Distributed Computing, vol. 9, no. 1, pp. 77–82, 1990. View at Google Scholar · View at Scopus
  13. Y. Chang, “Design of mutual exclusion algorithms for real-time distributed systems,” Journal of Inforamtion Science and Engineering, vol. 11, no. 4, pp. 527–548, 1994. View at Google Scholar
  14. M. Challenger, P. Bayat, and M. R. Meybodi, “A reliable optimization on distributed mutual exclusion algorithm,” in Proceedings of the 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRI-DENTCOM '06), pp. 566–574, Barcelona, Spain, 2006. View at Publisher · View at Google Scholar
  15. M. Challenger, V. Khalilpour, P. Bayat, and M. R. Meibodi, “A new robust centralized DMX algorithm,” in Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN '07), pp. 367–374, Innsbruck, Austria, February 2007. View at Scopus
  16. A. S. Tanenbaum, Distributed Operating System, Pearson Education, 2007.
  17. G. Hosseinabadi and N. H. Vaidya, “Exploiting opportunistic overhearing to improve performance of mutual exclusion in wireless Ad Hoc networks,” in Wired/Wireless Internet Communication, vol. 7277 of Lecture Notes in Computer Science, pp. 162–173, 2012. View at Google Scholar
  18. P. Chaudhuri and T. Edward, “An O(n) distributed mutual exclusion algorithm using queue migration,” Journal of Universal Computer Science, vol. 12, no. 2, pp. 140–159, 2006. View at Google Scholar · View at Scopus
  19. F. Mueller, “Prioritized token-based mutual exclusion for distributed systems,” in Proceedings of the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, pp. 791–795, April 1998. View at Publisher · View at Google Scholar · View at Scopus
  20. M. L. Neilsen and M. Mizuno, “A dag-based algorithm for distributed mutual exclusion,” in Proceedings of the 11th International Conference on Distributed Computing Systems, pp. 354–360, May 1991. View at Scopus
  21. M. Naimi and M. Trehel, “A distributed algorithm for mutual exclusion based on data structures and fault tolerance,” in Proceedings of the 6th International Phoenix IEEE International Conference on Computer Communications, pp. 35–39, Scottsdale, Ariz, USA, 1987.
  22. M. Naimi, M. Trehel, and A. Arnold, “A log (N) distributed mutual exclusion algorithm based on path reversal,” Journal of Parallel and Distributed Computing, vol. 34, no. 1, pp. 1–13, 1996. View at Publisher · View at Google Scholar · View at Scopus
  23. J. Edmondson, D. Schmidt, and A. Gokhale, “QoS-enabled distributed mutual exclusion in public clouds,” in On the Move to Meaningful Internet Systems: OTM, vol. 7045 of Lecture Notes in Computer Science, pp. 542–559, 2011. View at Google Scholar
  24. M. Chen, W. Cai, and L. Ma, “Cloud computing platform for an online model library system,” Mathematical Problems in Engineering, vol. 2013, Article ID 369056, 7 pages, 2013. View at Publisher · View at Google Scholar
  25. G. Wen and Z. Duan, “Dynamics behaviors of weighted local-world evolving networks with extended links,” International Journal of Modern Physics C, vol. 20, no. 11, pp. 1719–1735, 2009. View at Publisher · View at Google Scholar · View at Scopus
  26. K. Erciyes, D. Ozsoyeller, and O. Dagdeviren, “Distributed algorithms to form cluster based spanning trees in wireless sensor networks,” in Proceedings of the 8th International Conference of Computational Science (ICCS '08), vol. 5101 of Lecture Notes in Computer Science, pp. 519–528, Springer, 2008.
  27. Q. Min and R. Zimmermann, “VCA: an energy-efficient voting-based clustering algorithm for sensor networks,” Journal of Universal Computer Science, vol. 13, no. 1, pp. 87–109, 2007. View at Google Scholar · View at Scopus
  28. F. Chung and L. Lu, “The average distance in a random graph with given expected degrees,” Internet Mathematics, vol. 1, no. 1, pp. 91–113, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. S. Kanrar and N. Chaki, “Modified Raymond's algorithm for priority (MRA-P) based mutual exclusion in distributed systems,” in Proceedings of the 3rd International Conference on Distributed Computing and Internet Technology (ICDCIT '06), pp. 325–332, 2006.
  30. A. Swaroop and A. K. Singh, “A token-based group mutual exclusion algorithm for cellular wireless networks,” in Proceedings of the Annual IEEE India Conference (IN-DICON '09), pp. 1–4, 2009.
  31. A. Housni and M. Trehel, “Distributed mutual exclusion token-permission based by prioritized groups,” in Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, pp. 253–259, 2001.