An Index-Based Location Management Scheme for PCS Network

Location management provides the guarantee to deliver a call to mobile user during the mobility of user and it is a key challenge in wireless cellular networks. In this paper, we are introducing a new index-based location management scheme. It is based on indexing of location update information at the home agent of network. A tuple of index will keep track of range of location update information and corresponding thread of it, connected to stack of information table. To register a new mobile user, the mobile switching centre will generate a new identification number with the help of mobile switching centre identification number and temporary mobile subscriber identity of subscriber. If, the identification number is with in the range of index then, the Care of Address of mobile subscriber is added to information table else, the index will be reconstruct based on new range of identification number. It has been observed that in proposed technique, the call setup delay and network overheads is reduces over the limitation of minor increment of registration delay. The analytical model and numerical result represents the effectiveness of proposed scheme over the existing schemes.     

A new signaling protocol for intersystem roaming in next-generationwireless systems

In next-generation wireless systems, one of the major features that is different from the current personal communication service systems is the seamless global roaming. The mobile subscribers will be allowed to move freely across different networks while maintaining their quality of service for a variety of applications. To meet this demand, the signaling protocol of mobility management must be designed, supporting location registration and call delivery for roaming users who move beyond their home network. A new signaling protocol is proposed, emphasizing the active location registration for ongoing services during the mobile subscribers' movement. Another important goal of this new protocol is to reduce the overhead caused by mobility management so that the signaling traffic load and consumption of network resources can be reduced. The new protocol efficiently reduces the latency of call delivery and call loss rate due to crossing wireless systems with different standards or signaling protocols. The numerical results reveal that the proposed protocol is effective in improving the overall system performance     

Group registration with local anchor for location tracking in mobile networks

In mobile networks, the location of a mobile user needs to be traced for successful and efficient call delivery. In existing cellular networks, as a mobile user changes his/her location area (LA), a location registration request is sent to the home location register (HLR) to update the user profile to point to the new LA. With a large number of mobile subscribers, this conventional registration strategy will incur a high volume of signaling traffic. We propose a new location registration strategy, called Group Registration (GR), which efficiently reduces the location registration cost by reporting location changes to the HLR for multiple mobile terminals (MTs) in a single location update request message. Specifically, the IDs of the MTs newly moving into an LA are buffered and sent to the HLR for location update in the route response message of the next incoming call to any MT in the LA. An analytic model is developed and numerical results are presented. It is shown that the proposed GR strategy can achieve significant cost reductions compared to the conventional strategy and the local anchor strategy over a wide range of system parameters. Moreover, the GR strategy results in a much smaller call delivery latency than the local anchor strategy.     

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.     

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.     

Effect of personal mobility management in mobile communication networks

Personal mobility (PM) is one of the key issues in realizing a personal communications service (PCS) in emerging third-generation mobile communication networks such as IMT-2000. It can be realized through the universal personal telecommunication (UPT) service. Two PM management schemes are proposed to manage PM information related to UPT users for incoming call (incall) registration/deregistration, incall registration reset by a mobile terminal (MT) owner, and incall delivery to UPT users in mobile communication networks based on the location information managed by the user's home network. The relative cost, i.e., the ratio of cost per unit time for supporting both terminal mobility (TM) and PM management to that of TM management, is derived, and the effect of PM management is analyzed from the aspects of update or query cost, signaling delivery cost, and processing cost. These results can be utilized in the implementation of PM management in IMT-2000.     

Predictive distance-based mobility management for multidimensional PCS networks

This paper presents a mobile tracking scheme that exploits the predictability of user mobility patterns in wireless PCS networks. In this scheme, a mobile's future location is predicted by the network, based on the information gathered from the mobile's recent report of location and velocity. When a call is made, the network pages the destination mobile around the predicted location. A mobile makes the same location prediction as the network does; it inspects its own location periodically and reports the new location when the distance between the predicted and the actual locations exceeds a threshold. To more realistically represent the various degrees of velocity correlation in time, a Gauss-Markov mobility model is used. For practical systems where the mobility pattern varies over time, we propose a dynamic Gauss-Markov parameter estimator that provides the mobility parameters to the prediction algorithm. Based on the Gauss-Markov model, we describe an analytical framework to evaluate the cost of mobility management for the proposed scheme. We also present an approximation method that reduces the computational complexity of the cost evaluation for multidimensional systems. We then compare the cost of predictive mobility management against that of the regular, nonpredictive distance-based scheme, for both the case with ideal Gauss-Markov mobility pattern and the case with time-varying mobility pattern.     

