Fig 3 - available via license: Creative Commons Attribution 4.0 International

Content may be subject to copyright.

# EWSAoI performance versus an increasing packet arrival rate, where N = 2, p 1 = p 2 = 0.8, and ω 1 = ω 2 = 1.

Source publication

We consider a wireless uplink network consisting of multiple end devices and an access point (AP). Each device monitors a physical process with stochastic arrival of status updates and sends these updates to the AP over a shared channel. The AP aims to schedule the transmissions of these devices to optimize the network-wide information freshness, q...

## Contexts in source publication

**Context 1**

... Fig. 3, we illustrate the EWSAoI of the POMW policy, its corresponding upper bounds, and the universal lower bound L B with increasing packet arrival rate. The R F OMW in the FON and its corresponding upper bound, i.e., the optimal RS policy, are given as benchmarks. We set N = 2, ω 1 = ω 2 = 1, p 1 = p 2 = 0.8, λ 1 = λ 2 = λ, D = 20, and T = ...

**Context 2**

... 3, we illustrate the EWSAoI of the POMW policy, its corresponding upper bounds, and the universal lower bound L B with increasing packet arrival rate. The R F OMW in the FON and its corresponding upper bound, i.e., the optimal RS policy, are given as benchmarks. We set N = 2, ω 1 = ω 2 = 1, p 1 = p 2 = 0.8, λ 1 = λ 2 = λ, D = 20, and T = 100. Fig. 3 shows that all curves decrease as λ increases. This is intuitive because the EWSAoI decreases when the status update packets arrive at nodes more frequently. Furthermore, the value of the universal lower bound is the smallest, the value of R RSM is the largest, and R P OMW and R F OMW are lower than their corresponding upper bounds, ...

**Context 3**

... the EWSAoI decreases when the status update packets arrive at nodes more frequently. Furthermore, the value of the universal lower bound is the smallest, the value of R RSM is the largest, and R P OMW and R F OMW are lower than their corresponding upper bounds, respectively. These relationships validate the analysis given in the previous section. Fig. 3 also shows that R P OMW is larger than R F OMW , and the upper bound of R P OMW is larger than that of R F OMW . This is intuitive because the POMW policy in the PON only knows the packet arrival rate and some occasional observations, while the FOMW policy in the FON can utilize the fully observed state information. Furthermore, the ...

## Similar publications

This work introduces sIPOMDPLite-net, a deep neural network (DNN) architecture for decentralized, self-interested agent control in partially observable stochastic games (POSGs) with sparse interactions between agents. The network learns to plan in contexts modeled by the interactive partially observable Markov decision process (I-POMDP) Lite framew...