TY - GEN
T1 - On throughput optimality with delayed network-state information
AU - Ying, Lei
AU - Shakkottai, Sanjay
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.
AB - We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.
UR - http://www.scopus.com/inward/record.url?scp=52949129138&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52949129138&partnerID=8YFLogxK
U2 - 10.1109/ITA.2008.4601070
DO - 10.1109/ITA.2008.4601070
M3 - Conference contribution
AN - SCOPUS:52949129138
SN - 1424426707
SN - 9781424426706
T3 - 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA
SP - 339
EP - 344
BT - 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA
T2 - 2008 Information Theory and Applications Workshop - ITA
Y2 - 27 January 2008 through 1 February 2008
ER -