On throughput optimality with delayed network-state information

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.