Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

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

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 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 Integer Round-Up Property (IRUP) seems to hold for our problem., OPTx-editorial-board=yes, OPTx-proceedings=yes, OPTx-international-audience=yes
Fichier principal
Vignette du fichier
GPR08b.pdf (363.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00371144 , version 1 (26-03-2009)

Identifiers

  • HAL Id : hal-00371144 , version 1

Cite

Cristiana Gomes, Stéphane Pérennes, Hervé Rivano. Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks. 4th IEEE Workshop on Broadband Wireless Access (BWA), Dec 2008, New-Orleans, US, France. ⟨hal-00371144⟩
161 View
143 Download

Share

Gmail Facebook Twitter LinkedIn More