Journal of Communications and Networks

  • 제5권1호
  • /
  • Pages.43-54
  • /
  • 2003
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

A Decomposition Approach for Fixed Channel Assignment Problems in Large-Scale Cellular Networks

  • 발행 : 2003.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Due to insufficient available bandwidth resources and the continuously growing demand for cellular communication services, the channel assignment problem has become increasingly important. To trace the optimal assignment, several heuristic strategies have been proposed. So far, most of them focus on the small-scale systems containing no more than 25 cells and they use an anachronistic cost model, which does not satisfy the requirements ity. Solving the small-scale channel assignment problems could not be applied into existing large scale cellular networks' practice. This article proposes a decomposition approach to solve the fixed channel assignment problem (FCAP) for large-scale cellular networks through partitioning the whole cellular network into several smaller sub-networks and then designing a sequential branch-and-bound algorithm that is made to solve the FCAP for them sequentially. The key issue of partition is to minimize the dependences of the sub-networks so that the proposed heuristics for solving smaller problems will suffer fewer constraints in searching for better assignments. The proposed algorithms perform well based on experimental results and they were applied to the Taiwan Cellular Cooperation (TCC) in ChungLi city to find better assignments for its network.

키워드

참고문헌

  1. M. H. Jin et at., 'An evolutionary approach to fixed channel assignmentproblems with limited bandwidth constraint,' in Proc. ICC2001, vol. 7,June 2001, pp. 2100-2104
  2. N. Funabiki, N. Okutani, and S. Nishikawa, 'A three-stage heuristic com-bined neural-network algorithm for channel assignment in cellular mobilesystems,' IEEE Trans. Vehicut. Technot., vol. 49, issue: 2, no. 4, PP. 397-403, Mar. 2000 https://doi.org/10.1109/25.832970
  3. S. Azad and R. Sankar, 'Performance of channel assignment strategies incellular systems,' in Proc. IEEE Southeastcon '99, pp. 299-304
  4. T. J. Kahwa and N. D. Georganas, 'A hybrid channel assignment schemein large-scale, cellular-structured mobile communication systems,' IEEE Trans. Commun., vol. COM-26, no. 4, Apr. 1978
  5. C. Y. Ngo and V. O. K. Li, 'Fixed channel assignment in cellular radio net-works using a modified genetic algorithm,' IEEE Trans. Vehicut. Technot.,vol.47,no.1,pp.163-171, 1998
  6. K. N. Sivarajan, R. J. McEliece, and J. W. Ketchun, 'Channel assignmentin cellular radio,' in Proc. 39th IEEE VTC, May 1989, pp. 846-850
  7. P. Raymond, 'Performance analysis of cellular networks,' IEEE Trans.Commun., vol. 39, no. 12, PP. 1787-1793, Dec. 1991 https://doi.org/10.1109/26.120164
  8. B. Dirk and K. Ulrich, 'A new strategy for the application of genetic algo-rithms to the channel-assignment problem,' IEEE Trans. Vehicuf. TechnoI.,vol.48,no.4,pp.1261-1269,July 1999 https://doi.org/10.1109/25.775374
  9. W. K. Hale, 'Frequency assignment: theory and applications,' in Proc. IEEE, vol. 68, no. 12, 1980, PP. 1497-1514 https://doi.org/10.1109/PROC.1980.11899
  10. F. Box, 'A heuristic technique for assignment frequencies to mobile radionets,' IEEE Trans. Vehicul. Technot., vol. 27, PP. 57-64, 1977
  11. S. Kim and S. L. Kim, 'A two-phase algorithm for frequency assignmentin cellular mobile systems,' IEEE Trans. Vehicut. Technot., vol. 43, no. 3pp. 542-548,1994 https://doi.org/10.1109/25.312792
  12. N. Funabiki and Y. Takefuji, 'A neural network parallel algorithm forchannel assignment problems in cellular radio networks,' IEEE Trans. Vehicul. Technot., vol. 41, no. 4, pp. 430-437, 1992 https://doi.org/10.1109/25.182594
  13. A. I. Giortzis, L. F. Turner, and J. A. Barria, 'Decomposition technique forfixed channel assignment problems in mobile radio networks,' IEEE Proc.Commun., vol. 147, issue 3, PP. 187-194, June 2000 https://doi.org/10.1049/ip-com:20000336