A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks With Order-Optimal Per-Flow Delay
Source: Purdue University
The joint congestion control and scheduling problem in multi-hop wireless networks has been extensively studied in the literature. Often, each user is associated with a non-decreasing and concave utility function of its rate, and a cross-layer utility maximization problem is formulated to maximize the total system utility subject to the constraint that the rate vector can be supported by some scheduling algorithm. One optimal solution to this problem is known to be the max weight back-pressure scheduling algorithm combined with a congestion control component at the source. Further, significant progresses have been made in designing distributed scheduling algorithms with provable throughput and lower complexity than the back-pressure algorithm.