Spectrum Bandit Optimization
2013 (English)In: 2013 IEEE Information Theory Workshop, ITW 2013, IEEE conference proceedings, 2013, 6691221- p.Conference paper (Refereed)
We consider the problem of allocating radio channels to links in a wireless network. Links interact through interference, modelled as a conflict graph (i.e., two interfering links cannot be simultaneously active on the same channel). We aim at identifying the channel allocation maximizing the total network throughput over a finite time horizon. Should we know the average radio conditions on each channel and on each link, an optimal allocation would be obtained by solving an Integer Linear Program (ILP). When radio conditions are unknown a priori, we look for a sequential channel allocation policy that converges to the optimal allocation while minimizing on the way the throughput loss or regret due to the need for exploring suboptimal allocations. We formulate this problem as a generic linear bandit problem, and analyze it in a stochastic setting where radio conditions are driven by a i.i.d. stochastic process, and in an adversarial setting where radio conditions can evolve arbitrarily. We provide, in both settings, algorithms whose regret upper bounds outperform those of existing algorithms.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 6691221- p.
Channel allocation, Finite time horizon, Integer linear programs, Interfering links, Network throughput, Optimal allocation, Stochastic settings, Sub-optimal allocations
IdentifiersURN: urn:nbn:se:kth:diva-138922DOI: 10.1109/ITW.2013.6691221ISI: 000330643200009ScopusID: 2-s2.0-84893312376ISBN: 978-1-4799-1321-3OAI: oai:DiVA.org:kth-138922DiVA: diva2:681941
2013 IEEE Information Theory Workshop, ITW 2013; Seville; Spain; 9 September 2013 through 13 September 2013
QC 201401072013-12-202013-12-202014-03-26Bibliographically approved