Skip Navigation

The Computer Journal 2005 48(1):84-100; doi:10.1093/comjnl/bxh063
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lam, K.-Y.
Right arrow Articles by Zhang, C.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?



Grand Challenges

On Using Handoff Statistics and Velocity for Location Management in Cellular Wireless Networks

Kam-Yiu Lam1 *, BiYu Liang1,2 and ChuanLin Zhang2

1 Department of Computer Science, City University of Hong Kong, 83 TatChee Avenue, Kowloon, Hong Kong, 2 Department of Mathematics, Jinan University, Guangzhou 510632, P.R.C.

This paper studies the location management problem in cellular wireless networks. We propose a handoff-velocity prediction (HVP) scheme to minimize the paging cost in searching a mobile terminal. HVP is based on the assumptions that the movement behavior of mobile terminals has temporal and spatial properties. Based on handoff statistics the system maintains a handoff graph to describe the movement probabilities of a mobile terminal in a cell to the neighboring cells within a location area. Combining with the velocity information of a mobile terminal we calculate the probabilities of finding the mobile terminal in the cells within the paging area. Then, the paging of the mobile terminal follows the cell probabilities to minimize the paging cost of a mobile terminal. Analysis on HVP has been performed to calculate the optimal threshold for update generation to minimize the total cost in location management. A group paging scheme based on a non-linear programming technique is suggested to limit the paging delay within the quality of services (QoS) requirement in call connection delay and at the same time to minimize the paging cost. In 3G networks and the next generation wireless networks different connection requests may have different QoS requirements in connection delay. Extensive experiments have been performed to investigate the performance characteristics of HVP when compared with the adaptive distance-based (ADB) method, the direction-based location update (DBLU) method and the basic velocity paging (BVP) method under different system settings. The results have shown that HVP gives a better performance when compared with ADB, DBLU and BVP for different call-to-mobility ratio values and update cost to paging cost ratios.


Received 2 September 2003. Revised 8 June 2004.

* Email: cskylam{at}cityu.edu.hk


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.