Magnús M. Halldórsson: Models for wireless algorithms
Time: Mon 2014-05-12 12.10 - 13.00
Location: Room 4523, Lindstedsvägen 5, KTH CSC
Participating: Magnús M. Halldórsson, Reykjavik University
Practicalities
Lunch is served at 12:00 noon (register at this doodle by Sunday May 11 at 8 pm). The presentation starts at 12:10 pm and ends at 1 pm. Those of us who wish reconvene after a short break for ca two hours of more technical discussions.
Abstract
The design and analysis of algorithms requires appropriate models — models that capture reality, yet are algorithmically usable; general, yet analyzable. The wireless setting has proved most challenging in this regard.
We survey some of the recent progress on fundamental problems in the SINR (or physical) model, including link capacity and scheduling, aggregation, and the relative value of power control.
The basic SINR model, however, still makes unrealistic assumptions that hold only in idealistic situations. We outline how to allow for arbitrary static environments while maintaining comparable performance guarantees with what holds in the basic SINR model. We might therefore be approaching an algorithmic model that captures reality with high fidelity while maintaining generality and analytic feasibility.