DocumentCode
2445973
Title
A Geometric Routing Protocol in Disruption Tolerant Network
Author
Du, Jingzhe ; Kranakis, Evangelos ; Nayak, Amiya
Author_Institution
Sch. of Comput. Sci., Carleton Univ., Ottawa, ON, Canada
fYear
2009
fDate
22-26 June 2009
Firstpage
109
Lastpage
116
Abstract
We describe a novel geometric localized routing (GLR) protocol in disruption (delay) tolerant network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information still could be used to make routing decisions in a store and forward way. Geometric planar spanners, especially local Delaunay triangulation can also be used in DTN to provide a good routing graph with constant stretch factor and shorter paths during communication. In this work, we design local distributed solutions to extract spanning trees from local Delaunay triangulation graphs in the direction from source to destination. Our protocol resorts to flooding packets along the trees and with high probability packets are delivered with low delay. Through experimentation, we have shown that the proposed routing protocol achieves higher delivery ratio with lower delay and limited storage requirement than the benchmark epidemic routing protocol.
Keywords
mobile communication; network theory (graphs); probability; routing protocols; Delaunay triangulation graph; delay tolerant network; disruption tolerant network; geometric planar spanner; geometric routing protocol; probability packet; spanning trees; Bandwidth; Computer science; Conferences; Delay; Disruption tolerant networking; Distributed computing; Information technology; Mobile ad hoc networks; Routing protocols; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems Workshops, 2009. ICDCS Workshops '09. 29th IEEE International Conference on
Conference_Location
Montreal, QC
ISSN
1545-0678
Print_ISBN
978-0-7695-3660-6
Electronic_ISBN
1545-0678
Type
conf
DOI
10.1109/ICDCSW.2009.55
Filename
5158841
Link To Document