Wireless link scheduling under a graded SINR interference model

Paolo Santi, Ritesh Maheshwari, Giovanni Resta, Samir Das, Douglas M. Blough
2009 Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing - FOWANC '09  
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
more » ... bed. 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.
doi:10.1145/1540343.1540346 fatcat:kir2sd4bcbh5lpkldhxz3uxnzm