Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks
Lists
Only you see this
Abstract
We propose a new class of distributed scheduling policies for <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">hoc</i> wireless networks that can achieve provable capacity regions. Previously known scheduling policies that guarantee comparable capacity regions are either centralized or require 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., given a fixed approximation ratio and a bounded maximum node-degree of the network, the time needed for computing a new schedule is independent of the network size. Hence, they can be easily deployed in large networks.
BibTeX
@article{lin2009constant,
author = {Xiaojun Lin and Shahzada B. Rasool},
title = {{Constant-Time Distributed Scheduling Policies for <i>Ad Hoc</i> Wireless Networks}},
journal = {IEEE Transactions on Automatic Control},
year = {2009},
doi = {10.1109/tac.2008.2010888},
}Loading related content...