UCL workshop on graphs and networks

Two days workshop on graphs and networks

Day 1: October 23, 2006 (building Euler, UCL)

14h00 Optimization of wireless sensor networks
by Yannis Paschalidis, Center for Information and Systems Engineering, Boston University

For a variety of reasons (sensors are powered by batteries, have limited computational capabilities, operate in noisy environments, the wireless channel is unreliable) sensor networks are extremely resource constrained. Hence, aggressive optimization of network operations is not merely a desirable luxury but rather an indispensable necessity. In this talk I shall outline challenges to that end and review our recent system/network-level work in drastically increasing sensor network efficiency and enabling predictable performance. Illustrative outcomes of our work include: a novel RF-based localization system, a minimal energy routing algorithm with latency performance guarantees, and a TDMA-like transmission scheduling algorithm that can drastically improve throughput over existing approaches.

15h00 Principles of distributed hash tables for peer to peer systems
by Pierre Fraigniaud, Laboratoire de Recherche en Informatique, Université Paris Sud (Orsay)

This talk will describe the basic principles of Distributed Hash Tables for peer-to-peer file-sharing systems. It will briefly survey the several types of distributed hash tables proposed in the literature, and compare their main features.

Day 2: October 24, 2006 (at KULeuven, organized jointly with IAPV/22)
See http://www.inma.ucl.ac.be/IAPV/IAPDay.html for more details and registration

09h30 Interactome networks and human disease
by Marc Vidal, Harvard University,Francqui chair http://vidal.dfci.harvard.edu/

10h30 How to observe and control an agent in a colored network
by Vincent Blondel and Raphael Jungers, Université catholique de Louvain

11h20 Navigability of small world networks
by Pierre Fraigniaud, CNRS and Université Paris-Sud http://www.lri.fr/~pierre/

14h00 Consensus and disagreement on manifolds
by Rodolphe Sepulchre, Université de Liège

14h30 The emergence of clusters in a class of interconnected systems
by Dirk Aeyels and Filip De Smet, Universiteit Gent

15h00 Transductive inference for graph labeling
by Kristiaan Pelckmans, Katholieke Universiteit Leuven

15h50 Analytical methods for trust management in autonomic networks
by John Baras, University of Maryland ( http://www.isr.umd.edu/~baras/