Abstract : In this article we consider the problem of gathering information in
a gateway in a radio mesh access network. Due to interferences,
calls (transmissions) cannot be performed simultaneously. This leads
us to define a round as a set of non-interfering calls.
Following the work of Klasing, Morales and Pérennes, we model the
problem as a Round Weighting Problem (RWP) in which the objective is
to minimize the overall period of non-interfering calls activations
(total number of rounds) providing enough capacity to satisfy the
throughput demand of the nodes.
We develop tools to obtain lower and upper bounds for general graphs. Then, more precise results are obtained considering a symmetric interference model based on distance of graphs, called the distance-d interference model (the particular case d= 1 corresponds to the primary node model).
We apply the presented tools to get lower bounds for grids with the
gateway either in the middle or in the corner. We obtain upper bounds
which in most of the cases match the lower bounds, using strategies
that either route the demand of a single node or
route simultaneously flow from several source nodes. Therefore, we
obtain exact and constructive results for grids, in particular
for the case of uniform demands answering a problem asked by Klasing, Morales and Pérennes.