An overview of tractable computation of optimal scheduling and routing in mesh networks
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 2 L 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.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Sep 01, 2007
- Source ID
- 10.1145/1330555.1330564
Entities
People
- Peng Wang
- Stephan Bohacek
Organizations
- United States Army Research Laboratory
- University of Delaware