Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Spectrum Bandit Optimization
KTH, School of Electrical Engineering (EES), Automatic Control.
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0002-1934-7421
2013 (English)In: 2013 IEEE Information Theory Workshop, ITW 2013, IEEE conference proceedings, 2013, 6691221- p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
Channel allocation, Finite time horizon, Integer linear programs, Interfering links, Network throughput, Optimal allocation, Stochastic settings, Sub-optimal allocations
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-138922DOI: 10.1109/ITW.2013.6691221ISI: 000330643200009Scopus ID: 2-s2.0-84893312376ISBN: 978-1-4799-1321-3 (print)OAI: oai:DiVA.org:kth-138922DiVA: diva2:681941
Conference
2013 IEEE Information Theory Workshop, ITW 2013; Seville; Spain; 9 September 2013 through 13 September 2013
Note

QC 20140107

Available from: 2013-12-20 Created: 2013-12-20 Last updated: 2014-03-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusIEEEXplore

Authority records BETA

Talebi Mazraeh Shahi, Mohammad Sadegh

Search in DiVA

By author/editor
Proutiere, AlexandreTalebi Mazraeh Shahi, Mohammad Sadegh
By organisation
Automatic Control
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf