On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networks

@article{Tsanikidis2020OnTP,
  title={On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networks},
  author={Christos Tsanikidis and Javad Ghaderi},
  journal={IEEE INFOCOM 2020 - IEEE Conference on Computer Communications},
  year={2020},
  pages={59-68}
}
In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each link are delivered within their deadlines, which is referred to as delivery ratio. This problem has been studied before under restrictive frame-based traffic models, or greedy maximal scheduling schemes like LDF (Largest-Deficit First) that can lead to poor… 

Figures from this paper

Randomized Scheduling of Real-Time Traffic in Wireless Networks Over Fading Channels
TLDR
This paper studies the problem of scheduling real-time traffic under a conflict-graph interference model with unreliable links due to channel fading, and proposes low-complexity and myopic distributed randomized algorithms, and characterize their efficiency ratio.
A Dynamic Scheduling Policy for a Network with Heterogeneous Time-Sensitive Traffic
TLDR
This work casts a novel optimization problem formulation for minimizing the average Age of Information (AoI) while satisfying the timely throughput constraints and simulation results show the convergence of the algorithm for different values of the weighted factor and the trade-off between the AoI andThe timely throughput.
Optimal Wireless Scheduling for Remote Sensing through Brownian Approximation
TLDR
This paper studies a remote sensing system where multiple wireless sensors generate possibly noisy information updates of various surveillance fields and delivering these updates to a control center over a wireless network and develops a simple online scheduling policy that employs the optimal means and variances to achieve the optimal system-wide performance.
Adaptive Ensemble Q-learning: Minimizing Estimation Bias via Error Feedback
TLDR
Adaptive Ensemble Q-learning (AdaEQ), a generalized ensemble method with two key steps: approximation error characterization which serves as the feedback for flexibly controlling the ensemble size, and ensemble size adaptation tailored towards minimizing the estimation bias is devised.
A Perspective on Time towards Wireless 6G
TLDR
A general statistical framework of timing requirements in wireless communication systems, which subsumes both latency and AoI is established and sets the basis for design and optimization for the next-generation real-time systems.

References

SHOWING 1-10 OF 29 REFERENCES
On the Performance of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks
TLDR
It is proved that the efficiency ratio of LDF, which is the fraction of the throughput region that LDF can achieve for given traffic distributions, can be lower-bounded by a quantity that is called the real-time local-pooling factor (R-LPF).
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks
TLDR
A number of new analytic results characterizing the performance limits of greedy maximal scheduling are provided, including an equivalent characterization of the efficiency ratio of GMS through a topological property called the local-pooling factor of the network graph.
On the Capacity Requirement of Largest-Deficit-First for Scheduling Real-Time Traffic in Wireless Networks
TLDR
The capacity requirement of a low-complexity scheduling policy, called largest-deficit-first (LDF), for achieving the same quality of service (QoS) as the optimal policy in networks with unit capacity is studied.
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
TLDR
This paper results in an optimal scheduling algorithm which fairly allocates data rates to all flows while meeting long-term delay demands and proves that under a simplified scenario the solution translates into a greedy strategy that makes optimal decisions with low complexity.
Scheduling Heterogeneous Real-Time Traffic over Fading Wireless Channels
TLDR
A general approach for designing scheduling policies for real-time traffic over wireless channels is developed, which allows the treatment of more realistic fading channels as well as scenarios with mobile nodes, and the usage of more general transmission strategies.
Scheduling Heterogeneous Real-Time Traffic Over Fading Wireless Channels
  • I.-Hong Hou
  • Computer Science
    IEEE/ACM Transactions on Networking
  • 2014
TLDR
A general approach for designing scheduling policies for real-time traffic over wireless channels is developed, which allows the treatment of more realistic fading channels as well as scenarios with mobile nodes and the usage of more general transmission strategies.
Delay optimal queue-based CSMA
TLDR
This paper proposes a CSMA algorithm with per-node average-delay bounded by a constant, independent of the network size, when the network has geometry (precisely, polynomial growth structure) that is present in any practical wireless network.
Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks With Elastic and Inelastic Traffic
TLDR
This paper proposes a model for incorporating the quality-of-service (QoS) requirements of packets with deadlines in the optimization framework and results in a joint congestion control and scheduling algorithm that fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows.
Randomized competitive algorithms for online buffer management in the adaptive adversary model
A Theory of QoS for Wireless
TLDR
A framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability is proposed and analytically prove the necessary and sufficient condition for a set of clients to be feasible with respect to the above three criteria.
...
1
2
3
...