移动通信网络中自适应的寻呼策略研究

移动通信网络中,位置管理用于跟踪移动台,有位置更新和寻呼两个基本操作。现行位置管理策略在查找移动台时对整个位置区进行同步寻呼,由于位置区由众多小区组成,而移动台只在其中一个小区,所以现行策略造成了网络资源的大量浪费。该文基于增强学习理论与方法,提出了自适应的多阶段智能寻呼策略,通过学习寻呼过程所获得的移动台位置信息,动态调整各阶段所寻呼组的小区,以降低寻呼费用。仿真实验结果表明,所提出的寻呼策略能较大地降低寻呼代价。     

低轨卫星通信网络中动态位置更新管理方案

移动性管理是LEO(低轨卫星(low earth orbit))卫星网络通信系统中的一个重要问题.提出了LEO网络中一种改进的基于移动的位置更新和寻呼方案.在这种方法中我们引入了"元小区"概念,它由两个相邻波束组成.首先阐述了基于"元小区"模型的位置管理策略,然后推导了基于移动的动态位置管理的数学模型,并利用该模型分别计算了LEO网络中单位呼叫的位置更新和寻呼代价.通过元小区方案和普通小区的在各种网络参数环境下的性能比较证明了"元小区"方法的有效性和健壮性.最后为了进一步减小"元小区"方法中的寻呼代价,提出了强制更新策略,它强制移动终端在穿越两颗卫星覆盖区的边界时进行位置更新操作.     

一种基于动态概率的定位管理策略

提出了基于动态概率的定位管理方法, 能够适用于多种移动模式.该方法包括在不同情况下分别使用基于方向和基于距离的位置更新策略以及一种动态的基于用户定位概率和方向概率的终端寻呼策略.给出了根据移动单元居住位置的概率和移动单元运动的方向概率来决定更新方法和寻呼策略的分析模型.通过位置更新和终端寻呼的代价可决定位置更新和终端寻呼的总的平均代价.实验证明动态的基于用户定位概率的终端寻呼策略的寻呼代价远小于ring-by-ring的终端寻呼代价.     

基于GLR的动态位置管理方法

为平衡位置更新代价和寻呼代价,结合网关位置寄存器的三层数据库结构,设计一种基于移动域的动态位置管理方法。根据移动速度和呼叫到达率调整移动域大小,降低位置管理总开销。根据呼叫移动比选择寻呼策略,优化位置管理性能。仿真结果表明,采用该方法可以获得最优移动阈值。     

蜂窝网络中移动台越区漫游仿真研究

移动性管理(包括位置管理和切换管理)是移动通信领域的一个具有挑战性的问题,而位置管理涉及到位置更新和寻呼操作。在现行蜂窝系统中,一旦移动台越区(从一个位置区LA移动到另一个位置区LA),就需要进行位置更新。因此,移动台越区问题的研究,对蜂窝系统的设计、位置管理策略的制订与性能评价是非常重要的。该文给出越区漫游仿真算法,并对运行结果进行分析,最终得出:越区漫游有局部性。     

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

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

基于不规则蜂窝网络拓扑模型的位置管理研究

针对当前大多数位置管理策略的研究都是假设在同大小、同形状、同分布的蜂窝网络下实现的,提出了基于不规则分布的蜂窝网络结构(包括宏蜂窝、微蜂窝、微微蜂窝)的位置管理策略,通过将邻近的蜂窝重组并根据基站广播的蜂窝坐标CC(cell coordinates)计算当前所在蜂窝到当前位置区最后报告所在蜂窝的实际距离,并提出了基于实际距离和方向角的动态位置更新算法.最后,通过半马尔可夫决策过程推导两次寻呼到达间的位置管理总代价计算公式.数值分析结果表明,当移动用户运动特性很强时,选择个性化的扇形位置管理策略在位置更新与寻呼总代价上优于无个性的圆形位置区.     

移动台自调控的移动性管理策略

在移动通信系统中，移动性管理是一个具有挑战性的研究内容，提出了移动台自调控移动性管理策略：引入一个控制参数m，移动台根据系统的实际查找时间，采用指数平均方法预测下一次查找时间，进而对m进行调节，以平衡系统在位置更新有位置查找方面的费用，提高系统的整体效率，给出了具体的算法，并对这一策略与基本的移动性管理策略及普通的“指针推进策略”的代价进行对比。     

