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.     

User Independent Paging Scheme for Mobile IP

Multi-step paging has been widely proposed in personal communications services (PCS) systems to reduce the signaling overheads. Similar ideas can be applied to Mobile IP to provide IP paging services. However, current proposed multi-step paging schemes are user dependent under which the partition of paging areas and the selection of paging sequence are different for each user. The performance of a user dependent paging scheme for individual users may be affected by many factors. It is often difficult to achieve perfect performance for each user. In addition, when multiple users are paged at the same time, user dependent paging schemes may consume significant system resources. This paper introduces a user independent paging scheme where the paging criterion is not based on individual user information. The goal of user independent paging is to provide satisfactory overall performance of the whole system, when personalized optimal performance for each user is hard to obtain. The user independent paging scheme is proposed for IP mobility for its easy implementation and convenient combination with paging request aggregation. The paging criterion adopted is the mobility rate of each subnet determined by the aggregated movements of all mobile users. In order to implement the proposed scheme, a concept of “semi-idle state” is introduced and the detailed solution for obtaining mobility rate is presented. Analytical results show that when paging one user at a time, the performance of the proposed user independent paging scheme is comparable to that of the paging schemes based on perfect knowledge of user movement statistics. When paging multiple users simultaneously and when the knowledge on individual user behavior is not perfectly accurate, the proposed scheme has remarkable advantages in terms of reducing the overall paging cost. Jiang Xie received her B.E. degree from Tsinghua University, Beijing, China, in 1997, M.Phil. degree from Hong Kong University of Science and Technology in 1999, and M.S. and Ph.D. degrees from Georgia Institute of Technology in 2002 and 2004, respectively, all in electrical engineering. She is currently an assistant professor with the Department of Electrical and Computer Engineering at the University of North Carolina-Charlotte. Her current research interests include resource and mobility management of wireless networks,QoS provisioning, and next-generation Internet. She is a member of IEEE and ACM.     

Intelligent paging strategies for third generation mobiletelecommunication systems

Location management procedures, in conjunction with the millions of users expected to subscribe to third generation mobile telecommunication systems, will generate a huge signaling load. In this paper, we propose a method which aims at the reduction of signaling overhead on the radio link produced by the paging procedure. The key idea is the application of a multiple step paging strategy which operates as follows: at the instance of a call terminating to a mobile user who roams within a certain location area, paging is initially performed in a portion of the location area (the paging area) that the so-called “paging related information” indicates. On no paging response, the mobile user is paged in the complementary portion of the location area-this phase can be completed in more than one (paging) step. Various “paging related information” elements (e.g. recent interaction information, high mobility flag, etc.) can be used and several “intelligent” paging strategies can be defined. Representative paging strategies are analyzed in terms of network performance and quality of service (paging signaling, paging delay, processing power requirements), via a simulation tool which models a realistic city area environment     

基于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.     

Effect of dormant registration on performance of mobility management based on IP paging in wireless data networks

Unlike traditional cellular networks, which provide mainly voice services, there is, at present, no method that enables the effective management of terminal mobility for both active and idle mobile terminals in data networks. Although IP paging has been introduced to reduce power consumption of dormant mobile terminals, there is no concern to design an effective IP paging method for real wireless environments. Therefore, we propose a new dormant registration based IP paging method and analyze the effect of the dormant registration threshold used in IP paging on the performance of mobility management. Moreover, we demonstrate the importance of selecting an appropriate value for the dormant registration threshold.     

Efficient Location and Paging Area Planning in Future Cellular Systems

Efficient resource utilisation in future cellular systems is partly related to the location update and paging operations, which rely on proper planning of location and paging areas, and the application of efficient paging schemes. Important is the design of low complexity planning algorithms that may enable the system to dynamically adapt to new traffic and mobility conditions. In this paper we define and solve versions of the location and paging area planning problems focusing also on algorithms that are applicable in real-time. Thus, they can be used to adapt location and paging areas to traffic and mobility conditions. Starting from a formal definition and an optimal formulation, we solve efficiently by means of a low complexity heuristic, a general version of the location area planning problem. Regarding paging area planning, we provide a low complexity algorithm, under the assumption that the scheme applied falls within the last interaction based paging (LIBP) category. The results presented, and the low cost and complexity induced by the proposed schemes, indicates that the real-time application of the schemes is feasible.     

