TY - GEN
T1 - Optimal Mobile Relay Beamforming Via Reinforcement Learning
AU - Diamantaras, Konstantinos
AU - Petropulu, Athina
N1 - Publisher Copyright: © 2019 IEEE.
PY - 2019/10
Y1 - 2019/10
N2 - We consider the communication of a source-destination pair in a dynamic flat fading channel environment. The communication is aided by mobile relays, which beamform the source signal to the destination. The beamforming weights and the relay positions are optimally selected so that the average Signal-to-Interference and Noise ratio (SINR) at the destination is maximized subject to total relay power constraints. We assume a time slotted system, and model the channels as random fields with a deterministic path loss component with unknown exponent, and random log-normal shadowing and multipath fading components with unknown model parameters. In the beginning of each slot, the relays optimally beamform based on source and destination channel estimates obtained up to their current positions and current time. Then, for the remainder of the slot, the relays optimally select their positions for the next slot beamforming. The relay positions are computed using a reinforcement learning approach, which recursively estimates the channel map in time and space.
AB - We consider the communication of a source-destination pair in a dynamic flat fading channel environment. The communication is aided by mobile relays, which beamform the source signal to the destination. The beamforming weights and the relay positions are optimally selected so that the average Signal-to-Interference and Noise ratio (SINR) at the destination is maximized subject to total relay power constraints. We assume a time slotted system, and model the channels as random fields with a deterministic path loss component with unknown exponent, and random log-normal shadowing and multipath fading components with unknown model parameters. In the beginning of each slot, the relays optimally beamform based on source and destination channel estimates obtained up to their current positions and current time. Then, for the remainder of the slot, the relays optimally select their positions for the next slot beamforming. The relay positions are computed using a reinforcement learning approach, which recursively estimates the channel map in time and space.
KW - Beamforming
KW - Mobile relay network
KW - Multi-armed bandits
KW - Reinforcement Learning
UR - https://www.scopus.com/pages/publications/85077714910
UR - https://www.scopus.com/pages/publications/85077714910#tab=citedBy
U2 - 10.1109/MLSP.2019.8918745
DO - 10.1109/MLSP.2019.8918745
M3 - Conference contribution
T3 - IEEE International Workshop on Machine Learning for Signal Processing, MLSP
BT - 2019 IEEE 29th International Workshop on Machine Learning for Signal Processing, MLSP 2019
PB - IEEE Computer Society
T2 - 29th IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2019
Y2 - 13 October 2019 through 16 October 2019
ER -