A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels

Authors:
Arun Sridharan;C. Emre Koksal;Elif Uysal-Biyikoglu
Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 15
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
On the stability of input-queued switches with speed-up

IEEE/ACM Transactions on Networking (TON)
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the complexity of scheduling in 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)
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Distributed throughput maximization in wireless mesh networks via pre-partitioning

IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Wireless link scheduling under a graded SINR interference model

Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Longest-queue-first scheduling under SINR interference model

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Approximation algorithms for wireless link scheduling with SINR-based interference

IEEE/ACM Transactions on Networking (TON)
On optimal SINR-based scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Information-theoretic broadcast channels (BCs) and multiple-access channels (MACs) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node, respectively. In this paper, we address the problem of link scheduling in multihop wireless networks containing nodes with BC and MAC capabilities. We first propose an interference model that extends protocol interference models, originally designed for point-to-point channels, to include the possibility of BCs and MACs. Due to the high complexity of optimal link schedulers, we introduce the Multiuser Greedy Maximum Weight algorithm for link scheduling in multihop wireless networks containing BCs and MACs. Given a network graph, we develop new local pooling conditions and show that the performance of our algorithm can be fully characterized using the associated parameter, the multiuser local pooling factor. We provide examples of some network graphs, on which we apply local pooling conditions and derive the multiuser local pooling factor. We prove optimality of our algorithm in tree networks and show that the exploitation of BCs and MACs improve the throughput performance considerably in multihop wireless networks.