scholarly journals Elimination of generalized ping-pong effects using triple-layers of location areas in cellular networks

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.

Author(s):  
Sanjay Kumar Biswash ◽  
Chiranjeev Kumar

In this paper, the authors have proposed a new prediction-based location management scheme for cellular networks. The current mobile switching centre predicts the previous mobile switching center of user, and then imports the data about the mobile terminal from that. For this purpose it uses a prediction table, which is based on the neighboring location areas. The analytical model and formulation presents the conceptual schema of proposed scheme. The performance comparisons and numerical analysis is helpful to find out the efficiency and effectiveness of the proposed system, with respect to existing location management techniques. It has been observed that, the registration cost, and the network overhead at mobile switching center have been reduced in the proposed prediction-based scheme.


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.


2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Yun Won Chung ◽  
Jae Kyun Kwon ◽  
Suwon Park

One of the key technologies to support mobility of mobile station (MS) in mobile communication systems is location management which consists of location update and paging. In this paper, an improved movement-based location management scheme with two movement thresholds is proposed, considering bursty data traffic characteristics of packet-switched (PS) services. The analytical modeling for location update and paging signaling loads of the proposed scheme is developed thoroughly and the performance of the proposed scheme is compared with that of the conventional scheme. We show that the proposed scheme outperforms the conventional scheme in terms of total signaling load with an appropriate selection of movement thresholds.


2011 ◽  
pp. 213-250
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.


2013 ◽  
Vol 57 (1) ◽  
pp. 1-11 ◽  
Author(s):  
Vijendra Singh Bhadauria ◽  
Sanjeev Sharma ◽  
Ravindra Patel

Sign in / Sign up

Export Citation Format

Share Document