Papers
Topics
Authors
Recent
2000 character limit reached

Adaptive Power and Rate Control for Real-time Status Updating over Fading Channels

Published 5 Jan 2020 in cs.IT, cs.SY, eess.SY, and math.IT | (2001.01234v2)

Abstract: Age of Information (AoI) has attracted much attention recently due to its capability of characterizing the freshness of information. To improve information freshness over fading channels, efficient scheduling methods are highly desired for wireless transmissions. However, due to the channel instability and arrival randomness, optimizing AoI is very challenging. In this paper, we are interested in the AoI-optimal transmissions with rate-adaptive transmission schemes in a buffer-aware system. More specifically, we utilize a probabilistic scheduling method to minimize the AoI while satisfying an average power constraint. By characterizing the probabilistic scheduling policy with a Constrained Markov Decision Process (CMDP), we formulate a Linear Programming (LP) problem. Further, a low complexity algorithm is presented to obtain the optimal scheduling policy, which is proved to belong to a set of semi-threshold-based policies. Numerical results verify the reduction in computational complexity and the optimality of semi-threshold-based policy, which indicates that we can achieve well real-time service with a low calculating complexity.

Citations (17)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.