LEO卫星网络基于动态位置区的寻呼策略

针对LEO卫星网络中具有自主定位能力的用户终端,采用基于地理位置的动态位置区划分方案,根据用户移动速度设置位置区的大小。在动态位置区的基础上,对高速移动用户提出了一种基于时延限制的分组寻呼策略。仿真结果表明,对于低速移动用户,二次寻呼策略的时延和开销性能最佳;对于高速移动用户,基于时延限制的分组寻呼策略最佳。     

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

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

A profile-based location strategy and its performance

Future microcellular personal communications systems (PCSs) will be characterized by high user density and high mobility. It is expected that registrations will incur a large amount of the radio link signaling traffic. A profile-based strategy (PBS) is proposed to reduce the signaling traffic on the radio link by increasing the intelligence within the fixed network. The system maintains a sequential list of the most likely places where each user is located. The list is ranked from the most to the least likely place where a user is found. When a call arrives for a mobile, it is paged sequentially in each location within the list. When a user moves between location areas in this list, no location update is required. The list may be provided by the user or may be based on each user's past calling history. The method for doing this is outside the scope of this work. This work focuses on the potential performance improvements that can result from maintaining such a list. This paper compares the performance of the proposed strategy to the typical geographic-based location-tracking schemes being implemented in evolving digital cellular and cordless standards. Key performance measures for the comparison are radio bandwidth, fixed network SS7 traffic, and call setup delay. We investigate the conditions under which the PBS performs better than the traditional scheme. Results indicate that over a wide range of parameters, it may be possible to reduce both the radio bandwidth and fixed network signaling load for a modest increase in call setup delay     

Terminal detach scenarios in future mobile telecommunications

In mobile telecommunications the network should monitor the terminal status, i.e.,switched on, switched off, busy. Once a mobile terminal is switched on, it automatically informs the network about its status (attachment action). However, regarding the way that the network can identify that a terminal is switched off (detachment), there are three alternatives: (a)Periodic detachment scenario. The terminal (when switched on) periodically informs the network about its state. If the network detects that there is no contact with the terminal for more than the agreed time period, it detaches the terminal, (b)Detach on unsuccessful paging. At the instance of a call terminating to a mobile terminal and after a number of unanswered paging messages, the terminal is detached. (c)Detachment action scenario. The moment that the mobile terminal is switched off, it informs the network about its status. Scenarios (a) and (c) claim that paging signaling savings can be achieved when the network is early informed that a mobile terminal is switched off. However, these scenarios require access to the network database, which is expected to be a bottleneck. On the other hand, scenario (b) requires no access to the database but does not guarantee paging signaling savings. In this paper we model the behavior of a terminal so as to compare the above scenarios in terms of performance. Note that paging signaling and database transactions are not the same cost.This paper was partially funded by the CEC through the RACE 2066 project MObile NETwork (MONET). The paper does not present the views of the project as a whole but those of the authors.     

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.     

Paging and location update algorithms for cellular systems

Several alternative strategies for reducing paging and location update costs have been proposed lately. This paper initially compares four well-known strategies, that differ in the manner they approach that problem. The same mobility model and performance evaluation criteria were used for all strategies analyzed. Users are classified utilizing the call-to-mobility-ratio (CMR) metric. Results are given weighting in different ways the signaling cost in the radio interface and in the fixed network part. Based on the results obtained, this paper also introduces an alternative paging and location update algorithm. The subscriber call patterns and its mobility profile are used to define the size and shape of the location areas. Further analysis showed that this technique yields a significant signaling load reduction     

一种适应微蜂窝的移动性管理策略

在微蜂窝系统中,移动性管理是一个很重要的课题。如果采用传播蜂窝的位置登记的管理方式将会产生大量的系统资源浪费,降低系统的效率。本文提出一种基于用户移动特性（例如呼叫到达率、移动速度和移动位置等特点）的动态位置区的管理方案。在论文中对方案的寻呼代价和位置区修改代价进行分析和讨论,并与传统位置区管理方式〖１〗〖２〗做了比较。     

An Efficient Two‐Step Paging Strategy Using Base Station Paging Agents in Mobile Communication Networks

