A mobile user location update and paging mechanism under delay constraints

Authors:
Ian F. Akyildiz;Joseph S. M. Ho
Affiliations:
Broadband and Wireless Networking Laboratory (B.W.N Lab), School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Broadband and Wireless Networking Laboratory (B.W.N Lab), School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA
Venue:
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Year:
1995

Citing 3
Cited 6

Mobile users: to update or not to update?

Wireless Networks
Dynamic mobile user location update for wireless PCS networks

Wireless Networks
Minimizing the average cost of paging under delay constraints

Wireless Networks

A survey of routing techniques for mobile communications networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
Mobile user location update and paging under delay constraints

Wireless Networks
Hierarchical Group Location Tracking for Transportation Systems inWireless Personal Communication Networks

Wireless Personal Communications: An International Journal
Location management in mobile wireless networks

Wireless internet handbook
DIP-MIP: Distributed individual paging extension for mobile IP in IP-based cellular networks

Computer Communications
Resource management issues in future wireless multimedia networks

Journal of High Speed Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for location update and terminal paging, the average total location update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal location update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.