PUMA
Istituto di Informatica e Telematica     
Santi P., Maheshwari R., Resta G., Das S., Blough D. M. Wireless Link Scheduling under a Graded SINR Interference Model. In: FOWANC'09 - 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (New Orleans, Louisiana, USA, 18 May 2009). Proceedings, pp. 3 - 12. ACM, 2009.
 
 
Abstract
(English)
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
DOI: 10.1145/1540343.1540346
Subject Algorithms
Experimentation
Performance
Theory
C.2.1 Network Architecture and Design. Wireless communication


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional