The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2008 vol.7)
pp: 1504-1518
Ozan K. Tonguz , Carnegie Mellon University, Pittsburgh
Evşen Yanmaz , Los Alamos National Laboratory, Los Alamos
ABSTRACT
While many interesting dynamic load balancing schemes have been proposed for efficient use of limited bandwidth and to increase the capacity of congested or hot spots (or cells) in wireless networks, to date, a comprehensive mathematical framework which encompasses all of these schemes does not exist. In this paper, we provide a unified mathematical framework for dynamic load balancing, which leads to closed-form performance expressions for evaluating the performance of some of the most important dynamic load balancing strategies proposed in the literature. To the best of our knowledge, this is the first generic theoretical framework that can be used to evaluate the performance of many different dynamic load balancing schemes with simple closed-form results. The accuracy of the results predicted by these analytical expressions derived from the theoretical framework is checked by comparing these results with simulation results provided in the literature for well-known schemes.
INDEX TERMS
Communication/Networking and Information Technology, Algorithm/protocol design and analysis, Performance of Systems, Mobile communication systems
CITATION
Ozan K. Tonguz, Evşen Yanmaz, "The Mathematical Theory of Dynamic Load Balancing in Cellular Networks", IEEE Transactions on Mobile Computing, vol.7, no. 12, pp. 1504-1518, December 2008, doi:10.1109/TMC.2008.66
REFERENCES
[1] T. Rappaport, Wireless Communications: Principles and Practice. Prentice Hall, 1996.
[2] V.H. Mac Donald, “The Cellular Concept,” Bell System Technical J., vol. 58, no. 1, pp. 15-41, Jan. 1979.
[3] 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.
[4] J.C.-I. Chuang, “Performance Issues and Algorithms for Dynamic Channel Assignment,” IEEE J. Selected Areas Comm., vol. 11, no. 6, pp. 955-963, Aug. 1993.
[5] M. Zhang and T.-S.P. Yum, “Comparisons of Channel-Assignment Strategies in Cellular Mobile Telephone Systems,” IEEE Trans. Vehicular Technology, vol. 38, no. 4, pp. 211-215, Nov. 1989.
[6] T.J. Kahwa and N.D. Georganas, “A Hybrid Channel Assignment Scheme in Large-Scale, Cellular-Structured Mobile Communication Systems,” IEEE Trans. Comm., vol. 26, no. 4, pp. 432-438, Apr. 1978.
[7] S.M. Elnoubi, R. Singh, and S.C. Gupta, “A New Frequency Channel Assignment Algorithm in High Capacity Mobile Communication Systems,” IEEE Trans. Vehicular Technology, vol. 31, no. 3, pp. 125-131, Aug. 1982.
[8] B. Eklundh, “Channel Utilization and Blocking Probability in a Cellular Mobile Telephone System with Directed Retry,” IEEE Trans. Comm., vol. 34, no. 4, pp. 329-337, Apr. 1986.
[9] J. Karlsson and B. Eklundh, “A Cellular Mobile Telephone System with Load Sharing-An Enhancement of Directed Retry,” IEEE Trans. Comm., vol. 37, no. 5, pp. 530-535, May 1989.
[10] H. Jiang and S.S. Rappaport, “CBWL: A New Channel Assignment and Sharing Method for Cellular Communication Systems,” IEEE Trans. Vehicular Technology, vol. 43, no. 2, pp. 313-322, May 1994.
[11] S.S. Rappaport and L.-R. Hu, “Microcellular Communication Systems with Hierarchical Macrocell Overlays: Traffic Performance Models and Analysis,” Proc. IEEE, vol. 82, no. 9, pp. 1383-1397, Sept. 1994.
[12] S.K. Das, S.K. Sen, and R. Jayaram, “A Novel Load Balancing Scheme for the Tele-Traffic Hot Spot Problem in Cellular Networks,” Wireless Networks, vol. 4, no. 4, pp. 325-340, July 1998.
[13] S.K. Das, S.K. Sen, and R. Jayaram, “A Dynamic Load Balancing Strategy for Channel Assignment Using Selective Borrowing in Cellular Mobile Environment,” Wireless Networks, vol. 3, no. 5, pp.333-347, Oct. 1997.
[14] Y. Zhang, “An Efficient Channel Allocation Strategy for Mobile Cellular Networks,” Proc. IEEE Vehicular Technology Conf. (VTC '99), vol. 1, pp. 611-616, 1999.
[15] W. Yue, “Analytical Methods to Calculate the Performance of a Cellular Mobile Radio Communication System with Hybrid Channel Assignment,” IEEE Trans. Vehicular Technology, vol. 40, no. 2, pp. 453-460, May 1991.
[16] T.-S.P. Yum and W.-S. Wong, “Hot-Spot Traffic Relief in Cellular Systems,” IEEE J. Selected Areas in Comm., vol. 11, no. 6, pp. 934-940, Aug. 1993.
[17] D. Everitt and D. Manfield, “Performance Analysis of Cellular Mobile Communication Systems with Dynamic Channel Assignment,” IEEE J. Selected Areas in Comm., vol. 7, no. 8, pp. 1172-1180, Oct. 1989.
[18] M. Alanyali and B. Hajek, “On Simple Algorithms for Dynamic Load Balancing,” Proc. IEEE INFOCOM '95, vol. 1, pp. 230-238, Apr. 1995.
[19] K.-N. Chang and D. Kim, “Optimal Prioritized Channel Allocation in Cellular Mobile Systems,” Computers and Operations Research, vol. 28, pp. 345-356, 2001.
[20] J.-W. Lee, R.R. Mazumdar, and N.B. Shroff, “Joint Resource Allocation and Base-Station Assignment for the Downlink in CDMA Networks,” IEEE/ACM Trans. Networking, vol. 14, no. 1, pp. 1-14, Feb. 2006.
[21] D. Zhao, “Throughput Fairness in Infrastructure-Based IEEE 802.11 Mesh Networks,” IEEE Trans. Vehicular Technology, vol. 56, no. 5, pp. 3210-3219, Sept. 2007.
[22] X. Wu, B. Mukherjee, and S.-H.G. Chan, “MACA—An Efficient Channel Allocation Scheme in Cellular Networks,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '00), vol. 3, pp. 1385-1389, 2000.
[23] O.K. Tonguz and E. Yanmaz, “On the Theory of Dynamic Load Balancing,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '03), vol. 7, pp. 3626-3630, Dec. 2003.
[24] E. Yanmaz and O.K. Tonguz, “Handover Performance of Dynamic Load Balancing Schemes in Cellular Networks,” Proc. IEEE Symp. Computers and Comm. (ISCC '05), pp. 295-300, June 2005.
[25] R.B. Cooper, Introduction to Queueing Theory. The MacMillan, 1972.
[26] L. Kleinrock, Queueing Systems Volume I: Theory. John Wiley & Sons, 1975.
[27] I.F. Akyildiz, “Exact Product Form Solution for Queueing Networks with Blocking,” IEEE Trans. Computers, vol. 36, no. 1, pp. 122-125, Jan. 1987.
[28] P. Kermani and L. Kleinrock, “Analysis of Buffer Allocation Schemes in a Multiplexing Node,” Conf. Record of the IEEE Int'l Conf. Comm. (ICC '77), vol. 2, pp. 269-275, June 1977.
[29] F. Baskett, K. Chandy, R. Muntz, and F. Palacios, “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” J. ACM, vol. 22, no. 2, pp. 248-260, Apr. 1975.
[30] G.D. Tsiotras and H. Badr, “A Recursive Methodology for the Derivation of the Blocking Probabilities of Tandem Queues with Finite Capacity,” Computers and Operations Research, vol. 17, no. 5, pp. 475-479, 1990.
[31] J.P. Buzen, “Computational Algorithms for Closed Queueing Networks with Exponential Servers,” Comm. ACM, vol. 16, no. 9, pp. 527-531, Sept. 1973.
[32] M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions. Dover Publications, 1972.
[33] Y.D. Lin and Y.C. Hsu, “Multihop Cellular: A New Architecture for Wireless Communication,” Proc. IEEE INFOCOM '00, pp. 1273-1282, 2000.
[34] N.V. Marathe, U.B. Desai, and S.N. Merchant, “Base Station Selection Strategy in Multihop Cellular Networks: A New Approach,” Proc. IEEE Int'l Conf. Signal Processing, Comm., and Networking (ICSCN '08), pp. 401-404, Jan. 2008.
[35] H. Wu, C. Qiao, S. De, and O. Tonguz, “Integrated Cellular and Ad Hoc Relaying Systems: iCAR,” IEEE J. Selected Areas in Comm., vol. 19, no. 10, pp.2105-2115, Oct. 2001.
[36] E. Yanmaz, O.K. Tonguz, and R. Rajkumar, “Is There an Optimum Dynamic Load Balancing Scheme?” Proc. IEEE GlobalTelecomm. Conf. (GLOBECOM '05), vol. 1, pp.598-602, Dec. 2005.
[37] E. Yanmaz and O.K. Tonguz, “Location Dependent Dynamic Load Balancing,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '05), vol. 1, pp. 587-591, Dec. 2005.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool