Throughput-Optimal Scheduling in Multi-Hop Wireless Networks Without Per-Flow Information

This paper focuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, for multi-hop wireless networks under general interference constraints. Although the celebrated backpressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and results in poor delay performance in certain scenarios. In contrast, the proposed schemes can circumvent these drawbacks while guaranteeing throughput optimality.

Provided by: Ohio State University Topic: Mobility Date Added: Jul 2011 Format: PDF

Find By Topic