World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Special Issue – Advances in Parallel and Distributed Computational Models (APDCM 2009)No Access

ON THE PERFORMANCE OF STATIC AND DYNAMIC LOCATION MANAGEMENT STRATEGIES IN MOBILE COMPUTING

    https://doi.org/10.1142/S0129054111008210Cited by:2 (Source: Crossref)

    This work reviews a number of algorithms to solve the location management problem in mobile networks for both static and dynamic scenarios. In the static mode, results of five algorithms are used to highlight the pros and cons for each algorithm. These results provide new insight into the mobility management problem that can influence the design of future wireless networks. In the dynamic mode in which mobile users' past movement patterns are used in making future paging decisions by the network, the performance of an online location management algorithm is examined under different deployment setups. Performance results of this algorithm show its advantages over the currently implemented and/or proposed static location management systems (including GSM).