An overview of tractable computation of optimal scheduling and routing in mesh networks

  • Authors:
  • Peng Wang;Stephan Bohacek

  • Affiliations:
  • University of Delaware;University of Delaware

  • Venue:
  • ACM SIGMETRICS Performance Evaluation Review
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Capacity optimization by optimizing transmission schedules of wireless networks has been an active area of research for at least 20 years. The challenge is that the space over which the optimization is performed is exponential in the number of links in the network. For example, in the simple SISO case where no power control is used and only one bitrate is available, the optimization must be performed over a space of size 2L where there are L links in the network. Thus, a brute force approach to this optimization is not possible for even moderate size networks of more than a few tens of links.