TY - GEN
T1 - Low-complexity distributed scheduling algorithms for wireless networks
AU - Gupta, Abhinav
AU - Lin, Xiaojun
AU - Srikant, R.
PY - 2007
Y1 - 2007
N2 - We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules, but which require low complexity due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queue-length information in its neighborhood, and its complexity is independent of the size and topology of the network. The second algorithm is presented for the node-exclusive interference model, does not require nodes to collect queue-length information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network.
AB - We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules, but which require low complexity due to the fact that they do not necessarily attempt to find maximal schedules. The first algorithm requires each link to collect local queue-length information in its neighborhood, and its complexity is independent of the size and topology of the network. The second algorithm is presented for the node-exclusive interference model, does not require nodes to collect queue-length information even in their local neighborhoods, and its complexity depends only on the maximum node degree in the network.
UR - http://www.scopus.com/inward/record.url?scp=34548317470&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548317470&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2007.191
DO - 10.1109/INFCOM.2007.191
M3 - Conference contribution
AN - SCOPUS:34548317470
SN - 1424410479
SN - 9781424410477
T3 - Proceedings - IEEE INFOCOM
SP - 1631
EP - 1639
BT - Proceedings - IEEE INFOCOM 2007
T2 - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
Y2 - 6 May 2007 through 12 May 2007
ER -