Group location management for mobile subscribers on transportation systems in mobile communication networks

We propose a new location tracking scheme for subscribers on transportation systems (TSs) in which a large number of fast-moving users have the same location as the TS. The group location tracking (GLT) scheme in which a group location update is performed instead of the IS-41's individual location update has been proposed. We propose a distributed GLT (DGLT) scheme based on several virtual visitor location registers (VVLRs) and representative identities. We analyze the GLT and DGLT schemes in view of the database (DB) access cost as well as the signaling cost under one-dimensional network architecture. Compared with the IS-41 scheme, the schemes based on group management generally have a lower signaling cost and a lower DB access cost due to a significant reduction in the number of location updates. As user mobility increases or the number of users on a TS increases, the performance of the group management schemes improves. The DGLT scheme, in which a corresponding home location register selects a closest VVLR among several possible VVLRs, generally has a lower signaling cost although a DB access cost is increased slightly compared with the GLT scheme. We also obtain the regions in which the DGLT is more efficient than the IS-41 and the GLT scheme. The DGLT scheme is an appropriate solution for high signaling cost systems and the GLT scheme is useful for high DB access cost systems.     

Hierarchical Group Location Tracking for Transportation Systems in Wireless Personal Communication Networks

A hierarchical group location tracking (HGLT) based on grouplocation tracking and hierarchical location update is proposed toreduce the location management cost for terrestrialtransportation systems (TSs) in personal communication networks. A global group location update (GGLU) and a local group locationupdate (LGLU) are performed to provide an accurate position for auser. The GGLU informs a virtual visitor location register of thecurrently camped-on location area and the LGLU informs the servingmobile switching center of the currently camped-on cell. Althoughthe LGLU is done each time a TS moves into a new cell, it causessmall increment in the signaling cost due to localized updates andgroup updates compared with the previous group location trackingscheme. The proposed scheme significantly reduces the paging costbecause the scheme pages only a camped-on cell using the LGLUinformation. Compared with the previous schemes, the HGLT reducesthe location management cost, and it is more efficient as thecost for paging a cell increases.     

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

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

Movement-based location update and selective paging for PCSnetworks

This paper introduces a mobility tracking mechanism that combines a movement-based location update policy with a selective paging scheme. Movement-based location update is selected for its simplicity. It does not require each mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of cells visited. A location update is performed when this counter exceeds a predefined threshold value. This scheme allows the dynamic selection of the movement threshold on a per-user basis. This is desirable as different users may have very different mobility patterns. Selective paging reduces the cost for locating a mobile terminal in the expense of an increase in the paging delay. We propose a selective paging scheme which significantly decreases the location tracking cost under a small increase in the allowable paging delay. We introduce an analytical model for the proposed location tracking mechanism which captures the mobility and the incoming call arrival patterns of each mobile terminal. Analytical results are provided to demonstrate the cost-effectiveness of the proposed scheme under various parameters     

The Virtual Overlap Region with Forwarding Pointer (VORFP) Technique for Tracking Mobile Users in Personal Communication Systems

Reducing the volume of location updates and cost of searching for location information are two important issues for tracking mobile users in personal communication systems. Many approaches have been proposed to improve both the location update traffic and searching costs. Some of these approaches can reduce access cost and some other approaches can reduce the location update cost and location update rate. In this paper, we shall propose a new approach for reducing both location update cost and searching cost (for finding mobile users location information). The new scheme called Virtual Overlap Region with Forwarding Pointer (VORFP) uses the forwarding pointer and the virtual overlap region concepts. The virtual overlap region technique is a good method for reducing the location update traffic, especially when a user backs and forths between adjacent cells. Our performance evaluations show that VORFP can significantly reduce searching cost and update cost.     

Locating strategies for personal communication networks, a noveltracking strategy

The partition of location areas is designed to minimize the total costs of finding users' location and tracking their movement in personal communication networks (PCNs). A new scheme to partition and track mobile users and its implementation based on cellular architecture are proposed. According to the tracking strategy, the mobile station (MS) transmits only update messages at specific reporting cells, while the search for a mobile user is done at the vicinity of the cell to which the user has just reported. We use the cost analysis model to demonstrate the feasibility of updating and searching costs to reduce the amount of resources when using wireless channels. Simulations are performed to compare the performance of three schemes: always update, always search, and our new scheme     

