A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
LeZi-update: an information-theoretic framework for personal mobility tracking in PCS networks
Wireless Networks - Selected Papers from Mobicom'99
Location management in cellular networks
Handbook of wireless networks and mobile computing
A 2-D Random Walk Based Mobility Model for Location Tracking
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Concurrent search of mobile users in cellular networks
IEEE/ACM Transactions on Networking (TON)
Optimal sequential paging in cellular wireless networks
Wireless Networks
Location management in mobile wireless networks
Wireless internet handbook
Location Management of Correlated Mobile Users in the UMTS
IEEE Transactions on Mobile Computing
Mobile user tracking using a hybrid neural network
Wireless Networks
Location management based on distance and direction for PCS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Mobile Computing
Location management for wireless networks: issues and directions
International Journal of Mobile Communications
IEEE/ACM Transactions on Networking (TON)
A Stop-or-Move Mobility model for PCS networks and its location-tracking strategies
Computer Communications
| Hi-index | 0.00 |
This paper proposes the use of easily-obtainable information to reduce the “wireless” cost of locating mobile units in cellular communication networks. This comprises the direct cost of searching for them in different cells upon arrival of calls, as well as that of occasional position-updates issued by the units to reduce the number of cells that need to be searched. The direction of motion at the time of last update is used to construct an asymmetric distance-based reporting boundary and, in conjunction with the elapsed time since the latest position-update, to optimize the search order. For a Markovian motion model along a straight line and known motion parameters, optimal algorithms are provided. The results suggest that substantial savings may be attained in common demanding situations such as commuter traffic in congested corridors.