Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
Reducing location update cost in a PCS network
IEEE/ACM Transactions on Networking (TON)
Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
Journal of Optimization Theory and Applications
Mobile users: to update or not to update?
Wireless Networks
Mobile user location update and paging under delay constraints
Wireless Networks
A selective location update strategy for PCS users
Wireless Networks
Neuro-Dynamic Programming
User Mobility Pattern Scheme for Location Update and Paging in Wireless Systems
IEEE Transactions on Mobile Computing
Predictive distance-based mobility management for multidimensional PCS networks
IEEE/ACM Transactions on Networking (TON)
Tracking mobile users with uncertain parameters
Wireless Networks
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
A dynamic location management scheme for next-generation multitier PCS systems
IEEE Transactions on Wireless Communications
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
A new random walk model for PCS networks
IEEE Journal on Selected Areas in Communications
An adaptive distance-based location update algorithm for next-generation PCS networks
IEEE Journal on Selected Areas in Communications
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
Adaptive location update area design for wireless cellular networks under 2D Markov walk model
Computer Communications
Paging and location management in IEEE 802.16j multihop relay network
Journal of Computer Systems, Networks, and Communications - Special issue on WiMAX, LTE, and WiFi interworking
| Hi-index | 0.00 |
In this paper, we propose a mobile terminal (MT) location registration/update model. In this model, the registration decision is based on two factors驴the time elapsed since last call arrival and the distance the MT has traveled since last registration. It is established that the optimal registration strategy can be represented by a curve. Only when the state of the system reaches this curve is a registration performed. In order for an MT to calculate its traveled distance, an interactive implementation scheme and a distance calculation algorithm are developed. When the call interarrival times are independent and geometrically distributed, the proposed model becomes a distance-based model and, in this case, the optimal registration strategy is of threshold structure. For the distance-based model, a single sample path-based ordinal optimization algorithm is devised. In this algorithm, without any knowledge about the system parameters, the MT observes the system state transitions, estimates the ordinal of a set of strategies, and updates the registration strategy adaptively. Since only a single sample path is used, this algorithm can be implemented online. Several numerical examples are provided to compare the proposed model and the existing ones.