Round weighting problem and gathering in radio networks with symmetrical interference

Jean-Claude Bermond 1 Cristiana Gomes Huiban 2 Patricio Reyes 3
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Liste complète des métadonnées
Contributor : Jean-Claude Bermond <>
Submitted on : Friday, December 2, 2016 - 12:34:01 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM




Jean-Claude Bermond, Cristiana Gomes Huiban, Patricio Reyes. Round weighting problem and gathering in radio networks with symmetrical interference. Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2016, 8 (2), 1650035 57 p. 〈〉. 〈10.1142/S179383091650035X〉. 〈hal-01407591〉



Record views