2026-09-20T08:49:04Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/99200 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Srikant, Rayadurgam Gupta, Harsh 2018-03-13T15:21:07Z 2018-03-13T15:21:07Z 2020-03-14T09:15:08Z 2017-11-10 2017-12 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. Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-12-01 The student, Harsh Gupta, accepted the attached license on 2017-11-10 at 13:35. The student, Harsh Gupta, submitted this Thesis for approval on 2017-11-10 at 13:38. This Thesis was approved for publication on 2017-11-10 at 14:37. DSpace SAF Submission Ingestion Package generated from Vireo submission #11731 on 2018-03-13 at 09:55:44 Made available in DSpace on 2018-03-13T15:21:07Z (GMT). No. of bitstreams: 2 GUPTA-THESIS-2017.pdf: 537746 bytes, checksum: 4ccb993d6ef1edf24b636d8b87de5e85 (MD5) LICENSE.txt: 4208 bytes, checksum: 8f78f5b5a8a6494d8be414226238774c (MD5) Previous issue date: 2017-11-10 Embargo set by: Seth Robbins for item 105162 Lift date: 2020-03-13T15:21:19Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system Embargo set by: Seth Robbins for item 105162 Lift date: 2020-03-13T15:25:40Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system Embargo set by: Seth Robbins for item 105162 Lift date: 2020-03-13T15:28:52Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system U of I Only Restriction Lifted for Item 105162 on 2020-03-14T09:15:08Z. application/pdf http://hdl.handle.net/2142/99200 en Copyright 2017 Harsh Gupta Link rate selection Thompson sampling Regret minimization Computational complexity Low-complexity, low-regret link rate selection in rapidly varying wireless channels text text Electrical & Computer Eng Electrical & Computer Engr University of Illinois at Urbana-Champaign Thesis M.S.