On Solving the Tree-Topology Design Problem for Wireless Cellular Networks

  • Pomerleau Yanick (Department of Computer Engineering, Ecole Polytechnique de Montreal) ;
  • Chamberland Steven (Department of Computer Engineering, Ecole Polytechnique de Montreal) ;
  • Pesant Gilles (Department of Computer Engineering, Ecole Polytechnique de Montreal)
  • 발행 : 2006.03.01

초록

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

키워드

참고문헌

  1. A. Merchant and B. Sengupta, 'Multi way graph partitioning with applications to PCS networks,' in Proc. IEEE INFOCOM'94, Toronto, Canada, June 1994, pp. 593-600
  2. A. Merchant and B. Sengupta, 'Assignment of cells to switches in PCS networks,' IEEE/ACM Trans. Networking, vol. 3, no. 5, pp. 521-526, 1995 https://doi.org/10.1109/90.469954
  3. J. Sohn and S. Park, 'Efficient solution procedure and reduced size formulations for p-hub location problems,' European J. Operational Research, vol. 108, pp. 118-126, 1998 https://doi.org/10.1016/S0377-2217(97)00201-4
  4. M. Andre, G. Pesant, and S. Pierre, 'A variable neighborhood search algorithm for assigning cells to switches in wireless networks,' J. Computer Sci., vol. 1, no. 2, pp. 175-181, 2005 https://doi.org/10.3844/jcssp.2005.175.181
  5. G. Amoussou, M. Andre, G. Pesant, and S. Pierre, 'A constraint programming approach to assign cells to switches in personnal communication networks,' Annals of Telecommun., vol. 58, no. 3, pp. 584-604, 2003
  6. S. Chamberland and S. Pierre, 'On the design problem of cellular wireless networks,' Wireless Networks, vol. 11, no. 4, pp. 489-496, 2005 https://doi.org/10.1007/s11276-005-1770-3
  7. L. A. Cox and J. R. Sanchez, 'Designing least-cost survivable wireless backhaul networks,' J. Heuristics, vol. 6, no. 4, pp. 525-540, 2000 https://doi.org/10.1023/A:1009673427015
  8. S. Pierre and F. Houeto, 'Assigning cells to switches in cellular mobile networks using taboo search,' IEEE/ACM Trans. Syst., Man, Cybernetics, vol. 32, no. 3, pp. 465-478, 2002
  9. S. Pierre and A. Quintero, 'Assigning cells to switches in cellular mobile networks: A comparative study,' Computer Commun., vol. 26, no. 9, pp. 950-960, 2003 https://doi.org/10.1016/S0140-3664(02)00224-4
  10. P. S. Bhattacharjee, D. Saha, and A. Mukherjee, 'Heuristics for assignment of cells to switches in a PCSN: A comparative study,' in Proc. IEEE PWC'99, Jaipur, India, Feb. 1999, pp. 331-334
  11. D. Saha, A. Mukherjee, and P. Bhattacharya, 'A simple heuristic for assigment of cell to switches in a PCS network,' Wireless Pers. Commun., vol. 12, pp. 209-224, 2000 https://doi.org/10.1023/A:1008850615965
  12. P. Hansen, N. Mladenovic, and D. Perez-Brito, 'Variable neighborhood decomposition search,' J. Heuristics, vol. 7, no. 4, pp. 335-350, 2001 https://doi.org/10.1023/A:1011336210885
  13. K. Marriott and P. J. Stuckey, Programming with Constraints: An Introduction, The MIT Press, 1998
  14. M. D. Yacoub, Wireless Technology: Protocols, Standards, and Techniques, CRC Press, 2002
  15. ILOG, 'ILOG OPL STUDIO 3.5-The Optimisation Language,' 1999
  16. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publisher, 1997
  17. S. Kirpatrick, C. D. Gelatt, and M. P. Vecchi, 'Optimization by simulated annealing,' Science, vol. 220, pp. 671-680, 1983 https://doi.org/10.1126/science.220.4598.671