Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
On the design problem of cellular wireless networks
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
International Journal of Network Management
Optimal switch location in mobile communication networks using hybrid genetic algorithms
Applied Soft Computing
LTE access network planning and optimization: a service-oriented and technology-specific perspective
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Comparison of different meta-heuristics to solve the global planning problem of UMTS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless network design: solution-oriented modeling and mathematical optimization
IEEE Wireless Communications
Location area planning and cell-to-switch assignment in cellular networks
IEEE Transactions on Wireless Communications
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
Hi-index | 0.00 |
Tremendous increase in mobile subscribers, demand for real-time interactive applications of voice, text, multimedia data and also to provide QoS attracts researchers towards the wireless cellular mobile networks. This necessitates, cellular network monitoring and cost optimisation a non-trivial problem that needs continuous scrutinise and improvement. In this study, we propose a categorisation strategy that eases the approach of optimising the access subsystem of universal mobile telecommunications system UMTS cellular network problem. Further, we use mixed integer programming model for optimisation of layered cellular access network and is a NP hard problem. In order to find feasible solution, we propose an extended evolutionary heuristic algorithm that uses powerful techniques like reassignment, redistribution and shuffle tolerance limit. Finally, we show that our proposed heuristic algorithm outperforms other conventional algorithm for both smaller networks and larger networks.