| Speaker : | Peter Marbach |
| University of Toronto | |
| Date: | 21/01/2015 |
| Time: | 2:00 pm - 3:00 pm |
| Location: | LINCS Meeting Room 40 |
Abstract
One vision for wireless networks has been the creation of wireless multihop networks that are formed and operate in a fully decentralized manner using cheap commodity hardware. One of the main challenges to achieve this vision is the design of scheduling protocols for data transmissions that are throughput and delay optimal, and can be implemented in a fully distributed manner.In the talk, we present results that provide a new perspective on the design of distributed scheduling algorithms. In particular, our results suggest that it is possible to create protocols that throughput and delay order-optimal, and can be implemented in a fully distributed manner. We will first discuss the intuition behind the performance limitations of traditional distributed scheduling protocols, and present the main idea behind our approach. We will then provide a more detail discussion of our results as well as future work.An interesting aspect of the work is that the underlying mathematical models and results may be of independent interest and might be applicable to more general combinatorial optimization problem.