Information Theory of Wireless Networks: Approximate Max-Flow Min-Cut
Seminar Room 1, Newton Institute
AbstractA holy grail of information theory is to extend Shannon's original point-to-point results to wireless networks. Despite significant efforts in the past 40 years, progress has been slow. Unlike wired networks, signals from different nodes interact in a complex way in wireless channels in addition to noise. We discuss a recent approach based on approximating the noisy wireless channels by deterministic ones while capturing the signal interactions. In the case of single source and single destination, we use this approach to prove an approximate max-flow min-cut theorem for wireless networks.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.