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
Revisiting Minimum-Length Scheduling in Wireless Networks: An Algorithmic Framework
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. Department of Electrical and Computer Engineering, University of Maryland, USA.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
2012 (English)In: International Symposium on Information Theory and its Applications (ISITA), 2012, Piscataway, NJ, USA: IEEE , 2012, 506-510 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider the problem of constructing the minimum length schedule required to empty a wireless network with queues of given size. In a recent work we have provided new fundamental insights towards its structure and complexity. Motivated by the problem computational complexity, we demonstrate here how a one-size-fits-all optimal algorithm cannot be expected and introduce a framework that decomposes the problem in two core sub-problems: Selecting which subset of wireless links to activate and for how long. This modular approach enables the construction of algorithms that can yield solutions ranging from simple and intuitive to exact optimal. We provide a comprehensive set of design strategies and results to elucidate how different combinations within the framework modules can be used to approach optimality.

Place, publisher, year, edition, pages
Piscataway, NJ, USA: IEEE , 2012. 506-510 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-96522ISI: 000320850700106ISBN: 978-1-4673-2521-9 (print)OAI: oai:DiVA.org:liu-96522DiVA: diva2:642355
Conference
International Symposium on Information Theory and its Applications (ISITA),Honolulu, HI, USA, 28-31 Oct. 2012
Available from: 2013-08-21 Created: 2013-08-20 Last updated: 2014-04-11Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

He, QingAngelakis, VangelisEphremides, AnthonyYuan, Di

Search in DiVA

By author/editor
He, QingAngelakis, VangelisEphremides, AnthonyYuan, Di
By organisation
Communications and Transport SystemsThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

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