We present four eecient heuristics (one basic scheme and three of its variants) to predict the location of a mobile user in the cellular mobile environment. The proposed location management schemes assume a hierarchy of location areas, which might change dynamically with changing traac patterns. A method to compute this hierarchical tree is also proposed. Depending on the proole of the user movements for the last time units, the most probable (and the future probable) location areas are computed for the user in the basic scheme and its rst variant. The second variant predicts the location probabilities of the user in the future cells combining them with those already traversed in the last time units to form the most probable location area. The third variant is a hybrid of the rst and second variants. Finally, the proposed heuristics are validated by extensive simulation of a real time cellular mobile system, where all the four schemes are compared under various traac patterns.
[1]
Seizo Onoe,et al.
A new location updating method for digital cellular systems
,
1991,
[1991 Proceedings] 41st IEEE Vehicular Technology Conference.
[2]
Kalyan Basu,et al.
Adaptive paging algorithms for cellular systems
,
1995,
1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.
[3]
Dieter Plassmann.
Location management strategies for mobile cellular networks of 3rd generation
,
1994,
Proceedings of IEEE Vehicular Technology Conference (VTC).
[4]
Xian Zhou,et al.
Locating Strategies for Personal Communication Networks: A Novel Tracking Strategy
,
1997,
IEEE J. Sel. Areas Commun..