Friday, August 22, 2008 |
| 8:20 am to 8:40 am |
Breakfast & Registration |
| 8:40 am to 8:50 am |
Opening Remarks: Michael Segal and Alexander Kesselman, Program Co-Chairs |
| 8:50 am to 9:50 am |
Keynote Address: Algorithmic Aspects of Radio Communication by Andrzej Pelc
|
| 9:50 am to 10:30 am |
Invited Talk I: Roger Wattenhofer Theory for Sensor Networks: What Is It Good For?
|
| 10:30 am to 10:50 am |
Break |
| 10:50 am to 11:50 am |
Session 1: Sensor Networks
-
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows by Zeev Nutov
- On the lifetime of randomly deployed sensor networks by Gruia Calinescu and Robert Ellis
- Scalable Medium Access Control for In-Network Data Aggregation by Jamie Macbeth and Majid Sarrafzadeh
|
| 11:50 am to 12:30 pm |
Invited Talk II: Shlomi Dolev Self-Stabilizing and Self-Organizing Mobile Networks |
| 12:30 pm to 2:00 pm |
Lunch Break |
| 2:00 pm to 2:40 pm |
Invited Talk III: Alessandro Panconesi Gossiping (via mobile?) in Social Networks |
2:40 pm to 3:40 pm |
Session 2: Wireless Networks I (Scheduling)
-
Local Broadcasting in the Physical Interference Model by Olga Goussevskaia, Thomas Moscibroda and Roger Wattenhofer
- Exact and Approximate Link Scheduling Algorithms under the Physical Interference Model by Qiang-Sheng Hua and Francis Lau
- Latency of Opportunistic Forwarding in Finite Regular Wireless Networks by Chi-Kin Chau and Prithwish Basu
|
| 3:40 pm to 4:00 pm |
Break |
| 4:00 pm to 5:20 pm |
Session 3: Wireless Networks II (Topology)
-
Symmetric Range Assignment with Disjoint MST Constraints by Eric Schmutz
- Distance Graphs: From Random Geometric Graphs to Bernoulli Graphs and Between by Chen Avin
-
Modelling Gateway Placement in Wireless Networks: Geometric k-Centres of Unit Disc Graphs by Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw and Lata Narayanan
- Local, Distributed Weighted Matching on General and Wireless Topologies by Tim Tieberg
|
|