Skip to Main content Skip to Navigation
New interface

Link scheduling and multi-path routing in wireless mesh networks

Fabio Rocha Jimenez Vieira 1 
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We present algorithmic solutions for two problems related to the wireless network interference. The first one proposes to schedule the links of a given set of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol provides a background of synchronized time slots and seek to schedule the routes' links to maximize the number of packets that get delivered to their destinations per time slot. Our approach is to construct an undirected graph G and to heuristically obtain node multicolorings for G that can be turned into efficient link schedules. In G each node represents a link to be scheduled and the edges are set up to represent every possible interference for any given set of interference assumptions. We present two multicoloring-based heuristics and study their performance through extensive simulations. One of the two heuristics is based on relaxing the notion of a node multicoloring by dynamically exploiting the availability of communication opportunities that would otherwise be wasted. We have found that, as a consequence, its performance is significantly superior to the other's. In the second proposal, we consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther in the network than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR as well as their multi-path variants as the underlying routing method. For one TDMA setting running a path-oriented link scheduling algorithm and two different CSMA settings (802.11 protocol), we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern.
Complete list of metadata

Cited literature [76 references]  Display  Hide  Download
Contributor : Fabio Rocha Jimenez Vieira Connect in order to contact the contributor
Submitted on : Friday, March 30, 2012 - 12:40:26 PM
Last modification on : Sunday, June 26, 2022 - 9:44:46 AM
Long-term archiving on: : Wednesday, December 14, 2016 - 6:53:55 PM


  • HAL Id : tel-00683986, version 1


Fabio Rocha Jimenez Vieira. Link scheduling and multi-path routing in wireless mesh networks. Networking and Internet Architecture [cs.NI]. Université Pierre et Marie Curie - Paris VI, 2012. English. ⟨NNT : ⟩. ⟨tel-00683986⟩



Record views


Files downloads