Title: Geometric Routing Protocol in Disruption Tolerant Network


Abstract

We describe Geometric Routing (GR) in disruption (delay) tolerant networks (DTNs). Although DTNs do not guarantee the connectivity of the network all the time, geometric spanners, especially Delaunay triangulation still could be used to provide a good routing graph with constant stretch factors and shorter paths during communication. Existing DTN routing protocols mainly focus on the improvement of message delivery ratio without considering storage attributes. In this work, we would design local distributed solutions to extract three spanning trees from Delaunay triangulation in the direction from source to destination. Our protocol will resort to flooding packets along the three trees with high probability packets will be delivered with low delay. The goals of Geometric Routing are to: 1) fast delivery with intelligence 2) shorter routing path 3) better storage utilization. Through the implementation in the ns-2 simulator, we would show the proposed routing protocol achieves higher delivery ratio with satisfied attributes.