Download now Free registration required
Interference and collisions greatly limit the throughput of mesh networks that use contention-based MAC protocols such as 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 paper presents a practical technique to compute optimal schedules. The resulting algorithm searches for a low dimensional optimization problem that has the same solution as the full problem. Such a low dimensional problem is shown to always exist.
- Format: PDF
- Size: 287.8 KB