Simulated Annealing for Location Area Planning in Cellular networks

Details Simulated Annealing for Location Area Planning in Cellular networks Simulated Annealing for Location Area Planning in Cellular networks

2010-03-18

arxiv.org/abs/1003.3553v1

International journal on applications of graph theory in wireless ad hoc networks and sensor networks 2.1 (2010) 1-7

Computer Science

Networking and Internet Architecture

7 Pages, JGraph-Hoc Journal

Scientific paper

10.5121/jgraphhoc.2010.2101

LA planning in cellular network is useful for minimizing location management
cost in GSM network. In fact, size of LA can be optimized to create a balance
between the LA update rate and expected paging rate within LA. To get optimal
result for LA planning in cellular network simulated annealing algorithm is
used. Simulated annealing give optimal results in acceptable run-time.

Affiliated with

Also associated with

No associations

Rating

Simulated Annealing for Location Area Planning in Cellular networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulated Annealing for Location Area Planning in Cellular networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulated Annealing for Location Area Planning in Cellular networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700342