Wireless link scheduling under a graded SINR interference model

Authors:
Paolo Santi;Ritesh Maheshwari;Giovanni Resta;Samir Das;Douglas M. Blough
Affiliations:
IIT-CNR, Pisa, Italy;Stony Brook University, Stony Brook, NY, USA;IIT-CNR, Pisa, Italy;Stony Brook University, Stony Brook, NY, USA;Georgia Institute of Technology, Atlanta, GA, USA
Venue:
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Year:
2009

Citing 9
Cited 6

Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks

Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
The SCREAM Approach for Efficient Distributed Scheduling with Physical Interference in Wireless Mesh Networks

ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
A measurement study of interference modeling and scheduling in low-power wireless networks

Proceedings of the 6th ACM conference on Embedded network sensor systems
The capacity of wireless networks

IEEE Transactions on Information Theory

Approximation algorithms for wireless link scheduling with SINR-based interference

IEEE/ACM Transactions on Networking (TON)
Partial interference and its performance impact on wireless multiple access networks

EURASIP Journal on Wireless Communications and Networking
Scheduling links for heavy traffic on interfering routes in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for wireless link scheduling with flexible data rates

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Connectivity and aggregation in multihop wireless networks

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we revisit the wireless link scheduling problem under a graded version of the SINR interference model. Unlike the traditional thresholded version of the SINR model, the graded SINR model allows use of "imperfect links", where communication is still possible, although with degraded performance (in terms of data rate or PRR). Throughput benefits when graded SINR model is used instead of thresholded SINR model to schedule transmissions have recently been shown in an experimental testbed. Here, we formally define the wireless link scheduling problem under the graded SINR model, where we impose an additional constraint on the minimum quality of the usable links, (expressed as an SNR threshold βQ). Then, we present an approximation algorithm for this problem, which is shown to be within a constant factor from optimal. We also present a more practical greedy algorithm, whose performance bounds are not known, but which is shown through simulation to have much better average performance than the approximation algorithm. Furthermore, we investigate, through both simulation and implementation on an experimental testbed, the tradeoff between the minimum link quality threshold βQ and the resulting network throughput.