移动IP的寻呼扩展技术

介绍了一种简单易行的移动IP的扩展方案,它通过对基本的移动IP协议进行简单的扩展,使其支持寻呼功能,减少大量的信令开销,使MIP能够支持大量移动用户。     

基于HMIPv6的寻呼扩展策略

本文首先对移动IPv6 (MIPv6 )和分级移动IPv6 (HMIPv6 )中的通信过程和各个功能实体进行了简单的介绍。然后在HMIPv6的基础上提出一种寻呼扩展结构 (PagingExtensiononHMIPv6 ) ,包括加入此寻呼扩展后的网络体系结构和各个功能实体的描述并定义了其中几个重要的报文结构。通过加入该寻呼扩展使MIPv6实现注册本地化的同时支持IPPagingSupport,提供更好的可扩展性。     

下一代无线IP移动通信网中的IP微移动性协议

与Internet无缝连接和IP基的移动性是下一代移动通信网的重要特点。为了减少移动IP中的时延和信令开销，减少包丢失，提出了支持快速、 可靠切换和IP寻呼（IP paging)的IP微移动性（micro-mobility)协议。本文研究了提交到IETF移动IP工作组（MIP WG)的几种关键IP微移动性协议，分析了协议的动机、特点，比较了性能、信令复杂度和实用性，给出了可能的优化途径。     

一种应用位置预测的动态寻呼框架

移动通信系统里评估系统的一项重要指标是用户在移动过程产生的信令消耗。在现行4G网络中,当核心网向目标终端发送寻呼时,在跟踪区域列表里的所有小区都要发送寻呼信令,造成了不必要的信令浪费。为减少寻呼信令的消耗,提出了一种移动性管理的框架,此框架可以分为预测部分和回落部分,其中预测部分提供了移动性管理与预测算法有机结合的方案,回落部分则使用马尔科夫链对寻呼过程进行分析,在预测失败时采取动态寻呼的方式。对该框架进行建模和仿真可以看出,所用的寻呼方案能有效减少移动终端的非接入层处于空闲态时进行移动性管理中寻呼信令的开销。     

区域注册移动IP中的分布式位置管理方案

提出了一种区域注册移动IP的分布式位置管理方案。该方案基于区域网络逻辑上分层的结构特点,提出了在流量负载不超出一定流量门限的前提下,为移动节点选取不同层次上的外地代理FA作为网关外地代理GFA。通过对一种区域网络模型的研究,分析了不同层次上的FA作为GFA时的信令开销。最后通过仿真计算得出了采用分布式位置管理方案时区域注册移动IP信令开销的数值结果。通过分析比较说明该方案相比于区域注册移动IP而言,可以节约10％以上的信令开销,并将有效流量分配山多个GFA承担,当某个GFA失效时将不会影响其它GFA工作,提高了网络的稳健性。     

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

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

LTE寻呼优化方案研究

分析了LTE网络中的寻呼优化需求,针对固定位置或低移动性终端,提出2种解决方案,分别是基于网络侧的寻呼优化方案和基于终端的寻呼优化方案,并分析了对现有网元功能的影响,从而在保证一定的寻呼成功率的基础上,通过减小寻呼区域的方式来降低寻呼的信令负荷。     

利用信令仪实现移动通信系统寻呼问题的分析

本文提出了一种方案采用2台或3台信令仪来分析寻呼问题,介绍了相关的设计思想、软件开发和应用,该方案以极低的成本解决了长期困扰移动运营商的寻呼定位到小区和用户的问题,并克服了现有软件的缺陷,同时为拓展信令仪的应用提供了新的思路,具有较高的推广应用价值.     

移动互联网中的网络技术

从移动性管理、轻量级IP协议适配、多接口异构网络接入等方面入手,对传统IP网络的发展策略进行了探讨.针对造成移动通信网“信令风暴”的原因,提出了从移动终端、无线接入网、核心网等层面共同解决“信令风暴”的对策.     

LTE位置管理中信令开销的分析

为了克服2G和3G移动通信网络位置管理方案的缺陷,4G长期演进(Long Term Evolution,LTE)采用了基于跟踪区列表(Tracking Area List,TAL)的位置管理方案。基于TAL的位置管理方案的性能取决于TAL分配方案。考虑到本地移动设备(User Equipment,UE)的活动区域相对固定,该文提出一种嵌入式马尔科夫链模型,用于分析本地UE的基于TAL的位置管理方案的信令开销。推导得到位置更新开销和寻呼开销的数学公式。利用这些公式,可搜索得到能使信令开销最低化的最佳TAL分配方案。     

IP Paging Service for Mobile Hosts

In wireless networks, mobile hosts must update the network with their current location in order to get packets delivered. Paging facilitates efficient power management at the mobile host by allowing the host to update the network less frequently at the cost of providing the network with only approximate location information. The network determines the exact location of a mobile host through paging before delivering packets destined to the mobile host. In this paper, we propose the concept of paging as an IP service. IP paging enables a common infrastructure and protocol to support the different wireless interfaces such as CDMA, GPRS, wireless LAN, avoiding the duplication of several application layer paging implementations and the inter-operability issues that exist today. We present the design, implementation, and detailed qualitative and quantitative evaluation, using measurements and simulation, of three IP-based paging protocols for mobile hosts.     

Associative IP paging based on hierarchical mobile IPv6

IP paging is a well‐known topic, which focuses on reducing amount of binding update (BU). Various IP paging architectures rely on multicast/broadcast to send their messages in wireless network. However, multicast/broadcast is unreliable and has limited bandwidth in power saving mode. This paper uses unicast to avoid exhaustion of the limited bandwidth and reliably page mobile nodes (MNs) by layer 2's supporting acknowledgment in nature. Furthermore, we successfully suppress the amount of BU by remembering and checking MNs' ever attached on‐link care of addresses (LCoAs) in the stack, which is maintained by least recently used (LRU) algorithm for efficiently paging while MNs moving in a localized pattern. We simulate this mechanism to obtain the optimal stack size, which can dramatically reduce the signals of location update and paging. Copyright © 2009 John Wiley & Sons, Ltd.     

Hash-Based Paging and Location Update Using Bloom Filters

We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call false location updates although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.     

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.     

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.     

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.     

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 …     

Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems

In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since paging costs are associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging costs, three new paging schemes, reverse, semi-reverse and uniform, are introduced to provide a simple way of partitioning the service areas and decrease the paging costs based on each mobile terminal's location probability distribution. Numerical results demonstrate that our approaches significantly reduce the paging costs for various probability distributions such as uniform, truncated discrete Gaussian, and irregular distributions.     

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.     

IIPP: integrated IP paging protocol with a power save mechanism

The advent of advanced mobile/wireless systems has been facilitating the battery‐powered mobile computing devices (nodes) to remain always connected to the internet. However, until now, the power‐drain rate of mobile nodes is very high in comparison with the available power of portable batteries. To reduce the energy consumption of mobile nodes, we present an integrated IP paging protocol (IIPP) by integrating the IP‐layer paging protocol based on Mobile IPv4 regional registration (MIPRR) with a power save mechanism. IIPP reduces the frequency of signaling messages between mobile nodes and networks. When not sending or receiving data for a certain time, mobile nodes enter power save mode (PSM), and consume very low power. We formulate analytical models and carry out simulations to evaluate the proposed IIPP. The results show that, compared to MIPRR, IIPP significantly reduces the average power consumption of the mobile node and signaling overheads in the network. Copyright © 2006 John Wiley & Sons, Ltd.