Record Details

Throughput and fairness guarantees through maximal scheduling in wireless networks

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Throughput and fairness guarantees through maximal scheduling in wireless networks
 
Creator CHAPORKAR, PRASANNA
KAR, KOUSHIK
XIANG LUO
SARKAR, SASWATI
 
Subject information theory
scheduling
throughput
topology
transceivers
 
Description The question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time, is addressed in this paper. It is shown that a simple distributed scheduling strategy, maximal scheduling, attains a guaranteed fraction of the maximum throughput region in arbitrary wireless networks. The guaranteed fraction depends on the ldquointerference degreerdquo of the network, which is the maximum number of transmitter-receiver pairs that interfere with any given transmitter-receiver pair in the network and do not interfere with each other. Depending on the nature of communication, the transmission powers and the propagation models, the guaranteed fraction can be lower-bounded by the maximum link degrees in the underlying topology, or even by constants that are independent of the topology. The guarantees are tight in that they cannot be improved any further with maximal scheduling. The results can be generalized to end-to-end multihop sessions. Finally, enhancements to maximal scheduling that can guarantee fairness of rate allocation among different sessions, are discussed.
 
Publisher IEEE
 
Date 2009-01-12T11:57:59Z
2011-11-25T16:28:50Z
2011-12-26T13:05:31Z
2011-12-27T05:52:38Z
2009-01-12T11:57:59Z
2011-11-25T16:28:50Z
2011-12-26T13:05:31Z
2011-12-27T05:52:38Z
2008
 
Type Article
 
Identifier IEEE Transactions on Information Theory 54 (2), 572-594
0018-9448
http://dx.doi.org/10.1109/TIT.2007.913537
http://hdl.handle.net/10054/556
http://dspace.library.iitb.ac.in/xmlui/handle/10054/556
 
Language en