Implicit Deregistration with Forced Registration for PCS Mobility Management

Registration/deregistration with a mobility database called Visitor Location Registers (VLRs) is required in a PCS network when a mobile phone moves between registration areas. Several schemes were proposed to deregister a mobile phone after it moves out of a registration area. A simple scheme, called implicit deregistration, is studied in this paper, which does not specifically deregister any obsolete record in the VLR. If the VLR is full when a mobile phone arrives, a record in the VLR is deleted and the reclaimed storage is reassigned to the incoming mobile phone. It is possible that a valid record will be deleted. If so, the VLR record of a mobile phone may be deleted before a call to the mobile phone arrives. Our previous work assumed that the incoming call setup would be lost. In this paper, we propose forced registration to restore the VLR record before the call setup operation can proceed. With this modification, implicit deregistration totally eliminates the deregistration traffic at the cost of creating some forced registration traffic.We derive the record-missing probability and the portion of the network traffic saved by implicit deregistration. Our study indicates that implicit deregistration with forced registration may significantly reduce the deregistration traffic if the user mobility is high and the number of mobile phones in a registration area is not very large.     

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     

DiffServ resource allocation for fast handoff in wireless mobileInternet

The next-generation wireless networks are evolving toward a versatile IP-based network that can provide various real-time multimedia services to mobile users. Two major challenges in establishing such a wireless mobile Internet are support of fast handoff and provision of quality of service (QoS) over IP-based wireless access networks. In this article, a DiffServ resource allocation architecture is proposed for the evolving wireless mobile Internet. The registration-domain-based scheme supports fast handoff by significantly reducing mobility management signaling. The registration domain is integrated with the DiffServ mechanism and provisions QoS guarantee for each service class by domain-based admission control. Furthermore, an adaptive assured service is presented for the stream class of traffic, where resource allocation is adjusted according to the network condition in order to minimize handoff call dropping and new call blocking probabilities     

Dynamic scope location tracking algorithm for mobile PNNI scheme inwireless ATM networks

The authors propose an enhanced location tracking algorithm for the mobile PNNI scheme in wireless ATM networks. The main contribution is the use of the dynamic reachability scope depending on the mobile endpoint's movement rate and terminating call rate without any modifications to the mobile PNNI scheme. As a result, the proposed algorithm can reduce the location management cost compared with the original mobile PNNI scheme having a fixed scope value     

Mobility management in next-generation wireless systems

This paper describes current and proposed protocols for mobility management for public land mobile network (PLMN)-based networks, mobile Internet protocol (IP) wireless asynchronous transfer mode (ATM) and satellite networks. The integration of these networks will be discussed in the context of the next evolutionary step of wireless communication networks. First, a review is provided of location management algorithms for personal communication systems (PCS) implemented over a PLMN network. The latest protocol changes for location registration and handoff are investigated for mobile IP followed by a discussion of proposed protocols for wireless ATM and satellite networks. Finally, an outline of open problems to be addressed by the next generation of wireless network service is discussed     

Actual call connection time characterization for wireless mobile networks under a general channel allocation scheme

Actual call connection time (ACCT) is the total time that a mobile user engages in communications over a wireless network during a call connection. Due to limited network resources of wireless mobile networks, a call connection may be prematurely disconnected and the ACCT for the call in general may not be the same as the requested call connection time (RCCT). The ACCT depends not only on the RCCT, but also on the network resource allocation scheme and network traffic. We characterize the ACCT and related performance metrics for wireless mobile networks under a newly proposed general channel allocation scheme. This scheme generalizes the nonprioritized scheme, the reserved channel scheme, the queueing priority scheme and the subrating scheme in such a way as to reduce the blocking probability of the handoff calls while keeping the ACCT as long as possible. Explicit formulae for the distribution and the expectation of the ACCT are obtained. The call completion probability, the call drop probability, and the average actual call connection times for both the complete calls and the incomplete calls are derived. The results can form the basis for designing better billing rate schemes by differentiating incomplete calls and complete calls.     

A scalable multicast key management scheme for heterogeneous wireless networks

