Cargando…

On the Age of Information in a Two-User Multiple Access Setup

This work considers a two-user multiple access channel in which both users have Age of Information (AoI)-oriented traffic with different characteristics. More specifically, the first user has external traffic and cannot control the generation of status updates, and the second user monitors a sensor...

Descripción completa

Detalles Bibliográficos
Autores principales: Salimnejad, Mehrdad, Pappas, Nikolaos
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9033144/
https://www.ncbi.nlm.nih.gov/pubmed/35455205
http://dx.doi.org/10.3390/e24040542
_version_ 1784692818176901120
author Salimnejad, Mehrdad
Pappas, Nikolaos
author_facet Salimnejad, Mehrdad
Pappas, Nikolaos
author_sort Salimnejad, Mehrdad
collection PubMed
description This work considers a two-user multiple access channel in which both users have Age of Information (AoI)-oriented traffic with different characteristics. More specifically, the first user has external traffic and cannot control the generation of status updates, and the second user monitors a sensor and transmits status updates to the receiver according to a generate-at-will policy. The receiver is equipped with multiple antennas and the transmitters have single antennas; the channels are subject to Rayleigh fading and path loss. We analyze the average AoI of the first user for a discrete-time first-come-first-served (FCFS) queue, last-come-first-served (LCFS) queue, and queue with packet replacement. We derive the AoI distribution and the average AoI of the second user for a threshold policy. Then, we formulate an optimization problem to minimize the average AoI of the first user for the FCFS and LCFS with preemption queue discipline to maintain the average AoI of the second user below a given level. The constraints of the optimization problem are shown to be convex. It is also shown that the objective function of the problem for the first-come-first-served queue policy is non-convex, and a suboptimal technique is introduced to effectively solve the problem using the algorithms developed for solving a convex optimization problem. Numerical results illustrate the performance of the considered optimization algorithm versus the different parameters of the system. Finally, we discuss how the analytical results of this work can be extended to capture larger setups with more than two users.
format Online
Article
Text
id pubmed-9033144
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-90331442022-04-23 On the Age of Information in a Two-User Multiple Access Setup Salimnejad, Mehrdad Pappas, Nikolaos Entropy (Basel) Article This work considers a two-user multiple access channel in which both users have Age of Information (AoI)-oriented traffic with different characteristics. More specifically, the first user has external traffic and cannot control the generation of status updates, and the second user monitors a sensor and transmits status updates to the receiver according to a generate-at-will policy. The receiver is equipped with multiple antennas and the transmitters have single antennas; the channels are subject to Rayleigh fading and path loss. We analyze the average AoI of the first user for a discrete-time first-come-first-served (FCFS) queue, last-come-first-served (LCFS) queue, and queue with packet replacement. We derive the AoI distribution and the average AoI of the second user for a threshold policy. Then, we formulate an optimization problem to minimize the average AoI of the first user for the FCFS and LCFS with preemption queue discipline to maintain the average AoI of the second user below a given level. The constraints of the optimization problem are shown to be convex. It is also shown that the objective function of the problem for the first-come-first-served queue policy is non-convex, and a suboptimal technique is introduced to effectively solve the problem using the algorithms developed for solving a convex optimization problem. Numerical results illustrate the performance of the considered optimization algorithm versus the different parameters of the system. Finally, we discuss how the analytical results of this work can be extended to capture larger setups with more than two users. MDPI 2022-04-12 /pmc/articles/PMC9033144/ /pubmed/35455205 http://dx.doi.org/10.3390/e24040542 Text en © 2022 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Salimnejad, Mehrdad
Pappas, Nikolaos
On the Age of Information in a Two-User Multiple Access Setup
title On the Age of Information in a Two-User Multiple Access Setup
title_full On the Age of Information in a Two-User Multiple Access Setup
title_fullStr On the Age of Information in a Two-User Multiple Access Setup
title_full_unstemmed On the Age of Information in a Two-User Multiple Access Setup
title_short On the Age of Information in a Two-User Multiple Access Setup
title_sort on the age of information in a two-user multiple access setup
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9033144/
https://www.ncbi.nlm.nih.gov/pubmed/35455205
http://dx.doi.org/10.3390/e24040542
work_keys_str_mv AT salimnejadmehrdad ontheageofinformationinatwousermultipleaccesssetup
AT pappasnikolaos ontheageofinformationinatwousermultipleaccesssetup