vix.ing · top · new · best · stats · spec

Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks with Elastic and Inelastic Traffic

2009/07/30 by Juan José Jaramillo, Jaramillo, Juan Jose, R. Srikant +1
Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI)

paper · pdf · doi:10.48550/arxiv.0907.5402

openalex publication_date 2009/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and per-packet delay requirements of inelastic flows.

Related