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
Minimizing Average On-Demand AoI in an IoT Network with Energy Harvesting Sensors
Univ Oulu, Finland.
Univ Oulu, Finland.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-0210-4375
2021 (English)In: SPAWC 2021: 2021 IEEE 22ND INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (IEEE SPAWC 2021), IEEE , 2021, p. 156-160Conference paper, Published paper (Refereed)
Abstract [en]

Delivering timely status information of a random process has become increasingly important for time-sensitive applications, e.g., vehicle tracking and environment monitoring. We consider an IoT sensing network, where a cache-enabled wireless edge node receives on-demand requests from multiple users to send status updates on physical quantities, each measured by an energy harvesting sensor. To serve users' requests, the edge node uses the current information state (i.e., the number of requests, battery level, and AoI for each sensor) to decide whether to command a sensor to send a status update or to retrieve the most recently received sensor's measurements from the cache. We aim at finding the best actions of the edge node to minimize the average AoI of the served measurements at the users, i.e., average on-demand AoI. We model this as a Markov decision process problem and derive a relative value iteration algorithm to find an optimal policy. Simulation results illustrate the threshold-based structure of an optimal policy and show that the proposed on-demand updating policy outperforms the greedy (myopic) policy and also, by accounting for the per-sensor request frequencies and intensities, the pure average AoI minimization policy that keeps the edge node updated regardless of requests.

Place, publisher, year, edition, pages
IEEE , 2021. p. 156-160
Series
IEEE International Workshop on Signal Processing Advances in Wireless Communications, ISSN 1948-3244, E-ISSN 1948-3252
Keywords [en]
Age of information (AoI); energy harvesting (EH); relative value iteration algorithm (RVIA)
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-209594DOI: 10.1109/SPAWC51858.2021.9593235ISI: 000783745500032ISBN: 9781665428514 (electronic)ISBN: 9781665428521 (print)OAI: oai:DiVA.org:liu-209594DiVA, id: diva2:1913239
Conference
22nd IEEE International Workshop on Signal Processing Advances in Wireless Communications (IEEE SPAWC), Lucca, ITALY, sep 27-30, 2021
Note

Funding Agencies|Infotech Oulu; Academy of Finland [319485, 323698, 318927]; HPY Research Foundation; Riitta ja Jorma J. Takanen Foundation; Academy of Finland (AKA) [319485] Funding Source: Academy of Finland (AKA)

Available from: 2024-11-14 Created: 2024-11-14 Last updated: 2024-11-14

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Codreanu, Marian
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: 24 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