Low-complexity, low-regret link rate selection in rapidly varying wireless channels

Link rate selection;Thompson sampling;Regret minimization;Computational complexity

Gupta, Harsh ; Srikant ; Rayadurgam

关键词: Link rate selection;    Thompson sampling;    Regret minimization;    Computational complexity;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/99200/GUPTA-THESIS-2017.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

We consider the problem of transmitting at the optimal rate over a rapidly varying wireless channel with unknown statistics when the feedback about channel quality is very limited. One motivation for this problem is that, in emerging wireless networks, the use of mmWave bands means that the channel quality can fluctuate rapidly and thus, one cannot rely on full channel-state feedback to make transmission rate decisions. Inspired by related problems in the context of multi-armed bandits, we consider a well-known algorithm called Thompson sampling to address this problem. However, unlike the traditional multi-armed bandit problem, a direct application of Thompson sampling results in a computational and storage complexity that grows exponentially with time. Therefore, we propose an algorithm called modified Thompson sampling (MTS), whose computational and storage complexity is simply linear in the number of channel states and which achieves at most logarithmic regret as a function of time when compared to an optimal algorithm which knows the probability distribution of the channel states.