Optimal AoI-Aware Scheduling and Cycles in Graphs

Minimizing Age of Information in Energy Harvesting Wireless Sensor Networks

“…4(a) shows results for the concurrent case of e.g. in [29], [32], when the sensed information is obtained simultaneously by all SNs and them transmitted after the SNs the required energy is harvested.…”

“…To elaborate, analyses of AoI can be found in the literature; they are based on two distinct timing conditions, namely, a distributed model in which each SN has its own time origin, as adopted e.g. [28], and a concurrent model in which a common time origin is shared by all SNs as adopted for instance in [29], [32].…”

“…In turn, the concurrent model adopted e.g. in [29], [32], which is also more commonly utilized, addresses applications such as DT, in which different pieces of information collected by different SNs contribute to composing a larger whole, e.g. the digital twin of a given system.…”

“…However, similar to data rate and delay, AoI is also impacted by the presence of multiple usersor in the context of WSNs, multiple sensors -that compete for the same frequency and time resources, which must therefore be properly allocated or scheduled. Considering this issue, resource allocation schemes aimed at minimizing AoI in time-division multiple access (TDMA) and frequency-division multiple access (FDMA) systems have been studied in [25]- [29]. In addition, the characterization of AoI has been studied for random access networks in [30] and for carrier sense multiple access (CSMA) networks with distributed scheduling in [31].…”

Age of Information Aware Communication Systems : Modeling and Performance Analysis

“…More recent works [85,86,87,88,89,90,91] propose centralized and decentralized scheduling policies for AoI minimization, under general interference constraints and time varying channels. The proposed scheduling algorithms have low complexity with strong AoI performances over stochastic information arrivals.…”