Location Management of Correlated Mobile Users in the UMTS
IEEE Transactions on Mobile Computing
ACM SIGMOBILE Mobile Computing and Communications Review
Performance analysis of dynamic mobility management for proxy mobile IPv6 networks
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analytical-numerical study of mobile IPv6 and hierarchical mobile IPv6
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Performance analysis of adaptive mobility management in wireless networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A novel local mobility anchor selection scheme for proxy mobile IPv6 networks
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Improving session continuity through user mobility tracking for EPS inter-serving gateway handover
Wireless Communications & Mobile Computing
Trade-off between energy efficiency and report validity for mobile sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.01 |
In general packet radio service (GPRS), a mobile station (MS) is tracked at the cell level during packet transmission, and is tracked at the routing-area (RA) level when no packet is delivered. A READY timer (RT) mechanism was proposed in 3GPP 23.060 to determine when to switch from cell tracking to RA tracking. In this mechanism, a threshold interval T is defined. If no packet is delivered within T, the MS is tracked at the RA level. When a packet arrives, the MS is tracked at the cell level again. However, the RT mechanism has a major fallacy in that the RTs in both the MS and the serving GPRS support node may lose synchronization. This paper considers another mechanism called READY counter (RC) to resolve this problem. In this approach, a threshold K is used. Like the RT approach, the MS is tracked at the cell level during packet transmission. If no packets are delivered after the MS has made K cell crossings, the MS is tracked at the RA level. We also devise an adaptive algorithm called dynamic RC (DRC). This algorithm dynamically adjusts the K value to reduce the location update and paging costs. We propose analytic and simulation models to investigate RC, RT, and DRC. Our study indicates that RC may outperform RT. We also show that DRC nicely captures the traffic-mobility patterns and always adjusts the K threshold close to the optimal values.