On Integrated Location and Service Management for Minimizing Network Cost in Personal Communication Systems

We investigate the notion of per-user integrated location and service management in personal communication service (PCS) networks by which a per-user service proxy is created to serve as a gateway between the mobile user and all client-server applications engaged by the mobile user. The service proxy is always colocated with the mobile user's location database such that whenever the MU's location database moves during a location handoff, a service handoff also ensues to colocate the service proxy with the location database. This allows the proxy to know the location of the mobile user all the time to reduce the network communication cost for service delivery. We investigate four integrated location and service management schemes. Our results show that the centralized scheme performs the best when the mobile user's SMR (service to mobility ratio) is low and CMR (call to mobility ratio) is high, while the fully distributed scheme performs the best when both SMR and CMR are high. In all other conditions, the dynamic anchor scheme is the best except when the service context transfer cost is high, under which the static anchor scheme performs the best. Through analytical and simulation results, we demonstrate that different users with vastly different mobility and service patterns should adopt different integrated location and service management methods to optimize system performance. Further, the best integrated scheme always performs better than the best decoupled scheme that considers location and service managements separately and management schemes that do not use any service proxy.     

Air interface switching and performance analysis for fast vertical handoff in cellular network and WLAN interworking

The integration of wireless local area network (WLAN) hotspot and the 3G cellular networks is imminently the future mode of public access networks. One of the key elements for the successful integration is vertical handoff between the two heterogeneous networks. Service disruption may occur during the vertical handoff because of the IP layer handoff activities, such as registration, binding update, routing table update, etc. In this paper, the network interface switching and registration process are proposed for the integrated WLAN/cellular network. Two types of fast vertical handoff protocols based on bicasting and non‐bicasting supporting real‐time traffic, such as voice over IP, are modeled. The performance of a bicasting based handoff scheme is analyzed and compared with that of fast handoff without bicasting. Numerical results and the simulation are given to show that packet loss rate can be reduced by the bicasting during handoff scheme without increasing bandwidth on both wireless interfaces. Copyright © 2006 John Wiley & Sons, Ltd.     

LEO卫星IP网络中的切换管理研究

为了缓解LEO卫星IP网络的注册和绑定更新频率并降低切换延时,提出了基于虚拟移动路由器(VMR)的切换管理方案.当发生切换时,与用户段网络的移动路由器关联的VMR根据损耗函数决定是否转移以及向用户段的家乡代理发送注册和绑定更新消息.文中描述了VMR的数据结构、操作流程和损耗函数模型,并进行了仿真试验.试验结果表明,该方案实现了切换与注册与绑定更新过程的分离,可以应用在LEO卫星IP网络中.     

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 …     

Q-Learning Based Interference-Aware Channel Handoff for Partially Observable Cognitive Radio Ad Hoc Networks

Channel handoff is a crucial function for Cognitive radio ad hoc networks (CRAHNs). The ab-sence of centralized infrastructures and the limited power make the handoff design more challenging. A learning-based interference-aware handoff scheme is proposed for distributed CRAHNs. We model the channel handoff pro-cess as a Partially observable Markov decision process (POMDP) and adopt a Q-learning algorithm to find an optimal handoff strategy in a long term. The proposed algorithm obtains an efficient transmission performance by considering the interferences among SUs and PUs. To achieve PU awareness, the handoff scheme predicts the PU activities by using the historical channel usage statistics. In addition, we also propose a refined channel selection rule to compromise between learning speed and cumulative trans-mission reward. The simulation results show that the pro-posed handoff scheme can adapt to the PU activities and achieves a better performance in terms of high throughput and low collisions. And the learning process keeps a consid-erable balance between convergence time and cumulative reward.     

一种基于移动IPv6协议的软切换实现方案

移动IPv6协议解决了IPv6网络中移动节点的位置更新和路由可达问题,使移动节点能够在不同IPv6子网间进行切换而不中断当前连接。但是这种切换的时延较长,影响移动IPv6网络的性能。为了减少切换时延,文章在移动IPv6协议中引入软切换技术,提出一种采用绑定更新计时器和路由优先级变换机制的软切换工程实现方案,实验结果表明,该软切换方案可以有效提高移动IPv6网络的性能。     

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.     

Virtually fixed channel assignment in cellular mobile networks with recall and handoffs

