This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE/ACM TRANSACTIONS ON NETWORKING 1 Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks With

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 sto-chastic network theory have been successful in designing architec-tures for fair resource allocation to meet long-term throughput de-mands. 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-ser-vice (QoS) requirements of packets with deadlines in the optimiza-tion framework. The solution to the problem results in a joint con-gestion control and scheduling algorithm that fairly allocates re-sources to meet the fairness objectives of both elastic and inelastic flows and per-packet delay requirements of inelastic flows. Index Terms—Ad hoc networks, best-effort traffic, congestion control, quality of service (QoS), real-time traffic, scheduling, wireless networks. I