liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Optimal Link Scheduling for Age Minimization in Wireless Systems
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0002-6213-8561
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
Univ Maryland, MD 20742 USA.
2018 (engelsk)Inngår i: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 64, nr 7, s. 5381-5394Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Information age is a recently introduced metric to represent the freshness of information in communication systems. We investigate age minimization in a wireless network and propose a novel approach of optimizing the scheduling strategy to deliver all messages as fresh as possible. Specifically, we consider a set of links that share a common channel. The transmitter at each link contains a given number of packets with time stamps from an information source that generated them. We address the link transmission scheduling problem with the objective of minimizing the overall age. This minimum age scheduling problem (MASP) is different from minimizing the time or the delay for delivering the packets in question. We model the MASP mathematically and prove it is NP-hard in general. We also identify tractable cases as well as optimality conditions. An integer linear programming formulation is provided for performance benchmarking. Moreover, a steepest age descent algorithm with better scalability is developed. Numerical study shows that, by employing the optimal schedule, the overall age is significantly reduced in comparison to other scheduling strategies.

sted, utgiver, år, opplag, sider
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2018. Vol. 64, nr 7, s. 5381-5394
Emneord [en]
Information age; link scheduling; optimization; wireless networks
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-149703DOI: 10.1109/TIT.2017.2746751ISI: 000435979500038OAI: oai:DiVA.org:liu-149703DiVA, id: diva2:1234409
Merknad

Funding Agencies|EC Marie Curie Actions Projects MESH-WISE [324515]; Career LTE [329313]; National Science Foundation [CCF-0728966, CCF-1420651]; ONR [N000141410107]

Tilgjengelig fra: 2018-07-24 Laget: 2018-07-24 Sist oppdatert: 2018-08-14

Open Access i DiVA

fulltext(671 kB)90 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 671 kBChecksum SHA-512
b56da84b3cdfe0f075982e7471703bb243376ab4c00b7a092ed5b99344fd26161b35582a9a3980849aae14480c13e7856810be3a8dee29d8ab0448e94c4b0fdf
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekst

Personposter BETA

He, QingYuan, Di

Søk i DiVA

Av forfatter/redaktør
He, QingYuan, Di
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Information Theory

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 90 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 86 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf