Quantitative analysis of a hybrid replication with forwarding strategy for efficient and uniform location management in mobile wireless networks

A location management scheme in wireless networks must effectively handle both user location update and search operations. Replication and forwarding are two well-known techniques to reduce user search and update costs, respectively, with replication being most effective when the call to mobility ratio (CMR) of the user is high, while forwarding is most effective when the CMR value is low. Thus, based on the user's CMR, the system can adopt a CMR threshold-based scheme such that if the user's CMR is lower than a threshold, then the system applies the forwarding scheme; otherwise, it applies the replication scheme. Applying different location management schemes based on per-user CMR values introduces undesirable high complexity in managing and maintaining location- related information stored in the system as different system support mechanisms must be applied to different users. In this paper, we quantitatively analyze a hybrid replication with forwarding scheme that can be uniformly applied to all users. The most striking feature of the hybrid scheme is that it can determine and apply the optimal number of replicas and forwarding chain length on a per-user basis to minimize the communication cost due to location management operations while still being able to use the same data structure and algorithm to execute location management operations in a uniform way for all users. We develop a stochastic Petri net model to help gather this information and show how the information obtained statically can be used efficiently by the system at runtime to determine the optimal number of replicas and forwarding chain length when given a use user's profile. We show that the proposed hybrid scheme outperforms both pure replication and forwarding schemes, as well as the CMR threshold-based scheme under all CMR values.     

Analysis and Comparison of Location Strategies for Reducing Registration Cost in PCS Networks

In mobile environments, a personal communication service (PCS) network must keep track of the location of each mobile user in order to correctly deliver calls. A basic scheme used in the standard IS-41 and GSM protocols is to always update the location of a mobile user whenever the mobile user moves to a new location. The problem with this approach is that the cost of location update operations is very high especially when the mobile user moves frequently. In recent years, various location management strategies for reducing the location update cost have been proposed. However, the performance issue of these proposed algorithms remains to be investigated. In this paper, we develop two Markov chains to analyze and compare the performance of two promising location update strategies, i.e., the two location algorithm (TLA) and the forwarding and resetting algorithm (FRA). By utilizing the Markov chain, we are able to quickly answer what-if questions regarding the performance of PCS networks under various workload conditions and also identify conditions under which one strategy can perform better than the others. Using the cost due to location update and search operations between two successive calls to a mobile user as a performance measure, we show that when the mobile user exhibits a high degree of locality and the mobile user's call-to-mobility ratio (CMR) is low, TLA can significantly outperform both FRA and IS-41. On the other hand, when CMR is high, FRA is the winner. Furthermore, unlike TLA which may perform worse than IS-41 at high CMR values, FRA at identified optimal conditions can always perform at least as good as IS-41, suggesting that FRA over TLA should be used as a generic scheme in reducing the location cost in the PCS network to cover all possible per-user CMR values.     

Two-level pointer forwarding strategy for location management in PCS networks

For a IPCS network to effectively deliver services to its mobile users, it must have an efficient way to keep track of the mobile users. The location management fulfills this task through location registration and paging. To reduce the signaling traffic, many schemes such as a local anchor (LA) scheme, per-user caching scheme and pointer forwarding scheme have been proposed in the past. In this paper, we present a new location management scheme which intends to mitigate the signaling traffic as well as reduce the tracking delay in the PCS systems. In this strategy, we choose a set of visitor location registers (VLRs) traversed by users as the mobility agents (MA), which form another level of management in order to make some registration signaling traffic localized. The idea is as follows: instead of always updating to the home location register (HLR), which would become the bottleneck otherwise, many location updates are carried out in the mobility agents. Thus, the two-level pointer forwarding scheme is designed to reduce the signaling traffic: pointers can be set up between VLRs as the traditional pointer forwarding scheme and can also be set up between MAs. The numerical results show that this strategy can significantly reduce the network signaling traffic for users with low CMR without increasing much of the call setup delay.     

An analysis of location record checkpointing interval for mobility database in PCS networks

Mobility database that stores the users’ location records is very important to connect calls to mobile users on personal communication networks. If the mobility database fails, calls to mobile users may not be set up in time. This paper studies failure restoration of mobility database. We study per-user location record checkpointing schemes that checkpoint a user’s record into a non-volatile storage from time to time on a per-user basis. When the mobility database fails, the user location records can be restored from the backup storage. Numeric analysis has been used to choose the optimum checkpointing interval so that the overall cost is minimized. The cost function that we consider includes the cost of checkpointing a user’s location record and the cost of paging a user due to an invalid location record. Our results indicate that when user registration intervals are exponentially distributed, the user record should never be checkpointed if checkpointing costs more than paging. Otherwise, if paging costs more, the user record should be always checkpointed when a user registers.     

