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
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
| Hi-index | 0.00 |
In Cellular Mobile Networks, assigning of cells to switch is known as assignment problem. The conventional integer programming method could be used for solving this problem, but then, when the number of cells exceeds 35, the total computational data surpass the memory available, computational time grow too larger and it becomes unfeasible to obtain the optimal solution. Thus this assignment problem defined above is a complex integer programming problem which has been proved to be NP hard problem. Particularly, in this paper addresses single homed assignment problem is discussed where each cells is connected to a single switch only. The objective function is to minimize the link cost between cells and switches upon their assignment. An efficient metaheuristic approach based on Iterative Local search is been proposed to minimizing link cost along with constraint based on number of available port on switches. Empirical results show that the proposed heuristic produces results nearer to optimal solution as expected.