University of Oulu

W. Lin, L. Li, J. Yuan, Z. Han, M. Juntti and T. Matsumoto, "Age-of-Information in First-Come-First-Served Wireless Communications: Upper Bound and Performance Optimization," in IEEE Transactions on Vehicular Technology, vol. 71, no. 9, pp. 9501-9515, Sept. 2022, doi: 10.1109/TVT.2022.3177298.

Age-of-information in first-come-first-served wireless communications : upper bound and performance optimization

Saved in:
Author: Lin, Wensheng1; Li, Lixin1; Yuan, Jinhong2;
Organizations: 1School of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710129, China
2School of Electrical Engineering and Telecommunications, University of New South Wales, Sydney, NSW 2052, Australia
3Department of Electrical and Computer Engineering at the University of Houston, Houston, TX 77004 USA
4Department of Computer Science and Engineering, Kyung Hee University, Seoul 446-701, South Korea
5Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
6IMT Atlantique Bretagne Pays de la Loire, 4 Rue Alfred Kastler, 44300 Nantes, France
7Japan Advanced Institute of Science and Technology, Japan
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 2.5 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2022
Publish Date: 2022-06-28


This paper establishes an analytical framework for the upper bound on the average Age-of-Information (AoI) in first-come-first-served (FCFS) wireless communications where a certain level of outage probability is unavoidable. To begin with, we analyze the average AoI and derive a general upper bound for G/G/1 systems with a certain outage probability. Subsequently, for an M/M/1 system with the FCFS scheme, we obtain a concise closed-form expression of the upper bound, and further refine the upper bound after analyzing the relative error. Interestingly, it is found by the analysis that the relative error is independent of the service rate, and the upper bound becomes tighter as the outage probability increases. Based on the refined upper bound, we minimize the average AoI for the communications suffering from block Rayleigh fading. We derive a closed-form expression of the outage probability over a fading channel, and then prove that the refined upper bound is a convex function with respect to the average update generating rate. Consequently, we optimize the AoI performance by solving a convex optimization problem formulated utilizing the refined upper bound expression. The numerical results indicate that the minimum average AoI can be reduced by either increasing the service rate or the transmission power.

see all

Series: IEEE transactions on vehicular technology
ISSN: 0018-9545
ISSN-E: 1939-9359
ISSN-L: 0018-9545
Volume: 71
Issue: 9
Pages: 9501 - 9515
DOI: 10.1109/TVT.2022.3177298
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This work was supported in part by National Natural Science Foundation of China (NSFC) under Grant 62001387, in part by Shanghai Academy of Spaceflight Technology (SAST) under Grant SAST2020124, in part by French National Research Agency Future program under reference ANR-10-LABX-07-01, in part by NSF CNS-2107216 and CNS-2128368, in part by the Australian Research Council (ARC) Discovery Projects under Grant DP190101363, in part by the ARC Linkage Project under Grant LP170101196, and in part by the Academy of Finland 6G Flagship program under Grant 346208.
Academy of Finland Grant Number: 346208
Detailed Information: 346208 (Academy of Finland Funding decision)
Copyright information: © 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.