指针推进移动性管理策略中指针链长度的概率

为了降低移动通信网络中位置跟踪操作的代价,指针推进策略被提出.显然,指针链长度的确定对这一策略的有效应用是至为重要的.已有论文假定移动台在位置区的逗留时间服从指数分布的条件下,对指针链的长度进行研究,但指数分布的特殊性,限制了其研究结果的应用.本文推广了上述结果,研究了移动台在位置区的逗留时间服从一般概率分布的指针推进策略,通过构造向量马氏过程,利用密度演化方法,导出了指针链长度的概率公式,这个公式可用于对各种指针推进策略性能的评价.     

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.     

Simulation and analysis of Awerbuch–Peleg and GSM schemes for location tracking of mobile users

Mobile users are increasingly demanding full access to networked communications while they are on the move. Several studies have shown that the overhead incurred by the network to keep track of the current location of mobile users is considerably high. The methods currently used for location tracking incur heavy unnecessary costs by requiring that users update locations in their home networks after each move regardless of the distance at which the move occurs, and that all search attempts for a mobile user are first routed to that user's home network. The Awerbuch–Peleg scheme presents a formal model for location tracking which attempts to minimize the cost of local operations—both move and find operations—through the construction of a regional hierarchy. In this paper we present a performance evaluation of the Awerbuch–Peleg scheme. We also compare its performance to that of the GSM‐based location tracking scheme. It is found that the Awerbuch–Peleg scheme in general results in higher costs than the GSM scheme. The reason for this is found to be some unexpected properties of the read and write sets which are key components of the Awerbuch–Peleg scheme. Copyright © 2001 John Wiley & Sons, Ltd.     

An Enhanced Location‐Based Location Update Scheme in Mobile Cellular Networks

In this study, we consider a location‐based location update (LU) scheme. We propose an enhanced LU (ELU) scheme that can store more cells to reduce the location update cost of the LU scheme and show that the ELU scheme always outperforms the LU scheme. Our scheme can be easily implemented in actual cellular systems.     

EDBLU: enhanced direction-based location update scheme for PCS networks

An enhanced direction-based location update scheme (EDBLU) is presented. Unlike the direction-based location update (DBLU) scheme, in EDBLU the location update depends on both the moving direction and the moving distance. The performance of EDBLU is analysed based on the discrete-time 2D Markov walk model. The results confirm that the EDBLU scheme reduces the signalling cost significantly for different mobility patterns.     

Tracking with dynamic weighted compressive model

Fast compressive tracking utilizes a very sparse measurement matrix to capture the appearance model of targets. Such model performs well when the tracked targets are well defined. However, when the targets are low-grain, low-resolution, or small, a single fixed size sparse measurement matrix is not sufficient enough to preserve the image structure of the target. In this work, we propose a multi-sparse measurement matrices scheme along with a weight map to select the best measurement matrix that preserves the image structure of the targets during tracking. The weight map combines a contrast weight and a feature weight to efficiently characterize the target appearance and location. Moreover, a dispersion function is used for the online update of the target template, allowing tracking both the location and scale of the target. Extensive experimental results have demonstrated that the proposed DWCM tracking algorithm outperforms several state-of-the-art tracking algorithms as well as compressive tracker.     

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

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

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.     

LATS: a load-adaptive threshold scheme for tracking mobile users

Mobile user tracking is a major issue. We propose a novel approach for user tracking, in which the tracking activity is adapted to both user and system activity. The basic idea is to make the user-location update-rate dependent not only on the user activity (such as the call profile and mobility pattern). Rather, it is also made dependent on the signaling load, which reflects the actual cost of the update operation. Thus, at low-signaling load locations, the users are to transmit location update messages more frequently. To carry out this approach, we propose a load-adaptive threshold scheme (LATS): the network determines for each cell a registration threshold level (which depends on the cell load) and announces it, as a broadcast message, to the users. The user computes its own registration priority and then transmits a registration message only if its priority exceeds the announced threshold level. Thus, whenever the local load on the cell is low, the registration activity increases, while in loaded cells the registration activity decreases. Our analysis shows that the LATS reduces the paging cost, in comparison with other dynamic methods, without increasing the wireless cost of registration. Moreover, if higher user density is coupled with less mobility (e.g., consider vehicles), then the LATS strategy offers further performance improvement. The load-adaptive strategy can be used in addition to any other dynamic tracking strategy. Furthermore, the computational complexity imposed on the user is identical to that required by an equivalent load-insensitive scheme     

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     

