Skip to Main content Skip to Navigation
New interface
Journal articles

Local heuristic for the refinement of multi-path routing in wireless mesh networks

Abstract : 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 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 underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Fabio Rocha Jimenez Vieira Connect in order to contact the contributor
Submitted on : Monday, June 23, 2014 - 2:54:32 PM
Last modification on : Sunday, June 26, 2022 - 9:44:47 AM

Links full text



Fabio Rocha Jimenez Vieira, José Ferreira de Rezende, Valmir C. Barbosa, Serge Fdida. Local heuristic for the refinement of multi-path routing in wireless mesh networks. Computer Networks, 2013, 57 (1), ⟨10.1016/j.comnet.2012.09.009⟩. ⟨hal-00683994⟩



Record views