TY - JOUR
T1 - Understanding Age of Information in Large-Scale Wireless Networks
AU - Yang, Howard H.
AU - Xu, Chao
AU - Wang, Xijun
AU - Feng, Daquan
AU - Quek, Tony Q.S.
N1 - Funding Information:
Manuscript received November 24, 2019; revised September 10, 2020; accepted December 22, 2020. Date of publication January 8, 2021; date of current version May 10, 2021. This work was supported in part by the National Natural Science Foundation of China under Grant 61701372, in part by the Talents Special Foundation of Northwest A&F University under Grant Z111021801, in part by the Zhejiang University/University of Illinois at Urbana–Champaign Institute Starting Fund, in part by the Fundamental Research Funds for the Central Universities under Grant 19lgpy79, in part by the MOE ARF Tier 2 under Grant T2EP20120-0006, and in part by the SUTD Growth Plan Grant for AI. The associate editor coordinating the review of this article and approving it for publication was S. Kompella. (Corresponding authors: Chao Xu; Xijun Wang.) Howard H. Yang is with the Zhejiang University/University of Illinois at Urbana–Champaign Institute, Haining 314400, China, and also with the College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310007, China (e-mail: haoyang@intl.zju.edu.cn).
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2021/5
Y1 - 2021/5
N2 - The notion of age-of-information (AoI) is investigated in the context of large-scale wireless networks, in which transmitters need to send a sequence of information packets, which are generated as independent Bernoulli processes, to their intended receivers over a shared spectrum. Due to interference, the rate of packet depletion at any given node is entangled with both the spatial configurations, which determine the path loss, and temporal dynamics, which influence the active states, of the other transmitters, resulting in the queues to interact with each other in both space and time over the entire network. To that end, variants in the packet update frequency affect not just the inter-arrival time but also the departure process, and the impact of such phenomena on the AoI is not well understood. In this paper, we establish a theoretical framework to characterize the AoI performance in the aforementioned setting. Particularly, tractable expressions are derived for both the peak and average AoI under two different transmission protocols, namely the first-come-first-serve (FCFS) and the last-come-first-serve with preemption (LCFS-PR). Additionally, our analysis also accounts for the effects of channel access controls such as ALOHA on the AoI. The accuracy of the analysis is verified via simulations, and based on the theoretical outcomes, we find that: i ) networks operating under LCFS-PR are able to attain smaller values of peak and average AoI than that under FCFS, whereas the gain is more pronounced when the infrastructure is densely deployed, ii ) in sparsely deployed networks, ALOHA with a universally designed channel access probability is not instrumental in reducing the AoI, thus calling for more advanced channel access approaches, and iii ) when the infrastructure is densely rolled out, there exists a non-trivial ALOHA channel access probability that minimizes the peak and average AoI under both FCFS and LCFS-PR.
AB - The notion of age-of-information (AoI) is investigated in the context of large-scale wireless networks, in which transmitters need to send a sequence of information packets, which are generated as independent Bernoulli processes, to their intended receivers over a shared spectrum. Due to interference, the rate of packet depletion at any given node is entangled with both the spatial configurations, which determine the path loss, and temporal dynamics, which influence the active states, of the other transmitters, resulting in the queues to interact with each other in both space and time over the entire network. To that end, variants in the packet update frequency affect not just the inter-arrival time but also the departure process, and the impact of such phenomena on the AoI is not well understood. In this paper, we establish a theoretical framework to characterize the AoI performance in the aforementioned setting. Particularly, tractable expressions are derived for both the peak and average AoI under two different transmission protocols, namely the first-come-first-serve (FCFS) and the last-come-first-serve with preemption (LCFS-PR). Additionally, our analysis also accounts for the effects of channel access controls such as ALOHA on the AoI. The accuracy of the analysis is verified via simulations, and based on the theoretical outcomes, we find that: i ) networks operating under LCFS-PR are able to attain smaller values of peak and average AoI than that under FCFS, whereas the gain is more pronounced when the infrastructure is densely deployed, ii ) in sparsely deployed networks, ALOHA with a universally designed channel access probability is not instrumental in reducing the AoI, thus calling for more advanced channel access approaches, and iii ) when the infrastructure is densely rolled out, there exists a non-trivial ALOHA channel access probability that minimizes the peak and average AoI under both FCFS and LCFS-PR.
UR - http://www.scopus.com/inward/record.url?scp=85099560877&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85099560877&partnerID=8YFLogxK
U2 - 10.1109/TWC.2020.3048008
DO - 10.1109/TWC.2020.3048008
M3 - Article
AN - SCOPUS:85099560877
VL - 20
SP - 3196
EP - 3210
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
SN - 1536-1276
IS - 5
M1 - 9316915
ER -