Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning


Several policies have recently been proposed for attaining the maximum throughput region, or a guaranteed fraction thereof, through dynamic link scheduling. Among these policies, the ones that attain the maximum throughput region require a computation time which is linear in the network size, and the ones that require constant or logarithmic computation… (More)
DOI: 10.1109/TAC.2008.2006820



Citations per Year

54 Citations

Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics