Age-of-Information Aware Scheduling

Jhunjhunwala, Prakirt Raj; Moharir, Sharayu

doi:10.1109/spcom.2018.8724448

Cited by 27 publications

(20 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, W (1) < C. Now, if there exists some h > 1 such that W (h) ≥ C, then we know that there also exists some H such that W (H) ≤ C ≤ W (H + 1) using monotonicity of W (·). Observe that this implies that there exists some H satisfying (12).…”

Section: H Proof Of Theoremmentioning

confidence: 98%

“…In [12], the authors show that for reliable channels there exists an optimal policy that is stationary, cyclic and can be found by solving the minimum average cost cycle problem over a large graph.…”

Section: Definition Stationary Cyclic Policiesmentioning

confidence: 99%

“…Instead of weighted sum AoI, we are interested in minimizing the time-average of We develop a restless mutli-armed bandit formulation for the problem and use a Whittle Index based approach to find low complexity scheduling policies that have good performance. Closer to our work, scheduling to minimize functions of age has also been considered in [11] and [12]. In [11], the authors deals with minimizing symmetric functions of age of sources over multiple orthogonal unreliable channels and show that simple greedy schemes are asymptotically optimal.…”

Section: Introductionmentioning

confidence: 99%

“…Observe that this implies that there exists some H satisfying (12) and hence the threshold policy is optimal. If there exists no H satisfying (12), then W (h) < C, ∀h.…”

mentioning

confidence: 98%

See 3 more Smart Citations

A Whittle Index Approach to Minimizing Functions of Age of Information

Tripathi

Modiano

2019

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

We consider a setting where multiple active sources send real-time updates over a single-hop wireless broadcast network to a monitoring station. Our goal is to design a scheduling policy that minimizes the time-average of general nondecreasing cost functions of Age of Information. We use a Whittle index based approach to find low complexity scheduling policies that have good performance, for reliable as well as unreliable channels. We prove that for a system with two sources, having possibly different cost functions and reliable channels, the Whittle index policy is exactly optimal. For reliable channels, we also derive structural properties of an optimal policy, that suggest that the performance of the Whittle index policy may be close to optimal in general. These results might also be of independent interest in the study of restless multi-armed bandit problems with similar underlying structure. Finally, we provide simulations comparing the Whittle index policy with optimal scheduling policies found using dynamic programming, which support our results.

show abstract

Section: H Proof Of Theoremmentioning

confidence: 98%

Section: Definition Stationary Cyclic Policiesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Observe that this implies that there exists some H satisfying (12) and hence the threshold policy is optimal. If there exists no H satisfying (12), then W (h) < C, ∀h.…”

mentioning

confidence: 98%

See 2 more Smart Citations

A Whittle Index Approach to Minimizing Functions of Age of Information

Tripathi

Modiano

2019

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…In addition, most of the literature does not consider the dynamic channel or is not sufficiently comprehensive. The authors in [15], [16] adopted a multi-source system composed of multiple sensors, a central monitoring station, and multiple orthogonal frequency channels. Due to the limited communication capacity, not all sensors can send updates to the monitoring station at any time.…”

Section: B Related Workmentioning

confidence: 99%

Link Resource Allocation Strategy Based on Age of Information and Sample Extrusion Awareness in Dynamic Channels

Wei

Huang

2021

IEEE Access

View full text Add to dashboard Cite

As an emerging measure of data freshness, the age of information (AoI) is receiving extensive attention. Many methods using AoI have been proposed for IoT communication scheduling. However, most of them are aimed at constant channel conditions in the ideal state, and the utilization of link resources is not sufficient. In addition, only the optimization of AoI is considered, without considering whether the sample is extruded or not. The occurrence of sample extrusion means that the transmission of the remaining untransmitted sample of the source node cannot be completed within the transmission time interval (TTI) before the arrival of the new sampling period of the source node, resulting in a phenomenon in which the new sample arrives while the old sample has not yet been completely transmitted. This scenario has a serious impact on delay-sensitive IoT applications. Therefore, under dynamic channel conditions and limited link resources, this paper establishes a mathematical model for AoI and sample extrusion. The influence of the scheduling algorithm on these two target values is analyzed and proved. Based on a greedy strategy, we propose an online allocation algorithm of preemptive link resources that considers two objectives: to give full play to the value of link resources and to minimize sample extrusion. The simulation results show that the proposed strategy can achieve better comprehensive performance in two scenarios where the sample variance between each source node is small and large.INDEX TERMS Age of information, sample extrusion, dynamic channel, preemptive.

show abstract