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 Optimal Link Scheduling with Deadlines for Emptying a Wireless Network
Linköping University, Department of Science and Technology. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-6213-8561
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Univ Maryland, MD 20742 USA.
2017 (English)In: 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), IEEE , 2017, p. 461-465Conference paper, Published paper (Refereed)
Abstract [en]

We consider link scheduling in wireless networks for emptying the queues at the transmitters in minimum time, with time constraints, or deadlines, for one or multiple individual links. We formulate the minimum-time scheduling problem with deadlines (MTSD) mathematically and derive the optimal activation order of the link sets in a schedule solution. Theoretical results are obtained, showing that the MTSD can be treated as the conventional minimum-time scheduling problem by "absorbing" the deadline constraints into the rate region where the scheduling problem is defined. By this approach, optimality characterization and geometric interpretation for the MTSD are provided. Furthermore, we extend the results to the MTSD in a general form that accommodates an arbitrary rate region.

Place, publisher, year, edition, pages
IEEE , 2017. p. 461-465
Series
IEEE International Symposium on Information Theory, ISSN 2157-8117
Keywords [en]
optimality; scheduling; wireless networks
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-148171DOI: 10.1109/ISIT.2017.8006570ISI: 000430345200093ISBN: 978-1-5090-4096-4 (print)OAI: oai:DiVA.org:liu-148171DiVA, id: diva2:1212193
Conference
IEEE International Symposium on Information Theory (ISIT)
Available from: 2018-06-01 Created: 2018-06-01 Last updated: 2019-07-15

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
He, QingYuan, Di
By organisation
Department of Science and TechnologyFaculty of Science & EngineeringCommunications and Transport Systems
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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