|
MASCOTTE no longer exists => visit the new project-team
|
Date : | 15/04/08 |
Location : | Fermat Jaune |
We address with the problem of allocating bandwidth efficiently in a radio network where the traffic demands are directed towards a unique special node.
Due to the sharing property of the radio bandwidth, one has to schedule radio transmissions in order to avoid collisions. Thus, the interference model determines the set of possible simultaneous transmissions, called rounds. The problem is then, to find the good rounds in order to gather all the traffic.
We start dealing with a basic case: All the demand is concentrated in only one node and the rounds consist in matchings over the graph of the network. The case is faced using fractional coloring in cycles combined with primal/dual techniques in linear programming.