The Most Valuable Lemma<br />Assumption: Each node maintains the entire network information.<br />For any relay s with locally expected cost-effectiveness, when it contacts node i at time t:<br />If i’s centrality < expected cost-effectiveness: selecting any i’s neighbor j as relay will decrease expected cost-effectiveness.<br />Ifi’s centrality >= expected cost-effectiveness: there exists one i’s neighbor j, such that selecting j as relay will increase expected cost-effectiveness.<br />12<br />MDC Lab Meeting<br />05/26/2011<br />
Conclusion<br />Solve the user-centric data dissemination problem in DTN using social contact pattern and greedily expected cost-effectiveness approach<br />18<br />MDC Lab Meeting<br />05/26/2011<br />Thanks for Your Attention!<br />The slides are made and presented by<br />Yao-Jen Tang (email@example.com)<br />
My Next Presentation Topic List<br />Data Dissemination:R. Masiero and G. Neglia, “Distributed Subgradient Methods for Delay Tolerant Networks”, INFOCOM, 2011.<br />Data Caching:W. Gaoand G. Cao, “Supporting Cooperative Caching in Disruption Tolerant Networks”, ICDCS, 2011.<br />Power Control:E. Altman et al., “Risk Sensitive Optimal Control Framework Applied to Delay Tolerant Networks”, INFOCOM, 2011. <br />Appendix<br />MDC Lab Meeting<br />05/26/2011<br />
A particular slide catching your eye?
Clipping is a handy way to collect important slides you want to go back to later.