A promising approach for implementing channel assignment and control in cellular mobile telephone networks is the virtually fixed channel assignment (VFCA) scheme. In VFCA channels are allocated to cells according to the fixed channel assignment (FCA) scheme, but cells are allowed to borrow channels from one another. As such, VFCA maintains the efficiency of FCA, but adds the flexibility lacking in FCA. One feature of a VFCA network is that, to prevent co-channel interference, it requires several channels to be locked to serve a single call that borrows a channel. This feature raises the concern that VFCA may lead to chain reaction in channel borrowing among cells and cause the network performance to degrade, especially under heavy traffic conditions. In this paper, we propose the virtually fixed channel assignment with recall (VFCAWR) scheme: The network is implemented according to VFCA, but a cell can recall a locked channel to service an arriving handoff call, which occurs when a mobile unit crosses the boundary of its cell. We model the network as a three-dimensional Markov chain and derive its steady-state performance. Through modification of this basic model, we evaluate two dynamic channel assignment strategies, the virtual channel reservation (VCR) strategy and the linear switch-over (LSO) strategy, which exploit the unique borrowing/recall capability of VFCAWR to reduce the weighted cost of blocking fresh and handoff calls by reserving several virtual channels (the channels that may be borrowed from adjacent cells when necessary) for handoff calls. We validate the analytical models by simulation; the simulation test cases show that our models accurately predict the system performance measures of interest. Numerical and simulation results also show that both dynamic strategies outperform conventional channel reservation schemes based on fixed channel assignment and hybrid channel assignment. This revised version was published online in June 2006 with corrections to the Cover Date.     

Dynamic resource allocation schemes during handoff for mobilemultimedia wireless networks

User mobility management is one of the important components of mobile multimedia systems. In a cell-based network, a mobile should be able to seamlessly obtain transmission resources after handoff to a new base station. This is essential for both service continuity and quality of service assurance. In this paper, we present strategies for accommodating continuous service to mobile users through estimating resource requirements of potential handoff connections. A diverse mix of heterogeneous traffic with diverse resource requirements is considered. The investigate static and dynamic resource allocation schemes. The dynamic scheme probabilistically estimates the potential number of connections that will be handed off from neighboring cells, for each class of traffic. The performance of these strategies in terms of connection blocking probabilities for handoff and local new connection requests are evaluated. The performance is also compared to a scheme previously proposed by Yu and Leung (see IEEE J. Select. Areas Commun., vol.15, p.1208-25, 1997). The results indicate that using dynamic estimation and allocation, we can significantly reduce the dropping probability for handoff connections     

一种基于状态的动态位置管理方法

在蜂窝移动通信系统中,用户位置管理方法性能的好坏直接影响系统的服务质量.本文提出了一种基于运动状态的动态位置管理方法.系统根据用户不同的运动状态动态地决定其位置区的大小.其性能较传统方法有显著提高,接近基于个体移动特征的方法;同时,它保持了传统算法实现简单的特点,不增加任何系统负担,不改变现有的信令流程,较好地兼顾了性能与工程实用性两方面的要求,适合3G系统的应用要求,具有很好的工程应用前景.     

A novel distributed dynamic location management scheme for minimizing signaling costs in Mobile IP

Mobile IP is a simple and scalable global mobility solution. However, it may cause excessive signaling traffic and long signaling delay. Mobile IP regional registration is proposed to reduce the number of location updates to the home network and to reduce the signaling delay. This paper introduces a novel distributed and dynamic regional location management for Mobile IP where the signaling burden is evenly distributed and the regional network boundary is dynamically adjusted according to the up-to-date mobility and traffic load for each terminal. In our distributed system, each user has its own optimized system configuration which results in the minimal signaling traffic. In order to determine the signaling cost function, a new discrete analytical model is developed which captures the mobility and packet arrival pattern of a mobile terminal. This model does not impose any restrictions on the shape and the geographic location of subnets in the Internet. Given the average total location update and packet delivery cost, an iterative algorithm is then used to determine the optimal regional network size. Analytical results show that our distributed dynamic scheme outperforms the IETF Mobile IP regional registration scheme for various scenarios in terms of reducing the overall signaling cost.     

Performance analysis of a dynamic handoff scheme in wireless networks with heterogeneous call arrival processes

