Program, Friday 29 July 2016, and talk slides

9:00 – 9:05 Opening words

9:00 – 9: 50* *R. Srikant, UIUC*: *

*Open Problems
in the Design of Distributed Algorithms for Wireless Networks*

9:50 – 10:40
Seth Gilbert, NUS:

*Collision
Resolution*

*–– Coffee ––*

11:10 – 12:00 Ouri Wolfson, UIC :

*Computation in Intelligent Transportation *

*––* Lunch *––*

13:00 – 13:50 Nancy Lynch, MIT :

*Abstractions for Wireless Networks*

13:50 – 14:40 Nitin Vaidya, UIUC :

Network-Aware Distributed Algorithms (How to make simple
things complicated)

*–– Coffee ––*

15:15 – 15:55 Calvin Newport, Georgetown :

Noisy
Distributed Computing

16:00 – 17:00 Open-ended discussion & brief
announcements

Abstracts

R.
Srikant, UIUC*: Open Problems in the Design of Distributed Algorithms for
Wireless Networks*

Interference between competing transmissions and the randomness in the channel quality are two characteristics of wireless networks which make the design of scheduling algorithms challenging. As a result, there is no direct wireless analog of well known scheduling policies that work well in wireline networks, such as round robin, earliest deadline first, and shortest remaining processing time first. This is true even if one is interested in designing centralized scheduling policies, but the problem becomes especially challenging in certain wireless networking applications where distributed algorithms are required. In this talk ,we will provide a survey of recent results and open problems on this topic.