Mobile user location update and paging under delay constraints

Wireless personal communication networks (PCNs) consist of a fixed wireline network and a large number of mobile terminals. These terminals are free to travel within the PCN coverage area without service interruption. Each terminal periodically reports its location to the network by a process calledlocation update. When a call for a specific terminal arrives, the network will determine the exact location of the destination terminal by a process calledterminal paging. This paper introduces a mobile user location management mechanism that incorporates a distance based location update scheme and a selective paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for location update and terminal paging, the average total location update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal location update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.     

A direction-based location update scheme with a line-pagingstrategy for PCS networks

On the problem of location update and terminal paging, many schemes using ring-paging strategies have been proposed. However, sequentially paging the rings surrounding the mobile user's last updated location may cause large paging cost. We propose a direction-based location update (DBLU) scheme using a line-paging strategy to reduce the paging cost. A moving direction identification mechanism using only simple computations detects the change of moving direction and updates the mobile's location. The numerical results show that our DBLU scheme achieves good performance when the paging cost is high     

Optimal dynamic mobility management for PCS networks

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     

Dynamic Location Management for Mobile Computing

This paper presents a dynamic and individualized location update scheme that considers each user's mobility patterns. The mobility patterns are used to create individualized location areas for each user. The proposed scheme is flexible and can be used in network with arbitrary cell topologies. The scheme, along with other existing schemes is simulated using realistic users' mobility and call arrival patterns, and network topology. The simulated environment consists of 90 cells representing the geographical area of the San Francisco bay, and 66,550 mobile users representing the typical classes of users that are normally present in a real cellular network. Results show the proposed scheme gives lower overall signaling costs, resulting in savings on the limited radio bandwidth that may have otherwise been used for location updates and paging.     

Paging strategy optimization in personal communication systems

Mobility tracking is concerned with finding a mobile subscriber (MS) within the area serviced by the wireless network. The two basic operations for tracking an MS, location updating and paging, constitute additional load on the wireless network. The total cost of updating and paging can be minimized by optimally dividing the cellular area into location registration (LR) areas. In current systems broadcast paging messages are sent within the LR area to alert the MS of an incoming call. In this paper we propose a selective paging strategy which uses the MS mobility and call patterns to minimize the cost of locating an MS within an LR area subject to a constraint on the delay in locating the MS. This revised version was published online in July 2006 with corrections to the Cover Date.     

A parallel shuffled paging strategy under delay bounds in wireless systems

In sequential paging schemes, the paging process is considered on per user basis. When an incoming call arrives to a mobile terminal (MT), the associated location area is divided into several paging areas (PAs) and PAs are paged one by one until the MT is found. Even though sequential paging algorithms can reduce the paging cost compared to the blanket-paging scheme, they introduce extra and unnecessary delay due to the fact that, during each paging cycle, unpaged cells are idle and unused in terms of paging. In this letter, a simple parallel shuffled paging strategy is proposed to reduce delay and improve performance. In the proposed scheme, multiple MTs can be paged in difference PAs in parallel. Our study shows that the proposed scheme outperforms both the sequential paging and the blanket paging in terms of discovery rate and queueing delay.     

基于DNS的代理移动IPv6位置管理机制

Proxy Mobile IPv6 (PMIPv6) is designed to provide a network-based localized mobility management protocol, but it does not handle the global mobility of hosts. In this paper, we propose a location management scheme based on Domain Name System (DNS) for PMIPv6 which can support global mobility by using DNS as a location manager. In addition, to support large numbers of mobile terminals and enhance network scalability a paging extension scheme is introduced to PMIPv6.To evaluate the proposed location management scheme, we establish an analytical model, formulate the location update cost and the paging cost,and analyze the influence of the different factors on the total signaling cost. The performance results show that our proposed scheme outperforms the basic PMIPv6 under various parameters in terms of reducing the signaling overhead and the proposed scheme reduces signaling overhead compared to the basic PMIPv6.     

A crossing-tier location update/paging scheme in hierarchical cellular networks

