|
Evènement pour le groupe Algorithmique Distribuée
Date | 2013-02-11 14:00-15:00 |
Titre | Bounds for Communication in Wireless Grids |
Résumé | In a wireless network, a transmission can be received by a node if it is
close enough to the sender. However, transmissions can interfere with
each other and the interference distance is typically greater than the
reception distance. Efficient communication protocols in these networks
minimize the time to move information without interference.
In this talk, I will describe optimal protocols for the problem of collecting
information into a central node of a two-dimensional square or hexagonal
grid graph. The optimality of the protocols is proved using a new lower
bound technique that is an adaptation to a discrete environment of a
method based on linear programming duality for continuous flows.
This is joint work with Jean-Claude Bermond, CNRS-INRIA-University of Nice. |
Lieu | Salle 178 |
Orateur | Joseph Peters (Simon Fraser University) |
Url | School of Computing Science, Simon Fraser University |
Aucun document lié à cet événement. RetourRetour à l'index
| |