Secure multicast applications require key management that provides access control. In wireless networks, where the error rate is high and the bandwidth is limited, the design of key management schemes should place emphasis on reducing the communication burden associated with key updating. A communication-efficient class of key management schemes is those that employ a tree hierarchy. However, these tree-based key management schemes do not exploit issues related to the delivery of keying information that provide opportunities to further reduce the communication burden of rekeying. In this paper, we propose a method for designing multicast key management trees that match the network topology. The proposed key management scheme localizes the transmission of keying information and significantly reduces the communication burden of rekeying. Further, in mobile wireless applications, the issue of user handoff between base stations may cause user relocation on the key management tree. We address the problem of user handoff by proposing an efficient handoff scheme for our topology-matching key management trees. The proposed scheme also addresses the heterogeneity of the network. For multicast applications containing several thousands of users, simulations indicate a 55%-80% reduction in the communication cost compared to key trees that are independent of the network topology. Analysis and simulations also show that the communication cost of the proposed topology-matching key management tree scales better than topology-independent trees as the size of multicast group grows.     

Tracking Mobile Users with Uncertain Parameters

A method of reducing the wireless cost of tracking mobile users with uncertain parameters is developed in this paper. Such uncertainty arises naturally in wireless networks, since an efficient user tracking is based on a prediction of its future call and mobility parameters. The conventional approach based on dynamic tracking is not reliable in the sense that inaccurate prediction of the user mobility parameters may significantly reduce the tracking efficiency. Unfortunately, such uncertainty is unavoidable for mobile users, especially for a bursty mobility pattern. The two main contributions of this study are a novel method for topology-independent distance tracking, and a combination of a distance-based tracking with a distance-sensitive timer that guarantees both efficiency and robustness. The expected wireless cost of tracking under the proposed method is significantly reduced, in comparison to the existing methods currently used in cellular networks. Furthermore, as opposed to other tracking methods, the worst case tracking cost is bounded from above and governed by the system, such that it outperforms the existing methods. The proposed strategy can be easily implemented, and it does not require a significant computational power from the user.     

Location Management Strategies for Cellular Overlay Networks—A Signaling Cost Analysis

In a world driven by the accessibility of data for business, for communication and entertainment, but one populated by an increasingly nomadic society, it is no surprise that the appetite for wireless services continues to grow. The limitations of existing technologies however, particularly for wireless multi-casting and broadcasting, suggest that new approaches are needed to allow users to access services in the all wireless world. A popular approach for improving wireless services proposes to equip mobile terminals (MTs) with more than one radio interface to enable access to services in an always best connected paradigm. One such architecture envisages a co-operating overlay network, or inter-network, that comprises of a cellular telephony network and a digital broadcasting network. MTs in the inter-network have two corresponding radio interfaces and co-operation between the networks provide the user with seamless access to diverse services across the inter-worked platform. In this paper, we introduce novel location management proposals for co-operating overlay networks that incorporate a uni-directional broadcast overlay and provide a cost and latency analysis of the schemes. Our cost analysis demonstrates the soundness of the techniques and the value of the analyses as comparative evaluation tools. In particular, it is shown that there are a wide range of realistic operating conditions where the novel proposals presented here provide an optimum performance in cost terms.     

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     

A batch‐update strategy for the distributed HLRs architecture in PCS networks

Owing to the increasing population of mobile subscribers, the rapidly expanding signaling traffic has become a challenge to the mobility management in PCS networks. Multiple database schemes to reduce signal traffic and to solve the bottleneck problem of the single home location register (HLR) architecture have been proposed by many researchers. However, in most of the multiple location databases or HLR systems, extra signaling is required for the multiple database updates. We propose a batch‐update strategy, instead of the immediate update method, for the location‐tracking schemes with replication to reduce the signaling overhead. In this paper, we first introduce a distributed HLRs architecture in which each HLR is associated with a localized set of VLRs and the location registrations and queries are processed locally. Then we propose our batch‐update strategy and present two pointing schemes for inter‐HLR call deliveries. The numerical result shows that our approach can effectively decrease the signaling cost of location registration and call delivery compared with the IS‐41 standard. Copyright © 2002 John Wiley & Sons, Ltd.     

On optimum timer value of area and timer-based locationregistration scheme

In typical mobile communication systems, mobile station (MS) location information is updated when the MS crosses the location area boundary or the registration timer is expired. When a call attempt occurs, sequential paging rather than blanket paging is used to reduce the paging cost. We propose a new location update scheme in which to increase the paging accuracy, timer-based location update is performed within a location area. In this work, the optimum timer value of the area and timer-based location registration scheme with intelligent paging is derived. In case of a fixed location area, the optimum registration timer value depends on the speed and call arrival rate of the MS. If the speed or call arrival rate of the MS is high, location registration based on timer value should be performed frequently. Otherwise, location registration based on the crossing of location area is sufficient     

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.