On solving the tree-topology design problem for wireless cellular networks

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]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[2]  Sungsoo Park,et al.  Efficient solution procedure and reduced size formulations for p-hub location problems , 1998, Eur. J. Oper. Res..

[3]  Michel Daoud Yacoub.  Wireless Technology: Protocols, Standards, and Techniques , 2001 .

[4]  Maria Zrikem,et al.  Variable neighborhood decomposition search for the optimization of power plant cable layout , 2002, J. Intell. Manuf..

[5]  Samuel Pierre,et al.  A Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless Networks , 2005 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Amitava Mukherjee,et al.  Heuristics for assignment of cells to switches in a PCSN: a comparative study , 1999, 1999 IEEE International Conference on Personal Wireless Communications (Cat. No.99TH8366).

[8]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[9]  B. Sengupta,et al.  Assignment of cells to switches in PCS networks , 1995, TNET.

[10]  Alejandro Quintero,et al.  Assigning cells to switches in cellular mobile networks: a comparative study , 2003, Comput. Commun..

[11]  Michel Daoud Yacoub.  Wireless technology , 2001 .

[12]  Louis Anthony Cox,et al.  Designing Least-Cost Survivable Wireless Backhaul Networks , 2000, J. Heuristics.

[13]  Samuel Pierre,et al.  On the Design Problem of Cellular Wireless Networks , 2005, Wirel. Networks.

[14]  Arif Merchant,et al.  Multiway graph partitioning with applications to PCS networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Amitava Mukherjee,et al.  A Simple Heuristic for Assignment of Cells to Switches in a PCS Network , 2000, Wirel. Pers. Commun..

[16]  Samuel Pierre,et al.  Assigning cells to switches in cellular mobile networks using taboo search , 2002, IEEE Trans. Syst. Man Cybern. Part B.