Reducing Paging Cost in Route-based Group Registration
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this study, a route-based group location registration (RGR) scheme is considered toreduce location registration and paging costs when there are many mobile stations (MSs) in atransportation system (TS) such as bus and train routes. In addition to adopting the existing grouplocation tracking (GLT) scheme, the RGR scheme tries to minimize the total signaling cost byusing the mobility characteristics of the TS whereby vehicles move along a specified route fromthe point of departure to the destination. In this study, we propose a 2-step paging (2SP) schemebased on an estimation of the location of the vehicles of a TS to reduce the paging cost of theRGR scheme. In this 2SP scheme, when an incoming call occurs, the first paging area isdetermined in accordance with an estimation of the location of the TS vehicle using the timefrom location registration to call occurrence. Since the moving speed of the TS vehicle is almostconstant, the probability that the first paging will succeed is very high, which reduces the pagingcost by roughly half. Numerical results show that the larger the route threshold K in the RGRscheme, the larger the reduction in total cost because of the 2SP effect. As a result, it can beseen that 2SP increases the optimal K, which minimizes the total cost compared withsimultaneous paging. The results of this study can be used for mobility management research ofmobile networks as well as for performance analysis of mobility management schemes.
Abstract
In this study, a route-based group location registration (RGR) scheme is considered toreduce location registration and paging costs when there are many mobile stations (MSs) in atransportation system (TS) such as bus and train routes. In addition to adopting the existing grouplocation tracking (GLT) scheme, the RGR scheme tries to minimize the total signaling cost byusing the mobility characteristics of the TS whereby vehicles move along a specified route fromthe point of departure to the destination. In this study, we propose a 2-step paging (2SP) schemebased on an estimation of the location of the vehicles of a TS to reduce the paging cost of theRGR scheme. In this 2SP scheme, when an incoming call occurs, the first paging area isdetermined in accordance with an estimation of the location of the TS vehicle using the timefrom location registration to call occurrence. Since the moving speed of the TS vehicle is almostconstant, the probability that the first paging will succeed is very high, which reduces the pagingcost by roughly half. Numerical results show that the larger the route threshold K in the RGRscheme, the larger the reduction in total cost because of the 2SP effect. As a result, it can beseen that 2SP increases the optimal K, which minimizes the total cost compared withsimultaneous paging. The results of this study can be used for mobility management research ofmobile networks as well as for performance analysis of mobility management schemes.
참고문헌 (17)
- Jung, J., , Appl. Sci., 10, pp.5705~ (2020)
- Lin, Y. B., , IEEE, 1997, pp.5(1), 25~33
- Ryu, B. H., , IEICE Trans. Commun., E86-B(3), pp.1177~1180 (2003)
- Baek, J. H., , IEICE Trans. Commun., E83-B(3), pp.1509~1516 (2000)
- Rodriguez-Dagnino, R. M., , IEEE Trans. Veh. Technol, 56, pp.2713~2722 (2007)
- Li, J., , IEEE, 2000, pp.8(3), 319~327
- Mao, Z., , Comput. Commun., 23, pp.1729~1739 (2000)
- JangHyunBaek, "Modeling and Analysis of Distance-Based Registration with Implicit Registration", ETRI Journal, 25(6), pp.527~530 (2003), 한국전자통신연구원
- 장희선, "Performance Analysis of Distance-based Registration with 4-Directional Mobility Model", 공학기술논문지, 12(2), pp.85~90 (2019), 공학기술연구원[DOI]
- Chung, Y. W., , IEICE Trans. Commun., E88-B(6), pp.2650~2653 (2005)
- Hwang. H. W., , IEEE Commun. Lett., 4(5), pp.149~151 (2000)
- 서재준, "이동통신 네트워크에서 방향 기준 위치등록과 라인 페이징의 정확한 모델링 및 성능 분석", 공학기술논문지, 13(2), pp.59~65 (2020), 공학기술연구원[DOI]
- Han, I., , IEEE Commun. Lett., 5(8), pp.349~351 (2001)
- Seo, J. Y., , IE Interfaces, 22(2), pp.85~91 (2009)
- T., Zagdsuren, , Proc. of 6th ICCIP (2020)
- Baek, J. H., , IEICE trans. commun., E93-B(5), pp.1306~1309 (2010)
- Ross, S., "Stochastic Processes" (1996), Wiley