1 / 20

Hybrid Replication Routing Solution for Delay Tolerant Networks

Research into the hybridization of the PRoPHET and ERP network routing algorithms. Hybrid Replication Routing Solution for Delay Tolerant Networks. George Mason University INFS 612 (Spring 2013). Project Group 4 : Richard Joy, Miriam Joy, Serena Mei, and Suyog Parajuli. Research Review.

parson
Télécharger la présentation

Hybrid Replication Routing Solution for Delay Tolerant Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Research into the hybridization of the PRoPHET and ERP network routing algorithms Hybrid Replication Routing Solution for Delay Tolerant Networks George Mason University INFS 612 (Spring 2013) Project Group 4: Richard Joy, Miriam Joy, Serena Mei, and SuyogParajuli

  2. Research Review • Research Problem • Background on ERP and PRoPHET • Research Approach • Results • Demonstration • Conclusion and Questions

  3. Research Problem • Delay Tolerant Network (DTN) addresses challenges in disconnected, disrupted networks without end-to-end connection • Over time, DTN routing protocols have developed in two areas: forwarding-based and replication-based • Replication-based algorithms have higher message delivery rates, but are resource hungry • Problem: Is there a way to combine two replication-based algorithms which result in the same delivery rate with lower overhead?

  4. Business Applications • Mobile Sensor Networks • Sensors with wireless connectivity deployed over a geographic area • Periodically transmit their findings to a base station, perhaps for analysis or permanent storage. • These sensors may be small and have limited communication range, implying that they are not always able to establish a connected path (leveraging other sensors as routers) back to base stations. • Disaster Recovery/Military Deployment: • People, in addition to sensors, are deployed over an area with limited wireless coverage (i.e., few, if any, base stations). • Interplanetary/Spacecraft Communications

  5. DTN Algorithm Background

  6. Epidemic Routing Protocol (ERP) • ERP is a “greedy” replication algorithm • Nodes continuously replicate and transmit messages to newly discovered contacts who do not already possess a copy • Very effective at delivering messages • Extremely inefficient for resources

  7. Epidemic Routing Protocol (ERP) Time = t1 C2 C2 C3 C3 S S D D C1 C1 Time = t2>t1

  8. PRoPHET • PRoPHET is a “utility-based” replication protocol • Not indiscriminate in its replication; uses an adaptive algorithm • Set of probabilities for successful delivery • Algorithm updates whenever a node is encountered. • Nodes that are encountered frequently have a high delivery predictability. • PRoPHET statistics are shared between each of the communicating nodes.

  9. PRoPHET Message Source: S Message Destination: D C C C C S S S S D D D D B B B B 1 2 4 3 Message Orbit and probability of encounter

  10. Research and Demonstration

  11. Composition of Virtual Network DTNNode DTNNode DTN Listener DTN Connector Connection List Message Stats Message Manager In our environment, the nodes have particular orbits; connection probabilities are assigned to reflect this design JBDC Connector • 20 Nodes • 4 connection partners per node with 25% probability • 30 messages Database

  12. Test Parameters • Ran a series of tests incrementing the threshold for switching to ERP (if it is the better solution) • Each test (each threshold) was 40 minutes long • Time-to-live for each message was 128 connections 40 min 100% PRoPHET 100% ERP

  13. Breakdown of each propagation type by threshold 0 = 100% ProPHET 1 = 100% ERP

  14. Average and Max Message Buffer Size by Threshold ERP first selected by node

  15. Average and Max Message Buffer Size by Threshold by Node 12342 12340 12341 12343 12344 12345

  16. Average and Max Message Buffer Size by Threshold by Node (cont) 12346 12347 12348 12349 12350 12351

  17. Average and Max Message Buffer Size by Threshold by Node (cont) 12353 12354 12352 12355 12356 12357

  18. Average and Max Message Buffer Size by Threshold by Node (cont) 12358 12359

  19. Further Considerations/Research • Routing Under Uncertainty • Is information on location of target node reliable or being distorted by environmental conditions? How do you adjust for this? • Resource Allocation • How do you properly elevate messages for priority handling? • Managing buffers and still maximizing delivery • Integrating a forwarding algorithm • Performance • Average latency in delivering messages; • Average amount of system storage and bandwith consumed; • Amount of energy consumed in transmission (particularly applicable to mobile devices serving as carriers for others) • Reliability • Sending back acknowledgements from message recipient • Security • New area of research into “reputation” protocol • How to track messages through the entire path • Encryption

  20. Conclusion and Questions

More Related