By Topic

Heuristic search techniques for cell to switch assignment in location area planning for cellular networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Mandal ; Indian Inst. of Manage. Calcutta, India ; D. Saha ; A. Mahanti

The issue of grouping cells into location areas (LAs), where each LA is serviced by a switch, plays an important role in the planning of cellular networks. It is a combinatorial optimization problem that is known to be NP-hard. This paper proposes a total cost of operation (TCO) minimizing state space search formulation of the problem and a heuristic for assigning cell to switches. The TCO includes both recurring hand-off cost and amortized fixed cost. The proposed heuristic is used with block depth first search (BDFS), and also with iterative deepening A (IDA) to solve the problem. Detailed experiments show that the BDFS has a better performance than IDA with respect to execution time while finding an optimal solution. BDFS also outperforms other existing techniques that are based on meta-heuristics, namely, simulated annealing (SA), genetic algorithm (GA), tabu search (TS), and H-I, in terms of solution quality when they are constrained to run for a user specified time.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:7 )

Date of Conference:

20-24 June 2004