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
Optimal distributed scheduling in wireless networks under SINR interference model
KTH, School of Electrical Engineering (EES), Automatic Control.
2013 (English)In: 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, IEEE conference proceedings, 2013, 1372-1379 p.Conference paper, Published paper (Refereed)
Abstract [en]

Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper [1], Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes [2] have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference can be accurately modelled by a simple interference graph. In this paper, we consider the more realistic and challenging SINR interference model. We present the first distributed scheduling algorithms that (i) are optimal under the SINR interference model, and (ii) that do not require any message passing. They are based on a combination of a simple and efficient power allocation strategy referred to as Power Packing and randomization techniques. These algorithms are rate-optimal in the sense that they perform as well as the best centralized scheduling schemes in scenarios where each transmitter is aware of the rate at which it should send packets to the corresponding receiver. As shown in [3], rate-optimal algorithms can be extended easily so that they reach throughput-optimality.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 1372-1379 p.
Keyword [en]
Centralized scheduling, Distributed implementation, Distributed scheduling, Distributed scheduling algorithms, Interference graphs, Interference modeling, Randomization techniques, Scheduling schemes, Communication, Real time systems, Scheduling, Scheduling algorithms, Transmitters, Wireless networks, Optimization
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-147472DOI: 10.1109/Allerton.2013.6736687ISI: 000350802400191Scopus ID: 2-s2.0-84897712506ISBN: 978-147993409-6 (print)OAI: oai:DiVA.org:kth-147472DiVA: diva2:730293
Conference
51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, 2 October 2013 through 4 October 2013, Monticello, IL, United States
Note

QC 20140627

Available from: 2014-06-27 Created: 2014-06-27 Last updated: 2015-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Proutière, Alexandre
By organisation
Automatic Control
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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