An effective paging strategy is essential for improving the utility of radio channels. This paper proposes a two‐step paging strategy which involves using base station paging agents to page a single cell at each paging. An analytical model is used to evaluate the performance of the proposed strategy. The proposed strategy is compared with the traditional simultaneous paging strategy and a recent proposal using the base station paging agents. The numerical results showed that the proposed strategy proficiently reduces paging cost on radio channels compared with other paging strategies.     

A learning strategy for paging in mobile environments

The essence of designing a good paging strategy is to incorporate the user mobility characteristics in a predictive mechanism that reduces the average paging cost with as little computational effort as possible. In this scope, we introduce a novel paging scheme based on the concept of reinforcement learning. Learning endows the paging mechanism with the predictive power necessary to determine a mobile terminal's position, without having to extract a location probability distribution for each specific user. The proposed algorithm is compared against a heuristic randomized learning strategy akin to reinforcement learning, that we invented for this purpose, and performs better than the case where no learning is used at all. It is shown that if the user normally moves only among a fraction of cells in the location area, significant savings can be achieved over the randomized strategy, without excessive time to train the network. Copyright © 2003 John Wiley & Sons, Ltd.     

A Distributed and Adaptive Location Management Scheme for Hierarchical Mobility Management

1IntroductionThe IETF Mobile IPstandards[1~2]were proposedtosolve the general problemof host mobility in the inter-net.However,whenthe number of Mobile Node(MN)grows rapidly and the MNare far away fromhome andwith micro mobility,this basic mechanism will …     

P-MIP: Paging Extensions for Mobile IP

As the number of Mobile IP users grows, so will the signalling overhead associated with Internet mobility management in the core IP network. This presents a significant challenge to Mobile IP as the number of mobile devices scale-up. In cellular networks, registration and paging techniques are used to minimize the signalling overhead and optimize the mobility management performance. Currently, Mobile IP supports registration but not paging. In this paper, we argue that Mobile IP should be extended to support paging to improve the scalability of the protocol to handle large populations of mobile devices. To address this, we introduce P-MIP, a set of simple paging extensions for Mobile IP, and discuss the construction of paging areas, movement detection, registration, paging and data handling. We present analysis and simulation results for Mobile IP with and without paging extensions, and show that P-MIP can scale well supporting large numbers of mobile devices with reduced signalling under a wide variety of system conditions.     

关于TMSI寻呼与IMSI寻呼性能分析

随着移动用户的持续增长和手机新业务的不断推广,移动通信系统的寻呼负荷日益加重。以移动用户漫游被叫时的呼叫流程为例,分析IMSI寻呼和TMSI寻呼的原理,对比两种寻呼方式对网络性能影响,提出一种评估寻呼方式的量化计算方法。通过对寻呼容量较为紧张网元的试验证明,该方法可以科学指导寻呼方式的优化工作,提高移动通信网络的系统寻呼容量,改善移动通信系统寻呼性能。     

Optimal location management in LTE networks using evolutionary techniques

Wireless network is considered a vital enabler in the world of information technology, specifically, LTE and LTE advanced networks, which are the latest technologies owing to their fast speed, robustness, and large bandwidth. However, in spite of the aforementioned advancements, signaling overhead poses critical challenges in terms of network availability, especially those caused by location management messages which are related to users’ mobility behavior. This paper seeks to address the problem of signaling overhead caused by the location management messages specifically, tracking area update (TAU) and paging by deploying three evolutionary algorithms, namely particle swarm optimization (PSO), artificial bee colony (ABC), and gravitational search algorithm (GSA). The deployed algorithms guarantee yielding the minimum values of the signaling overhead for TAU, paging, and the battery power consumption of the user. It is shown that ABC‐based algorithm has faster convergence and better signaling overhead when compared with other implemented algorithms. Moreover, the measured relative standard deviation (RSD) value of all algorithms shows low uncertainty of around 1% for the objective function and 3% for the paging, TAU, and power. Hence, the three applied optimization algorithms have proven to be efficient and reliable for solving the problem in a large‐scale environment.     

中国无线寻呼业务的发展及市场展望

本文通过分析近几年来我国无线寻呼业务的发展状况及趋势，从技术、业务、经营模式等多方面了我国无线寻呼市场具有巨大的发展潜力，并对未来我国无线寻呼业务及市场作了展望 。