TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 14051

Algorithms for Wireless Communication

( Jan 26 – Jan 31, 2014 )

(Click in the middle of the image to enlarge)

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/14051

Organizers

Contact


Motivation

The last decades have seen an ever growing interest in wireless communication networks and their applications. Wireless networks pose many algorithmic challenges for various reasons: Realistic wireless signal propagation and interference models are very complex and therefore hard to use in rigorous algorithmic research, and this is further complicated by emerging technologies such as MIMO. Also, reasonable models for the dynamics and mobility in these networks can be quite complex and are not yet well-understood. Furthermore, standard complexity measures such as time and space are not sufficient any more as energy consumption is also a critical aspect that cannot be neglected. Many protocols for wireless networks have already been proposed by the research community, but most of them have only been studied in simulations or analyzed using rather simple models. So there is doubt whether any of these protocols would actually work in practice.

The goal of the Dagstuhl Seminar is to bring together computer scientists of different back-grounds to review and discuss models and algorithmic approaches in order to obtain a better understanding of the capabilities and limitations of modern wireless networks and to come up with more realistic models and approaches for future research on wireless networks that may then be investigated in joint research projects.


Summary

The last decades have seen an ever growing interest in wireless communication networks and their applications. Wireless networks pose many algorithmic challenges for various reasons: Realistic wireless signal propagation and interference models are very complex and therefore hard to use in rigorous algorithmic research, and this is further complicated by emerging technologies such as MIMO (multiple-input and multiple-output). Also, reasonable models for the dynamics and mobility in these networks can be quite complex and are not yet well-understood. Furthermore, standard complexity measures such as time and space are not sufficient any more as energy consumption is also a critical aspect that cannot be neglected. Many protocols for wireless networks have already been proposed by the research community, but most of them have only been studied in simulations or analyzed using rather simple models. So there is doubt whether any of these protocols would actually work in practice.

The purpose of this Dagstuhl seminar was to bring together computer scientists of different backgrounds to review and discuss models and algorithmic approaches in order to obtain a better understanding of the capabilities and limitations of modern wireless networks and to come up with more realistic models and approaches for future research on wireless networks that may then be investigated in joint research projects. The mix of the participating people resulted in fruitful discussions and interesting information exchange. The structure of the seminar took advantage of these different backgrounds by focusing on themed talks and open discussions.

The program included an eclectic mix of algorithmic and systems perspectives, modeling issues and emerging networking techniques, and explorations of the limits and possibilities of fundamental problems.

Discussions of models ranged from simple graph-based communication and interference models, to stochastic models, adversarial interruptions and jamming, dynamic networks and uncertainty formulations, and variations and extensions of signal-strength models.

Presentations from the systems perspective included managing environmental factors affecting measurements, robust predictions of channel capacities, efficiency of backpressure routing, issues in emerging heterogeneous radio environmental contexts, and robots controlled via wireless communication.

New dimensions at different networking layers included MIMO, network coding, interference cancellation, directional antennas and cognitive radio networks.

Finally, new results were presented on various related classic problems including broadcast, local broadcast, game theory, coding, routing, positioning, and connectivity.

Copyright Guy Even, Magnús M. Halldórsson, Yvonne-Anne Pignolet, and Christian Scheideler

Participants
  • Eyjólfur Ingi Asgeirsson (Reykjavik University, IS) [dblp]
  • Marijke Bodlaender (Reykjavik University, IS) [dblp]
  • Johannes Dams (RWTH Aachen, DE) [dblp]
  • Michael Dinitz (Johns Hopkins University - Baltimore, US) [dblp]
  • Yuval Emek (Technion - Haifa, IL) [dblp]
  • Guy Even (Tel Aviv University, IL) [dblp]
  • Sándor Fekete (TU Braunschweig, DE) [dblp]
  • Fabian Fuchs (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Jie Gao (SUNY - Stony Brook, US) [dblp]
  • Seth Gilbert (National University of Singapore, SG) [dblp]
  • Martin Haenggi (University of Notre Dame, US) [dblp]
  • Bernhard Haeupler (Microsoft Corp. - Mountain View, US) [dblp]
  • Magnús M. Halldórsson (Reykjavik University, IS) [dblp]
  • Martin Hoefer (Universität des Saarlandes, DE) [dblp]
  • Stephan Holzer (MIT - Cambridge, US) [dblp]
  • Qiang-Sheng Hua (Tsinghua University - Beijing, CN) [dblp]
  • Thomas Janson (Universität Freiburg, DE) [dblp]
  • Tomasz Jurdzinski (University of Wroclaw, PL) [dblp]
  • Holger Karl (Universität Paderborn, DE) [dblp]
  • Matthew J. Katz (Ben Gurion University - Beer Sheva, IL) [dblp]
  • Thomas Kesselheim (Cornell University, US) [dblp]
  • Christian Konrad (Reykjavik University, IS) [dblp]
  • Bhaskar Krishnamachari (University of Southern California, US) [dblp]
  • Fabian Daniel Kuhn (Universität Freiburg, DE) [dblp]
  • Bodo Manthey (University of Twente, NL) [dblp]
  • Friedhelm Meyer auf der Heide (Universität Paderborn, DE) [dblp]
  • Calvin Newport (Georgetown University - Washington, US) [dblp]
  • Merav Parter (Weizmann Institute - Rehovot, IL) [dblp]
  • Marina Petrova (RWTH Aachen, DE) [dblp]
  • Yvonne-Anne Pignolet (ABB Corporate Research - Baden-Dättwil, CH) [dblp]
  • Dror Rawitz (Bar-Ilan University, IL) [dblp]
  • Kay Römer (TU Graz, AT) [dblp]
  • Adi Rosén (CNRS, FR & University Paris-Diderot, FR) [dblp]
  • Alexander Russell (University of Connecticut - Storrs, US) [dblp]
  • Christian Scheideler (Universität Paderborn, DE) [dblp]
  • Christian Schindelhauer (Universität Freiburg, DE) [dblp]
  • Ravi Sundaram (Northeastern University - Boston, US) [dblp]
  • Takeshi Tokuyama (Tohoku University - Sendai, JP) [dblp]
  • Roger Wattenhofer (ETH Zürich, CH) [dblp]

Classification
  • data structures / algorithms / complexity
  • mobile computing
  • networks

Keywords
  • distributed algorithms
  • wireless networks
  • wireless communication models