基于IPv6的快速切换改进方案

在移动IP网络中,当前的移动性管理方案由于其基本协议的切换时延较大、丢包率较高而不能适应实时业务和移动通信的要求,所以需要改善移动性管理策略的切换性能,尽量实现无缝切换和零丢包率。提出了一种基于移动IPv6的快速切换的改进方案,采用一种新的地址分配方式使得移动节点能够在移动至新的网络后迅速获取新的转交地址,有效地减少了切换所产生的时延和丢包率,具有较好的切换性能。     

An integrated strategy for reducing location management cost

In this letter, an integrated location information management strategy is proposed for mobile networks, where local anchor and replica are deployed to efficiently manage the location information of a mobile terminal (MT) based on its call and mobility characteristics. As an MT's user is roaming within the local signal transfer point (LSTP) region serving the user's home or workplace, the MT's location change is reported to a local anchor (LA)-the visitor location register (VLR) associated with the user's home or workplace. Meanwhile, the LA's location is replicated at several switches (called the replicas) originating relatively high call rates to the MT. As a result, the MT's home location register (HLR) needs to be accessed only when the MT changes its LSTP region or an incoming call for the MT is generated by a nonreplica originating switch. This is shown to reduce location tracking costs.     

Performance Analysis of Location-Aware Mobile Service Proxies for Reducing Network Cost in Personal Communication Systems

We propose and analyze mobile service management schemes based on location-aware proxies with the objective to reduce the network signaling and communication cost in future personal communication systems (PCS). Under these schemes, a mobile user uses personal proxies as intelligent client-side agents to communication with services engaged by the mobile user. A personal proxy cooperates with the underlying location management system so that it is location-aware and can optimally decide when and how often it should move with the roaming user. We show that, when given a set of model parameters characterizing the network and workload conditions, there exists an optimal proxy service area size for service handoffs such that the overall network signaling and communication cost for servicing location and service operations is minimized. We demonstrate via Petri net models that our proposed proxy-based mobile service management schemes outperform non-proxy-based schemes over a wide range of identified conditions. Further, when the mobile user is concurrently engaged in multiple services, the per-service proxy scheme that uses a separate proxy for each service outperforms the aggregate proxy scheme that uses a single proxy to interface with multiple services taking their aggregate service characteristics into consideration. Baoshan Gu received the BS degree from University of Science and Technology of China, Hefei, China, in 1992 and the MS degree in computer science from Institute of Computing Technology, Chinese Academia of Science, Beijing, China, in 1995. From 1995 to 2000, he was a research and development engineer in Institute of Computing Technology, Chinese Academia of Science. He is currently pursuing his PhD degree in the Department of Computer Science, Virginia Tech, where he is a research assistant in the Systems and Software Engineering Laboratory. His research interests include next-generation wireless system architectures, design and evaluation of location and service management schemes in mobile computing environments, and mobile database systems. Ing-Ray Chen received the BS degree from the National Taiwan University, Taipei, Taiwan, and the MS and PhD degrees in computer science from the University of Houston, Texas. He is currently an associate professor in the Department of Computer Science at Virginia Tech. His research interests include mobile computing, pervasive computing, multimedia, distributed systems, real-time intelligent systems, and reliability and performance analysis. Dr. Chen has served on the program committee of numerous conferences, including being as program chair of 14th IEEE International Conference on Tools with Artificial Intelligence in 2002, and 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology in 2000. Dr. Chen currently serves as an Associate Editor for IEEE Transactions on Knowledge and Data Engineering, The Computer Journal, and International Journal on Artificial Intelligence Tools. He is a member of the IEEE/CS and ACM.This revised version was published online in August 2005 with a corrected cover date.     

Agent-Based Forwarding Strategies for Reducing Location Management Cost in Mobile Networks

An important issue in location management for dealing with user mobility in wireless networks is to reduce the cost associated with location updates and searches. The former operation occurs when a mobile user moves to a new location registration area and the network is being informed of the mobile user's current location; the latter operation occurs when there is a call for the mobile user and the network must deliver the call to the mobile user. In this paper, we propose and analyze a class of new agent-based forwarding schemes with the objective to reduce the location management cost in mobile wireless networks. We develop analytical models to compare the performance of the proposed schemes with existing location management schemes to demonstrate their feasibility and also to reveal conditions under which our proposed schemes are superior to existing ones. Our proposed schemes are particularly suitable for mobile networks with switches which can cover a large number of location registration areas.     

A mobility prediction architecture based on contextual knowledge and spatial conceptual maps

