On the design problem of cellular wireless networks

Authors:
Steven Chamberland;Samuel Pierre
Affiliations:
Computer Engineering Department, École Polytechnique de Montréal, Montréal (Québec), Canada;Computer Engineering Department, École Polytechnique de Montréal, Montréal (Québec), Canada
Venue:
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Year:
2005

Citing 9
Cited 5

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Economic aspects of configuring cellular networks

Wireless Networks
Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
Wireless technology: protocols, standards, and techniques

Wireless technology: protocols, standards, and techniques
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Designing Least-Cost Survivable Wireless Backhaul Networks

Journal of Heuristics
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

Wireless Personal Communications: An International Journal
A tabu search approach for assigning cells to switches in cellular mobile networks

Computer Communications

A tabu search algorithm for the global planning problem of third generation mobile networks

Computers and Electrical Engineering
On cost-efficient optimisation of universal mobile telecommunications system access subsystem using extended evolutionary heuristic algorithm

International Journal of Mobile Network Design and Innovation
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic

Computers and Operations Research
A local search heuristic to solve the planning problem of 3G UMTS all-IP release 4 networks with realistic traffic

International Journal of Autonomous and Adaptive Communications Systems
An Efficient Algorithm for Optimizing Base Station Site Selection to Cover a Convex Square Region in Cell Planning

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.