Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 1258-1263
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 networksKeywords
This publication has 14 references indexed in Scilit:
- Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks2006
- A linear-time approximation algorithm for weighted matchings in graphsACM Transactions on Algorithms, 2005
- End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks2004
- Dynamic power allocation and routing for time varying wireless networks2004
- Stable scheduling policies for broadcast channels2003
- The throughput of data switches with and without speedup2002
- On the stability of input-queued switches with speed-upIEEE/ACM Transactions on Networking, 2001
- On the Distributed Complexity of Computing Maximal MatchingsSIAM Journal on Discrete Mathematics, 2001
- On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit ModelsThe Annals of Applied Probability, 1995
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988