移动通信网中位置管理算法仿真平台设计

与移动通信网中的位置管理紧密相关的两个问题是位置更新和寻呼。目前，围绕着各种移动模型，越来越多的位置管理算法被提出，以减少位置更新和寻呼的总代价。给出了一种仿真实现方法，设计出一个位置管理算法仿真验证平台，详细描述了仿真平台模块功能和仿真流程。     

移动计算系统中的自适应位置更新策略

移动计算系统中一个很重要的问题就是管理移动客户机的实时位置.在现有商业的移动计算系统中,采用一种两层的体系结构.这种两层的结构不具有可扩展性,因而不能适应具有大量移动用户的新型移动计算应用.人们提出了一种新的层次结构的位置数据库结构,系统中的位置数据库组成一个树形结构以方便移动用户位置查找.尽管这种结构把位置更新及查询的任务在系统中的所有位置数据库中进行了分摊,它也有其自身的弱点:位置更新的代价较大及位置查询的延迟较长.研究了树形位置数据库结构中的位置更新策略,给出了一个位置变更的阈值计算方法,以使得位置管理的代价最少.     

A location-based mobility tracking scheme for PCS networks

This paper introduces a location-based locating strategy for Personal Communication Services (PCS) systems. In the proposed scheme, location updates are based on the value of a movement counter. The update of the movement counter is based on information on the locations visited by a mobile terminal (MT) since the last location update. In particular, the cell identifiers and the corresponding movement counter values are maintained in the MT for a part of the visited cells since the last location update. When the MT enters a cell whose identifier is not stored in the MT, the movement counter increases by one. If the movement counter reaches the update threshold, a location update is triggered; otherwise, the cell identifier and the corresponding movement counter value are stored in the MT. When the MT enters a cell whose identifier is in the MT, the movement counter is assigned with the counter value kept in the MT for this cell, and all cells with greater counter values in the MT are removed. The proposed scheme allows the dynamic selection of the update threshold according to each user's calling and mobility patterns. Analytical and simulation models have been developed to compare the proposed scheme with both the movement-based scheme and the distance-based scheme. Results demonstrate that when the call-to-mobility ratio (CMR) is low, the proposed scheme can achieve a significant cost reduction compared to the movement-based scheme. For example, when the CMR is 0.01, a savings of around 25% in the optimal total cost per call arrival is achieved with the proposed scheme. Moreover, the proposed scheme is easier to implement than the distance-based scheme.     

New probabilistic models for managing user’s locations in PCS networks

Personal communication service (PCS) networks enable mobile terminals (MTs) to communicate regardless of their locations. However, in order to guarantee an efficient service delivery, MTs’ real time locations should be perfectly managed. Location management (LM) includes two fundamental processes; registration and paging. The former is concerned with the reporting of the current locations of the MTs, while the latter is used to locate a MT. Both processes incur signaling cost across the wireless channel. The more the location updates, the less the paging signaling cost, thus there is a tradeoff in terms of signaling cost. Due to the scarcity of PCS wireless bandwidth, it is important to reduce that signaling cost. As The blanket paging in current mobile networks wastes a lot of wireless bandwidth, we focus on the subject of paging and try to reduce the paging signaling cost under a predefined delay bound. Our contribution can be summarized as: (i) establishing a family of probability based paging strategies; (ii) introducing a novel topology for PCS registration area, which is called the hot spot topology (HST); (iii) based on HST, a novel LM strategy, which is called “Flower Based Strategy” had been introduced. Experimental results had shown that that the proposed paging strategies substantially lower the signaling cost of paging compared to the blanket one with a negligible increase in paging delay.     

Design and analysis of location management for 3G cellular networks

