This paper studies the problem of scheduling in single-hop wireless networks
with real-time traffic, where every packet arrival has an associated deadline
and a minimum fraction of packets must be transmitted before the end of the
deadline. Using optimization and stochastic network theory we propose a
framework to model the quality of service (QoS) requirements under delay
constraints. The model allows for fairly general arrival models with
heterogeneous constraints.
This paper studies the problem of congestion control and scheduling in ad hoc
wireless networks that have to support a mixture of best-effort and real-time
traffic. Optimization and stochastic network theory have been successful in
designing architectures for fair resource allocation to meet long-term
throughput demands. However, to the best of our knowledge, strict packet delay
deadlines were not considered in this framework previously. In this paper, we
propose a model for incorporating the quality of service (QoS) requirements of
packets with deadlines in the optimization framework.