ACM Home Page
Please provide us with feedback. Feedback
DL HomeProceedingsMobiComCHANTS '08Citation
Supporting predicate routing in DTN over MANET
Full text PdfPdf (383 KB)
International Conference on Mobile Computing and Networking archive
Proceedings of the third ACM workshop on Challenged networks table of contents
San Francisco, California, USA
POSTER SESSION: Demo and poster session table of contents
Pages 125-128  
Year of Publication: 2008
Gabriele Ferrari Aggradi  Boston University, Boston, MA, USA
Flavio Esposito  Boston University, Boston, MA, USA
Ibrahim Matta  Boston University, Boston, MA, USA
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
ACM  New York, NY, USA
Downloads (6 Weeks): 28,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article:
What is a DOI?


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.


Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," in SIGCOMM '03: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. ACM, 2003, pp. 27--34.
J. Dike, User Mode Linux, ser. Bruce Perens' Open Source Series. Prentice Hall, 2006.
C. Perkins, E. Belding-Royer, and S. Das, "Ad Hoc On-Demand Distance Vector (AODV) Routing," RFC 3561, Internet Engineering Task Force (IETF), July 2003. [Online]. Available:
[Online]. Available:
T. Roscoe, S. Hand, R. Isaacs, R. Mortier, and P. Jardetzky, "Predicate Routing: Enabling Controlled Networking," SIGCOMM Comput. Commun. Rev., vol. 33, no. 1, pp. 65--70, 2003
J. Ott, D. Kutscher, and C. Dwertmann, "Integrating DTN and MANET Routing," in CHANTS '06: Proceedings of the 2006 SIGCOMM workshop on Challenged networks. New York, NY, USA: ACM, 2006, pp. 221--228.

Collaborative Colleagues:
Gabriele Ferrari Aggradi: colleagues
Flavio Esposito: colleagues
Ibrahim Matta: colleagues