Efficient and flexible location management techniques for wireless communication systems (original) (raw)

On location management for personal communications networks

IEEE Communications Magazine, 1996

Personal communications services (PCS) support mobile terminals (MTs) which are free to travel within the service coverage area In order to effectively locate a n MT when a called is initiated, location management schemes are used to keep track of the locations of the MTs. The current approach to location management requires each MT to report its location to the network periodically The location information is then stored in databases. When a call is initiated, the network determines the current location of the called MT through a database lookup and paging procedure In this article, a currently available standard for location management is described. Recent research results on location management are surveyed in detail

Adaptive, distributed location management in mobile, wireless networks

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004

Location management refers to the problem of updating and searching the current locations of multiple mobile nodes in a wireless network. To make location management efficient, the sum of update and lookup costs of the location database must be minimized. We hypothesize that previously proposed location management techniques rely on fixed location databases, and are therefore unable to fully exploit the knowledge of user mobility patterns in the system so as to achieve this minimization.

Location management for next-generation personal communications networks

IEEE Network, 2000

ver the past few years, there has been tremendous growth in wireless communications. Personal communications service (PCS) subscribers are increasing at an exponential rate and will continue to increase in the near future. The next-generation personal communications network (PCN) is being standardized as part of the International Mobile Telecommunications 2000 (IMT-2000) system [1], whose goal is to unify many diverse systems existing today (including PCS, two-way paging, mobile satellite, etc.) into a seamless radio infrastructure capable of offering a wide range of services.

A simple analytical framework for location management in personal communication systems

1998

Abstract Efficient mobility management for portable stations (PS's)-handoff, channel assignment and locating-will play an important role in future personal communication systems (PCS's). Among these tasks, location management plays a critical role for wide-area roaming. The key elements of locating are location registration/updating and paging. Due to the smaller cell size in PCS, the high boundary crossing rate of PS will result in more frequent location area (LA) updating.

Location management framework for next generation wireless systems

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004

Overlapping coverage areas of the systems in next generation networks cause high signaling overhead if the users are tracked in multiple systems independently. Selecting the system over which paging will be done is yet another problem. In this paper, we present a general next generation wireless network architecture and propose a location registration scheme that updates the location information only in the relevant subsystems. We also propose an efficient paging scheme that exploits the location information in multiple subsystems. User preferences, network availability, and connection history are considered while determining the subsystems to be used for location registration and paging. 1

From location to position management: User tracking for location-based services

Kommunikation in Verteilten …, 2005

This paper compares traditional location management, which focuses on tracking mobile subscribers in the topology of a cellular network, with position management, which we define to be a set of functions for tracking mobile targets in terms of geographic positions as needed for LBSs. As the air interface is the most limited resource in a mobile network, location management has been optimized with regard to signaling overhead caused by updating location data (and paging) between the terminal and the network. Position management is exposed to the same limitations, but, on the other hand, imposes much stronger requirements with regard to accuracy of position data as well as flexibility of tracking. This paper presents an architecture for for tailoring the tracking process according to the special LBS requirements on the one hand, and limiting the resulting update traffic at the air interface on the other. The architecture is shared between mobile terminals and an application server, for which we present first details of our implementation.

A Comparative Study on Distributed Location Management Strategies in Wireless Networks

Personal Wireless Communications, 2000

Location management is an essential process in future mobile communication networks. An important issue is an efficient management of the location database. In this paper, the next generation mobile communication networks are proposed to integrate with a TINA-compliant architecture enabling to handle that kind of mobile-specific processes. We consider a distributed location database architecture for location management performing the following strategies: HI.D (home location database only), HLD-VLD (HLD with a visited location database), or VLD-CLD (HLD and VLD with a cache location database). TIris paper discusses design, modelling and the comparison of the mentioned distributed location management strategies. The performance measures used for comparison are communication cost (signalling messages), computational cost (database accesses) and average total cost. For the performance analysis, we assume that the cost of updating a cache pointer and a user profile at CLDIVLD is equal. Results show that the combination of replication with caching scheme (VLD-CLD) performs better than the replication scheme (HLD-VLD) for a very wide range of call-to-mobility ratio (CMR).

A Cost Efficient Location Management Technique for Mobile Users with Frequently Visited Locations

4th Annual Communication Networks and Services Research Conference (CNSR'06), 2006

Unfortunately, current standards of location management schemes, such as GSM and IS-41, behave inefficiently for mobile terminals moving between the same set of areas, or users tending to call and move in a fixed pattern. This is in turn results in a high location management cost. Several approaches have been proposed to tackle with this problem. One of the most efficient techniques is to replicate user profile according to the most frequently visited location areas. In this paper, we propose a new location management scheme based on replicated databases utilizing mobile stations to capture frequently visited location areas. We compare the performance of our scheme with that of GSM and other replicated databases location management schemes in respect of communication cost, database cost, and total cost. Simulation results show that the proposed scheme performs better than other schemes.

A dynamic individualized location management algorithm

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 1997

The challenge of supporting rapidly growing numbers of mobile subscribers, while constrained by limited radio spectrum, is being met through increasingly smaller radio cells. This, however, results in increased signalling for location management procedures, which reduces the bandwidth available for user traffic. Location areas in current systems, such as GSM, consist of static and arbitrarily-defined collections of cells, which do

An efficient hierarchical scheme for locating highly mobile users

1998

To accommodate the increase in user population in future personal communication systems, hierarchical architectures of location databases have been proposed. In this paper, a scheme based on forwarding pointers is presented, that reduces the cost of the overall network and database tra c generated by frequent location updates in such hierarchical architectures. To reduce the number of forwarding pointers that need to be traversed to locate a user, auxiliary caching techniques are presented. Various conditions for purging the chain of forwarding pointers and updating the database are also introduced. Special care is given so that the scheme correctly supports the concurrent execution of updates and lookups. The applicability of the scheme and the performance of the caching techniques are demonstrated through a number of experiments for a range of call to mobility ratios and for a variety of moving and calling behaviors.