The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Information Theory of Wireless Networks: Approximate Max-Flow Min-Cut

Tse, D (UC, Berkeley)
Thursday 14 January 2010, 11:00-12:00

Seminar Room 1, Newton Institute


A 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.


The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