New Location Management for Reducing HLR Overhead Traffic in Mobile Networks

Author(s):  
Dong Chun Lee ◽  
Hyun Cheul Shin ◽  
Jeom Goo Kim
2009 ◽  
pp. 650-681
Author(s):  
Samuel Pierre

This chapter analyzes and proposes some mobility management models and schemes by taking into account their capability to reduce search and location update costs in wireless mobile networks. The first model proposed is called the built-in memory model; it is based on the architecture of the IS-41 network and aims at reducing the home-location-register (HLR) access overhead. The performance of this model was investigated by comparing it with the IS-41 scheme for different call-to-mobility ratios (CMRs). Experimental results indicate that the proposed model is potentially beneficial for large classes of users and can yield substantial reductions in total user-location management costs, particularly for users who have a low CMR. These results also show that the cost reduction obtained on the location update is very significant while the extra costs paid to locate a mobile unit simply amount to the costs of crossing a single pointer between two location areas. The built-in memory model is also compared with the forwarding pointers’ scheme. The results show that this model consistently outperforms the forwarding pointers’ strategy. A second location management model to manage mobility in wireless communications systems is also proposed. The results show that significant cost savings can be obtained compared with the IS-41 standard location-management scheme depending on the value of the mobile units’ CMR.


2011 ◽  
Vol 22 (03) ◽  
pp. 519-546 ◽  
Author(s):  
JAVID TAHERI ◽  
ALBERT Y. ZOMAYA

This work reviews a number of algorithms to solve the location management problem in mobile networks for both static and dynamic scenarios. In the static mode, results of five algorithms are used to highlight the pros and cons for each algorithm. These results provide new insight into the mobility management problem that can influence the design of future wireless networks. In the dynamic mode in which mobile users' past movement patterns are used in making future paging decisions by the network, the performance of an online location management algorithm is examined under different deployment setups. Performance results of this algorithm show its advantages over the currently implemented and/or proposed static location management systems (including GSM).


2008 ◽  
Vol 5 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Guangbin Fan ◽  
Ivan Stojmenovic ◽  
Jingyuan Zhang

Location-areas is a popular location management scheme in cellular networks In the location areas scheme, a service area is partitioned into location areas, each consisting of contiguous cells. A mobile terminal updates its location whenever it moves into a cell that belongs to a new location area. However, no matter how the location areas are designed, the ping-pong location update effect exists when a mobile terminal moves back and forth between two location areas. The paper defines a new kind of ping-pong effect referred to as the generalized ping-pong effect, and shows that it accounts for a nonnegligible portion of the total location update cost. Although several strategies have been proposed to reduce the ping-pong effect in the literature, they either eliminate no generalized ping-pong effect or introduce a larger paging cost. This paper proposes a triple-layer location management strategy to eliminate the generalized ping-pong effect, therefore greatly reducing the total location update cost. Simulation results show that the triple-layer strategy outperforms the existing schemes designed to reduce the ping-pong effect.


Sign in / Sign up

Export Citation Format

Share Document