Abstract
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. The solution to the problem results in a joint congestion control and scheduling algorithm that fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows and per-packet delay requirements of inelastic flows.
Original language | English (US) |
---|---|
Article number | 5680987 |
Pages (from-to) | 1125-1136 |
Number of pages | 12 |
Journal | IEEE/ACM Transactions on Networking |
Volume | 19 |
Issue number | 4 |
DOIs | |
State | Published - Aug 2011 |
Keywords
- Ad hoc networks
- best-effort traffic
- congestion control
- quality of service (QoS)
- real-time traffic
- scheduling
- wireless networks
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering