|Stochastic Systems Group|
Distributed Link Scheduling with Constant Overhead
In this work we look at the problem of scheduling transmissions in wireless networks with interference. Each network has an associated fundamental capacity region, which represents the highest possible data rates that can be sustained given the interference pattern.
There has been a lot of work in designing distributed algorithms that achieve this capacity region. However, all these algorithms have overheads that grow with network size, a property that limits their practical value.
In our work we develop a class of algorithms that have CONSTANT overheads and can achieve any apriori fixed FRACTION of the capacity region. The complexity of our algorithms is independent of network size but grows with the fraction the algorithm is intended to capture.
Joint work with Loc Bui and R. Srikant, UIUC.
Problems with this site should be emailed to firstname.lastname@example.org