A geometric routing protocol in disruption tolerant network

Authors:
Jingzhe Du;Evangelos Kranakis;Amiya Nayak
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada
Venue:
International Journal of Parallel, Emergent and Distributed Systems - Best papers from the WWASN2009 workshop
Year:
2010

Citing 0
Cited 2

Evolutionary reputation model for node selfishness resistance in opportunistic networks

Concurrency and Computation: Practice & Experience
Enhancing TCP congestion control for improved performance in wireless networks

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a novel geometric localised routing protocol in disruption (delay) tolerant network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information could still be used to make routing decisions in a store-and-forward way. Geometric planar spanners, especially local Delaunay triangulation (LDT) can also be used in DTNs to provide a good routing graph with constant stretch factor and shorter paths during communications. In this work, we design local distributed solutions to extract spanning trees from LDT graphs from source to destination. Our protocol resorts to flooding packets along trees with high probability of being delivered without significant delays. Through experimentation, we have shown that the proposed routing protocol achieves higher delivery ratios with lower delays and limited storage requirements than the benchmark epidemic routing protocol.