Author:
Chen Chao,Wu Zhengyang,Yu Xiaohan,Ma Bo,Li Chuanhuang
Abstract
AbstractWe consider a fundamental file dissemination problem in a two-hop relay-based heterogeneous network consisting of a macro base station, a half-duplex relay station, and multiple users. To minimize the dissemination delay, rateless code is employed at the base station. Our goal is to find an efficient channel-aware scheduling policy at the half-duplex relay station, i.e., either fetch a packet from the base station or broadcast a packet to the users at each time slot, such that the file dissemination delay is minimized. We formulate the scheduling problem as a Markov decision process and propose an intelligent deep reinforcement learning-based scheduling algorithm. We also extend the proposed algorithm to adapt to dynamic network conditions. Simulation results demonstrate that the proposed algorithm performs very close to a lower bound on the dissemination delay and significantly outperforms baseline schemes.
Funder
National Natural Science Foundation of China
Zhejiang Provincial Natural Science Foundation of China
Fundamental Research Funds for the Provincial Universities of Zhejiang
Zhejiang Provincial Key Laboratory of New Network Standards and Technologies
Zhejiang Gongshang University "Digital+" Disciplinary Construction Management
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Signal Processing