Abstract
In this work we have addressed the issue of inherent trade-off between location update cost and paging cost for proper location area (LA) planning and have attempted to find out an optimal LA size such that the total cost comprising of location update and paging can be minimized. We have formulated a constrained cost optimization problem under the known patterns of call arrival and terminal mobility. The present work is divided into two parts. First, we have tried to validate the model itself; next we have proposed an algorithm based on simulated annealing technique as a solution methodology for the hard constrained optimization problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
