Distributed link scheduling with constant overhead

Authors:
Loc X. Bui;Sujay Sanghavi;R. Srikant
Affiliations:
Airvana Inc., Chelmsford, MA;School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN;Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 9
Cited 4

Scheduling nonuniform traffic in a packet-switching system with small propagation delay

IEEE/ACM Transactions on Networking (TON)
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A simpler linear time 2/3 - ε approximation for maximum weight matching

Information Processing Letters
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
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
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On resource allocation in fading multiple-access channels-an efficient approximate projection approach

IEEE Transactions on Information Theory
Scheduling and channel assignment algorithm for IEEE 802.16 mesh networks using clique partitioning technique

Computer Communications
Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.06

Visualization

Abstract

This paper proposes a new class of simple, distributed algorithms for scheduling in multihop wireless networks under the primary interference model. The class is parameterized by integers k ≥ 1. We show that algorithm kof our class achieves k/(k + 2) of the capacity region, for every k ≥ 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 throughput performance and provides a tuning-knob protocol designers can use to harness this tradeoff in practice.