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

**Authors:** Bin Han, Yao Zhu, Zhiyuan Jiang, Yulin hu, Hans D., Schotten

arXiv: 1907.02779 · 2021-11-30

## TL;DR

This paper studies how to optimally allocate blocklength in wireless sensor networks to minimize Age of Information (AoI), using Markov decision processes and reinforcement learning to improve data freshness in finite blocklength regimes.

## Contribution

It formulates AoI minimization as a resource allocation problem in FBL regime and proposes a reinforcement learning-based solution for optimal blocklength allocation.

## Key findings

- Reinforcement learning outperforms traditional error rate policies.
- Optimal blocklength allocation reduces AoI significantly.
- The method is validated through simulations.

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1907.02779/full.md

## Figures

6 figures with captions in the complete paper: https://tomesphere.com/paper/1907.02779/full.md

## References

17 references — full list in the complete paper: https://tomesphere.com/paper/1907.02779/full.md

---
Source: https://tomesphere.com/paper/1907.02779