DocumentCode :
2337087
Title :
Endpoint Discovery and Contact Graph Routing in space and terrestrial DTNs
Author :
Farrell, Stephen
Author_Institution :
Trinity Coll. Dublin, Dublin, Ireland
fYear :
2010
fDate :
13-15 Sept. 2010
Firstpage :
89
Lastpage :
93
Abstract :
Contact Graph Routing is a routing scheme for Delay-and Disruption-Tolerant Networks (DTNs) that is designed particularly for use in highly deterministic space networks. The Endpoint Discovery Protocol is designed for use in terrestrial DTNs where opportunistic contacts are common. We outline two scenarios where use of both of these protocols could be desirable and analyse the current versions to see where they are compatible and where incompatible. DTNs will benefit from this kind of analysis in general, since it is desirable that DTN deployments be able to mix-and-match routing and other schemes within boundaries that make sense for the DTN in question.
Keywords :
routing protocols; contact graph routing; disruption-tolerant networks; endpoint discovery protocol; endpoint discovery routing; mix-and-match routing; space DTN; terrestrial DTN; Helicopters; Internet; Logic gates; Peer to peer computing; Protocols; Routing; Security; Contact Graph Routing; DTN; Endpoint attribute discovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced satellite multimedia systems conference (asma) and the 11th signal processing for space communications workshop (spsc), 2010 5th
Conference_Location :
Cagliari
Print_ISBN :
978-1-4244-6831-7
Electronic_ISBN :
978-1-4244-6832-4
Type :
conf
DOI :
10.1109/ASMS-SPSC.2010.5586850
Filename :
5586850
Link To Document :
بازگشت