liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Optimal Sampling Cost in Wireless Networks with Age of Information Constraints
Linköping University, Department of Science and Technology, Communications and Transport Systems. 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.ORCID iD: 0000-0003-4416-7702
Linköping University, Department of Science and Technology, Communications and Transport Systems. 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. Univ Maryland, MD 20742 USA.
2020 (English)In: IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2020, p. 918-923Conference paper, Published paper (Refereed)
Abstract [en]

We consider the problem of minimizing the time average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information constraints (AoI). Errors in the transmission may occur and the scheduling algorithm has to decide if the users sample a new packet or attempt for retransmission of the packet sampled previously. The cost consists of both sampling and transmission costs. The sampling of a new packet after a failure imposes an additional cost in the system. We formulate a stochastic optimization problem with time average cost in the objective under time average AoI constraints. To solve this problem, we apply tools from Lyapunov optimization theory and develop a dynamic algorithm that takes decisions in a slot-by-slot basis. The algorithm decides if a user: a) samples a new packet, b) transmits the old one, c) remains silent. We provide optimality guarantees of the algorithm and study its performance in terms of time average cost and AoI through simulation results.

Place, publisher, year, edition, pages
IEEE , 2020. p. 918-923
Series
IEEE Conference on Computer Communications Workshops, ISSN 2159-4228
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-172335DOI: 10.1109/INFOCOMWKSHPS50562.2020.9163054ISI: 000593830400152ISBN: 978-1-7281-8695-5 (electronic)OAI: oai:DiVA.org:liu-172335DiVA, id: diva2:1514680
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), ELECTR NETWORK, jul 06-09, 2020
Note

Funding Agencies|Center for Industrial Information Technology (CENIIT); Swedish Research Council (VR)Swedish Research Council; ELLIIT

Available from: 2021-01-07 Created: 2021-01-07 Last updated: 2021-01-07

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Fountoulakis, EmmanouilPappas, NikolaosCodreanu, MarianEphremides, Anthony
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 66 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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