Journal ArticleDOI
Optimal dynamic mobility management for PCS networks
Jie Li,Hisao Kameda,Keqin Li +2 more
Reads0
Chats0
TLDR
It is proved that the total cost function is a convex function of the threshold, and an efficient algorithm is proposed to find the optimal threshold directly directly.Abstract:
We study a dynamic mobility management scheme: the movement-based location update scheme. An analytical model is applied to formulate the costs of location update and paging in the movement-based location update scheme. The problem of minimizing the total cost is formulated as an optimization problem that finds the optimal threshold in the movement-based location update scheme. We prove that the total cost function is a convex function of the threshold. Based on the structure of the optimal solution, an efficient algorithm is proposed to find the optimal threshold directly. Furthermore, the proposed algorithm is applied to study the effects of changing important parameters of mobility and calling patterns numerically.read more
Citations
More filters
Journal ArticleDOI
Predictive distance-based mobility management for multidimensional PCS networks
Ben Liang,Zygmunt J. Haas +1 more
TL;DR: A mobile tracking scheme that exploits the predictability of user mobility patterns in wireless PCS networks, and proposes a dynamic Gauss-Markov parameter estimator that provides the mobility parameters to the prediction algorithm.
Journal ArticleDOI
Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs
TL;DR: In this paper, the authors propose an offline algorithm that solves for the optimal configuration in a specific look-ahead time-window, and an online approximation algorithm with polynomial time-complexity to find the placement in real-time whenever an instance arrives.
Journal ArticleDOI
Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs
TL;DR: In this article, the authors propose an offline algorithm that solves for the optimal configuration in a specific look-ahead time-window, and an online approximation algorithm with polynomial time-complexity to find the placement in real-time whenever an instance arrives.
Journal ArticleDOI
User mobility pattern scheme for location update and paging in wireless systems
E. Clayirci,Ian F. Akyildiz +1 more
TL;DR: The experimental results show that the UMP scheme outperforms the time-based and movement-based location update schemes as well as the blanket, selective, and velocity paging schemes.
Journal ArticleDOI
Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks
TL;DR: This paper proposes a suitable addressing scheme for nodes, derive a formula for distance between nodes, and presents a very simple and elegant routing algorithm for hexagonal interconnection.
References
More filters
Journal ArticleDOI
Movement-based location update and selective paging for PCS networks
TL;DR: In this paper, the authors proposed a mobility tracking mechanism that combines a movement-based location update policy with a selective paging scheme, where each mobile terminal only keeps a counter of the number of cells visited and a location update is performed when this counter exceeds a predefined threshold value.
Journal ArticleDOI
Mobile users: to update or not to update?
TL;DR: This paper considers both memoryless movement patterns and movements with Markovian memory along a topology of cells arranged as a ring and analyzes the performance of each one of the three strategies under such movements, and shows the performance differences between the strategies.
Journal ArticleDOI
Reducing location update cost in a PCS network
TL;DR: If the user mobility is higher than the call frequency or the user tends to move back to the previously visited registration areas, then the TLA may significantly outperform IS-41 and better performance is expected for larger variance.
Journal ArticleDOI
A caching strategy to reduce network impacts of PCS
TL;DR: An auxiliary strategy for locating users who move from place to place while using Personal Communications Services (PCS), called per-user caching, is proposed, which attempts to exploit the spatial and temporal locality in calls received by users, similar to the idea of exploiting locality of file access in computer systems.