Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks

Cristiana Gomes 1, * Stéphane Pérennes 1 Hervé Rivano 1
* Auteur correspondant
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless network. As we deal with a multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation of the problem that computes joint routing and scheduling. We use a branch-and-price algorithm to solve optimally the problem. A column generation algorithm is used to cope with the exponential set of rounds. The branch-and-bound algorithm provides mono-routing. We run experiments on networks from the literature, with different number of gateways. Experimental results as well as theoretical insights let us conjecture that the bottleneck region analysis is enough to find the optimal solution. The bottleneck is usually the gateway considering almost uniform traffic. The \emph{integer round-up property} (IRUP) seems to hold for our problem.
Type de document :
Rapport
[Research Report] 2008, pp.11
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00282200
Contributeur : Cristiana Gomes <>
Soumis le : lundi 26 mai 2008 - 16:29:44
Dernière modification le : samedi 17 septembre 2016 - 01:35:09
Document(s) archivé(s) le : vendredi 28 mai 2010 - 18:24:19

Fichiers

INRIA_Report3.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00282200, version 1

Collections

Citation

Cristiana Gomes, Stéphane Pérennes, Hervé Rivano. Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks. [Research Report] 2008, pp.11. 〈inria-00282200〉

Partager

Métriques

Consultations de
la notice

273

Téléchargements du document

184