User Mobility prediction represents a key component in assisting handoff management, resource reservation, and service preconfiguration. However, most of the existing approaches presume that the user travels in an a priori known pattern with some regularity; an assumption that may not always hold. This paper presents a novel framework for user mobility prediction that can accurately predict the traveling trajectory and destination using knowledge of user's preferences, goals, and analyzed spatial information without imposing any assumptions about the availability of users' movements history. This framework thus incorporates the notion of combining user context and spatial conceptual maps in the prediction process. The main objective of this notion is to circumvent the difficulties that arise in predicting the user's future location when adequate knowledge about the history of user's traveling patterns is not available. Using concepts of evidential reasoning of Dempster-Shafer's theory, the user's navigation behavior is captured by gathering pieces of evidence concerning different groups of candidate future locations. These groups are then refined to predict the user's future location when evidence accumulates using the Dempster rule of combination. Simulation results are presented to demonstrate the performance of the proposed framework.     

Mobility support for IP over wireless ATM

A wireless ATM system consists of a core network infrastructure that provides mobility support to end terminals and a wireless access link. This article outlines two schemes for supporting mobility of IP terminals in this network. In the first scheme, location management and handoff support is integrated within the ATM signaling and control framework (“mobile ATM”), and mobility is transparently supported at the IP layer by mobile ATM underneath. In the second approach, the IP protocol stack is directly executed on ATM switches (without an intermediate ATM signaling stack) using an IP switching technique called IPSOFACTO (IP Switching Over Fast ATM Cell Transport), and terminal mobility is supported via mobile IP     

Intelligent Handoff for Mobile Wireless Internet

This paper presents an intelligent mobility management scheme for Mobile Wireless InterNet – MWIN. MWIN is a wireless service networks wherein its core network consisting of Internet routers and its access network can be built from any Internet-capable radio network. Two major standards are currently available for MWIN, i.e., the mobile IP and wireless LAN. Mobile IP solves address mobility problem with the Internet protocol while wireless LAN provides a wireless Internet access in the local area. However, both schemes solve problems independently at different layers, thereby some additional problems occur, e.g., delayed handoff, packet loss, and inefficient routing. This paper identifies these new problems and performs analyses and some real measurements on the handoff within MWIN. Then, a new handoff architecture that extends the features of both mobile IP and wireless LAN handoff mechanism was proposed. This new architecture consists of mobile IP extensions and a modified wireless LAN handoff algorithm. The effect of this enhancement provides a linkage between different layers for preventing packet loss and reducing handoff latency. Finally, some optimization issues regarding network planning and routing are addressed.     

A class of mobile motion prediction algorithms for wireless mobile computing and communications

This paper describes a class of novel mobile motion prediction algorithms for supporting global mobile data accessing. Traditionally, mobility and routing management includes functions to passively keep track of the location of the users/terminals and to maintain connections to the terminals belonging to the system. To maintain uninterrupted high-quality service for distributed applications, it is important that a mobile system be more intelligent and can anticipate the change of the location of its user. We propose an aggressive mobility and routing management scheme, called predictive mobility management. A class of mobile motion prediction algorithms predicts the future location of a mobile user according to the user's movement history, i.e., previous movement patterns. By combining this scheme with mobility agent functions, the service and user routing data are actually pre-connected and pre-assigned at the locations to which the user is moving. Thus, the user can immediately receive service or data with virtually the same efficiency as at the previous location, i.e., without encountering a large data structure handover delay before service or data is available.     

Predictive mobility support for QoS provisioning in mobile wirelessenvironments

With the proliferation of wireless network technologies, mobile users are expected to demand the same quality of service (QoS) available to fixed users. This paper presents a predictive and adaptive scheme to support timed-QoS guarantees in pico- and micro-cellular environments. The proposed scheme integrates the mobility model into the service model to achieve efficient network resource utilization and avoid severe network congestion. The mobility model uses a probabilistic approach to determine the most likely cluster to be visited by the mobile unit. The admission control is invoked when a new call arrives or an existing call performs a handoff to verify the feasibility of supporting the call. The performance of the proposed schemes is compared to the shadow cluster scheme. The performance of the proposed scheme under different traffic patterns is also presented     

Predictive mobile-oriented channel reservation schemes in wireless cellular networks

Provision of seamless service to multimedia applications in cellular wireless networks largely depends on the way calls are handled during handoff. Hence, sufficient resources must be provided for handoff (HO) connections when a mobile station (MS) moves from one cell to another. Effective allocation of resources can be achieved when the exact future trajectory of MSs is known in advance. However, such a scenario is unrealistic. The next best possibility is to employ user mobility prediction to determine the cell(s) a MS will likely visit in the near future. In this paper, we present an extensive survey and classification of channel (bandwidth) reservation schemes which employ user mobility prediction in the resource reservation process. We also present a survey and classification of call admission control (CAC) schemes, including discussion of prioritized and non-prioritized handoff schemes, which can be useful for researches both in academia and industry.     

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

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

