user centric data dissemination in disruption tolerant networkas
TRANSCRIPT
User-Centric Data Dissemination in Disruption Tolerant Networks
Wei Gao and Guohong Cao
INFOCOM 2011
05/26/2011 MDC Lab Meeting Yao-Jen Tang
Outline
Introduction
Problem and Models
Approach
Analysis
Simulation
Conclusion
OutlineMDC Lab Meeting05/26/2011
05/26/2011 MDC Lab Meeting Introduction
Disruption Tolerant Network (DTN)
Example 1: Connected Network
1MDC Lab Meeting05/26/2011
Disruption Tolerant Network (DTN)
Example 2: Disruption Tolerant Network
2MDC Lab Meeting05/26/2011
Flooding Example of User-Centric Data Dissemination in DTN
05/26/2011 MDC Lab Meeting 3
1 9
3
64
2
7
510
8
11
2
3
5
6
1
8
4
9
1011
1212
05/26/2011 MDC Lab Meeting Problem and Models
User-Centric Data Dissemination: Uncontrollable and Controllable Parts
05/26/2011 MDC Lab Meeting 4
1
3
4
2
4
Controllable
3
4
2
1
2
3
4
Maximize Cost-Effectiveness User-Centric Data Dissemination in DTN
05/26/2011 MDC Lab Meeting 5
1 9
3
64
2
7
510
8
11
2
3
5
6
1
8
4
9
1011
1212
Cost-Effectiveness
Maximize Expected Cost-Effectiveness User-Centric Data Dissemination in DTN
05/26/2011
Wireless Sensor Network
Mobile Ad-hoc Network
Routing Protocol
DataAggregation
Information Brokerage
0.3 0.2 0.3 0.1 0.1
0 0.5 0 0 0.5
User
Paper
Interested in Paper = 0.3*0 + 0.2*0.5 + 0.3*0 + 0.1*0 + 0.1*0.5 = 0.15
MDC Lab Meeting 6
1 9
3
64
2
7
510
8
11
12
0.4
0.4
0.4
0.60.8
0.8
0.8
0.80.8
0.60.6 0.6
0.8
0.4
0.8
0.150.38
0.30.75
0.350.63
0.31.02
0.30.48
0.250.66
0.350.15
0.150.27 0.25
0.09
0.150.28
0.40.34
0.350.32
0.3*0.4+0.3*0.4+0.35*0.4=
05/26/2011 MDC Lab Meeting Approach
Relay Selection with Centrality
05/26/2011 MDC Lab Meeting 7
1 9
3
64
2
7
510
8
11
2
3
1212
0.4
0.4
0.4
0.60.8
0.8
0.8
0.80.8
0.60.6
0.4
0.6
0.8
0.4
0.80.8
0.150.38
0.30.75
0.350.63
0.31.02
0.30.48
0.250.66
0.350.15
0.150.27 0.25
0.09
0.150.28
0.40.34
0.350.32
0.350.24
0.30.54
0.250.39
0.30.74
0.150.24
0.150.41
0.40.06
0.350.06
Expected Cost-Effectiveness
0.30.78
0.380.70.7 0.717
0.717
Cost-Effectiveness
Relay Selection with Multi-Hop Centrality
05/26/2011 MDC Lab Meeting 8
1 9
3
64
2
7
510
8
11
2
3
5
4
1212
0.4
0.4
0.4
0.60.8
0.8
0.8
0.80.8
0.60.6
0.4
0.6
0.8
0.4
0.80.8
0.150.468
0.30.83
0.350.753
0.31.1075
0.30.696
0.250.843
0.350.285
0.150.334 0.25
0.126
0.150.396
0.40.364
0.350.344
0.350.456
0.250.633
0.30.8275
0.150.328
0.150.474
0.40.084
0.350.114
Cost-Effectiveness
0.30.62
0.30.584
0.350.122
0.150.452
0.250.168
0.30.9
0.150.396
0.30.696
0.150.384
0.30.9395
Expected Cost-Effectiveness
0.4680.7880.7880.806
0.806
0.802
0.802
05/26/2011 MDC Lab Meeting Analysis
Lower Bound on Expected Cost-Effectiveness at t
05/26/2011 MDC Lab Meeting 9
1
3
64
2
7
5
0.4
0.4
0.4
0.60.8
0.8
0.8
0.80.8
0.60.6
0.30.75
0.350.63
0.31.02
0.30.48
0.250.66
0.350.15
0.150.38
Lower Bound on Probability of Increasing Cost-Effectiveness within t
05/26/2011 MDC Lab Meeting 10
1
3
64
2
7
5
0.4
0.4
0.4
0.60.8
0.8
0.8
0.80.8
0.60.6
0.30.75
0.350.63
0.31.02
0.30.48
0.250.66
0.350.15
0.150.38
12120.8
0.350.24
0.30.78
Upper Bound on Maintaining Overhead with r-Hop Range
05/26/2011 MDC Lab Meeting 11
0
3
41
2
5
67
8
910 11
12
13
14
1615
1 2 r
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.
If i’s centrality >= expected cost-effectiveness: there exists one i’s neighbor j, such that selecting jas relay will increase expected cost-effectiveness.
12MDC Lab Meeting05/26/2011
The Most Valuable Lemma
05/26/2011 MDC Lab Meeting 13
1
4
5
2
3 531
13.5
13.3
13
13
13.2
Expected Cost-Effectiveness
4
Expected Cost-Effectiveness
2
10.9
10.9
11
0.6
0.6
The Most Valuable Lemma
05/26/2011 MDC Lab Meeting 13
1
4
5
2
31 3 5
13
Expected Cost-Effectiveness
3
4
Expected Cost-Effectiveness
1
10.9
10.9
11
0.6
0.6
13.5
13.3
13
13
13.2
Goal (Idea)
What’s your approach?
05/26/2011 MDC Lab Meeting Simulation
Performance Evaluation
Realistic DTN traces:
MIT Reality and Infocom06
Schemes for comparison:
Flooding
Random Flooding
ContentPlace
SocialCast
14MDC Lab Meeting05/26/2011
Data Dissemination with Different Time Constraints
05/26/2011 MDC Lab Meeting 15
Data Dissemination with Different Buffer Constraints
05/26/2011 MDC Lab Meeting 16
Data Dissemination with Different Scope of Maintaining Network Information
05/26/2011 MDC Lab Meeting 17
05/26/2011 MDC Lab Meeting Conclusion
Conclusion
Solve the user-centric data dissemination problem in DTN using social contact pattern and greedily expected cost-effectiveness approach
18MDC Lab Meeting05/26/2011
The slides are made and presented byYao-Jen Tang ([email protected])
Thanks for Your Attention!
My Next Presentation Topic List
Data Dissemination: R. Masiero and G. Neglia, “Distributed Subgradient Methods for Delay Tolerant Networks”, INFOCOM, 2011.
Data Caching: W. Gao and 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.
AppendixMDC Lab Meeting05/26/2011