메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
저널정보
대한전자공학회 텔레콤 텔레콤 제12권 제2호
발행연도
1996.12
수록면
33 - 44 (12page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
We investigate a topological design and routing problem for Low-Earth Orbit (LEO) satellite communication networks where each satellite can have a limited number of direct inter-satellite links (ISL's) to a subset of satellites within its line-of-sight. First, we model LEO satellite network as a FSA (Finite State Automaton) using satellite constellation information. Second, we solve a combined topological design and routing problem for each configuration corresponding to a state in the FSA. The topological design (or link assignment) problem deals with the selection of ISL's, and the routing problem handles the traffic distribution over the selected links to maximize the number of carried calls. I n this paper, this NP -complete mixed integer optimization problem is solved by a two-step heuristic algorithm that first solves the topological design problem, and then finds the optimal routing. The algorithm is iterated using the simulated annealing technique until the near-optimal solution is found. The link assignment table and the routing table that are pre-calculated off-line for each state are loaded into the satellites and a new set of these tables are retrieved at each state transition. The simulation result shows that the proposed method is applicable to practical LEO satellite networks.

목차

Abstract

Ⅰ. INTRODUCTION

Ⅱ. PROBLEM DEFINITION

Ⅲ. HEURISTIC APPROACH

Ⅳ. EXPERIMENTAL RESULTS

Ⅴ. CONCLUSION

REFERENCES

筆者紹介

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-569-014308740