Download Now Free registration required
Link scheduling is used in Wireless Mesh Networks (WMNs) to guarantee interference-free transmission on the shared wireless medium in a time division multiple access approach. Several papers in the literature address the problem of link scheduling guaranteeing a minimum throughput to the flows traversing the WMN. However, none of the existing works address the problem of computing a schedule that guarantees that pre-specified end-to-end delay constraints are met. In this paper, the authors make a first step forward in this direction by defining a link scheduling algorithm that works in sink-tree WMNs, i.e. those whose traffic is routed towards a common sink (i.e. the Internet gateway).
- Format: PDF
- Size: 1669.12 KB