ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 30, Issue 9, 30 June 2007, Pages 2060-2069
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (530 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2007.04.001    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Adaptive location update area design for wireless cellular networks under 2D Markov walk model

Jun Zhenga, Corresponding Author Contact Information, E-mail The Corresponding Author, Yan Zhangb, E-mail The Corresponding Author, Ling Wangc, E-mail The Corresponding Author and Jinlin Chena, E-mail The Corresponding Author

aDepartment of Computer Science, Queens College – City University of New York, Flushing, NY 11367, USA bSimula Research Laboratory, 1325 Lysaker, Norway cCollege of Computer Science and Technology, Harbin Institute of Technology, Harbin, China

Received 15 September 2006; 
revised 14 March 2007; 
accepted 1 April 2007. 
Available online 4 April 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In wireless cellular networks, location management operation expends the limited wireless resources to keep track the location information of a mobile terminal. Various dynamic location update (LU) schemes have been proposed to improve the efficiency of location management. However, most of them only work for certain mobility patterns. In this paper, we propose a new scheme that the LU area is adaptively designed according to the mobility pattern and traffic parameters. The 2D Markov walk is used as the mobility model which describes a broad class of mobility patterns. A recursive algorithm is developed to compute the location management cost of a general LU area shape. Due to the high computational complexity of the adaptive LU area design problem, we use an iterative greedy heuristic algorithm to find an approximation solution of the problem efficiently. The effects of the mobility patterns and traffic parameters on the designed LU area shape are investigated. Experimental results show that the LU area designed by the heuristic algorithm can adaptively change according to the given mobility pattern and traffic parameters. Compared with some existing dynamic LU schemes, the proposed adaptive LU scheme is more flexible and efficient for location management.

Keywords: Adaptive location update area; Location management; 2D Markov walk model; Location update; Paging; Wireless cellular network

Article Outline

1. Introduction
2. Mobility model – 2D Markov walk
3. Adaptive LU area design
3.1. Location management cost of a general LU area shape
3.2. Heuristic algorithm for adaptive LU area shape design
4. Performance evaluation
4.1. The effect of mobility patterns
4.2. The effect of call-to-mobility ratio
4.3. The effect of the cost ratio cu/cp
4.4. The effect of cell residence time distribution
4.5. Performance comparison
5. Discussions
6. Conclusions
Acknowledgements
References
Vitae













Computer Communications
Volume 30, Issue 9, 30 June 2007, Pages 2060-2069
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.