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
Dynamic Power Control for Packets with Deadlines
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering. Nokia Bell Labs, Germany.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-4416-7702
Nokia Bell Labs, Germany.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering. Univ Maryland, MD 20742 USA.
Show others and affiliations
2018 (English)In: 2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), IEEE , 2018Conference paper, Published paper (Refereed)
Abstract [en]

Wireless devices need to adapt their transmission power according to the fluctuating wireless channel in order to meet constraints of delay sensitive applications. In this paper, we consider delay sensitivity in the form of strict packet deadlines arriving in a transmission queue. Packets missing the deadline while in the queue are dropped from the system. We aim at minimizing the packet drop rate under average power constraints. We utilize tools from Lyapunov optimization to find an approximate solution by selecting power allocation. We evaluate the performance of the proposed algorithm and show that it achieves the same performance in terms of packet drop rate with that of the Earliest Deadline First (EDF) when the available power is sufficient. However, our algorithm outperforms EDF regarding the trade-off between packet drop rate and average power consumption.

Place, publisher, year, edition, pages
IEEE , 2018.
Series
IEEE Global Communications Conference, ISSN 2334-0983
Keywords [en]
Deadline-constrained traffic; power efficient algorithms; Lyapunov optimization; centralized scheduler; dynamic algorithms
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:liu:diva-158394DOI: 10.1109/GLOCOM.2018.8648124ISI: 000465774306017ISBN: 978-1-5386-4727-1 (electronic)OAI: oai:DiVA.org:liu-158394DiVA, id: diva2:1332810
Conference
IEEE Global Communications Conference (GLOBECOM)
Note

Funding Agencies|European Unions Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant [643002, 642743]; Center for Industrial Information Technology (CENIIT)

Available from: 2019-06-28 Created: 2019-06-28 Last updated: 2019-06-28

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Fountoulakis, EmmanouilPappas, NikolaosEphremides, AnthonyAngelakis, Vangelis
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Telecommunications

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