Surprisingly little is known about the algorithmic complexity and efficiency of wireless networks, despite their near omnipresence. Fundamental questions such as how much wireless communication is possible simultaneously are still yet to be resolved. Many of the answers depend on the wireless transmission model. Past algorithmic research has largely focused on graph-based models, which have been shown to be inefficient and/or unrealistic, both theoretically and experimentally. In contrast, research in communication, or network theory has centered on more realistic model, such as the signal-to-interference-plus-noise (SINR) model, but primarly using experimental and heuristic approaches that give limited insights into the complexity of the communication problems.
This workshop has been initiated to create a concerted effort to better understand the fundamental algorithmic properties of wireless communication. The aim is to bring together researchers from different areas and disciplines to approach these questions in a new way, as well as to introduce these emerging topics to young researchers.
Prospective participants are directed to contact the workshop organizers early. Please indicate if you wish to give a presentation. A schedule will be posted by May 20, 2010.
The workshop will be structured as a problem-solving event, with several selected talks and short recent contributions interspersed with ample time for discussions.
There will be no formal proceedings, but a booklet of abstracts will be distributed on site.
Roger Wattenhofer (ETH Zurich)