Minimizing Age of Information in IEEE 802.15.6 Time-Slotted Wireless Systems through Maximizing Slot Utilization Ratio
- Authors
- Kim, Beom-Su
- Issue Date
- Nov-2025
- Publisher
- Institute of Electrical and Electronics Engineers
- Keywords
- age of information; age-aware burst scheduling; block length adaptation; on-demand burst transmission
- Citation
- IEEE Transactions on Mobile Computing
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Mobile Computing
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/81274
- DOI
- 10.1109/TMC.2025.3638169
- ISSN
- 1536-1233
1558-0660
- Abstract
- With the growing need to ensure data freshness in time-sensitive applications, the Age of Information (AoI) has become a critical performance metric, particularly in IEEE 802.15.6 time-slotted wireless systems. In these systems, each data sample carries significant informational value, making it critical to maintain the freshness of all collected samples without loss. However, limited time and bandwidth resources pose a significant challenge, underscoring the importance of maximizing resource utilization. To address this issue, we propose an on-demand burst transmission mechanism that combines buffer-aware scheduling with block-based data transmission. This hybrid approach eliminates idle slots and reduces acknowledgment overhead, thereby improving slot efficiency and significantly lowering the AoI of all sampled data under tight resource constraints. To further enhance the robustness of on-demand burst transmissions in lossy wireless environments, we incorporate predictive channel awareness into the burst scheduling process, enabling adaptive and reliable transmission decisions. Simulation results demonstrate that the proposed algorithm significantly outperforms conventional AoI schedulers, especially in resource-constrained and dynamically varying network conditions.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.