Pull or Wait: How to Optimize Query Age of Information

Date

2023-01-01

Author

Ildiz, M. Emrullah
Yavascan, Orhan T.
Uysal, Elif
Kartal, O. Tugberk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

87
views

0
downloads

Cite This

We study a pull-based status update communication model where a source node submits update packets to a channel with random transmission delay, at times requested by a remote destination node. The objective is to minimize the average query-age-of-information (QAoI), defined as the average age-of-information (AoI) measured at query instants that occur at the destination side according to a stochastic arrival process. In reference to a push-based problem formulation defined in the literature where the source decides to update or wait at will, with the objective of minimizing the time average AoI at the destination, we name this problem the Pull-or-Wait (PoW) problem. We identify the PoW problem in the case of a single query as a stochastic shortest path (SSP) problem with uncountable state and action spaces, which has not been solved in previous literature. We derive an optimal solution for this SSP problem and use it as a building block for the solution of the PoW problem under periodic query arrivals.

Subject Keywords

Age of information, energy efficiency, energy efficient sensor communication, Internet of Things, pullbased communication, query age of information, status updates, stochastic shortest path problem, update or wait

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85188500744&origin=inward
https://hdl.handle.net/11511/112472

Collections

Department of Electrical and Electronics Engineering, Article