![• 1. Kevin Fall, Stephen Farrell (JUNE 2008) 'DTN: An Architectural Retrospective', IEEE,
26(5), pp. 828-836.
• 2. Sushant Jain,Kevin Fall,Rabin Patra (2004) 'Routing in a Delay Tolerant Network',
ACM , (1581138628/ 04/0008), pp. 145-157.
• 3.http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5684272&url=http%3A%2
F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5684272
• 4. V.Erramilli, M. Crovella, A.Chaintrean, and C.Diot, “Delegation forwarding,” in Proc.
Of ACM Mobihoc, 2008, pp.251-260.
• 5. Xiao Chen and Jian Shen and Jie Wu (2011) 'Enhanced Delegation Forwarding in
Delay Tolerant Networks', The International Journal of Parallel, Emergent and
Distributed Systems, 26(5), pp. 331-345.
• 6. D.Hua, X.Du, Y.Qian, S.Yan (2009) 'A DTN Routing Protocol Based on Hierarchy
Forwarding and Cluster Control', IEEE, DO1 10.1109(CIS.2009.150), pp. 397-401.
• 7. Jie Wu and Yunsheng Wang (2012) 'Social Feature-based Multi-path Routing in
Delay Tolerant Networks', IEEE INFOCOM, (978-1-4673-0775-8/12), pp. 1368-1376.
• 8. Maurice J. Khabbaz, Chadi M. Assi, and Wissam F. Fawaz (2012) 'Disruption-
Tolerant Networking: A Comprehensive Survey on Recent Developments and
Persisting Challenges', IEEE COMMUNICATIONS SURVEYS & TUTORIALS, 14(2), pp.
607-640.
• 9. Forrest Warthman (2012) Delay- and Disruption-Tolerant Networks (DTNs) A
Tutorial. [Online]. Available at: http://www.ipnsig.org (Accessed: 7/23/12).](https://image.slidesharecdn.com/shivi-cdac-160101051505/85/Intro-to-DTN-and-routing-classification-27-320.jpg)
Intro to DTN and routing classification
- 1. Submitted By SHIVI SHUKLA ABMTI13039 Under The Supervision of Dr Yatindra Nath Singh Professor, EE Dept IIT, Kanpur Department of Computer Science Banasthali University ROUTING IN DELAY TOLERANT NETWORKS Presented By- Shivi Shukla
- 3. Idea of DTN is taken from InterPlaNetary networks(IPN) Wireless Ad-hoc network Tolerates the intermittent connectivity ,longer delays and prevent data loss
- 7. Enables Retransmission Tolerates Intermittent connection Supports any type of connectivity Supports late binding • Scheduled, opportunistic, predicted • To support the heterogeneous environment
- 8. To choose the best path is not the case here. End to end path can never be constructed. Messages are forwarded when any contact is found.
- 9. • Every DTN node belongs to some particular network (area). • Where it meets some nodes so often and these nodes become friends of that node. • A particular node can depend upon their friends to receive any message. • When the network system has been established, every node will declare their friends according to the proximity.
- 10. M C G J L E I H F D K A Nodes Friends A D,E,F,K B I,K,D C J,L,M,E,F D B,A,F E F,C,A,J,K F C,K,D,A,E,J G L,M H N,K,I,J I J,H,B J H,F,E,C,I K A,E,B,F,H L C,G M C,G N H,D
- 11. Routing Protocols Flooding Based Direct Contact Epidemic Two- Hop Tree Based Spray and Wait Forwarding Based NECTAR Per- Hop Per- Contact Source Routing CRHC Broadly classified into two categories: •Flooding Based •Forwarding Based
- 12. Work even with no knowledge about the network. Any number of replicas can be flooded to the network. Number of replicas generated can be either : •Replication Based- number of replicas in the network can be n-1. •Quota Based – limited replicas present in the network.
- 13. •Source directly forwards the bundle to the destination. •Single message transmission. •Less resource consumption. •High delay in delivering the message. A C B A C B Message for C At t=0 At t=1
- 14. •Each node replicates the message to every other node after checking the summary vector. •The summary vector is maintained at each node that stores the information about all the messages. A C B D E F Send to every node in contact
- 15. •Source node replicates the message to an adequate number of relay nodes. •Message will be delivered to the destination within two hops only. A C B D E F G H Source Destination × At t=0 A C B D E F G H Source Destination D At t=1
- 16. •Each node can replicate to only two child nodes in binary tree approach. •Limiting the number of replicas can limit the breadth and depth of tree. A C ED F B G Source
- 17. Consist of two phases: •Spray: source node replicates the message to the m nodes and these m nodes will further relay the message to m relay nodes. •Wait: If the destination is not found in spray phase then the relay nodes will store the message and performs direct transmission to the destination.
- 18. Work with some knowledge of the network. Messages are not replicated but forwarded. •Works efficiently with less number of nodes.
- 19. •Each node maintains neighborhood index. •Neighborhood index contains the value of meeting frequency of node with every other node. •The messages are forwarded to the nodes having higher value of neighborhood index. A C B NI=1 NI=5
- 20. Consist of two phases: •Route discovery: route is discovered by sending control packets towards a destination node. •Route maintenance: if a link failure is detected then a route error message is broadcasted by the source.
- 21. •Each intermediate node will decide the next node to which the packet is to be forwarded. •More updated information is used. A C E F D B G 2 1 4 4 1 2 3 Source Destination
- 22. •Most updated information is used. •When intermediate node receives any message for a particular destination then it checks the current Up contacts and select the appropriate node for relaying the message. A C E F D B G 2 1 4 4 1 2 3 Source Destination A C E F D B G 2 1 4 4 1 2 3 Source Destination 2 At t=0 At t=1
- 23. •Introduces the concept of clustering (i.e. grouping) of nodes on the basis of link property and communication characteristics. •After formation of clusters, a cluster head is selected based on higher stability or the higher quality among all nodes and takes routing decisions.
- 24. Protocol Number of messages generated Message delivery ratio Average delay Resource consumption Direct contact Single Low High Less Epidemic N-1 High Low High Two-hop K Medium Medium Less Tree based 1+log(N/2) Medium High Medium Spray and Wait ≥K Medium Medium Medium Table1: Comparison of flooding based routing algorithms N= Total number of nodes present in the network K= Optimal number of nodes to assure the delivery
- 25. Protocol Information maintenance Message delivery ratio Average delay Resource consumption NECTAR Medium High Normal Medium Per-hop Medium Medium Medium Low Per-contact Medium High Low Medium Source Normal Low High Low CRHC High High Normal Medium Table 2: Comparison of forwarding based routing algorithms
- 26. •Each algorithm has its own pros and cons, so selection of routing protocol depends on application environment. •Algorithms based on flooding approach have a better delivery ratio but consume more resources in comparison to forwarding based algorithms. •Comparison of the different algorithms are shown in the tabular chart. •Each algorithm has its own pros and cons, so selection of routing protocol depends on application environment. •Algorithms based on flooding approach have a better delivery ratio but consume more resources in comparison to forwarding based algorithms.
- 27. • 1. Kevin Fall, Stephen Farrell (JUNE 2008) 'DTN: An Architectural Retrospective', IEEE, 26(5), pp. 828-836. • 2. Sushant Jain,Kevin Fall,Rabin Patra (2004) 'Routing in a Delay Tolerant Network', ACM , (1581138628/ 04/0008), pp. 145-157. • 3.http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5684272&url=http%3A%2 F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5684272 • 4. V.Erramilli, M. Crovella, A.Chaintrean, and C.Diot, “Delegation forwarding,” in Proc. Of ACM Mobihoc, 2008, pp.251-260. • 5. Xiao Chen and Jian Shen and Jie Wu (2011) 'Enhanced Delegation Forwarding in Delay Tolerant Networks', The International Journal of Parallel, Emergent and Distributed Systems, 26(5), pp. 331-345. • 6. D.Hua, X.Du, Y.Qian, S.Yan (2009) 'A DTN Routing Protocol Based on Hierarchy Forwarding and Cluster Control', IEEE, DO1 10.1109(CIS.2009.150), pp. 397-401. • 7. Jie Wu and Yunsheng Wang (2012) 'Social Feature-based Multi-path Routing in Delay Tolerant Networks', IEEE INFOCOM, (978-1-4673-0775-8/12), pp. 1368-1376. • 8. Maurice J. Khabbaz, Chadi M. Assi, and Wissam F. Fawaz (2012) 'Disruption- Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges', IEEE COMMUNICATIONS SURVEYS & TUTORIALS, 14(2), pp. 607-640. • 9. Forrest Warthman (2012) Delay- and Disruption-Tolerant Networks (DTNs) A Tutorial. [Online]. Available at: http://www.ipnsig.org (Accessed: 7/23/12).