An Efficient Paging Strategy Based on Paging Agents of Base Stations in Cellular Mobile Networks

  • Received : 2002.10.17
  • Published : 2003.02.28

Abstract

We propose a new paging strategy to reduce paging cost by adding paging agents at base stations. When a mobile-terminated call occurs, the base stations look up the paging agents to determine if terminal paging is actually to be made. An analytical model based on a Markov chain is used to evaluate the performance of the proposed strategy. The numerical results show that the proposed strategy significantly reduces the paging cost compared with the simultaneous paging strategy.

Keywords

References

  1. IEEE Trans. Veh. Technol. v.44 no.8 A New Distributed Location Management Algorithm for Broadband Personal Communication Networks Kim, B.C.;Choi, J.S.;Un, C.K.
  2. ETRI J. v.24 no.1 An Efficient Fault Tolerance Protocol with Backup Foreign Agents in a Hierarchical Local Registration Mobile IP Hong, C.S.;Yim, K.W.;Lee, D.Y.;Yun, D.S.
  3. IEEE Trans. Veh. Technol. v.48 no.1 State-Based Paging/Registration: a Greedy Technique Rose, C.
  4. ACM-Baltzer J. Wireless Networks v.5 no.4 Cost Reduction in Location Management Using Semi-Realtime Movement Information Wan, G.;Lin, E.
  5. IEEE Commun. Lett. v.6 no.8 An Intra-LA Location Update Strategy for Reducing Paging Cost Mao, Z.
  6. Queueing Systems Volume 1: Theory Kleinrock, L.