Location update/paging strategies have been widely studied in the traditional single-tier cellular networks. We propose and evaluate a novel crossing-tier location update/paging scheme that can be used in a hierarchical macrocell/microcell cellular network. Location update is proceeded only in the macrocell tier, where a location area (LA) is made up by larger macrocells. A mobile user will stay in such a LA for longer time. Therefore, the cost on location update can be reduced due to the decreased frequency of location update. To reduce the paging delay, the paged mobile user will be searched in the macrocell tier only when the paging load is not high. Otherwise, it will be searched in the microcell tier, where a sequential searching method is applied. The operation for the scheme is simple, as the macrocell/microcell cellular network has the advantage because a mobile user can receive a signal from both a microcell and the overlaid macrocell. Analytical models have been built for cost and delay evaluation. Numerical results show that, at relatively low cost, the crossing-tier scheme also achieves low paging delay.     

A dynamic anchor-cell assisted paging with an optimal timer for PCS networks

An intra location area (intra-LA) location update (LU) scheme is proposed to increase paging accuracy for PCS networks. In the proposed scheme, each mobile terminal (MT) has a valid/invalid anchor-cell, which may be dynamically changed. A MT updates its anchor-cell information only when the status is changed, i.e., from the valid to the invalid or vice versa. Therefore, the intra-LA LU cost is minimized. Whenever the MT enters a cell, a timer is set. The MT realizes that the entered cell is its current anchor-cell if the timer expires before leaving the cell. An analytical model is proposed, and the optimal time threshold is derived explicitly.     

Cooperative Location Management for a Cellular Network with Ad Hoc Communication

The cellular network with ad hoc communication has been foreseen in the next-generation mobile communication system. For such a network, a distance-based (DB) location management scheme cooperated with the ad hoc assistance node (DBCAN) is proposed in this paper. Allowing a mobile terminal to pass its mobility information to the ad hoc assistance node (AAN) with appropriate location updating, DBCAN can effectively reduce the paging cost and limit the paging delay. Moreover, DBCAN includes a method to determine whether AANs should be utilized or not to make cost effective. Our simulation results show that DBCAN can effectively reach cost reduction and still get performance improvement even if the probability to successfully deliver mobility information to AANs falls to the median level.     

Dynamic mobile user location update for wireless PCS networks

The basic architecture of a personal communication network consists of a wireline network and mobile terminals. Each mobile terminal communicates with the wireline network through a nearby base station. In order to route incoming calls to a destination mobile terminal, the network must keep track of the location of each mobile terminal from time to time. This is achieved bylocation update such that each mobile terminal reports its current location to the network at specific time points. When an incoming call arrives, the network will page the mobile terminal starting from the last updated location. A trade-off, therefore, exists between the frequency of location update and the number of locations paged in order to track down the mobile terminal. This paper introduces a location update policy which minimizes the cost of mobile terminal location tracking. A mobile terminal dynamically determines when to update after moving to a new cell based on its mobility pattern and the incoming call arrival probability. The performance of this scheme is close to that of the optimal policy reported earlier. However, the processing time requirement of this scheme is very low. The minimal computation required by this scheme enables its usage in mobile terminals which has limited energy supply and computational power.     

A Combination of Optimal Partitioning and Location Prediction to Assist Paging in Mobile Cellular Networks

The correlated both in space and time user mobility behavior can aid significantly in the localization of a moving terminal in the network coverage area. However, there is always some uncertainty in mobile user position and a network-wide search cannot be done. Therefore, a predictive paging scheme must always be combined with a location update strategy and a compatible algorithm to conduct the search. In this paper, we introduce a new strategy that combines an optimal partitioning of the location area (LA) with a model to predict user movements, based on the additional information of the cell where the last interaction between the network and the terminal took place. We study the performance of the strategy under delay bounds and different mobility and call arrival characteristics. It is found that the new scheme further minimizes signaling costs and enhances previous sequential paging algorithms.     

Analysis of cost and quality of service of time-based dynamic mobility management in wireless networks

A key observation of a time-based location management scheme (TBLMS) is that the simple paging method (i.e., the fastest paging method) does not guarantee to find a mobile terminal, no matter how small the location update cycle is and how big the radius of a paging area (PA) is. Therefore, in addition to cost analysis and optimization, there is one extra issue to deal with in a TBLMS, i.e., the quality of service (QoS), which is the probability that a mobile terminal can be found in the current PA. The main contributions of the paper are as follows. First, based on our previous results on random walks among rings of cell structures, we analyze the location distribution of a mobile terminal in a PA and the reachability of a mobile terminal in a PA when a phone call arrives, where the inter-call time and the cell residence time can have an arbitrary probability distribution. Second, using results from renewal processes, we analyze the cost of dynamic mobility management in a TBLMS, where the inter-call time and the cell residence time can have an arbitrary probability distribution. Third, we develop a method to find a TBLMS which has the best combination of the location update cycle and the radius of a PA with the minimum cost of mobility management, while still satisfying the required QoS.     