Overflow control for cellular mobility database

In a cellular phone system, the service area is partitioned into several location areas (LAs). Every LA is associated with a mobility database called visitor location register (VLR). When a mobile user enters an LA, the user must register to the VLR before receiving any cellular service. If the VLR is full, the registration procedure fails and the system cannot deliver services to the user under the existing cellular technology. To resolve this problem, we propose a VLR overflow control scheme to accommodate the incoming mobile users during VLR overflow. Our scheme only requires minor modifications to the existing cellular mobility management protocols. Particularly, no modification is made to the mobile phones. An analytic model is proposed to investigate the performance of the overflow control scheme. When exercising the scheme, the call setup procedure for an “overflow” user is more expensive than that for a “normal” user. Under the range of input parameters considered in our study, we show that even if the VLR overflow situation is serious, the overhead for exercising the overflow control scheme is very low     

Optimization of wireless resources for personal communicationsmobility tracking

In personal communications applications, users communicate via wireless with a wireline network. The wireline network tracks the current location of the user, and can therefore route messages to a user regardless of the user's location. In addition to its impact on signaling within the wireline network, mobility tracking requires the expenditure of wireless resources as well, including the power consumption of the portable units carried by the users and the radio bandwidth used for registration and paging. Ideally, the mobility tracking scheme used for each user should depend on the user's call and mobility pattern, so the standard approach, in which all cells in a registration area are paged when a call arrives, may be wasteful of wireless resources. In order to conserve these resources, the network must have the capability to page selectively within a registration area, and the user must announce his or her location more frequently. We propose and analyze a simple model that captures this additional flexibility. Dynamic programming is used to determine an optimal announcing strategy for each user. Numerical results for a simple one-dimensional mobility model show that the optimal scheme may provide significant savings when compared to the standard approach even when the latter is optimized by suitably choosing the registration area size on a per-user basis. Ongoing research includes computing numerical results for more complicated mobility models and determining how existing system designs might be modified to incorporate our approach     

Approaches to resource reservation for migrating real-time sessions in future mobile wireless networks

This paper presents two novel frameworks for session admission control and resource reservation in the context of next generation mobile and cellular networks. We also devised a special scheme that avoids per-user reservation signaling overhead in order to meet scalability requirements needed for next generation multi-access networks. The first proposal, Distributed Call Admission Control with Aggregate Resource Reservation (VR), uses mobility prediction based on mobile positioning system location information and takes into account the expected bandwidth to be used by calls handing off to and from neighboring cells within a configurable estimation time window. In conjunction, a novel concept called virtual reservation has been devised to prevent per-user reservation. Our second proposal, Local Call Admission Control and Time Series-based Resource Reservation, takes into account the expected bandwidth to be used by calls handed off from neighboring cells based only on local information stored into the current cell a user is seeking admission to. To this end, we suggest the use of two time series-based models for predicting handoff load: the Trigg and Leach (TL), which is an adaptive exponential smoothing technique, and Autoregressive Integrated Moving Average (ARIMA) that uses the Box and Jenkins methodology. It is worth to emphasize that the use of bandwidth prediction based on ARIMA technique still exist for wireless networks. The novelty of our approach is to build an adaptive framework based on ARIMA technique that takes into account the measured handoff dropping probability in order to tuning the prediction time window size so increasing the prediction accuracy. The proposed schemes are compared through simulations with the fixed guard channel (GC) and other optimized dynamic reservation-based proposals present in the literature. The results show that our schemes outperform many others and that the simpler local proposal based on TL can grant nearly similar levels of handoff dropping probability as compared to those from more the complex distributed approach.     

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.     

Design and analysis of dynamic mobility tracking in wirelesspersonal communication networks

In personal communication networks (PCN), mobility tracking provides the function of locating a mobile user within the service area. We propose an intersection-oriented dynamic location update (LU) strategy, which is designed to minimize the cost of mobility tracking by optimally partitioning the service area into location registration (LR) areas on a per-user basis. A realistic mobility model is proposed in which we consider not only the mobility behavior of the individual subscriber, but also the street layout. Based on this model, a transient Markov process is developed to analyze the tracking cost. To reduce the implementation cost and to make the proposed strategy feasible, the concept of mobile subscriber (MS) grouping, and equivalent quadrangular LR area are also adopted