Browse > Article

A Token-based Mutual Exclusion Algorithm in Mobile Computing Environments  

Yang, Seung-Il (충북대학교 컴퓨터공학과)
Lee, Tae-Gyu (충북대학교 컴퓨터공학과)
Park, Sung-Hoon (충북대학교 전기전자컴퓨터공학부)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.16, no.3, 2010 , pp. 263-274 More about this Journal
Abstract
Mutual exclusion that applied on existing systems was designed for static distributed systems. but now computing environments are going to mobile computing environments. Therefore a mutual exclusion algorithm in static distributed environments should be designed for new computing environments. So this paper proposes a mobile mutual exclusion algorithm to support the mutual exclusion of shared resources in mobile computer environments. Mobile computing resources as wireless hosts cause new issues because of their mobility and weakness and made mutual exclusion problem more complex than stationary distributed environments. So we proposed a new mobile token mutual exclusion algorithm with deadlock-free and starvation-free in mobile computing environments based on spanning tree topology and extend for mobile computing environments. The proposed algorithm minimizes message complexity in case of free hopping in cellular networks.
Keywords
Mutual Exclusion; Mobile Computing; Algorithm; Token;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. A. Maekawa. "A rootN Algorithm for Mutual Exclusion in Decentralized Systems," ACM Trans. Comput. Systems, vol.3, pp.145-159, 1985.   DOI   ScienceOn
2 R. Franklin, "On an improved algorithm for decentralized extrema finding in circular configurations of processors," Communications of the ACM, vol. 25, pp.336-337, 1982.   DOI
3 Mukesh Singhal and D. Manivannan, "A Distributed Mutual Exclusion Algorithm for Mobile Computing," Proc. of the 1997 IASTED International Conference on Intelligent Information Systems (IIS '97), pp.557, 1997.
4 Ye-In Chang, "A simulation study on distributed mutual exclusion," Source Journal of Parallel and Distributed Computing, vol.3, pp.107-121, 1996.
5 B. R. Badrinath, Arup Acharya, Tomasz Imielinski, "Designing Distributed Algorithms for Mobile Computing Networks," COMPUTER COMMUNICATIONS, vol.19, 1992.
6 K. Raymond. "A Tree-based Algorithm for Distributed Mutual Exclusion," ACM Bans. Comput. Systems, vol.7, pp.61-77, 1989.   DOI   ScienceOn
7 G. Ricart and A. K.. Agrawala. "An Optimal Algorithm for Mutual Exclusion in Computer Networks," Communications of the ACM, vol.24, pp.9-17, 1981.   DOI   ScienceOn
8 Y. Chang, M. Singhal, M. Liu, "A hybrid algorithm for distributed mutual exclusion," proc. of comPSAC'90, 1990.
9 MUKESH SINGHAL, "A taxonomy of distributed mutual exclusion," Journal of parallel and distributed computing, vol.18, pp.94-101, 1993.   DOI   ScienceOn
10 Michel Raynal, A simple taxonomy for distributed mutual exclusion algorithms, ACM SIGOPS Operating Systems Review, vol.25, pp.47-50, 1991.
11 Ichiro Suzuki and Tadao Kasami, "A distributed mutual exclusion algorithm," ACM Transactions on Computer Systems (TOCS), Vol.3, pp.344-349, 1985.   DOI   ScienceOn
12 L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Communications of the ACM, vol.21, pp.558-565, 1978.   DOI   ScienceOn
13 B. A. Sanders, "The information structure of distributed mutual exclusion algorithms," ACM Transactions on Computer Systems(TOCS), vol. 5, pp.284-299, 1987.   DOI   ScienceOn
14 M. sinhal, "A heuristically-aided algorithm for mutual exclusion in distributed systems," IEEE Trans. comput., vol.38, pp.5, 1989.