메뉴 건너뛰기




Volumn 26, Issue 5, 2004, Pages 493-496

An efficient two-step paging strategy using base station paging agents in mobile communication networks

Author keywords

Base station paging agent; Paging agent; Two step paging

Indexed keywords

APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); LOCAL AREA NETWORKS; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; PROBABILITY DENSITY FUNCTION; RADIO COMMUNICATION;

EID: 6344231922     PISSN: 12256463     EISSN: None     Source Type: Journal    
DOI: 10.4218/etrij.04.0204.0005     Document Type: Conference Paper
Times cited : (6)

References (8)
  • 1
    • 0346885747 scopus 로고    scopus 로고
    • Modeling and analysis of distance-based registration with implicit registration
    • Dec.
    • J.H. Baek and B.H. Ryu, "Modeling and Analysis of Distance-Based Registration with Implicit Registration," ETRI J., vol. 25, no. 6, Dec. 2003, pp. 527-530.
    • (2003) ETRI J. , vol.25 , Issue.6 , pp. 527-530
    • Baek, J.H.1    Ryu, B.H.2
  • 2
    • 0342741617 scopus 로고
    • Paging cost minimization under delay constraints
    • July
    • C. Rose and R. Yates, "Paging Cost Minimization under Delay Constraints," ACM-Baltzer J. Wireless Networks, vol. 1, no. 4, July 1995, pp. 211-220.
    • (1995) ACM-baltzer J. Wireless Networks , vol.1 , Issue.4 , pp. 211-220
    • Rose, C.1    Yates, R.2
  • 3
    • 0742290173 scopus 로고    scopus 로고
    • A novel sectional paging strategy for location tracking in cellular networks
    • Jan.
    • T. Tung and A. Jamalipour, "A Novel Sectional Paging Strategy for Location Tracking in Cellular Networks," IEEE Commun. Lett., Jan. 2004, vol. 8, pp. 24-26.
    • (2004) IEEE Commun. Lett. , vol.8 , pp. 24-26
    • Tung, T.1    Jamalipour, A.2
  • 4
    • 0041887130 scopus 로고    scopus 로고
    • A parallel shuffled paging strategy under delay bounds in wireless systems
    • Aug.
    • Yang Xiao, "A Parallel Shuffled Paging Strategy under Delay Bounds in Wireless Systems," IEEE Commun. Lett., vol. 7, issue. 8, Aug. 2003, pp. 367-369.
    • (2003) IEEE Commun. Lett. , vol.7 , Issue.8 , pp. 367-369
    • Xiao, Y.1
  • 5
    • 0042216928 scopus 로고    scopus 로고
    • Reducing location update and paging costs in a pcs network
    • Jan.
    • P.G. Escalle, V.C. Giner, and J.M. Oltra, "Reducing Location Update and Paging Costs in a PCS Network," IEEE Trans. Wireless Communications, vol. 1, no. 1, Jan. 2002, pp. 200-209.
    • (2002) IEEE Trans. Wireless Communications , vol.1 , Issue.1 , pp. 200-209
    • Escalle, P.G.1    Giner, V.C.2    Oltra, J.M.3
  • 6
    • 0042889273 scopus 로고    scopus 로고
    • A dynamic anchor-cell assisted paging with an optimal timer for PCS networks
    • Aug.
    • Yang Xiao, "A Dynamic Anchor-Cell Assisted Paging with an Optimal Timer for PCS Networks," IEEE Commun. Lett., vol. 7, issue. 8, Aug. 2003, pp. 358-360.
    • (2003) IEEE Commun. Lett. , vol.7 , Issue.8 , pp. 358-360
    • Xiao, Y.1
  • 7
    • 0037327315 scopus 로고    scopus 로고
    • An efficient paging strategy based on paging agents of base stations in cellular mobile networks
    • Feb.
    • B. Suh, J.S. Choi, and S.-i. Choi, "An Efficient Paging Strategy Based on Paging Agents of Base Stations in Cellular Mobile Networks," ETRI J., vol. 25, no. 1, Feb. 2003, pp. 55-58.
    • (2003) ETRI J. , vol.25 , Issue.1 , pp. 55-58
    • Suh, B.1    Choi, J.S.2    Choi, S.-I.3
  • 8
    • 0031075907 scopus 로고    scopus 로고
    • Reducing location update cost in a PCS network
    • Feb.
    • Y.B. Lin, "Reducing Location Update Cost in a PCS Network," IEEE/ACM Trans. Networking, vol. 5, Feb. 1997, pp. 25-33.
    • (1997) IEEE/ACM Trans. Networking , vol.5 , pp. 25-33
    • Lin, Y.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.