Browse > Article

Minimizing Frequency Drop Cost and Interference Cost in Reconfiguring Radio Networks  

Han, Jung-Hee (Department of Business Administration, Kangwon National University)
Publication Information
Journal of Information Technology Services / v.9, no.3, 2010 , pp. 107-121 More about this Journal
Abstract
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.
Keywords
Radio Network; Frequency Reassignment; Integer Programming; Heuristic;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Marthar R. and J. Mattfeldt, "Channel assignment in cellular radio networks", IEEE Trans. on Veh Tech., Vol. 42(1993), pp.647-656.   DOI   ScienceOn
2 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.
3 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.   DOI   ScienceOn
4 Martello S. and P. Toth, Knapsack problems : Algorithms and computer implementations, John Wiley and Sons : England, 1990.
5 Gamst A. and W. Rave, "On frequency assignment in mobile automatic telephone systems", Proc. of GLOBECOM IEEE, (1982), pp.309-315.
6 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.   DOI   ScienceOn
7 Chang K. and S. Kim, "Channel allocation in cellular radio networks", Computers and Operations Research,Vol.24(1997), pp.849-860.   DOI   ScienceOn
8 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.
9 Hale K, "Frequency assignment : theory and application", Proc. of IEEE, (1980), pp. 1498-1573.
10 Aardal K, S. Hoesel, A. Koster, C. Mannino, and A. Sassano, "Models and solution techniques frequency assigrunent problems", ZlB Report 01-40, 2001.
11 Padberg M., "On the facial. structure of set packing polyhedra", Math Prog., Vol.5(1973), pp.199-215.   DOI   ScienceOn
12 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.   DOI   ScienceOn
13 CPLEX Division, CPLEX 10.0 Users' Manual : ILOG Inc., 2006.
14 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.   DOI   ScienceOn
15 www.thestandard.com.
16 www.rimweb.in.
17 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   DOI   ScienceOn