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 Min-Max Peak Age of Information in Wireless Systems
Linköping University, Department of Science and Technology. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering. University of Maryland, MD 20742 USA.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering. University of Maryland, MD 20742 USA.
2016 (English)In: 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), IEEE , 2016Conference paper, Published paper (Refereed)
Abstract [en]

Freshness of information is of critical importance for a host of applications of wireless communications. In order to deliver information from multiple sources in a timely and fair fashion through a wireless channel, we propose optimizing the link scheduling strategy in respect of age of information, which is a newly introduced metric that measures how fresh information is. Specifically, we consider a set of co-channel links, each having a number of packets to be delivered, and address the problem that aims to find the optimal scheduling solution, such that the maximum peak age of information is minimized. We mathematically formulate this so-called min-max peak age scheduling problem (MPASP), and prove it is NP-hard. Theoretical insights including tractable cases and optimality properties are derived. For problem solution, an integer linear programming (ILP) formulation is proposed. We also develop a sub-optimal, but fast, algorithm to solve the problem with better scalability. Numerical study shows that, by employing the optimal schedule, the maximum peak age is significantly reduced in comparison to other classic scheduling strategies such as minimum-time scheduling.

Place, publisher, year, edition, pages
IEEE , 2016.
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keyword [en]
age of information; link scheduling; optimization; peak age; wireless networks
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:liu:diva-134226DOI: 10.1109/ICC.2016.7511331ISI: 000390993204018ISBN: 978-1-4799-6664-6 (print)OAI: oai:DiVA.org:liu-134226DiVA: diva2:1069761
Conference
IEEE International Conference on Communications (ICC)
Available from: 2017-01-30 Created: 2017-01-29 Last updated: 2017-01-30

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
He, QingYuan, DiEphremides, Anthony
By organisation
Department of Science and TechnologyFaculty of Science & EngineeringCommunications and Transport Systems
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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