Assigning cells to switches in mobile networks using an ant colony optimization heuristic

Authors:
Joseph R. L. Fournier;Samuel Pierre
Affiliations:
Mobile Computing and Networking Research Laboratory (LARIM), Department of Computer Engineering, Ecole Polytechnique of Montreal, P.O. Box 6079, Station Centre-ville, Montréal, Que., Canada H ...;Mobile Computing and Networking Research Laboratory (LARIM), Department of Computer Engineering, Ecole Polytechnique of Montreal, P.O. Box 6079, Station Centre-ville, Montréal, Que., Canada H ...
Venue:
Computer Communications
Year:
2005

Citing 4
Cited 5

Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
The ant colony optimization meta-heuristic

New ideas in optimization
Ant algorithms for discrete optimization

Artificial Life
A tabu search approach for assigning cells to switches in cellular mobile networks

Computer Communications

Ant colony optimization for the cell assignment problem in PCS networks

Computers and Operations Research
Survivable and delay-guaranteed backbone wireless mesh network design

Journal of Parallel and Distributed Computing
Ontological recommendation multi-agent for Tainan City travel

Expert Systems with Applications: An International Journal
Ant colony optimization for the cell assignment problem in PCS networks

Computers and Operations Research
A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.25

Visualization

Abstract

The problem of assigning cells to switches in a mobile network is an NP-Hard problem. It is therefore necessary to use a heuristic method to solve it in a reasonable amount of time. This paper applies the relatively new ant colony optimization meta-heuristic to this problem. It has also hybridized the local optimization k-opt technique with the heuristic. The developed algorithms have been applied to both problems (single and dual homing) described by the first studies regarding the assignment problem. In comparison to previous research, our methods are relatively efficient, regarding both quality of solutions provided and execution time of algorithms. It would thus be possible to increase the size of problem instances without augmenting the algorithm's execution time by a factor larger than n^2 and obtain solutions with an equivalent quality. The algorithm implemented for the double homing problem could be used to determine the best network configuration according to the number of known or anticipated calls for each cell, for each considered period of the day. It would afterwards be possible to design a dynamic algorithm that would take into account the existing physical links, which would determine in real time the appropriate moment for changing assignment (in respect of their management) of cells having two links, thus reducing the total number of handoffs occurring in the network.