Scheduling in Mobile Ad Hoc Networks with Topology and Channel-State Uncertainty

—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiulas and Ephremides) require instantaneous network state (topology, queues-lengths, and fading channel-state) in order to make scheduling/routing decisions. However, such instantaneous network-wide (global) information is hard to come by in practice, especially when mobility induces a time-varying topology. With information delays and a lack of global network state, different mobile nodes have differing “views” of the network, thus inducing uncertainty and inconsistency across mobile nodes in their topology knowledge and network state information. In such a setting, we first characterize the through-optimal rate region and develop a back-pressure-like scheduling algorithm, which we show is throughput-optimal. Then, by partitioning the geographic region spatially into disjoint tiles, and sharing delayed to...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Lei Ying, Sanjay Shakkottai
• Keywords: Communications, INFOCOM 2009, Mobile Node, Network State, Network State Information