activity
20162023
most citedAge-of-Information Dependent Random Access for Massive IoT Networks

25 citations · 141 across the 29 of their papers we have counts for

collaborators
Showing cs.ITShow all

27 papers · 1 filter

cs.IT2023

Age of Information in Reservation Multi-Access Networks with Stochastic Arrivals: Analysis and Optimization

Qian Wang, He Chen

This paper analyzes and optimizes the average Age of Information (AAoI) of Frame Slotted ALOHA with Reservation and Data slots (FSA-RD) in a multi-access network, where multiple us…

cs.IT20212 cited

Optimizing Information Freshness for Cooperative IoT Systems with Stochastic Arrivals

Bohai Li, Qian Wang, He Chen +2

This paper considers a cooperative Internet of Things (IoT) system with a source aiming to transmit randomly generated status updates to a designated destination as timely as possi…

cs.IT202010 cited

Optimizing Information Freshness via Multiuser Scheduling with Adaptive NOMA/OMA

Qian Wang, He Chen, Changhong Zhao +3

This paper considers a wireless network with a base station (BS) conducting timely status updates to multiple clients via adaptive non-orthogonal multiple access (NOMA)/orthogonal…

cs.IT2020

Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint

Yifan Gu, Qian Wang, He Chen +2

In this paper, we investigate the age minimization problem for a two-hop relay system, under a resource constraint on the average number of forwarding operations at the relay. We f…

cs.IT20202 cited

Optimizing Information Freshness in Two-Way Relay Networks

Bohai Li, He Chen, Nikolaos Pappas +1

In this paper, we investigate an amplify-and-forward (AF) based two-way cooperative status update system, where two sources aim to exchange status updates with each other as timely…

cs.IT20201 cited

Age-of-Information-based Scheduling in Multiuser Uplinks with Stochastic Arrivals: A POMDP Approach

Aoyu Gong, Tong Zhang, He Chen +1

In this paper, we consider a multiuser uplink status update system, where a monitor aims to timely collect randomly generated status updates from multiple end nodes through a share…