Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, August 03, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Peter Davies (University of Warwick)

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

The radio network model is a distributed computing model designed to capture networks of devices communicating wirelessly. One of the most fundamental communication tasks in such a network is broadcasting, where one device has a message of which it must inform the entire network. The time complexity of this problem was thought to have been settled in 2003, when algorithms matching the lower bound were found. However, this lower bound assumed “no spontaneous transmissions”, meaning that devices are not allowed to communicate before receiving the broadcast message.

A breakthrough work of Haeupler and Wajc last year showed that without this assumption, the lower bound could be beaten. We continue this line of work, improving the algorithmic running time further and extending the method to the problem of leader election, a more complex task often used to break network symmetry.

Based on joint work with Artur Czumaj.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login