Optimal Gathering in Radio Networks : How to bring internet in villages

Jean-Claude Bermond
Projet Mascotte


Abstract:

We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most dT and there is no interference from other transmissions. One transmission interferes with the reception of another transmission if the sender of the first transmission is at distance dI or less from the receiver of the second transmission. In this lecture we study the case dT=1 and dI > 1 for paths and two-dimensional grid networks with unit time transmissions. We prove lower bounds on the number of rounds required and describe protocols that are quasi optimal (optimal in many cases for example for the grid and odd dI). This is joint work with many other people in the frame of the CRC CORSO project with France Telecom.



Retour au séminaire