1. Cross-layer DTN Task Scheduling in Disaster Recovery
PJ Dillon
University of Pittsburgh
Department of Computer Science
10/7/2008

2. Background Familiar with traditional MANETs
Assume end-to-end path of contemporaneous links
Often not available
Delay Tolerant Architecture offer store, carry, and forward delivery service
Intermediate nodes hold messages until links become available
Can physically move a message
Now called Delay Tolerant Mobile Networks (DTMNs)

3. Project Scenario Network consists of n nodes Leader: Tasks have
Split in multiple partitions
One node designated the leader
Leader:
Knows approximate position of all nodes
sends tasks to other nodes
Tasks have
Execution time
Deadline
Location
Nodes move only in response to assigned task

4. Previous Work Sherif Khattab et al. considered this scenario below
Two partitions separated by some distance
Need to send tasks to nodes in other partition
Send courier nodes to traverse distance
How best to schedule couriers to meet deadlines and save energy?

5. Add a Highway Obstacles separate the partitions
Couriers can’t traverse it
A road with WiFi capable cars runs adjacent to partitions
Can carry messages between the partitions

6. Hypothesis How well do DTN routing protocols work in this scenario?
Epidemic Routing, Spray-and-Wait, Virtual Repositories, Coverage-based Probabilistic Forwarding
Use dedicated couriers
Which contributes to the best probability of meeting deadlines?