Skip to Main content Skip to Navigation
Journal articles

Scheduling links for heavy traffic on interfering routes in wireless mesh networks

Abstract : We propose 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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00683991
Contributor : Fabio Rocha Jimenez Vieira <>
Submitted on : Friday, March 30, 2012 - 12:57:27 PM
Last modification on : Friday, January 8, 2021 - 5:38:04 PM

Links full text

Identifiers

Citation

Fabio Rocha Jimenez Vieira, José Ferreira de Rezende, Valmir Carneiro Barbosa, Serge Fdida. Scheduling links for heavy traffic on interfering routes in wireless mesh networks. Computer Networks, Elsevier, 2012, 56 (5), pp.1584. ⟨10.1016/j.comnet.2012.01.011⟩. ⟨hal-00683991⟩

Share

Metrics

Record views

209