On the design problem of cellular wireless networks

被引：6

作者：

Chamberland, S ^{[1
]}

Pierre, S ^{[1
]}

机构：

[1] Ecole Polytech, Dept Comp Engn, Montreal, PQ H3C 3A7, Canada

来源：

WIRELESS NETWORKS | 2005年 / 11卷 / 04期

关键词：

cellular networks; topological design; BSC and MSC location; capacity planning; tabu search;

D O I：

10.1007/s11276-005-1770-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we deal with the problem of how to design cellular networks in a cost-effective way. We first propose an optimization model that deals with selecting the location of the base station controllers (BSCs) and mobile service switching centers (MSCs), selecting their types, designing the network topology and selecting the link types. In order to find a "good" solution, we propose a tabu search algorithm. Numerical results show that the tabu search algorithm produces solutions close to a proposed lower bound.

引用

页码：489 / 496

页数：8

共 15 条

[1]

[Anonymous], 1997, Tabu Search

[2]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[3]

BEAUBRUN R, 1999, P 11 INT C WIR COMM, V1, P259

[4] 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

[5] Designing least-cost survivable wireless backhaul networks [J].

Cox Jr. L.A. ;

Sanchez J.R. .

Cox, Louis Anthony, 2000, Kluwer Academic Publishers, Dordrecht, Netherlands (06) :525-540

[6] Economic aspects of configuring cellular networks [J].

Gavish, Bezalel ;

Sridhar, Suresh .

WIRELESS NETWORKS, 1995, 1 (01) :115-128

[7]

*ILOG, 2001, ILOG CPLEX 7 1 ADV R

[8] A SHORTEST AUGMENTING PATH ALGORITHM FOR DENSE AND SPARSE LINEAR ASSIGNMENT PROBLEMS [J].

JONKER, R ;

VOLGENANT, A .

COMPUTING, 1987, 38 (04) :325-340

[9] ASSIGNMENT OF CELLS TO SWITCHES IN PCS NETWORKS [J].

MERCHANT, A ;

SENGUPTA, B .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (05) :521-526

[10]

MERCHANT A, 1994, IEEE INFOCOM SER, P593, DOI 10.1109/INFCOM.1994.337682

← 1 2 →