Pith. sign in

REVIEW

Recursive Optimization of Finite Blocklength Allocation to Mitigate Age-of-Information Outage

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.14003 v2 pith:6LJNDROO submitted 2019-10-30 cs.IT eess.SPmath.IT

Recursive Optimization of Finite Blocklength Allocation to Mitigate Age-of-Information Outage

classification cs.IT eess.SPmath.IT
keywords blocklengthfiniteoutageage-of-informationallocationapproachoptimizationsproblem
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

As an emerging metric for the timeliness of information delivery, Age-of-Information (AoI) raises a special interest in the research area of tolerance-critical communications, wherein sufficiently short blocklength is usually adopted as an essential requirement. However, the interplay between AoI and finite blocklength is scantly treated. This paper studies the occurrence of high AoI, i.e., AoI outage, in TDMA systems with respect to the blocklength allocation among users. A Markov Decision Process model is set up for the problem, which enables a static state analysis, and therewith a policy iteration approach to improve the AoI robustness is proposed. The burstiness of outages is also analyzed to provide additional insights into this problem in the finite blocklength (FBL) regime. It is shown that, different from average AoI optimizations, a risk-sensitive approach is significantly beneficial for AoI outage optimizations, on account of the FBL regime.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.