Encounter-based Routing in Disaster Recovery Networks

Submitted by snelson on Mon, 09/28/2009 - 20:17
TitleEncounter-based Routing in Disaster Recovery Networks
Publication TypeThesis
Year of Publication2008
AuthorsNelson, S. C.
AdvisorKravets, R.
Academic DepartmentComputer Science
DegreeMS
Date Published01/2008
UniversityUniversity of Illinois at Urbana-Champaign
AbstractThe proliferation of wireless networking technology in a wide variety of devices allows for networks to exist in challenged environments where connectivity is intermittent. Networks capable of delivering data under such conditions are called delay or disruption tolerant networks (DTNs). A promenent example of a DTN is a disaster recovery network, in which emergency responders must be able to communicate even in complete infrastructure failure. Current work in routing protocols for these networks leverages epidemic-style algorithms that trade off injecting many copies of messages into the network for increased probability of message delivery. However, such techniques can cause a large amount of contention in the network, increase overall delays, and drain each mobile node’s limited battery supply. We present a new DTN routing algorithm, called Encounter-Based Routing (EBR), which maximizes delivery ratios while minimizing overhead and delay. Furthermore, we present a means of securing EBR against black hole denial-of-service attacks. To properly evaluate EBR, we develop an event-driven, role-based mobility model for disaster recovery networks that highlights several high-level characteristics of this environment. We then evaluate EBR against many of the best current DTN protocols showing substantial improvements in common metrics as well as three composite metrics that more effectively describe the quality of DTN routing algorithms.
Full Text

 
AttachmentSize
PDF533.63 KB