PreDA: Predicate Routing for DTN Architectures over MANET
MetadataShow full item record
CitationEsposito, Flavio; Matta, Ibrahim. "PreDA: Predicate Routing for DTN Architectures over MANET", Technical Report BUCS-TR-2009-012, Computer Science Department, Boston University, April 3, 2009. [Available from: http://hdl.handle.net/2144/1736]
We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how “content” should be routed. For example, content can be directed through an intermediary DTN node for the purposes of preprocessing, authentication, etc., or content from a malicious MANET node can be dropped. To support such content routing at the DTN level, we implement Predicate Routing  where high-level constraints of DTN nodes are mapped into low-level routing predicates within the MANET nodes. Our testbed  uses a Linux system architecture with User Mode Linux  to emulate every DTN node with a DTN Reference Implementation code . In our initial architecture prototype, we use the On Demand Distance Vector (AODV) routing protocol at the MANET level. We use the network simulator ns-2 (ns-emulation version) to simulate the wireless connectivity of both DTN and MANET nodes. Preliminary results show the efficient and correct operation of propagating routing predicates. For the application of content re-routing through an intermediary, as a side effect, results demonstrate the performance benefit of content re-routing that dynamically (on-demand) breaks the underlying end-to-end TCP connections into shorter-length TCP connections.