Throughput-Optimal Scheduling in Multihop Wireless Networks Without Per-Flow Information
In this paper, the authors consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Their goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although, the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous flows.