Solving assignment problem of cellular mobile network using iterative local search algorithm

Authors:
K. Rajalakshmi
Affiliations:
Jaypee Institute of Information Technology University, Noida, India
Venue:
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Year:
2010

Citing 8
Cited 0

Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for the terminal assignment problem

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A local search heuristic for the global planning of UMTS networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Optimal switch location in mobile communication networks using hybrid genetic algorithms

Applied Soft Computing
Assigning cells to switches in cellular mobile networks using taboosearch

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Assigning cells to switches in cellular networks by incorporating a pricing mechanism into Simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Assigning cells to switches in cellular mobile networks: a comparative study

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses, assigning cells to switches, given that each cell is connected to only one switch and performs signal handoff between cells that are connected to same switch, particularly know as single homed simple handoff assignment problem of Cellular Mobile Network. The objective function is minimization of cost while assigning cells to switches. This assignment problem falls under the same category of Complex Integer Programming Problem, which is proved to be a NP hard problem. In this paper a nondeterministic heuristic approach based on efficient Iterative Local search has been proposed. 2-opt and 3-opt local search techniques are used. Empirical results show that the proposed heuristic produces results nearer to optimal solution as expected.