This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
October 2002 (vol. 13 no. 10)
pp. 1024-1037

Abstract—Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). In this paper, we establish the exact relationship between the two problems. Specifically, we introduce the problem of relaxed mutual exclusion to model one important aspect of the DDCA problem. We develop a general algorithm that guarantees relaxed mutual exclusion for a single resource and prove necessary and sufficient conditions for the information structure. Considering distributed dynamic channel allocation as a special case of relaxed mutual exclusion, we apply and extend the algorithm to further address the issues that arise in distributed channel allocation such as deadlock resolution, dealing with multiple channels, design of efficient information structures, and channel selection strategies. Based on these results, we propose an example distributed channel allocation scheme using one of the information structures proposed. Analysis and simulation results are provided and show that the results of this research can be used to design more efficient distributed channel allocation algorithms.

[1] A. Baiocchi, F.D. Priscoli, F. Grilli, and F. Sestini, “The Geometric Dynamic Channel Allocation as a Practical Strategy in Mobile Networks with Bursty User Mobility,” IEEE Trans. Vehicular Technology, pp. 14-23, Feb. 1995.
[2] G. Cao and M. Singhal, “Distributed Fault-Tolerant Channel Allocation for Mobile Cellular Networks,” Proc. IEEE INFOCOM '99 Conf., pp. 584-591, Mar. 1999.
[3] O.S.F. Carvalho and G. Roucairol, “On Mutual Exclusion in Computer Networks,” Comm. ACM, pp. 146-147, Feb. 1983.
[4] X. Dong and T.H. Lai, “Distributed Dynamic Carrier Allocation in Mobile Cellular Networks: Search vs. Update,” Proc. 17th Int'l Conf. Distributed Computer Systems, pp. 108-115, May 1997.
[5] X. Dong and T.H. Lai, “An Efficient Priority-Based Dynamic Channel Allocation for Mobile Cellular Networks,” Proc. IEEE INFOCOM '97 Conf., 1997.
[6] Y. Furuya and Y. Akaiwa, “A Distributed Channel Allocation Scheme for Mobile Communication Systems,” IEICE Trans., vol. 74, pp. 1531-37, 1991.
[7] D.J. Goodman, Wireless Personal Comm. Systems. Addison-Wesley, 1997.
[8] C.L. I and P.H. Chao, “Local Packing—Distributed Dynamic Channel Allocation at Cellular Base Station,” IEEE Globecom, pp. 293-301, 1993.
[9] C.L. I and P.H. Chao, “Distributed Dynamic Channel Allocation Algorithms with Adjacent Channel Constraints,” IEEE Int'l Symp. Personal, Indoor and Mobile Radio Comm. (PIMRC), vol. B2.3, pp. 169-175, 1994.
[10] A. Kahol, S. Khurana, S.K. Gupta, and P.K. Srimani, “Adaptive Distributed Dynamic Channel Allocation for Wireless Networks,” Proc. 1998 Inst. for Certification of Computing Professionals Workshops (ICCP), pp. 124-133, Aug. 1998.
[11] I. Katzela and M. Naghshineh, “Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey,” IEEE Personal Comm., vol. 3, no. 3, pp. 10-31, June 1996.
[12] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[13] W.C.Y. Lee, Mobile Cellular Telecommunications: Analog and Digital Systems. McGraw-Hill, 1995.
[14] N. Lynch, Distributed Algorithms. New Jersey, Morgan Kaufman, 1996.
[15] V.H. MacDonald, “The Cellular Concept,” The Bell System Technical J., vol. 58, no. 1, pp. 15-41, Jan. 1979.
[16] L. Narayanan and S. M. Shende, “Static Frequency Assignment in Cellular Networks,” Algorithmica, pp. 396-409, 2001.
[17] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
[18] C. Mohan and A. Silberschatz, “Distributed Control—Is It Always Desirable?” Symp. Reliability in Distributed Software and Database Systems, July 1981.
[19] S. Nishio, K.F. Li, and E.G. Manning, “A Resilient Mutual Exclusion Algorithm for Computer Network,” IEEE Trans. Parallel and Distributed Systems, July 1990.
[20] R. Prakash, N. Shivaratri, and M. Singhal, “Distributed Dynamic Channel Allocation for Mobile Computing,” Proc. 14th ACM Symp. Principles of Distributed Computing, pp. 47-56, 1995.
[21] R. Prakash and M. Singhal, “Dynamic Hashing + Quorum = Efficient Location Management for Mobile Computing Systems,” Proc. ACM Symp. Principles of Distributed Computing (PODC), pp. 291-291, 1997.
[22] S. Ramanatham, “A Unified Framework and Algorithm for Channel Assignment in Wireless Networks,” Wireless Networks, pp. 81-94, 1999.
[23] G. Ricart and A. K. Agrawala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Comm. ACM, vol. 24, no. 1, pp. 9-17, Jan. 1981.
[24] B. Sanders, “The Information Structure of Distributed Mutual Exclusion Algorithms,” ACM Trans. Computer Systems, vol. 5, no. 3, pp. 284-299, Aug. 1987.
[25] A. Sen, T. Roxborough, and B.P. Sinha, “On an Optimal Algorithm for Channel Assignment in Cellular Networks,” Proc. IEEE Int'l Conf. Comm., vol. 2, pp. 1147-1151, 1999.
[26] M. Singhal,“A taxonomy of distributed mutual exclusion,” J. Parallel and Distributed Computing, vol. 15, pp. 94-101, May, 1993.
[27] C.W. Sung and W.S. Wong, “Sequential Packing Algorithm for Channel Assignment under Cochannel and Adjacent-Channel Interference Constraint,” IEEE Trans. Vehicular Technology, pp. 676-686, Aug. 1997.
[28] I. Suzuki and T. Kasami, “A Distributed Mutual Exclusion Algorithm,” ACM Trans. Computer Systems, vol. 3, no. 4, pp. 344-349, Nov. 1985.

Index Terms:
Mutual exclusion, dynamic channel allocation, cellular networks, distributed algorithms.
Citation:
Jianping Jiang, Ten-Hwang Lai, Neelam Soundarajan, "On Distributed Dynamic Channel Allocation in Mobile Cellular Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 10, pp. 1024-1037, Oct. 2002, doi:10.1109/TPDS.2002.1041879
Usage of this product signifies your acceptance of the Terms of Use.