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

Direct link
Referera
Referensformat
  • apa
  • 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
Minimizing Average On-Demand AoI in an IoT Network with Energy Harvesting Sensors
Univ Oulu, Finland.
Univ Oulu, Finland.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.ORCID-id: 0000-0003-0210-4375
2021 (engelsk)Inngår i: SPAWC 2021: 2021 IEEE 22ND INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (IEEE SPAWC 2021), IEEE , 2021, s. 156-160Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
IEEE , 2021. s. 156-160
Serie
IEEE International Workshop on Signal Processing Advances in Wireless Communications, ISSN 1948-3244, E-ISSN 1948-3252
Emneord [en]
Age of information (AoI); energy harvesting (EH); relative value iteration algorithm (RVIA)
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-209594DOI: 10.1109/SPAWC51858.2021.9593235ISI: 000783745500032ISBN: 9781665428514 (digital)ISBN: 9781665428521 (tryckt)OAI: oai:DiVA.org:liu-209594DiVA, id: diva2:1913239
Konferanse
22nd IEEE International Workshop on Signal Processing Advances in Wireless Communications (IEEE SPAWC), Lucca, ITALY, sep 27-30, 2021
Merknad

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)

Tilgjengelig fra: 2024-11-14 Laget: 2024-11-14 Sist oppdatert: 2024-11-14

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Søk i DiVA

Av forfatter/redaktør
Codreanu, Marian
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

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

Direct link
Referera
Referensformat
  • apa
  • 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