Optimization of sequential paging in movement-based location management based on movement statistics
Optimization of sequential paging in movement-based location management based on movement statistics
复制标题
基于移动统计的基于移动的位置管理中顺序寻呼的优化
DOI：
10.1109/tvt.2007.891403
复制
发表时间：
2007-03-01
影响因子：
6.8
通讯作者：
Leung, Victor C. M.
中科院分区：
文献类型：
--
作者：
Zhu, Yi-hua;Leung, Victor C. M.
基于移动的方案是一种特别容易实现的动态位置管理(LM)方案。每个移动设备只需计算跨越小区边界的数量，并在该数量超过预定义的移动阈值时启动位置更新。尽管其LM成本低于基于距离的方案，但是可以通过考虑移动设备的移动统计的顺序寻呼方法来降低该成本。在本文中，我们针对泊松呼叫到达和一般分布的小区停留时间，推导了在基于移动的 LM 方案中两次位置注册之间的间隔期间移动设备跨越小区边界的次数的概率分布。根据导出的统计数据，我们获得最佳移动阈值并开发最佳顺序寻呼方案。数值结果表明，所提出的最佳顺序寻呼方案在广泛的呼叫移动率范围内优于现有的顺序寻呼方案。
The movement-based scheme is a dynamic location management (LM) scheme that is particularly easy to implement. Each mobile simply counts the number of cell-boundary crossings and initiates location update when this number exceeds the predefined movement threshold. Although its LM cost is inferior to that of distance-based schemes, this cost can be decreased by sequential paging methods that take into account mobiles' movement statistics. In this paper, we derive the probability distribution of a mobile's number of cell-boundary crossings during the interval between two location registrations in a movement-based LM scheme for Poisson call arrivals and generally distributed cell residence time. Based on the derived statistics, we obtain the optimal movement threshold and develop an optimal sequential paging scheme. Numeric results are presented to show that the proposed optimal sequential paging scheme outperforms existing sequential paging schemes over a wide range of call-to-mobility ratios.