Douglas Leith, National University of Ireland

Location :

In the room of TREC Team
at l’ENS

Abstract :

This talk discusses a new class of channel 
allocation algorithms that are simple, robust and 
require no communication between interfering 
WLANs.  These algorithms are provably 
convergent and yet remarkably efficient under a 
wide range of network conditions and topologies.  
Using measurements of performance in a real 
office environment one interesting observation is 
that the interference between WLANs is generally 
channel dependent.

This means that a different  conflict graph is 
associated with each channel. This potentially has 
important implications as the behaviour of many 
proposed colouring-based algorithms for channel 
allocation is unclear in this context.

Host :

Ecole Normale Supérieure