Optimizing Age of Information in Wireless Networks with Throughput Constraints

@article{Kadota2018OptimizingAO,
  title={Optimizing Age of Information in Wireless Networks with Throughput Constraints},
  author={Igor Kadota and Abhishek Sinha and Eytan H. Modiano},
  journal={IEEE INFOCOM 2018 - IEEE Conference on Computer Communications},
  year={2018},
  pages={1844-1852}
}
Age of Information (AoI) is a performance metric that captures the freshness of the information from the perspective of the destination. The AoI measures the time that elapsed since the generation of the packet that was most recently delivered to the destination. In this paper, we consider a single-hop wireless network with a number of nodes transmitting time-sensitive information to a Base Station and address the problem of minimizing the Expected Weighted Sum AoI of the network while… 

Figures from this paper

Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints
TLDR
A single-hop wireless network with a number of nodes transmitting time-sensitive information to a base station is considered and the problem of minimizing the expected weighted sum AoI of the network while simultaneously satisfying timely-throughput constraints from the nodes is addressed.
Distributed Scheduling Algorithm for Optimizing Age of Information in Wireless Networks
TLDR
A distributed scheduling algorithm for peak age optimization in a wireless network where a number of sensor nodes attempt to deliver their sensed data to a data collector over a wireless channel that asymptotically approximates the optimal solution by only a constant factor.
Improving Age of Information in Wireless Networks With Perfect Channel State Information
TLDR
AoI minimization problem for a network with general interference constraints, and time varying channels is considered, and it is proved that the virtual-queue based policy is nearly optimal, up to a constant additive factor, and the age-based policy is at-most a factor of 4 away from optimality.
Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication
TLDR
This work shows that the AoI minimization problems are NP-hard, but only in the weak sense, as it develops an optimal algorithm with a pseudo-polynomial time complexity, and proves that minimizing AoI and minimizing maximum delay are "roughly" equivalent.
AoI and Throughput Tradeoffs in Routing-aware Multi-hop Wireless Networks
TLDR
From simulation results, this paper identifies the tradeoff points of the optimal AoI and throughput, demonstrating that one performance metric improves at the expense of degrading the other, with the routing path found as one of the key factors in determining such a tradeoff.
Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State
TLDR
It is proved that the virtual queue based policy is peak age optimal, up to an additive constant, while the age-based policy is at most factor 4 away from the optimal age.
Minimizing Age-of-Information with Throughput Constraints in Multi-Path Network Communication
TLDR
Comparing the newly proposed AoI with the common-studied maximum delay, it is shown that the maximum-delay-optimal solution can achieve a suboptimal AoI, and the fundamental structures of the problems are given, including proving that the peak-AoIminimization can differ from theAverage AoI minimization, but both of them are NP-hard in the weak sense.
Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks
  • Rajat Talak, S. Karaman, E. Modiano
  • Computer Science
    2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
  • 2018
TLDR
This work considers simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability, and obtains an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links.
Optimizing age of information in wireless networks with perfect channel state information
  • Rajat Talak, S. Karaman, E. Modiano
  • Computer Science
    2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
  • 2018
TLDR
It is proved that the virtual-queue based policy is nearly optimal, up to a constant additive factor, and the age-based policy is at-most factor 4 away from optimality.
On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels
TLDR
This paper derives an exactly optimal scheduling policy for Age-of-Information (AoI) in a downlink system with erasure channels, and shows that the resulting Age-process is positive recurrent under the optimal policy, and has an exponentially light tail.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints
TLDR
A single-hop wireless network with a number of nodes transmitting time-sensitive information to a base station is considered and the problem of minimizing the expected weighted sum AoI of the network while simultaneously satisfying timely-throughput constraints from the nodes is addressed.
Minimizing the Age of Information in broadcast wireless networks
TLDR
This is the first work to provide a scheduling policy that optimizes AoI in a wireless network with unreliable channels and shows that a Greedy Policy, which transmits the packet with highest current age, is optimal for the case of symmetric networks.
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
TLDR
This is the first work to derive performance guarantees for scheduling policies that attempt to minimize AoI in wireless networks with unreliable channels and shows that both the Max-Weight and Whittle’s Index policies outperform the other scheduling policies in every configuration simulated, and achieve near optimal performance.
On optimal link scheduling with min-max peak age of information in wireless systems
TLDR
Numerical study shows that, by employing the optimal schedule, the maximum peak age is significantly reduced in comparison to other classic scheduling strategies such as minimum-time scheduling.
Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State
TLDR
It is proved that the virtual queue based policy is peak age optimal, up to an additive constant, while the age-based policy is at most factor 4 away from the optimal age.
Optimizing freshness of information: On minimum age link scheduling in wireless systems
  • Qing He, D. Yuan, A. Ephremides
  • Computer Science
    2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
  • 2016
TLDR
This work investigates the age of information in wireless networks and proposes the novel approach of optimizing the scheduling strategy to deliver the information as timely as possible, and proves it is NP-hard in general.
Optimizing Information Freshness in Wireless Networks under General Interference Constraints
TLDR
It is proved an important separation principle: the optimal scheduling policy can be designed assuming fresh information, and independently, the packet generation rate control can be done by ignoring interference.
Age of information: Design and analysis of optimal scheduling algorithms
TLDR
This paper forms a Markov decision process (MDP) to find dynamic transmission scheduling schemes, with the purpose of minimizing the long-run average age, and proposes both optimal off-line and online scheduling algorithms for the finite-approximate MDPs, depending on knowledge of time-varying arrivals.
Age-optimal information updates in multihop networks
TLDR
This paper proves that if the packet transmission times over the network links are exponentially distributed, it is proved that a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy.
Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis
  • Changhee Joo, A. Eryilmaz
  • Computer Science
    2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
  • 2017
TLDR
This work develops a novel age-based scheduler that combines age with the interarrival times of incoming packets in its decisions, which yields significant gains in the information freshness at the receiver.
...
1
2
3
4
...