이동통신 네트워크에서 주파수간 간섭과 서비스 장애를 최소화하는 주파수 재할당 방법

Minimizing Frequency Drop Cost and Interference Cost in Reconfiguring Radio Networks

  • Han, Jung-Hee (Department of Business Administration, Kangwon National University)
  • 투고 : 2010.03.24
  • 심사 : 2010.06.07
  • 발행 : 2010.09.30

초록

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.

키워드

참고문헌

  1. Aardal K, S. Hoesel, A. Koster, C. Mannino, and A. Sassano, "Models and solution techniques frequency assigrunent problems", ZlB Report 01-40, 2001.
  2. Chang K. and S. Kim, "Channel allocation in cellular radio networks", Computers and Operations Research,Vol.24(1997), pp.849-860. https://doi.org/10.1016/S0305-0548(96)00098-6
  3. CPLEX Division, CPLEX 10.0 Users' Manual : ILOG Inc., 2006.
  4. Fischetti M., C. Lepschy, G. Minerva, G. Momanin-Jacur, and E. Toto, "Frequency assignment in mobile radio systems using branch-and-cut techniques", European Journal of Operational Research, Vol.123(2000), pp.241- 255. https://doi.org/10.1016/S0377-2217(99)00254-4
  5. Fisher L., N. Jaiktunar and A. Van Wassenhove, "A multiplier adjustment method for the generalized assignment problem", Management Science, Vol.32(1986), pp.1095-1103. https://doi.org/10.1287/mnsc.32.9.1095
  6. Gamst A. and W. Rave, "On frequency assignment in mobile automatic telephone systems", Proc. of GLOBECOM IEEE, (1982), pp.309-315.
  7. Hale K, "Frequency assignment : theory and application", Proc. of IEEE, (1980), pp. 1498-1573.
  8. Han J. H., "Tabu search algorithm for frequency reassignment problem in mobile communication networks", Journal of Korean lnstitute of Industrial Engineers, Vol.31(2005), pp.1-9.
  9. Hao J., R. Dome, and P. Galinier, "Tabu search for frequency assignment in mobile radio networks", Journal of Heuristics, Vol.4(1990), pp.47-62.
  10. Jamuard B., C. Marcotte, C. Meyer, and T. Vovor, "Comparison of column generation models for channel assignment in cellular networks", Discrete Applied Mathematics,Vol.112(2001), pp.217-240. https://doi.org/10.1016/S0166-218X(00)00317-6
  11. Martello S. and P. Toth, Knapsack problems : Algorithms and computer implementations, John Wiley and Sons : England, 1990.
  12. Marthar R. and J. Mattfeldt, "Channel assignment in cellular radio networks", IEEE Trans. on Veh Tech., Vol. 42(1993), pp.647-656. https://doi.org/10.1109/25.260746
  13. Padberg M., "On the facial. structure of set packing polyhedra", Math Prog., Vol.5(1973), pp.199-215. https://doi.org/10.1007/BF01580121
  14. Sung W. and W. Wong, "Sequential packing algorithm for channel assignment under cochannel and adjacent channel interference constraint", IEEE Trans. on Veh Tech, Vol.46 (1997), pp.676-686 https://doi.org/10.1109/25.618193
  15. Tiourine R. C. Hurkens, and J. Lenstra, "Local search algorithm for the radio link frequency assignment problem", Telecommunication Systems, Vol.13(2000), pp.293-314. https://doi.org/10.1023/A:1019100324508
  16. www.thestandard.com.
  17. www.rimweb.in.