Low-complexity distributed scheduling algorithms for wireless networks

Authors:
Abhinav Gupta;Xiaojun Lin;R. Srikant
Affiliations:
Qualcomm, San Diego, CA and Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, IL;Center for Wireless Systems and Applications and School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN;Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2009

Citing 14
Cited 9

A fast and simple randomized parallel algorithm for maximal matching

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

IEEE/ACM Transactions on Networking (TON)
Bluetooth revealed: the insider's guide to an open specification for global wireless communication

Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
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
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
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Optimal backpressure routing for wireless networks with multi-receiver diversity

Ad Hoc Networks
Scheduling and performance limits of networks with constantly changing topology

IEEE Transactions on Information Theory
A tutorial on cross-layer optimization in 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

Distributed energy aware cross-layer resource allocation in wireless networks

WICON '07 Proceedings of the 3rd international conference on Wireless internet
On the stability of flow-aware CSMA

Performance Evaluation
Utilization-based dynamic scheduling algorithm for wireless mesh networks

EURASIP Journal on Wireless Communications and Networking
Thwarting inside jamming attacks on wireless broadcast communications

Proceedings of the fourth ACM conference on Wireless network security
A refined performance characterization of longest-queue-first policy in wireless networks

IEEE/ACM Transactions on Networking (TON)
Low-complexity scheduling for wireless networks

Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for throughput maximization in wireless networks with delay constraints

IEEE/ACM Transactions on Networking (TON)
Optimization Decomposition for Scheduling and System Configuration in Wireless Networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of designing distributed scheduling algorithms for wireless networks. We present two algorithms, both of which achieve throughput arbitrarily close to that of maximal schedules, but whose complexity is low due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queue-length information in its neighborhood, and its complexity is otherwise independent of the size and topology of the network. The second algorithm, presented for the node-exclusive interference model, does not require nodes to collect queue-length information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network.