1 / 23

Integrating Forwarding and Replication in DTN Routing A Social Network Perspective

Integrating Forwarding and Replication in DTN Routing A Social Network Perspective.   Vehicular Technology Conference (VTC Spring), 2011 IEEE 73 rd Li, Yong ; Cao, Yuan ; Li, Su ; Jin, Depeng ; Zeng, Lieguang. Outline. Introduction Motivation and overview The IFR routing scheme

linus-levy
Download Presentation

Integrating Forwarding and Replication in DTN Routing A Social Network Perspective

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. Integrating Forwarding and Replication in DTN Routing A Social Network Perspective   Vehicular Technology Conference (VTC Spring), 2011 IEEE 73rd Li, Yong ; Cao, Yuan ; Li, Su ; Jin, Depeng ; Zeng, Lieguang

  2. Outline • Introduction • Motivation and overview • The IFR routing scheme • Community detection and weight assignment • IFR algorithm • Evaluation and result • Combrage trace • Reality trace • Conclusions

  3. Introduction • In the past few years, several routing algorithms according to store-carry-forward mechanism have been proposed to improve the performance of DTN. • There are opportunistic forwarding (or probabilistic forwarding) based approaches, which rely on probability metrics such as time elapsed since last encounter, social similarity, geometric distance and so on. • These related routing algorithms can be classified to two types, one type is replicating messages and the other type is forwarding only a single copy of each message.

  4. Introduction (cont.) In this paper, we deign a routing scheme, which Integrates Forwarding and Replication (IFR) in a simple form from the aspect of social networks.

  5. Motivation and overview • The existing DTN routing algorithms can be classified totwo types. One is replicating packets and the other is forwardingonly a single copy. • Replication increases the messagedelivery ratio but at the same time increases the delivery costs,while forwarding maintains at most one copy of the message inthe network but achieves low delivery radio due to the nodemobility and uncertainty.

  6. Motivation and overview There are two part of our solution, the first part is thecommunity detection and nodes’ delivery weight assignment,and the second part is the routing algorithm which IntegratesForwarding and Replication.

  7. Motivation and overview In the first part, the mobile modesare divided to different groups according to the social relationsreflected by the contacts in a distributed way, and for each nodeand community pair, a delivery weight will be assigned with avalue. Then, in the IFR, when a mobile node sends messagesto nodes belonging to the same community, the replicationmechanism is used. Otherwise, the forwarding mechanism isused based on the delivery weight.

  8. Community detection and weight assignment • There are some community detection algorithms such as SIMPLE and K-CLIQUE are proposed by Hui et al..

  9. Community detection and weight assignment Admission criteria for SIMPLE.

  10. Community detection and weight assignment Admission criteria for k-CLIQUE.

  11. Community detection and weight assignment By averaging the all history intermeetingtime of a node with any nodes in a community, wecan obtain the average contact rate of the node with thatcommunity.

  12. IFR algorithm

  13. IFR algorithm

  14. IFR algorithm A A B B

  15. IFR algorithm A B

  16. IFR algorithm B A

  17. IFR algorithm B B B A A A

  18. IFR algorithm A B

  19. IFR algorithm A B

  20. Evaluation and result • Combrage trace.

  21. Evaluation and result • Reality trace.

  22. Conclusions • In this paper, we focus on designing a simple but efficient mechanism to integrate replication and forwarding in the DTN routing from the social networks perspective. • By simulations of two-community case andmulti-community case based on traces of Cambridge and Realityrespectively, we show that our scheme although increasesthe message delivery cost, it has much more increasing of themessage delivery success ratio.

  23. 每週一句 • The existing DTN routing algorithms can be classified to two types. One is replicating packets and the other is forwarding only a single copy. • One, the other • One, another, the other • One, another, still another, the other

More Related