Distributed Link Scheduling With Constant Overhead

Abstract

This paper proposes a new class of simple, distributed algorithms for scheduling in multihop wireless networks under the primary interference model. The class is parameterized by integers 1. We show that algorithm of our class achieves ( + 2) of the capacity region, for every 1. The algorithms have small and constant worst-case overheads. In particular, algorithm generates a new schedule using a) time less than 4 + 2 round-trip times between neighboring nodes in the network and b) at most three control transmissions by any given node for any . The control signals are explicitly specified and face the same interference effects as normal data transmissions. Our class of distributed wireless scheduling algorithms are the first ones guaranteed to achieve any fixed fraction of the capacity region while using small and constant overheads that do not scale with network size. The parameter explicitly captures the tradeoff between control overhead and throughput performance and provides a tuning-knob protocol designers can use to harness this tradeoff in practice.

Delay Stability of Back-Pressure Policies in the Presence of Heavy-Tailed Traffic

“…Also, notice that λ 3 > 1+λ 1 −2λ 2 /3, which implies that flow 3 is delay unstable according to Proposition 5. Figure 6 shows the FMS for the particular set of rates, and with initial condition one for queue (1,2) and zero for all other queues. The length of queue (3,1) becomes positive before the FMS drains, so Theorem 3 implies that traffic flow 3 is delay unstable, confirming the findings of Proposition 5.…”

“…A special case of the Back-Pressure-α policy has been considered by Bui et al [2], where all α-parameters take the same value. We note that their setting includes just lighttailed traffic and, additionally, the existence of congestion controllers.…”

Scheduled channel access using geographical classification

“…Considerable work has been reported on the establishment of efficient transmission schedules in a distributed manner taking into account the nodal traffic demands and attempting to limit the overhead incurred in the establishment of schedules that approach the optimum [5], [16]. However, none of the approaches reported to date are practical in wireless networks because of the extensive signaling they incur.…”

VCMA: Efficient channel access in wireless mesh networks using virtual coordinates

“…Considerable work has been reported on the establishment of efficient transmission schedules in a distributed manner taking into account the nodal traffic demands and attempting to limit the overhead incurred in the establishment of schedules that approach the optimum [13], [14]. However, none of the approaches reported to date are practical in wireless networks because of the extensive signaling they incur.…”