ON THE PERFORMANCE OF STATIC AND DYNAMIC LOCATION MANAGEMENT STRATEGIES IN MOBILE COMPUTING
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).