#### Filter Results:

#### Publication Year

2007

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the capacity of the network. However, since the typical approach to this problem requires optimizing over a space that is exponential in the number of links, the problem has appeared to be… (More)

There has been extensive research focused on maximizing the throughput of wireless networks in general and mesh networks in particular. Recently, techniques have been developed that reliably compute the maximum throughput of mesh networks. However, different approaches to throughput optimization make different assumptions on the physical layer's abilities.… (More)

It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Consequently, it is widely believed that optimal scheduling cannot be solved in practical networks. However , there are many cases where there is a significant difference between… (More)

Interference and collisions greatly limit the throughput of mesh networks that use contention-based MAC protocols such as IEEE 802.11. Significantly higher throughput is achievable if transmissions are scheduled. However, traditional methods to compute optimal schedules are computationally intractable (unless co-channel interference is neglected). This… (More)

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… (More)

In the networking research literature, the problem of network utility optimization is often converted to the dual problem which, due to nondifferentiability, is solved with a particular subgradient technique. This technique is not an ascent scheme, hence each iteration does not necessarily improve the value of the dual function. This paper examines the… (More)

- ‹
- 1
- ›