Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty

Abstract

We determine a joint link activation and routing policy that maximizes the stable throughput region of time-varying wireless ad-hoc networks with multiple commodities. In practice, the state of the channel process from the time it is observed till the time a transmission actually takes place can be significantly different. With this in mind, we introduce a stationary policy that takes scheduling and routing decisions based on a possibly inaccurate estimate of the true channel state. We show optimality of this policy within a broad class of link activation processes. In particular, processes in this class may be induced by any policy, possibly non-stationary, even anticipative and aware of the entire sample paths, including the future, of the arrival, estimated and true channel state processes, as long as it has no knowledge on the current true channel state, besides that available through the estimated channel state.