Skip Navigation

The Computer Journal 2002 45(5):525-539; doi:10.1093/comjnl/45.5.525
© 2002 by British Computer Society
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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Kozatchok, I.
Right arrow Articles by Pierre, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

User Tracking and Mobility Management Algorithm for Wireless Networks

Irina Kozatchok1 and Samuel Pierre1

1 Mobile Computing and Networking Research Laboratory (LARIM),Department of Computer Engineering, École Polytechnique de Montréal, C.P. 6079, succ. Centre-ville, Montréal, Québec, Canada H3C 3A7 Email: samuel.pierre@polymtl.ca

This paper presents an algorithm for minimizing the cost associated with the management of users' mobility in mobile communications networks. This algorithm allows one to determine the optimal size of a location area and to find the optimal cellular grouping model in polling regions. It guarantees the global minimum of the total cost function, while respecting the pre-established delay constraints. It takes into account the average probabilities of received calls, movements, updates and paging costs. This algorithm also allows one to avoid the problem of evaluating the cost function in a large number of points, which makes it usable on machines with limited computing power.

Received 4 April, 2001. Revised 5 February, 2002.


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.