The Guard Channel Scheme (GCS) and Handoff Queueing Scheme (HQS) are the popular and practical strategies to prioritize handoff calls in wireless cellular networks. A key issue of giving handoff calls the higher priority is how to achieve a tradeoff among the handoff call blocking probability, new call blocking probability and handoff delay. This paper extends GCS and HQS and presents an efficient handoff scheme that dynamically manages the channels reserved for handoff calls depending on the current status of the handoff queue. A three-dimensional Markov model is developed to analyze the performance of this scheme and investigate the desirable performance tradeoff. The Poisson process and Markov-Modulated-Poisson-Process (MMPP) are used to model the arrival processes of new and handoff calls, respectively. The accuracy of this model is evaluated through the extensive comparison of the analytical results to those obtained from discrete-event simulation experiments. Performance measures in terms of the mean number of calls in the system, aggregate response time, aggregate call blocking probability, handoff call blocking probability, new call blocking probability and handoff delay are evaluated. The analytical model is used to investigate the effects of the number of channels originally reserved for handoff calls, the number of dynamic channels, and the ratio of the rate of handover calls to the aggregate arrival rate on the system performance.     

Integrating Distributed Channel Allocation and Adaptive Handoff Management for QoS-Sensitive Cellular Networks

Next generation high-speed cellular networks are expected to support multimedia applications, which require QoS provisions. Since frequency spectrum is the most expensive resource in wireless networks, it is a challenge to support QoS using limited frequency spectrum. In the literature, two orthogonal approaches are used to address the bandwidth utilization issue and the QoS provision issue; that is, channel allocation schemes have been proposed to improve bandwidth efficiency, whereas handoff management schemes, based on bandwidth reservation, have been proposed to guarantee a low connection dropping rate. However, little effort has been taken to address both issues together. In this paper, we integrate distributed channel allocation and adaptive handoff management to provide QoS guarantees and efficiently utilize the bandwidth. First, we present a complete distributed distributed channel allocation algorithm and propose techniques to reduce its message complexity and intra-handoff overhead. Second, we integrate the proposed distributed channel allocation algorithm with an adaptive handoff management scheme to provide QoS guarantees and efficiently utilize the bandwidth. Detailed simulation experiments are carried out to evaluate the proposed methodology. Compared to previous schemes, our scheme can significantly reduce the message complexity and intra-handoff overhead. Moreover, the proposed scheme can improve the bandwidth utilization while providing QoS guarantees.     

360 m 20 Gbit/s的W波段无线通信系统

为了满足未来空间高速通信的迫切需求,进行了W波段(75~110 GHz)无线高速通信的研究。通信系统中采用光子上变频技术产生传输速率为20 Gbit/s的W波段QPSK信号,解决了电子器件带宽受限的瓶颈问题。在接收机端采用模拟下变频和先进数字信号处理技术,实现了无线传输360 m距离后信号的离线解调。最终系统的误码率小于硬判决前向纠错(FEC)门限3.8×10?3。     

基于代价函数的动态分布式解析映射机制

针对身份与位置的动态解析映射问题,依据终端的移动模式和通信特征,提出了一种基于代价函数的动态分布式移动解析映射机制。该机制将移动终端的通信状态划分为移动更新、均衡传输和解析查询3种通信模式,以最小化解析映射代价为目标,分别提出了基于分布式多播、一致性散列协同和主动式域内共享的解析映射方法,设计了对应的注册更新、解析查询和数据路由解析优化策略。仿真结果表明,该机制实现了移动过程中解析映射代价的最小化,具有较小的解析时延,对网络结构的动态变化具有良好的适应性。     

A Modified Distributed Call Admission Control Scheme and Its Performance

Call admission control is one of the key elements to guarantee the handoff call dropping probability in cellular networks. Among numerous proposals in the literature, the distributed call admission control policy (DCAC) seems to be promising, due to its simplicity and adaptability to changing traffic. However, one crucial assumption used in DCAC is that the actually admitted new calls has to obey a Poisson process to enter the network after the call admission control. Given the dynamic and distributed nature of the control process, this can neither be validated nor be easily implemented. In this paper, we will first discuss a generalized DCAC which eliminates the above assumption and can be used in general environments. Then, a mobility-aware DCAC is introduced, which considers the difference of handoff support between low and high mobility calls in making the CAC decision in order to improve channel utilization. The performance of the modified DCAC scheme is investigated through simulation studies.     

A mapping forwarding approach for supporting mobility in networks with identifier/locator separation

