Minimizing Age of Processed Information in Wireless Networks

by   Chanikarn Nikunram, et al.

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.


page 1

page 2

page 3

page 4


Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

We consider a wireless broadcast network with a base station sending tim...

Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals

We consider a wireless network with a base station serving multiple traf...

Fresh-CSMA: A Distributed Protocol for Minimizing Age of Information

We consider the design of distributed scheduling algorithms that minimiz...

WiFresh: Age-of-Information from Theory to Implementation

Emerging applications, such as smart factories and fleets of drones, inc...

Delay-Optimal Scheduling for Queueing Systems with Switching Overhead

We study the scheduling polices for asymptotically optimal delay in queu...

Age of Broadcast and Collection in Spatially Distributed Wireless Networks

We consider a wireless network with a base station broadcasting and coll...

Age of Information of a Power Constrained Scheduler in the Presence of a Power Constrained Adversary

We consider a time slotted communication network consisting of a base st...

Please sign up or login with your details

Forgot password? Click here to reset