Since dynamic wireless networks evolve over time, optimal routing computations need to be performed frequently on time-varying network topologies. However, it is often infeasible or expensive to gather the current state of links for the entire network all the time. We provide a thorough analytical characterization of the effect of various link-state sampling strategies operating under a limited sampling budget on the performance of the minimum-latency routing policy in a special class of dynamic networks. We show that for a two-state Markov link-dynamics model parameterized by probabilities p, q, if links are more likely to turn on than off at each time instant (p > q), a “depth-first” sampling strategy is optimal, whereas a “breadth-first” sampling strategy is optimal if links are more likely to turn off than on (p < q)—under the Cut Through (CuT) latency model, i.e., when the packet-forwarding latency is negligible compared to the time scale of the link dynamics. We precisely characterize the optimal-latency spatial-sampling schedules for one-shot interrogation. We also present numerical simulation results on comparing various spatio-temporal sampling schedules under an overall sampling rate constraint, and initial results on comparisons of optimal schedules under a Store-and-Advance (SoA) packet-forwarding latency model.
[1]
Baruch Schieber,et al.
The Canadian Traveller Problem
,
1991,
SODA '91.
[2]
David R. Karger,et al.
Route Planning under Uncertainty: The Canadian Traveller Problem
,
2008,
AAAI.
[3]
Dennis Goeckel,et al.
A Markov chain model for coarse timescale channel variation in an 802.16e wireless network
,
2011,
2012 Proceedings IEEE INFOCOM.
[4]
Ram Ramanathan,et al.
Making link-state routing scale for ad hoc networks
,
2001,
MobiHoc '01.
[5]
Sergio Verdu,et al.
Fixed-length lossy compression in the finite blocklength regime: Gaussian source
,
2011,
ITW.
[6]
Vladislav Rutenburg,et al.
Minimum-expected-delay alternate routing
,
1992,
[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[7]
John N. Tsitsiklis,et al.
Stochastic shortest path problems with recourse
,
1996,
Networks.