The identifier/locator separation has been widely recognized as a feasible solution for addressing the current Internet's routing scaling problem. Moreover, such a separation solution in terms of mobility can keep connection survivability and support global seamless roaming. A critical challenge in supporting efficient mobility is how to update the identifier‐to‐locator mappings of mobile nodes (MNs). In this paper, we propose a mapping forwarding (MF) scheme for location management in the identifier/locator separation architecture. In the MF scheme, a tunnel router (xTR) is selected as an agent of an MN and keeps the MN's identifier‐to‐locator mapping invariable by setting up an MF chain. As long as the MN is managed by the same xTR, the MN's mapping stored in the xTR of each correspondent node of the MN does not need to be updated, thus reducing the location update signaling cost. Meanwhile, the unchanged mapping assures the correct forwarding of packets, which reduces mobility‐related disruption and enhances the location management's reliability. In addition, for the handoff in two MF chains, we propose a data‐triggered update scheme that can achieve route optimization. To evaluate the proposed MF scheme, we establish two analytical models and formulate the blocking probability and the total protocol cost. The performance results show how the blocking probability changes under various parameters and how the MF scheme can effectively reduce the blocking probability compared with the location management scheme without the MF strategy. Meanwhile, our analysis demonstrates that the MF scheme has a lower overhead when the mobility rate is high. Copyright © 2011 John Wiley & Sons, Ltd.     

Performance evaluation of prioritized handoff schemes in mobilecellular networks

This paper deals with the performance analysis of two prioritized handoff schemes for mobile cellular networks in which handoff attempts finding all channels busy are queued for a maximum time. Fixed channel assignment is assumed. In the first prioritized handoff scheme considered, handoff attempts are queued according to the first-in-first-out (FIFO) policy. Conversely, the second scheme resorts to an ideal nonpreemptive priority queueing policy to enhance system performance. Differently from previous works, in this paper the performance analysis is carried out on the basis of a model which takes into account the event that a call may terminate when the mobile user is waiting for a handoff. Comparisons with simulation results and analytical predictions derived by means of alternative approaches highlight a better estimation accuracy for the proposed method. Moreover, it is also demonstrated here that the FIFO policy allows performance very close to that of the ideal prioritized handoff scheme and, hence, that it is a solution suitable for applications in mobile cellular networks where a high service quality is required     

Multilayer Hierarchical Model for Mobility Management in IPv6: A Mathematical Exploration

The mobility solution provided by Mobile IPv6 (MIPv6) imposes too much signaling load to the network and enforces large handoff latency to end user. Hierarchical MIPv6 (HMIPv6) on the other hand, is designed by organizing MIPv6 in layered architecture and performs better than MIPv6 in terms of handoff latency and signaling load. Observation shows that, there is still possibility to shrink the handoff latency and the signaling load by further extending HMIPv6 into multiple layers. To explore this possibility of enhanced performance through layered architecture, this paper aimed at mathematical exploration of an N-layered MIPv6 network architecture in order to figure out the optimal levels of hierarchy for mobility management. A widespread analysis is carried out on various parameters such as location update frequency and cost, handoff latency and packet delivery cost. Influence of queuing delay on handoff latency is examined by modeling M/M/1/K queue in the architecture and user mobility is modeled using Markov chain. Analytical investigation reveals that three levels of hierarchy in MIPv6 architecture provide an optimal solution for mobility management.     

Fast and reliable handoff for vehicular networks

A layer-3 mobility management scheme for an all-IP Wireless Access Network (WAN), and in particular for vehicular networks, is developed in this paper. The proposed method enables fast and reliable handoff. This feature is extremely important for high speed vehicular networks. Since vehicles are characterized by likely-predictable path, as well as very high speed, handoff events can and should be predicted in order to achieve fast and reliable handoff. As it is shown in this study, the proposed scheme can significantly reduce the packet loss ratio caused by frequent handoff events experienced by high speed vehicles. This scheme is topology-independent in the sense that it does not assume any network topology. The key idea is to use a topology-learning algorithm that enables to perform localized mobility management, by efficiently re-selecting a Mobility Anchor Point (MAP) node. The goal of the proposed scheme is to maintain a continues connection subject to user-dependent delay constraints, while minimizing the signaling cost and packet loss ratio associated with handoff events. This scheme is consistent with the existing mobility management schemes currently used in Mobile IP (MIP) and cellular networks, and it fits into the Hierarchical Mobile IPv6 (HMIPv6) scheme defined in Mobile IPv6 (MIPv6) for integrating mobile terminals with the Internet wired backbone.