Date

2002-8-22

Author

Ildız, Muhammed Emrullah

Metadata

Show full item record

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

Item Usage Stats

236
views

70
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 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 provide a comparison of the two formulations: (i) Under Poisson query arrivals and random transmission delay, an optimal policy that minimizes the time average AoI also minimizes the average QAoI, and these minimum values are equal; and (ii) the optimal average QAoI is shown to be less than or equal to the optimal time average AoI under the following two cases: (1) Periodic query arrivals and random transmission delay and (2) general query arrivals and constant transmission delay. 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 been not 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, Communication Networks, Internet of things

URI

https://hdl.handle.net/11511/99381

Collections

Graduate School of Natural and Applied Sciences, Thesis