A contention-free mobility management scheme based on probabilisticpaging

In forthcoming personal communication systems (PCSs), small cells are deployed to achieve high spectral efficiency. This has significant impacts on location tracking of mobile users. The increase in location update (LU) load leads to more contention on the reverse control channel. Thus, many algorithms are designed to distribute the LU load to a larger number of cells. This avoids the inefficiency of random accessing due to high offered load. In an alternative approach (Wong 1995), a contention-free LU algorithm is proposed. Two or more mobile units are permitted to register with a base station simultaneously without contention. A probabilistic paging mechanism called Bloom filtering is used to select cells to be paged. Since there is no contention in LU, inefficiencies due to random accessing are bypassed. In this paper, we present another contention-free LU algorithm. It is hybrid in the sense that LUs are temporally or geographically triggered. The use of hybrid LU alleviates inefficiencies inherent to temporal triggered LU in Wong. Three selective paging schemes are considered in this paper. Tradeoff between paging delay and paging bandwidth is addressed. The performance of this algorithm is compared to Wong and other conventional strategies. Numerical results show that the new algorithm compares favorably with previous proposed strategies     

Location update optimization in personal communication systems

Mobility tracking is concerned with finding a mobile subscriber (MS) within the area serviced by the wireless network. The two basic operations for tracking an MS, location updating and paging, constitute additional load on the wireless network. The total cost of updating and paging can be minimized by optimally dividing the service area into location registration (LR) areas. There are various factors affecting this cost, including the mobility and call patterns of the individual MS, the shape, size and orientation of the LR area, and the method of searching for the MS within the LR area. Based on various mobility patterns of users and network architecture, the design of the LR area is formulated as a combinatorial optimization problem. The objective is to minimize the location update cost subject to a constraint on the size of the LR area. This revised version was published online in July 2006 with corrections to the Cover Date.     

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

User mobility pattern scheme for location update and paging in wireless systems

The user mobility pattern (UMP) scheme is introduced for location update and paging in wireless systems where mobile terminals (MTs) maintain their history data in a database called user mobility history (UMH). During a location update, a UMP is derived from UMH and registered to the network. Unless the MT detects that it has moved out of the registered UMP, it does not perform any other location update. On the other hand, cells are paged selectively according to the cell entry times in the registered UMP upon a call arrival for the MT. The related data structures and the protocols for the UMP scheme are presented in the paper. 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.     

基于多跳蜂窝网的组位置管理策略

提出了一种成组进行位置管理的策略,分析了彼此临近的移动台组成一个自组织网的基本网络模型,提出了向中继点注册,由中继点进行信令压缩,组成组控制信令,成批向网络报告位置的位置更新的策略;采用M/M/n/n模型具体比较了批处理方案与传统方案的性能,说明作者的方案不仅减少了移动台的发射功率,还大量节省了频率资源,增加了系统的吞吐能力。     

移动IP网络中基于遗传算法的多步寻呼策略及性能分析

在移动IP网络中,层次移动IP协议可降低移动IP位置管理的信令消耗。该文研究支持寻呼的HMIPv6,提出了时延限制下的多步寻呼策略以及基于遗传算法的多步寻呼方案——根据移动节点的位置概率分布,采用遗传算法对寻呼区域内的所有子网进行分组,每步寻呼一个组,使平均寻呼信令开销达到或接近最优。此外,对HMIPv6、单步寻呼的HMIPv6以及基于遗传算法的多步HMIPv6寻呼方案的信令开销进行了比较分析,得出寻呼节省信令开销的必要条件。最后,给出一组数值结果以说明所提出的寻呼策略的有效性。     

A novel sectional paging strategy for location tracking in cellular networks

In this letter, we propose a new paging technique, sectional paging, that reduces the paging cost while complying with the delay constraint for mobiles roaming with traceable patterns. Without having to install much additional complexity, the developed scheme predicts the likelihood of residence and assigns optimal paging boundaries. Thus while complying with the required delay constraints, quality-of-service (QoS) measures will not need to be sacrificed as a result of increasing the update threshold. Under the same network conditions and mobile characteristics, simulation results reveal that the usage of sectional paging is most suitable when the roaming pattern is either traceable or can be predicted with reasonable precision.