By Topic

Location area planning and cell-to-switch assignment in 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
$31 $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

4 Author(s)
Demirkol, I. ; Dept. of Comput. Eng., Bogazici Univ., Istanbul, Turkey ; Ersoy, C. ; Caglayan, M.U. ; Delic̀§, H.

Location area (LA) planning plays an important role in cellular networks because of the tradeoff caused by paging and registration signalling. The upper boundary for the size of an LA is the service area of a mobile services switching center (MSC). In that extreme case, the cost of paging is at its maximum but no registration is needed. On the other hand, if each cell is an LA, the paging cost is minimal but the cost of registration is the largest. Between these extremes lie one or more partitions of the MSC service area that minimize the total cost of paging and registration. In this paper, we seek to determine the location areas in an optimum fashion. Cell to switch assignments are also determined to achieve the minimization of the network cost. For that purpose, we use the available network information to formulate a realistic optimization problem, and propose an algorithm based on simulated annealing (SA) for its solution. Then, we investigate the quality of the SA-based technique by comparing it to greedy search, random generation methods, and a heuristic algorithm.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:3 ,  Issue: 3 )