Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Distributed Fair Scheduling in a Wireless LAN
IEEE Transactions on Mobile Computing
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A robust PTAS for maximum weight independent sets in unit disk graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
This paper presents novel distributed algorithms for scheduling transmissions in multi-hop wireless networks. Our algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. Two classes of algorithms are designed: one assumes that the location information of all wireless nodes are known, and the other does not. Both classes of algorithms are parameterized by an integer k (called algorithm-k). We show that algorithm-k that uses geometry location achieves (1 - 2/k)2 of the capacity region, for every k ≥ 3; algorithm-k which does not use geometry location achieves 1/ρ of the capacity region, for every k ≥ 3 and a constant ρ depending on k. Our algorithms have small worst-case overheads. Both classes of algorithms can generate a new schedule by requiring communications within Θ(k) hops for every node, which can be implemented by letting each node transmit at most O(k) messages. The parameter k explicitly captures the tradeoff between control overhead and the throughput performance of any scheduler. Additionally, the class of algorithms with known geometry location of nodes can find a new schedule in time Θ(k2 Δ), where Δ is the minimum mini-time-slots such that each of the n nodes can communicate with its neighbors once, which is the minimum time-slots required by any scheduling algorithm.