Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks

Abstract

We propose two new distributed scheduling policies for ad hoc wireless networks that can achieve provable capacity regions. Known scheduling policies that guarantee comparable capacity regions are either centralized or need computation time that increases with the size of the network. In contrast, the unique feature of the proposed distributed scheduling policies is that they are constant-time policies, i.e., the time needed for computing a schedule is independent of the network size. Hence, they can be easily deployed in large networks.

Delay Guarantees for Throughput-Optimal Wireless Link Scheduling

“…Subsequently, several policies have been shown to attain (in some cases, for specific topology classses and interference constraints), either the maximum throughput region [1], [5], [18], [21], [23], [24] or a guaranteed fraction thereof [2], [4], [13], [15], [26], while requiring lower computation time. However, whether these algorithms are able to provide low delay guarantees remains largely unknown.…”

Past queue length based low-overhead link scheduling in multi-beam wireless mesh networks

“…So a question of interest is: can we achieve full throughput with low overheads? Lin and Rasool, in [14], showed that close to 1/3 of the capacity region can be achieved with O(1) overhead, i.e., constant overhead. Gupta et al in [15], and Joo and Shroff in [16] built on this result in [14] and achieved close to 1/2 the capacity region with constant overhead.…”

“…Lin and Rasool, in [14], showed that close to 1/3 of the capacity region can be achieved with O(1) overhead, i.e., constant overhead. Gupta et al in [15], and Joo and Shroff in [16] built on this result in [14] and achieved close to 1/2 the capacity region with constant overhead. In [17], it has been shown that full throughput can be achieved with constant overhead when we consider a node exclusive spectrum sharing model for interference.…”

Stability-Based Topology Control in Wireless Mesh Networks

“…Lastly, distributed scheduling policies of complexity (1) O have been developed in [18,24,30]. These are known as constant time (CT) scheduling policies [17].…”

“…Therefore, in CT scheduling policies, frames can be wasted with some probability greater than zero. In [30], CT policies are proposed for the 1-hop and 2-hop interference models 11 . The efficiency ratios of these policies were improved in [18,24].…”