Skip to Main content Skip to Navigation

Radio Mesh Networks and the Round Weighting Problem

Cristiana Gomes 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In this thesis, we address the joint routing and slot assignment problem between the routers and the gateways in a radio mesh access networks. We model the problem as a Round Weighting Problem (RWP) in which the objective is to minimize the overall period of slot activations providing enough capacity to satisfy the bandwidth requirements of the routers. Solving the full problem means generating an exponential set of simultaneous transmission rounds which is intractable even for small networks. To cope with this issue, we implement a mathematical multi-objective model to solve the problem using a column generation method. We observe that the bottleneck is usually located in a limited region around a gateway. We propose a method to obtain lower bounds (considering only a limited probable bottleneck region) and upper bounds for general graphs. Our methods are applied to grid graphs providing closed formulae for the case of uniform demands, and also optimal routing strategies considering non-uniform demands. Motivated by the results of the existence of a limited (bottleneck) region capable of representing the whole network, we consider a variant of the RWP dealing also with bandwidth allocation, but considering SINR conditions in a CDMA network. We give sufficient conditions for the whole network to be reduced to a single-hop around the gateway. It is due to the fact that the problem is convex under some conditions that are often met. We are interested in optimal solutions in which each flow going through a bottleneck receives a fair share of the available bandwidth.
Complete list of metadatas

Cited literature [50 references]  Display  Hide  Download
Contributor : Cristiana Gomes <>
Submitted on : Friday, January 22, 2010 - 7:30:06 PM
Last modification on : Monday, October 12, 2020 - 10:30:18 AM
Long-term archiving on: : Friday, June 18, 2010 - 1:20:30 AM


  • HAL Id : tel-00449856, version 1



Cristiana Gomes. Radio Mesh Networks and the Round Weighting Problem. Networking and Internet Architecture [cs.NI]. Université Nice Sophia Antipolis, 2009. English. ⟨tel-00449856⟩



Record views


Files downloads