RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    차세대 이동통신에서의 지연을 고려한 순차적 페이징 = Sequential Paging under Delay Boundfor Next Generation Mobile Systems

    한글로보기

    https://www.riss.kr/link?id=A104963580

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    To reduce the signaling cost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems.
    The effectiveness of the proposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.
    번역하기

    To reduce the signaling cost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition ...

    To reduce the signaling cost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems.
    The effectiveness of the proposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.

    더보기

    참고문헌 (Reference)

    1 "Paging strategy in personal communication systems ACM-Baltzer" 3 : 195-204, 1997

    2 "On the Performance of Sequential Paging for Mobile User Location" fall2001.

    3 "Movement-Based Location Update and Selective Paging for wireless Networks" 4 : 629-638, 1996

    4 "Mobility Management in Next-Generation Wireless Systems" 87 : 1347-1348, 1999

    5 "Mobile Users:To Update or not to Update" bar- (bar-): 570-576, 1994

    6 "Mobile Location Tracking by Optimal Paging Zone Partitioning" 1 : 168-172, 1997

    7 "Minimizing the Average Cost of Paging Under Delay Constraints ACM-Baltzer" 1 : 211-219, 1995

    8 "Minimization Queueing Delays and Number of Messages in Mobile Phone Location" 1 (1): 39-48, 1996

    9 "Location Management for Next-Generation Personal Communications Networks" 14 : 18-24, 2000

    10 "Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems" 7 : 455-466, 2001

    1 "Paging strategy in personal communication systems ACM-Baltzer" 3 : 195-204, 1997

    2 "On the Performance of Sequential Paging for Mobile User Location" fall2001.

    3 "Movement-Based Location Update and Selective Paging for wireless Networks" 4 : 629-638, 1996

    4 "Mobility Management in Next-Generation Wireless Systems" 87 : 1347-1348, 1999

    5 "Mobile Users:To Update or not to Update" bar- (bar-): 570-576, 1994

    6 "Mobile Location Tracking by Optimal Paging Zone Partitioning" 1 : 168-172, 1997

    7 "Minimizing the Average Cost of Paging Under Delay Constraints ACM-Baltzer" 1 : 211-219, 1995

    8 "Minimization Queueing Delays and Number of Messages in Mobile Phone Location" 1 (1): 39-48, 1996

    9 "Location Management for Next-Generation Personal Communications Networks" 14 : 18-24, 2000

    10 "Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems" 7 : 455-466, 2001

    11 "An Optimal Paging Scheme for Minimizing Signaling Costs Under Delay Bounds" 5 (5): 43-45, 2001

    12 "Adaptive Paging Algorithms for Cellular Systems" 83-101, 1996

    더보기

    동일학술지(권/호) 다른 논문

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2027 평가 재인증평가 신청대상 (재인증)
    2021-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2018-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2015-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2011-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2009-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2007-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2005-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2002-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    1999-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.59 0.59 0.62
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.63 0.63 0.998 0.07
    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