Location tracking with distributed HLR's and pointer forwarding

Location tracking operations in a personal communications service (PCS) network are expensive. A location tracking algorithm called pointer forwarding has been proposed to reduce the location update cost. The key observation behind forwarding is that if users change PCS registration areas (RAs) frequently, but receive calls relatively infrequently, it should be possible to avoid registrations at the home-location register (HLR) database by simply setting up a forwarding pointer from the previous visitor-location register (VLR). Calls to a given user will first query the user's HLR to determine the first VLR, which the user was registered at, and then follow a chain of forwarding pointers to the user's current VLR. To reduce the “find” cost in call delivery, the PCS provider may distribute HLR databases in the network. This paper integrates the concept of distributed HLRs with pointer forwarding, and the new scheme is referred to as the pointer forwarding with distributed HLR (PFDHLR). Since no registration to the HLR is performed in the pointer forwarding scheme when a user moves to the new locations, the cost of updating multiple HLRs is eliminated in PFDHLR. Our study indicates that PFDHLR may significantly reduce the mobility management cost compared with the single HLR approach     

Hybrid Scheme with Adaptive Replication and Mobility Anchoring Point (MAP) in Wireless Networks

Replication strategy is mostly useful for replicating the mobile user’s profile at selected locations from which some callers have higher calling rate. Location management scheme also include replication strategy to reduce the location lookup cost of called mobile user. It plays important role in personal communication services in order to reduce call setup cost, call setup time, and increases the QoS (quality of service). In prior replication schemes, called user’s location profile is placed at some fixed and limited number of visitor location registers (VLRs) based on call history of the caller. In prior hybrid schemes location update and replication strategies are combined together. These prior hybrid schemes apply pointer forwarding strategy and replication. But these schemes have limitations like holding “loose” form of location profile and higher location update cost. We have proposed a new hybrid scheme which includes adaptive replication of updated user’s location profile and mobility anchoring point (MAP) for location update. The main objective of the proposed scheme is to reduce call setup cost and call setup time. In order to achieve the objective, adaptive replication is applied at certain visitor location registers (VLRs) according to movement of caller. The replica is kept updated at MAP and replicated to neighbor VLRs as per movement of the caller. We have presented fluid-flow based analytical modeling which shows that proposed scheme outperforms the prior hybrid scheme.     

怎样消除移动通信网络中的乒乓位置更新效应

本文介绍了移动通信网络中的乒乓位置更新效应的产生原因及各种方案对其抑制或消除的原理和性能。然后引出一种既简单易行又能从根本上完全消除乒乓位置更新效应的位置管理模型。这种模型还能与最优位置更新策略和最优寻呼策略同时使用 ,使位置管理开销降到最低。     

Wireless Location Tracking Algorithms for Environments with Insufficient Signal Sources

Location estimation and tracking for the mobile devices have attracted a significant amount of attention in recent years. The network-based location estimation schemes have been widely adopted based on the radio signals between the mobile device and the base stations. The location estimators associated with the Kalman filtering techniques are exploited to both acquire location estimation and trajectory tracking for the mobile devices. However, most of the existing schemes become inapplicable for location tracking due to the deficiency of signal sources. In this paper, two predictive location tracking algorithms are proposed to alleviate this problem. The Predictive Location Tracking (PLT) scheme utilizes the predictive information obtained from the Kalman filter in order to provide the additional signal inputs for the location estimator. Furthermore, the Geometric-assisted PLT (GPLT) scheme incorporates the Geometric Dilution of Precision (GDOP) information into the algorithm design. Persistent accuracy for location tracking can be achieved by adopting the proposed GPLT scheme, especially with inadequate signal sources. Numerical results demonstrate that the GPLT algorithm can achieve better precision in comparison with other network-based location tracking schemes.