Scheduling nonuniform traffic in a packet-switching system with small propagation delay
IEEE/ACM Transactions on Networking (TON)
A simpler linear time 2/3 - ε approximation for maximum weight matching
Information Processing Letters
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
Proceedings of the 12th annual international conference on Mobile computing and networking
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Complexity in wireless scheduling: impact and tradeoffs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Performance of random medium access control, an asymptotic approach
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed energy aware cross-layer resource allocation in wireless networks
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
IEEE/ACM Transactions on Networking (TON)
Performance of random access scheduling schemes in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Queue back-pressure random access in multihop wireless networks: optimality and stability
IEEE Transactions on Information Theory
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Distributed throughput maximization in wireless networks via random power allocation
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Low-complexity distributed scheduling algorithms for wireless networks
IEEE/ACM Transactions on Networking (TON)
Control of wireless networks with rechargeable batteries
IEEE Transactions on Wireless Communications
Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implementing utility-optimal CSMA
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Joint random access and power selection for maximal throughput in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Making the case for random access scheduling in wireless multi-hop networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed coordination with deaf neighbors: efficient medium access for 60 GHz mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
An investigation on the nature of wireless scheduling
INFOCOM'10 Proceedings of the 29th conference on Information communications
Maximum weighted independent set of links under physical interference model
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Utilization-based dynamic scheduling algorithm for wireless mesh networks
EURASIP Journal on Wireless Communications and Networking
Channel, capacity, and flow assignment in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
On combining shortest-path and back-pressure routing over multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Achieving MAC-layer fairness in CSMA/CA networks
IEEE/ACM Transactions on Networking (TON)
End-to-end maxmin fairness in multihop wireless networks: Theory and protocol
Journal of Parallel and Distributed Computing
Mathematical and Computer Modelling: An International Journal
Cluster-based back-pressure routing algorithm
IEEE/ACM Transactions on Networking (TON)
Exploring the throughput boundaries of randomized schedulers in wireless networks
IEEE/ACM Transactions on Networking (TON)
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
FlashLinQ: a synchronous distributed scheduler for peer-to-peer ad hoc networks
IEEE/ACM Transactions on Networking (TON)
On the efficiency of CSMA-CA scheduling in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.06 |
This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized by integers k\geq 1. We show that algorithm k of our class achieves k/(k+2) of the capacity region, for every k\geq 1. . The algorithms have small and constant worst-case overheads: in particular, algorithm k generates a new schedule using (a) time less than 4k+2 round-trip times between neighboring nodes in the network, and (b) at most three control transmissions by any given node, for any k. 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 k explicitly captures the tradeoff between control overhead and scheduler throughput performance and provides a tuning knob protocol designers can use to harness this trade-off in practice.