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
Maximizing Minimum Throughput Guarantees: The Small Violation Probability Region
Interdisciplinary Center for Security, Trust and Reliability (SnT), University of Luxembourg, Luxembourg .
Interdisciplinary Center for Security, Trust and Reliability (SnT), University of Luxembourg, Luxembourg .
Interdisciplinary Center for Security, Trust and Reliability (SnT), University of Luxembourg, Luxembourg .ORCID iD: 0000-0003-2298-6774
2013 (English)In: Wireless Communications Letters, ISSN 2162-2337, Vol. 2, no 3, 271-274 p.Article in journal (Refereed) Published
Abstract [en]

Providing minimum throughput guarantees is one of the goals for radio resource allocation schemes. It is difficult to provide these guarantees without defining violation probability due to limited power budget and rapidly changing conditions of the wireless channel. For every practical scheduling scheme, there is a feasibility region defined by the minimum guaranteed throughput and the corresponding probability that the users fail to get the guaranteed throughput (violation probability). In this work, we focus on minimizing the violation probability specifically in the small probability region. We compare our results with major schedulers available in literature and show that our scheme outperforms them in the small violation probability region.

Place, publisher, year, edition, pages
2013. Vol. 2, no 3, 271-274 p.
Keyword [en]
diversity reception, multi-access systems, probability, resource allocation, scheduling, wireless channels, minimum throughput guarantees, multiuser diversity, power budget, radio resource allocation scheme, scheduling scheme, violation probability region, wireless channel, Ad hoc networks, Fading, Quality of service, Scheduling, Throughput, Time domain analysis, Wireless communication, Multiuser diversity, opportunistic scheduling, throughput guarantees, violation probability
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-136555DOI: 10.1109/WCL.2013.13.130077Scopus ID: 2-s2.0-84880062831OAI: oai:DiVA.org:kth-136555DiVA: diva2:676381
Note

QC 20140324

Available from: 2013-12-05 Created: 2013-12-05 Last updated: 2014-03-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Ottersten, Björn

Search in DiVA

By author/editor
Ottersten, Björn
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 30 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