Reinforcement Learning-Based Resource Allocation for Streaming in a Multi-Modal Deep Space Network
- Authors
- Ha, Taeyun; Oh, Junsuk; Lee, Donghyun; Lee, Jeonghwa; Jeon, Yongin; Cho, Sungrae
- Issue Date
- Dec-2021
- Publisher
- IEEE Computer Society
- Keywords
- Channel Coding; Deep Q-learning Network; Deep Space; Scalable Video Coding
- Citation
- International Conference on ICT Convergence, v.2021, no.October , pp 201 - 206
- Pages
- 6
- Journal Title
- International Conference on ICT Convergence
- Volume
- 2021
- Number
- October
- Start Page
- 201
- End Page
- 206
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/54912
- DOI
- 10.1109/ICTC52510.2021.9621165
- ISSN
- 2162-1233
- Abstract
- With the development of 5G communication, users' data requirements are increasing rapidly, and the requirements for real-time data communication are increasing. These requirements were embodied as streaming services. This requirement can also be applied in deep space environments, where space communication, which is a relatively constrained environment, places importance on recovering the error rate. Typical channel coding techniques include turbo code, which is used to reduce Bit Error Rate. Taking this into account, this paper constructs deep space virtual environments, and applies various turbo-coding-based modulations for each link. In addition, streaming services use Scalable Video Coding to provide smoother streaming services. In this paper, we propose an algorithm that measures complexity and BER according to various modulation techniques of turbo codes to verify trade-off relationships and to assign data to appropriate links by learning them with Deep Q-learning Network. © 2021 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/54912)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.