Minimizing Age of Processed Information in Wireless Networks

TL;DR

This paper addresses minimizing the average age of processed information in wireless sensor networks by proposing and analyzing scheduling policies that optimize information freshness with theoretical guarantees.

Contribution

It introduces simplified drop-free policies and three novel transmission-scheduling policies with 2-optimal guarantees for minimizing processed information age.

Findings

Distributed Power-2 policy is implementable without a central scheduler.

Back-Off policy bounds maximum age of processed information.

Max-Weight policy achieves lowest average age in simulations.

Abstract

The freshness of real-time status processing of time-sensitive information is crucial for several applications, including healthcare monitoring and autonomous vehicles. This freshness is considered in this paper for the system where unprocessed information is sent from sensors to a base station over a shared wireless network. The base station has a dedicated non-preemptive processor with a constant processing time to process information from each sensor. The age of processed information is the time elapsed since the generation of the packet that was most recently processed by a processor. Our objective is to minimize the average age of processed information over an infinite time-horizon. We first show that a drop-free policy simplifies the system without sacrificing optimality. From this simplification, we propose three transmission-scheduling policies with 2-optimal guarantees for different requirements. A distributed Power-2 policy can be implemented without a central scheduler. With a central scheduler, both Back-Off and Max-Weight policies are near optimal with different advantages. The Back-Off policy guarantees a bound on the maximum age of processed information, while the Max-Weight policy achieves the lowest average age in simulation without the guarantee of bound. Simulation results confirm our theoretical findings.