17. Upper Bound on Maintaining Overhead with r-Hop Range 05/26/2011 MDC Lab Meeting 11 2 r 1 𝑘+𝑘𝑘−1+…+𝑘𝑘−1𝑟−1 =O(𝑐𝑟) 11 10 12 9 3 13 2 8 0 O(𝑟𝑐𝑟) 14 4 5 1 15 16 6 7
18. The Most Valuable Lemma Assumption: Each node maintains the entire network information. For any relay s with locally expected cost-effectiveness, when it contacts node i at time t: If i’s centrality < expected cost-effectiveness: selecting any i’s neighbor j as relay will decrease expected cost-effectiveness. Ifi’s centrality >= expected cost-effectiveness: there exists one i’s neighbor j, such that selecting j as relay will increase expected cost-effectiveness. 12 MDC Lab Meeting 05/26/2011
27. Conclusion Solve the user-centric data dissemination problem in DTN using social contact pattern and greedily expected cost-effectiveness approach 18 MDC Lab Meeting 05/26/2011 Thanks for Your Attention! The slides are made and presented by Yao-Jen Tang (yjtang@cs.nthu.edu.tw)
28. My Next Presentation Topic List Data Dissemination:R. Masiero and G. Neglia, “Distributed Subgradient Methods for Delay Tolerant Networks”, INFOCOM, 2011. Data Caching:W. Gaoand G. Cao, “Supporting Cooperative Caching in Disruption Tolerant Networks”, ICDCS, 2011. Power Control:E. Altman et al., “Risk Sensitive Optimal Control Framework Applied to Delay Tolerant Networks”, INFOCOM, 2011. Appendix MDC Lab Meeting 05/26/2011