RISS 학술연구정보서비스

검색
다국어 입력

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

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

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      KCI등재

      통신위성 일정계획 문제의 다항시간 알고리즘

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

      다국어 초록 (Multilingual Abstract)

      This paper deals with the time slot assignment problem (TSAP) that a satellite switches to traffic between n ground stations using on-board switching modes in SS/TDMA time-division technology. For this problem, there is only in used the mathematical approach as linear programming (LP) because there has been unknown the polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. In this paper we suggest the heuristic algorithm with O (n²) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm sets the lower bound (LB) that is a maximum sum of traffic of rows or columns to makespan in n × n d<SUB>ij</SUB>∈D traffic matrix for n ground stations, and transforms the D matrix to D<SUB>LB</SUB>  traffic matrix that all rows and columns sum have LB. Secondly, we select the maximum traffic of row and column in D<SUB>LB</SUB> , then decides the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for all of experimental data.
      번역하기

      This paper deals with the time slot assignment problem (TSAP) that a satellite switches to traffic between n ground stations using on-board switching modes in SS/TDMA time-division technology. For this problem, there is only in used the mathematical a...

      This paper deals with the time slot assignment problem (TSAP) that a satellite switches to traffic between n ground stations using on-board switching modes in SS/TDMA time-division technology. For this problem, there is only in used the mathematical approach as linear programming (LP) because there has been unknown the polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. In this paper we suggest the heuristic algorithm with O (n²) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm sets the lower bound (LB) that is a maximum sum of traffic of rows or columns to makespan in n × n d<SUB>ij</SUB>∈D traffic matrix for n ground stations, and transforms the D matrix to D<SUB>LB</SUB>  traffic matrix that all rows and columns sum have LB. Secondly, we select the maximum traffic of row and column in D<SUB>LB</SUB> , then decides the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for all of experimental data.

      더보기

      참고문헌 (Reference)

      1 이상운, "동종처리기계의 총 작업소요시간 최소화 알고리즘" 한국정보기술학회 12 (12): 123-130, 2014

      2 M. Edvall, "Publicity Campaign" Tomlab Optimization Inc

      3 G. Maral, "Performance of Fully Variable Demand Assignment SS/TDMA Satellite Systems" 5 (5): 279-290, 1987

      4 J. P. Jue, "Optical networks" Kluwer Academic Publishers 99-122, 2001

      5 T. Gonzalez, "Open-Shop Scheduling to Minimize Finish Time" 23 (23): 665-679, 1976

      6 S. Martello, "Jenö Egerváry: From the Origins of the Hungarian Algorithm to Satellite Communication" 18 (18): 47-57, 2010

      7 K. L. Yeung, "Efficient Time Slot Assignment Algorithms for TDM Hierarchical and Nonhierarchical Switching Systems" 49 (49): 351-359, 2001

      8 D. L. Adamy, "EW 102: A Second Course in Electronic Warfare, Chapter 7: Communication Satellite Links" Horizon House Publications, Inc 2004

      9 C. Guéret, "Applications of Optimization with Xpress-MP: 12.5 Scheduling of Telecommunications via Satellite" Dash Optimization Ltd. 185-190, 2005

      10 X. Wan, "An Optimal Algorithm for Time-slot Assignment in SS/TDMA Satellite Systems" 1-6, 2013

      1 이상운, "동종처리기계의 총 작업소요시간 최소화 알고리즘" 한국정보기술학회 12 (12): 123-130, 2014

      2 M. Edvall, "Publicity Campaign" Tomlab Optimization Inc

      3 G. Maral, "Performance of Fully Variable Demand Assignment SS/TDMA Satellite Systems" 5 (5): 279-290, 1987

      4 J. P. Jue, "Optical networks" Kluwer Academic Publishers 99-122, 2001

      5 T. Gonzalez, "Open-Shop Scheduling to Minimize Finish Time" 23 (23): 665-679, 1976

      6 S. Martello, "Jenö Egerváry: From the Origins of the Hungarian Algorithm to Satellite Communication" 18 (18): 47-57, 2010

      7 K. L. Yeung, "Efficient Time Slot Assignment Algorithms for TDM Hierarchical and Nonhierarchical Switching Systems" 49 (49): 351-359, 2001

      8 D. L. Adamy, "EW 102: A Second Course in Electronic Warfare, Chapter 7: Communication Satellite Links" Horizon House Publications, Inc 2004

      9 C. Guéret, "Applications of Optimization with Xpress-MP: 12.5 Scheduling of Telecommunications via Satellite" Dash Optimization Ltd. 185-190, 2005

      10 X. Wan, "An Optimal Algorithm for Time-slot Assignment in SS/TDMA Satellite Systems" 1-6, 2013

      11 T. H. Lee, "An Integer Programming Approach to the Time Slot Assignment Problem in SS/TDMA Systems with Intersatellite Links" 135 (135): 57-66, 2001

      12 T. Inukai, "An Efficient SS/TDMA Time Slot Assignment Algorithm" COM-27 (COM-27): 1449-1455, 1979

      13 D. Werra, "A Note on SS/TDMA Satellite Communication" 135 : 69-77, 1990

      14 G. Rote, "A Heuristic for Decomposing Traffic Matrics in TDMA Satellite Communication" 38 (38): 281-307, 1993

      더보기

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

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

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

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

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2022 평가예정 재인증평가 신청대상 (재인증)
      2019-01-01 평가 등재학술지 유지 (계속평가) KCI등재
      2016-01-01 평가 등재학술지 유지 (계속평가) KCI등재
      2012-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2009-01-01 평가 등재학술지 선정 (등재후보2차) KCI등재
      2008-01-01 평가 등재후보 1차 PASS (등재후보1차) KCI등재후보
      2006-01-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.45 0.45 0.39
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.38 0.35 0.566 0.16
      더보기

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

      나만을 위한 추천자료

      해외이동버튼