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
Optimizing Freshness of Information: On Minimum Age Link Scheduling in Wireless Systems
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. 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 14TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT), IEEE , 2016, p. 115-122Conference paper, Published paper (Refereed)
Abstract [en]

There is a growing interest in age of information, which is a newly introduced metric that measures the freshness of information in communication systems. We investigate the age of information in wireless networks and propose the novel approach of optimizing the scheduling strategy to deliver the information as timely as possible. We consider a set of links that share a common channel, each containing a number of packets with time stamps, and address the scheduling problem with the objective of minimizing the overall information age. We model this problem mathematically and prove it is NP-hard in general. Fundamental insights including tractable cases and optimality conditions are presented. An integer linear programming formulation is provided for performance benchmarking. Moreover, a steepest age decent algorithm with better scalability is developed. Numerical study shows that, by employing the optimal schedule, the overall information age is significantly reduced in comparison to other scheduling strategies.

Place, publisher, year, edition, pages
IEEE , 2016. p. 115-122
Keywords [en]
Age of information; link scheduling; optimization; wireless networks
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-133758DOI: 10.1109/WIOPT.2016.7492912ISI: 000389647700017ISBN: 978-1-5090-1311-1 (print)OAI: oai:DiVA.org:liu-133758DiVA, id: diva2:1064023
Conference
14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
Available from: 2017-01-11 Created: 2017-01-09 Last updated: 2018-08-14

Open Access in DiVA

No full text in DiVA

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
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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