liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
On Emptying a Wireless Network in Minimum Time
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
2012 (English)In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), Piscataway, NJ, USA: IEEE , 2012, 2671-2675 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider N transmitter-receiver pairs that share a wireless channel and we address the problem of obtaining a schedule for activating subsets of these links so as to empty the transmitter queues in minimum time. Our aim is to provide theoretical insights for the optimality characterization of the problem, using both a cross-layer model formulation, which takes into account the effect of interference on achievable transmission rates, as well as a collision-based model, which does not incorporate the physical layer realities into the problem. We present the basic linear programming formulation of the problem and establish that the optimal schedule need not consist of more than N subset activation frames. We then prove that the problem is NP-hard for all reasonable continuous rate functions. Finally, we obtain sufficient and/or necessary conditions for optimality in a number of special cases.

Place, publisher, year, edition, pages
Piscataway, NJ, USA: IEEE , 2012. 2671-2675 p.
Series
IEEE International Symposium on Information Theory. Proceedings, ISSN 2157-8095
Keyword [en]
interference; optimality; scheduling; wireless networks
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-96567DOI: 10.1109/ISIT.2012.6284004ISI: 000312544302154ISBN: 978-1-4673-2580-6 (print)ISBN: 978-1-4673-2578-3 (print)OAI: oai:DiVA.org:liu-96567DiVA: diva2:642260
Conference
IEEE International Symposium on Information Theory Proceedings (ISIT), Cambridge, MA, USA, 1-6 July 2012
Available from: 2013-08-21 Created: 2013-08-20 Last updated: 2014-04-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Angelakis, VangelisEphremides, AnthonyHe, QingYuan, Di

Search in DiVA

By author/editor
Angelakis, VangelisEphremides, AnthonyHe, QingYuan, Di
By organisation
Communications and Transport SystemsThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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