Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Designing Cellular Mobile Network Using Lagrangian Based Heuristic

라그랑지안 기반의 휴리스틱 기법을 이용한 셀룰러 모바일 네트워크의 설계

  • Hong, Jung-Man (Entrue Consulting Partners, LG CNS) ;
  • Lee, Jong-Hyup (Department of Information and Communications Engineering, Inje University)
  • Received : 2010.07.12
  • Accepted : 2010.10.30
  • Published : 2011.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

Keywords

References

  1. Andre, M., Pesant, G., and Pierre, S. (2005), A Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless Networks, Journal of Computer Science, 1(20), 175-181. https://doi.org/10.3844/jcssp.2005.175.181
  2. Camerini, P. M., Fratta L., and Naffioli, F. (1975), On improving relaxation methods by modified gradient techniques, Mathematical Programming Studies, 3, 26-34. https://doi.org/10.1007/BFb0120697
  3. Dianati, M., Naik, S., Shen, X., and Karray, F. (2003), A Genetic Algorithm Approach for Cell to Switch Assignment in Cellular Mobile Networks, Proceedings 2003 Canadian workshop on information theory, Waterloo, Ontario, Canada, 159-162.
  4. Fournier, J. R. L. and Pierre, S. (2005), Assigning cells to switches in mobile networks using an ant colony optimization heuristic, Computer Communications, 28(1), 65-73. https://doi.org/10.1016/j.comcom.2004.07.006
  5. Goudos, S. K., Baltzis, K. B., Bachtsevanidis, C., and Sahalos, J. (2010), Cell-to switch assignment in cellular networks using barebones particle swarm optimization, IEICE Electronics express, 7(4), 254-260. https://doi.org/10.1587/elex.7.254
  6. Hung, W. N. and Song, X. (2002), On Optimal Cell Assignment in PCS Networks, 21st International IEEE Performance, Computing and Communications Conference, 225-232.
  7. Jabbari, B., Colombo, G., Nakajima, A., and Kulkarni, J. (1995), Network Issues for Wireless Communication, IEEE Communications magazine, 33(1), 88-89. https://doi.org/10.1109/35.339886
  8. Johnson, E. L., Mehrotra, A., and Nemhauser, G. L. (1993), Min-cut clustering, Mathematical programming, 62(1-3), 133-151. https://doi.org/10.1007/BF01585164
  9. Kim, M. J. and Kim, J. S. (1997), The Facility Locations Problem for Minimizing CDMA Hard Handoffs, Globecom 97, Phoenix, Arizona USA, 1611-1615.
  10. Lee, Y. H, Yun, H. J., Lee, S. S., and Park, N. I. (2008), Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks, Journal of the Korean Institute of Industrial Engineers, 34(2), 205- 215.
  11. Li, J., Kameda, H., and Itoh, H. (1997), Optimal assignment of cells in PCS networks, Personal and ubiquitous computing, 1(3), 127-134
  12. Mandal, S., Saha, D., Mahanti, A., and Pendharkar, P. C. (2007), Cellto- switch level planning in mobile wireless networks for efficient management of radio resources, Omega 35(6), 697-705. https://doi.org/10.1016/j.omega.2005.09.008
  13. Markoulidakis, J. G. and Sykas, E. D. (1993), Model for location updating and handover rate estimation in mobile telecommunications, Elect Letters, 29(17), 1574-1575. https://doi.org/10.1049/el:19931049
  14. Menon, S. and Gupta, R. (2004), Assigning cells to switches in cellular networks by incorporating a pricing mechanism into simulated annealing, IEEE Transactions on Systems, Man, and Cybernetics, 34(1), 558-565. https://doi.org/10.1109/TSMCB.2003.817081
  15. Merchant, A. and Sengupta, B. (1995), Assignment of Cells to Switches in PCS Networks, IEEE/ACM Trans, On Networking, 3(5), 521-526. https://doi.org/10.1109/90.469954
  16. Oh, D. I. and Kim, W. J. (2008), Optimal Topology in Wibro MMR Network Using a Genetiv Algorithm, Journal of the Korean Institute of Industrial Engineers, 34(2), 235-245.
  17. Pierre, S. and Houéto, F. (2002), A tabu search approach for assigning cells to switches in cellular mobile networks, Computer Communications, 25(5), 464-477. https://doi.org/10.1016/S0140-3664(01)00371-1
  18. Quintero, A. and Pierre, S. (2002), A memetic algorithm for assigning cells to switches in cellular mobile networks, IEEE communications letters, 6(11), 484-486. https://doi.org/10.1109/LCOMM.2002.805515
  19. Quintero, A. and Pierre, S. (2003a), Evolutionary approach to optimize the assignment of cells to switches in personal communication networks, Computer Communications, 26(9), 927-938. https://doi.org/10.1016/S0140-3664(02)00238-4
  20. Quintero, A. and Pierre, S. (2003b), Assigning Cells to Switches in cellular mobile networks : a comparative study, Computer Communications, 26(9), 950-960. https://doi.org/10.1016/S0140-3664(02)00224-4
  21. Rajalakshmi, K., Kumar, P., and Bindu, H. M. (2010), Hybridizing Iterative Local Search Algorithm for Assigning Cells to Switch in Cellular Mobile Network, International Journal of Soft Computing, 5(1), 7-12. https://doi.org/10.3923/ijscomp.2010.7.12
  22. Rappaport, T. S. (1996), Wireless Communications, Prentice-Hall.
  23. Saha, D., Mukherjee, A., and Bhattacharya, P. S. (2000), A Simple heuristic for assignment of cells to switches in a PCS network, Wireless personal communication, 12(2), 209-224. https://doi.org/10.1023/A:1008850615965
  24. Saha, D., Bhattacharjee, P. S., and Mukherjee, A. (2007), Time efficient heuristics for cell-to-switch assignment in quasi-static/dynamic location area planning of mobile cellular networks, Computer Communications, 30(2), 326-340. https://doi.org/10.1016/j.comcom.2006.08.036
  25. Salcedo-Sanza, S. and Yaob, X. (2008), Assignment of cells to switches in a cellular mobile network using a hybrid Hopfield network-genetic algorithm approach, Applied Soft Computing, 8(1), 216-224. https://doi.org/10.1016/j.asoc.2007.01.002