Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Heuristics for the Access Network Design Problem in UMTS Mobile Communication Networks

UMTS 이동통신망의 액세스망 설계 문제의 해법에 관한 연구

  • 김후곤 (경성대학교 경영정보학과) ;
  • 정용주 (동의대학교 산업경영공학과) ;
  • 백천현 (부산외국어대학교 e-비즈니스학과)
  • Received : 2010.02.16
  • Accepted : 2010.08.05
  • Published : 2010.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we study the access network design problem in Universal Mobile Telecommunication Systems (UMTS) networks. Given the location of radio base stations (node-Bs), their traffic demands, and the candidate facility centers for locating radio network controllers (RNCs), the problem is to determine the configuration of access network, including the number and location of facility centers, the number of RNCs in each facility center, and the links between RNCs and node-Bs, with the objective being to design such a network at the minimum cost. We provide a mathematical formulation of the problem with constraints on RNC and node-B capacities, along with a lower bounding method. We develop a heuristic algorithm with two different initial solution methods designed to strengthen the solution quality. The computational efficacy of their procedures is then demonstrated on a number of test problems.

Keywords

References

  1. Holma, H. and A. Toskala, WCDMA for UMTS：John Wiley and Sons, 2001.
  2. Cheung, J.C.S., M.A. Beach, and J.P. Mc- Geehan, "Network planning for third-generation mobile radio systems," IEEE Communications Magazine, Vol.32(1994), pp.54- 59.
  3. Berruto, E., M. Gudmundson, R. Menolascino, W. Mohr, and M. Pizarroso, "Research activities on UMTS radio interface, network architectures, and planning," IEEE Communications Magazine, Vol.36(1998), pp.82-95.
  4. Rose, R., "A smart technique for determining base-station locations in an urban environment," IEEE Transactions on Vehicular Technology, Vol.50(2001), pp.43-7. https://doi.org/10.1109/25.917869
  5. Eisenblatter, A., A. Fugenschuh, T. Koch, A. Koster, A. Martin, T. Pfender, O. Wegel, and R. Wessaly, "Modelling Feasible Network Configurations for UMTS," Konrad- Zuse-Zentrum fur Information stechnik, Berlin, Germany 02-16, 2002.
  6. Hao, Q., B.-H. Soong, E. Gunawan, J.-T. Ong, C.-B. Soh, and Z. Li, "A low-cost cellular mobile communication system：a hierarchical optimization network resource planning approach," IEEE Journal on Selected Areas in Communications, Vol.15 (1997), pp.1315-26. https://doi.org/10.1109/49.622914
  7. Laiho, J., A. Wacker, and T. Novosad, Radio Network Planning and Optimization for UMTS：John Wiley and Sons, 2002.
  8. Merchant, A. and B. Sengupta, "Assignment of cells to switches in PCS networks," IEEE/ACM Transactions on Networking, Vol.3(1995), pp.521-526. https://doi.org/10.1109/90.469954
  9. Krishnamachari, B. and S.B. Wicker, "Optimization of fixed network design in cellular systems using local search algorithms," presented at Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC 2000, 52nd Vehicular Technology Conference, Boston, MA, USA, 2000.
  10. Juttner, A., A. Orban, and Z. Fiala, "Two new algorithms for UMTS access network topology design," forthcoming.
  11. Monaci, M. and P. Toth, "A set-covering based heuristic approach for bin-packing problems," Working paper.
  12. Spieksma, F.C.R., "A branch-and-bound algorithm for the two-dimensional vector packing problem," Computers and Operations Research, Vol.21(1994), pp.19-25. https://doi.org/10.1016/0305-0548(94)90059-0
  13. Carprara, A. and P. Toth, "Lower bounds and algorithms for the 2-dimensional vector packing problem," Discrete Applied Mathematics, Vol.111(2001), pp.231-62. https://doi.org/10.1016/S0166-218X(00)00267-5
  14. Hochbaum, D.S., Approximation Algorithms for NP-hard Problems：PWS Publishing Company, 1997.