Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

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

(1) , (1) , (1)
1

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.
Fichier principal
Vignette du fichier
INRIA_Report3.pdf (1.53 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00282200 , version 1 (26-05-2008)

Identifiers

  • HAL Id : inria-00282200 , version 1

Cite

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⟩
204 View
187 Download

Share

Gmail Facebook Twitter LinkedIn More