This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow  information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow  information (which may be difficult to obtain and maintain), maintains per-flow (or per-destination) queues at each node, relies on constant exchange of queue length information among neighboring nodes to calculate link weights, and may result in poor delay performance  . In contrast, the proposed schemes can circumvent these drawbacks while guaranteeing throughput optimality. We rigorously analyze the throughput performance of the proposed schemes and show that they are throughput-optimal using fluid limit techniques via an inductive argument  . We also conduct simulations to show that the proposed schemes can substantially improve the delay performance.
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, exploit only local information, for multi-hop wireless networks under general interference constraints. Although the celebrated back-pressure 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. We rigorously analyze the performance of the proposed schemes using fluid limit techniques via an inductive argument and show that they are throughput-optimal . We also conduct simulations to show that the proposed schemes can substantially improve the delay performance.
D
and analyzing
R
the use of
using
A
or per-destination
R
one
a
D
and potentially improve the delay performance,
A
or per-destination
R
per-flow (or per-destination) queues
complex data structure
R
to calculate link weights, and may result
, and results
A
in certain scenarios
D
throughput
D
and show that they are throughput-optimal
A
and show that they are throughput-optimal