Routing on Delay Tolerant Sensor Networks

Free registration required

Executive Summary

Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs. The authors present experimental evidence showing that considering multiple (possibly not shortest) paths instead of one fixed (greedy) path can decrease the expected time to deliver a packet on such a network by as much as 65 per cent depending on the probability that an edge exists in a given time interval. They provide theoretical justification for this result by studying a special case of the Markovian evolving grid graph.

  • Format: PDF
  • Size: 532.9 KB