Pith. sign in

REVIEW

Optimal Blocklength Allocation towards Reduced Age of Information in Wireless Sensor Networks

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 1907.02779 v2 pith:EQBVQNV7 submitted 2019-07-05 eess.SP cs.ITmath.IT

Optimal Blocklength Allocation towards Reduced Age of Information in Wireless Sensor Networks

classification eess.SP cs.ITmath.IT
keywords networkssensorallocationblocklengthdatainformationtimelinesswireless
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The freshness or timeliness of data at server is a significant key performance indicator of sensor networks, especially in tolerance critical applications such as factory automation. As an effective and intuitive measurement to data timeliness, the metric of Age of Information (AoI) has attracted an intensive recent interest of research. This paper initiates a study on the AoI of wireless sensor networks working in the finite blocklength (FBL) regime as a resource allocation problem, and proposes to minimize the long-term discounted system AoI as a Markov decision process (MDP). The proposed method with its optimum solved by Reinforced Learning technique is verified by simulations to outperform benchmarks, including the conventional error rate minimizing policy.

discussion (0)

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