蜂窝网络中依概率环状搜索移动性管理策略

位置管理是移动通信领域的一个具有挑战性的问题，涉及到位置更新和位置查找操作。在现行蜂窝系统的位置管理策略(简称基本策略)中，一旦移动台越区(越过位置区边界)，就需要进行位置更新，由于移动台的越区具有局部性，基本策略会造成系统资源的极大浪费，因此，降低位置管理的费用成为移动通信领域的一个研究热点，给出了不需要进行位置更新的、根据移动台访问位置区的概率进行环状搜索的位置管理策略(简称依概率环状策略)，并推导出搜索位置区平均层数的一个公式，然后利用这一公式对基本策略与依概率环状策略的费用进行了对比研究，得出在一定条件下，依概率环状策略的费用比基本策略小这一结论。

A Mobility Management Strategy with Ring Search in Order of Probability in Cellular Networks

Location management, which consists of location update and location query, is a challenging topic in mobile communications. The basic location management scheme(basic scheme for short) of personal communications services (PCS's) networks requires that location updating be initiated whenever a mobile crosses the boundaries of location areas. Obviously, this scheme is likely to waste the system resources due to the locality of mobiles' roaming. Therefore, reducing the cost of location management has become a hot research area of mobile communication systems. A location management scheme with ring search in order of probability (probabilistic ring scheme, for short) is conceived, where no location updating is needed. Additionally, a formula of the layer number of the location areas queried by the scheme is derived. According to this formula, the cost of probabilistic ring scheme, on certain conditions, is less than that of the basic scheme.