Integer and combinatorial optimization
Integer and combinatorial optimization
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Mobile Radio Communications
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
A heuristics based approach for cellular mobile network planning
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A dynamic location management scheme for next-generation multitier PCS systems
IEEE Transactions on Wireless Communications
Location area planning and cell-to-switch assignment in cellular networks
IEEE Transactions on Wireless Communications
Hierarchical provisioning for 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
A two-phase genetic K-means algorithm for placement of radioports in cellular networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Research note: Design of hierarchical communication networks under node/link failure constraints
Computer Communications
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
On optimal design of multitier wireless cellular systems
IEEE Communications Magazine
Performance improvement of LTE tracking area design: a re-optimization approach
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Hi-index | 0.24 |
This paper presents a set of time efficient, sub-optimal heuristics to solve the problem of assigning cells to mobile switching centers (or, switches in short) for an effective location area (LA) planning in a mobile cellular network (MCN). A common objective of this NP-hard optimization problem, termed as cell-to-switch assignment (CSA) in the literature, is to minimize the hybrid cost, comprising handoff cost between adjacent cells, and the cable cost between cells and switches, subject to the constraint that the call volume to be handled by a switch should not exceed its traffic handling capacity. To solve CSA for a quasi-static/dynamic LA design, we need fast algorithms capable of producing acceptable solutions within a reasonable time. In this work, we first propose four variants (termed as heuristics III through VI) of our earlier heuristic (termed as heuristic II) and compare all of them with other published heuristics in respect of execution time and solution cost. Results indicate that though no single heuristic performs equally well with respect to both optimality and speed, heuristic IV is the best of the lot. Secondly, we modify the original CSA problem to include the factor of load balancing amongst switches (thereby minimizing unfairness), and propose a new CSA algorithm with load balancing (CALB), which emphasizes more on load balancing than on cost optimization. It is found that CALB is fast as heuristic VI, and performs extremely well in balancing the traffic amongst the switches, thereby increasing the overall scalability of MCNs against the increase in either mobile user density or per user traffic.