Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks

Free registration required

Executive Summary

This is by far the first paper considering joint optimization of link scheduling, routing and replication for Disruption-Tolerant Networks (DTNs). The optimization problems for resource allocation in DTNs are typically solved using dynamic programming which requires knowledge of future events such as meeting schedules and durations. This paper defines a new notion of optimality for DTNs, called snapshot optimality where nodes are not clairvoyant, i.e., cannot look ahead into future events, and thus decisions are made using only contemporarily available knowledge.

  • Format: PDF
  • Size: 1512.1 KB