An efficient heuristic for the expansion problem of cellular wireless networks

被引:13
作者
Chamberland, S
机构
[1] CRT, Montreal, PQ H3C 3A7, Canada
[2] Ecole Polytech Montreal, Dept Comp Engn, Montreal, PQ H3C 3A7, Canada
关键词
cellular networks; topological expansion; facility location and type selection; tabu search;
D O I
10.1016/S0305-0548(03)00119-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we propose a model for the expansion problem of the network subsystem (NSS) of a universal mobile telecommunication system (UNITS) wireless cellular network considering an update in the base station subsystem (BSS). The objective is to minimize the expansion cost of the network subsystem while considering network performance (e.g., call and handover blocking). Since the network expansion problem is a generalization of the design problem, the proposed model can also be used for designing networks. In order to find good solutions, we propose a heuristic based on the tabu search principle. Finally, we present a performance analysis of the proposed heuristic. The analysis shows that quasi-optimal solutions are found with the proposed heuristic. (C) 2003 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1769 / 1791
页数:23
相关论文
共 17 条
[1]  
[Anonymous], 1997, Tabu Search
[2]  
BEAUBRUN R, 1999, P INT C WIR COMM, P259
[3]   Heuristics for assignment of cells to switches in a PCSN: A comparative study [J].
Bhattacharjee, PS ;
Saha, D ;
Mukherjee, A .
1999 IEEE INTERNATIONAL CONFERENCE ON PERSONAL WIRELESS COMMUNICATIONS, 1999, :331-334
[4]   Design of partially survivable networks for cellular telecommunication systems [J].
Dutta, A ;
Kubat, P .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 118 (01) :52-64
[5]  
*ILOG INC, 2001, ILOG ILOG CPLEX 7 1
[6]   A SHORTEST AUGMENTING PATH ALGORITHM FOR DENSE AND SPARSE LINEAR ASSIGNMENT PROBLEMS [J].
JONKER, R ;
VOLGENANT, A .
COMPUTING, 1987, 38 (04) :325-340
[7]  
Krishnamachari B, 2000, IEEE VTS VEH TECHNOL, P1632, DOI 10.1109/VETECF.2000.886104
[8]   Design of cellular networks with diversity and capacity constraints [J].
Kubat, P ;
Smith, JM ;
Yum, C .
IEEE TRANSACTIONS ON RELIABILITY, 2000, 49 (02) :165-175
[9]   A multi-period network design problem for cellular telecommunication systems [J].
Kubat, P ;
Smith, JM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 134 (02) :439-456
[10]   ASSIGNMENT OF CELLS TO SWITCHES IN PCS NETWORKS [J].
MERCHANT, A ;
SENGUPTA, B .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (05) :521-526