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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-04-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/24/4/542 |
| _version_ | 1797434776342233088 |
|---|---|
| author | Mehrdad Salimnejad Nikolaos Pappas |
| author_facet | Mehrdad Salimnejad Nikolaos Pappas |
| author_sort | Mehrdad Salimnejad |
| collection | DOAJ |
| 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. |
| first_indexed | 2024-03-09T10:38:14Z |
| format | Article |
| id | doaj.art-f8e5196f81354d4e97dd49c51c252ab4 |
| institution | Directory Open Access Journal |
| issn | 1099-4300 |
| language | English |
| last_indexed | 2024-03-09T10:38:14Z |
| publishDate | 2022-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj.art-f8e5196f81354d4e97dd49c51c252ab42023-12-01T20:51:18ZengMDPI AGEntropy1099-43002022-04-0124454210.3390/e24040542On the Age of Information in a Two-User Multiple Access SetupMehrdad Salimnejad0Nikolaos Pappas1Department of Science and Technology, Linköping University, SE-60174 Norrköping, SwedenDepartment of Science and Technology, Linköping University, SE-60174 Norrköping, SwedenThis 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.https://www.mdpi.com/1099-4300/24/4/542age of informationmultiple access channelsmultiple-input multiple-output Rayleigh fading channeldiscrete-time Markov chainconvex optimization |
| spellingShingle | Mehrdad Salimnejad Nikolaos Pappas On the Age of Information in a Two-User Multiple Access Setup Entropy age of information multiple access channels multiple-input multiple-output Rayleigh fading channel discrete-time Markov chain convex optimization |
| 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 | age of information multiple access channels multiple-input multiple-output Rayleigh fading channel discrete-time Markov chain convex optimization |
| url | https://www.mdpi.com/1099-4300/24/4/542 |
| work_keys_str_mv | AT mehrdadsalimnejad ontheageofinformationinatwousermultipleaccesssetup AT nikolaospappas ontheageofinformationinatwousermultipleaccesssetup |