Supporting Predicate Routing in DTN over MANET
Data(s) |
20/10/2011
20/10/2011
10/07/2008
|
---|---|
Resumo |
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 may be diverted through an intermediary DTN node for the purposes of preprocessing, authentication, etc. To support such capability, we implement Predicate Routing [7] where high-level constraints of DTN nodes are mapped into low-level routing predicates at the MANET level. Our testbed uses a Linux system architecture and leverages User Mode Linux [2] to emulate every node running a DTN Reference Implementation code [5]. In our initial prototype, we use the On Demand Distance Vector (AODV) MANET routing protocol. We use the network simulator ns-2 (ns-emulation version) to simulate the mobility and wireless connectivity of both DTN and MANET nodes. We show preliminary throughput results showing the efficient and correct operation of propagating routing predicates, and as a side effect, the performance benefit of content re-routing that dynamically (on-demand) breaks the underlying end-to-end TCP connection into shorter-length TCP connections. NSF (CISE/CCF 0820138, CISE/CSR 0720604, CISE/CNS 0524477, CNS/ITR 0205294, CISE/EIA RI 0202067) |
Identificador |
Aggradi, Gabriele; Esposito, Flavio; Matta, Ibrahim. "Supporting Predicate Routing in DTN over MANET", Technical Report BUCS-TR-2008-013, Computer Science Department, Boston University, July 10, 2008. [Available from: http://hdl.handle.net/2144/1706] |
Idioma(s) |
en_US |
Publicador |
Boston University Computer Science Department |
Relação |
BUCS Technical Reports;BUCS-TR-2008-013 |
Palavras-Chave | #Delay tolerant network #Mobile ad hoc network #Emulation #Routing #Predictable routing #Transmission control protocol |
Tipo |
Technical Report |