Abstract

The assigned frequency spectrum to the wireless mobile systems has become a scarce resource as the number of mobile users has increased tremendously. So there is a need of using the allotted bandwidth efficiently. Distributed RME assigns channels to various cells and increases bandwidth utilization and at the same time reduces co- channel interference. Various algorithms exist which help in attaining mutual exclusion. Quorum based algorithms is one such class of algorithms where the requesting site asks permission from a set of smaller number of participating sites called a quorum. Quorums help reduce the message complexity in mobile systems.

References

• Ravi Prakash, Niranjan, G. Shivaratri, Mukesh Singhal, “Distributed Dynamic Channel Allocation for Mobile Computing”, 1995 ACM.
• Jianping Jiang, “On Distributed Dynamic Channel Allocation in Mobile Cellular Networks”, IEEE transactions on Parallel And Distributed Systems, vol. 13, No. 10, 2002.
• P.C.Saxena, J.Rai, “A survey of permission- based distributed mutual exclusion algorithms”, Computer Standards & Interfaces 25 (2003) 159–181.
• W. Luk, T. Wong, Two new quorum based algorithms for distributed mutual exclusion, Proceedings of the 17th International Conference on Distributed Computing Systems, ICDCS’ 97, Baltimore, MD, USA, IEEE (1997, May),pp. 100–106.
• D.J Goodman, Wireless Personal Comm. Systems, Addison Wesley
• M. Maekawa,“A ?N algorithm for mutual exclusion in decentralized systems”, ACM Trans. Comput. Systs., pp 145-159, May 1985
• W.C.Y.Lee, Mobile Cellular Telecommunications: Analog and Digital Systems. McGraw – Hill
• V.H.MacDonald, “The Cellular Concept”,The Bell System Technical J.., vol. 58, no. 1
• Ricart G and Agarwala, A. K. “An optimal algorithm for mutual exclusion in computer networks”, CACM., vol. 24, no.1, 1981
• Kumar, A. “ Hierarchical Quorum Consensus: a new algorithm for managing replicated data,” IEEE Trans. Comp., vol. 40, no. 9, 1991
• Shing- Tsaan Huang, Jehu- Ruey Jiang and Yu- Chen- Kuo, National Tsing Hua university, Hsin Chu, Tiawaan , “ k-coteries foe Fault- Tolerant k entries to a Critical Section”, NSC Republic of China.
• Gifford, D.K. “Weight voting for replicated data”, in Proc. 7th ACM SIGOPS Symp. Oper. Syst. Principles, Pacific Grove, CA, pp. 150- 159, 1979
• Thomas, R.H, “A majority consensus approach to concurrency control,” ACM Trans. Database Syst., vol 4, no. 2, pp. 180-209,1979
• Lamport, L. “Time, clocks and the ordering of events in a distributed system, CACM., vol. 21, no. 7, pp. 145-159, July 1978
• Agrawala, D., and El Abbadi, “An efficient and fault- tolerant algorithm for distributed mutual exclusion,” ACM Trans. Comp. Syst., vol.9, no. 1, pp. 1-20, Feb.1991
• Handbook of Wireless Networks and Mobile Computing, Edited by Ivan Stojmenovic´Copyright © 2002 John Wiley & Sons, Inc.
• H. Garcia-Molina, D. Barbara, “How to assign votes in a distributed system”, Journal for the Association for Computing Machinery, 1985.
• Megna Gupta, A.K Sachan, Journal of Theoritical and Applied Information Technology, 2007, “Distributed Dynamic Channel Allocation Algorithm for Cellular Mobile Network”.
• Jiangchang Yang et.al. “A fault tolerant channel allocation algorithm for cellular network with mobile base stations”. IEEE transactions on vehicular technology 56(1): 349- 361, 2007.