Location management is a key issue in personal communication service networks to guarantee the mobile terminals to continuously receive services when moving from one place to another. We study two location management schemes, a dynamic movement-based scheme (DYNAMIC-3G) and a static scheme (STATIC-3G), for 3G cellular networks where home location registers, gateway location registers (GLRs), and visitor location registers form a three-level hierarchical mobility database structure. For both schemes, the cost functions are formulated analytically. We prove that there is an optimal movement threshold that minimizes the total cost function of DYNAMIC-3G and propose a binary search algorithm to find the optimal threshold. Furthermore, we present performance evaluation and comparison of the proposed schemes with the previous schemes in 2G cellular networks where the GLR is not present. Our studies validate the optimality of the DYNAMIC-3G scheme and show that the proposed schemes outperform the previous schemes, especially when the remote-local-cost ratio is high. The comparison results between DYNAMIC-3G and STATIC-3G indicate that DYNAMIC-3G should be adopted when the mobility rate is low, and STATIC-3G should be adopted otherwise. Furthermore, DYNAMIC-3G tends to perform better than STATIC-3G when the paging cost is high or the number of cells in a location area is large.     

Distributed cell-centric neighborhood-related location area planning for PCS networks

An intelligent location area planning (LAP) scheme should consider the frequent replannings of location areas (LAs) due to changes in user distribution and mobility patterns along with optimization of location management costs, including location updating and paging costs. Most schemes proposed in the literature are designed through centralized techniques, thus requiring more computing time to plan the LAs. Frequent replannings to accommodate environmental changes make the situation worse. As to the optimization of location management costs, most proposed schemes consider the inter-cell crossing rate as one of the key factors in determining the optimal partitions. In some cases, the inter-cell crossing rate may lead to an unsatisfactory outcome. Another problem is the ping-pong effect which is caused by the fixed borders between any two of LAs. In this paper, we propose a distributed cell-centric neighborhood-related LAP scheme in which each cell acts as the center of an LA and in which highly correlative neighboring cells are bundled into the LA if mobile terminals (MTs) remain within the LA long enough to reduce costs. Moreover, the ping-pong effect will be alleviated because MTs always locate at the center cell of an LA whenever a new location update is performed. Finally, the scheme can be implemented in a distributed manner so the computing time incurred by frequent replannings can be reduced. Simulation results show that our scheme indeed exhibits excellent results.     

Location management in mobile network: A survey

Location management is an important area of mobile computing. Location management in mobile network deals with location registration and tracking of mobile terminals. The location registration process is called location update and the searching process is called paging. Various types of location management methods exist such as mobility based location management, data replication based location management, signal attenuation based location tracking, time, zone and distance based location update etc. In this paper, existing location management schemes are discussed and compared with respect to their cost consumption in terms of bytes. Finally the key issues are addressed in the context of location management for future generation mobile network.     

Cell-related location area planning for 4G PCS networks with variable-order Markov model

Location management is a critical issue in personal communication service (PCS) networks, tracking the location of user equipment (UE) with the goal of minimizing total signaling cost. Previous work can be classified into two categories: static and dynamic. Static schemes partition networks into fixed size LAs. However, these schemes are inefficient because they do not take UEs’ mobility and the call arrival rate into account. On the other hand, focusing on individual UEs, dynamic schemes have minimized the location management cost. However, they are difficult to implement because recording the individual information of numerous UEs and planning each of their LAs consume uncontrollable cost. Because of these reasons, we propose a cell-based scheme between static and dynamic schemes. Considering people usually stay in specific zones for long periods and the movement of UEs usually presents a strong moving direction in areas, this study presents a distributed algorithm by employing variable-order Markov models to find the mobility characteristic shared by UEs to plan better LAs with lower location management cost. When the order of Markov model is set to 1, our method is equal to a pure cell-centric LAP scheme; while the order of Markov model is high, it is more like a profile-based dynamic scheme. So, the setting of the order actually is a trade-off problem between the overall location management cost and the computing complexity. We present to retrieve a balance by using the expected location management cost and the number of total states of Markov models. In simulations, the origin–destination matrix (O–D matrix) from the Taipei Rapid Transit Corporation is used for representing the association between two cells. Simulation results demonstrate that the proposed scheme achieves good performance.     

Analytical results for optimal choice of location update intervalfor mobility database failure restoration in PCS networks

When the location information for a mobile user in the Home Location Register (HLR) is corrupted or obsolete, the new arriving calls to the user may be lost. In order to minimize the effect of such HLR mobility database failure, a location update scheme called period location updating is proposed, and the cost analysis is performed. Analytical results for the failure recovery time distribution and the average number of call losses, which are crucial for cost analysis, are presented. The optimal location update period is given analytically as a function of other traffic parameters. This optimal choice of location update period lays the foundation for the adaptive adjustment of the location update period in failure restoration for PCS networks