An Inequality for Query Age of Information and Age of Information Sorgu Ani Bilgi Yaşi (QAoI) ve Ortalama Bilgi Yaşi (AoI) Arasinda bir Eşitsizlik

Date

2022-01-01

Author

Ildiz, M. Emrullah
Avsar, Semanur
Uysal, Elif

Metadata

Show full item record

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

Item Usage Stats

74
views

0
downloads

We study a status update system where a destination node requests from a source node to submit update packets to a channel. The update packets incur a constant transmission delay in the channel. The update packets sent from the source node will be utilized by the destination node at certain query instants generated toward a computation. The query instants are modeled as a stochastic arrival process. The Age of Information (AoI) at the query instants is called as the Query Age of Information (QAoI). The pull-or-wait (PoW) problem is defined as an optimal control problem in which the destination node decides when to request new update packets from the source to minimize the average QAoI. We compare the solution of the PoW problem with the optimal time average AoI obtained as a result of the update-or-wait (UoW) problem, where the source node decides on packet transmission times to minimize the time-average AoI. We show that for all query arrival processes the optimal QAoI is always less than or equal to the optimal time average AoI under the same power constraint.

Subject Keywords

Age of information, equidistribution, pull-based communication model, query age of information, status update systems, update or wait

URI

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

DOI

https://doi.org/10.1109/siu55565.2022.9864717

Conference Name

30th Signal Processing and Communications Applications Conference, SIU 2022

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

QUERY AGE OF INFORMATION IN COMMUNICATION NETWORKS Ildız, Muhammed Emrullah; Uysal, Elif; Department of Electrical and Electronics Engineering (2002-8-22) 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 ...
Update or Wait: How to Keep Your Data Fresh Sun, Yin; Uysal, Elif; Yates, Roy D.; Koksal, C. Emre; Shroff, Ness B. (2017-11-01) In this paper, we study how to optimally manage the freshness of infimmation updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is, since the moment that this update was generated at the source node (e.g., a sensor). A reasonable update policy is the zero wait policy, i.e., the source node submits a fresh update once the previous update is deli...
A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Sridharan, Arun; Koksal, C. Emre; Uysal, Elif (Institute of Electrical and Electronics Engineers (IEEE), 2012-02-01) Information-theoretic broadcast channels (BCs) and multiple-access channels (MACs) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node, respectively. In this paper, we address the problem of link scheduling in multihop wireless networks containing nodes with BC and MAC capabilities. We first propose an interference model that extends protocol interference models, originally designed for point-to-point channels, to includ...
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels Sridharan, Arun; Koksal, C. Emre; Uysal, Elif (2010-03-19) Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node respectively. In this paper, we address the problem of link scheduling in multihop wireless networks containing nodes with BC and MAC capabilities. We first propose an interference model that extends protocol interference models, originally designed for point to point channels, to include t...
Improving the performance of Hadoop/Hive by sharing scan and computation tasks Özal, Serkan; Toroslu, İsmail Hakkı; Doğaç, Asuman; Department of Computer Engineering (2013) MapReduce is a popular model of executing time-consuming analytical queries as a batch of tasks on large scale data. During simultaneous execution of multiple queries, many oppor- tunities can arise for sharing scan and/or computation tasks. Executing common tasks only once can reduce the total execution time of all queries remarkably. Therefore, we propose to use Multiple Query Optimization (MQO) techniques to improve the overall performance of Hadoop Hive, an open source SQL-based distributed warehouse sy...

Citation Formats

M. E. Ildiz, S. Avsar, and E. Uysal, “An Inequality for Query Age of Information and Age of Information Sorgu Ani Bilgi Yaşi (QAoI) ve Ortalama Bilgi Yaşi (AoI) Arasinda bir Eşitsizlik,” presented at the 30th Signal Processing and Communications Applications Conference, SIU 2022, Safranbolu, Türkiye, 2022, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85138742755&origin=inward.