Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks

Transcription

1 Mobility Entropy an Message Routing in Community-Structure Delay Tolerant Networks Hieya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future Internet (AsiaFI) th -16 th January Beijing, China.

2 Table of Contents Introuction Mobility Entropy an Routing Potential-Base Approach Evaluation Conclusion

3 Introuction Message elivery in DTNs Message A C B Circle: Transmission Range How can they manage routing, when 100 noes? A large number of noe mobility patterns Contribution of this work: Mobility Entropy, Community-Structure Environment (CSE) Potential-base Entropy Aaptive Routing (PEAR)

4 Table of Contents Introuction Mobility Entropy an Routing Potential-Base Approach Evaluation Conclusion

5 Mobility Entropy an Message Routing Mobility Entropy represents uniformity of noe istribution. Small Entropy Large Entropy Locally Distribute Wiely Distribute Contact with only a small Contact with many noes set of noes Message Delivery by Mobility Message Delivery by Routing

6 Distribution of Noes Small Entropy Case Short overlapping of noe istribution Small Contact Areas Distribution x 2 x 1

7 Distribution of Noes Large Entropy Case Long overlapping of noe istribution Large Contact Areas Distribution x 2 x 1

8 Message Delivery Small Entropy Case Intermeiate Noes Distribution Source Destination x Contact Areas

9 Message Delivery Large Entropy Case Distribution Source Destination A Contact Area x

10 Community-Structure Environment (CSE) 1. Noes can communicate with each other when they are in the same community. 2. Noes move among preefine community set repeately. 3. Mobility entropy is given by the number of communities a noe belongs to. Mobility Entropy log2 Community A Contact Area Contact Area Contact Area The number of communities each noe belongs to. Community C Community B

11 CSE an Mobility Entropy If every noe belongs to 2 communities. If every noe belongs to 3 communities. c0 c2 c0 c2 c1 c1 Mobility Entropy Mobility Entropy log log 2

12 When noes belong to two communities. Mobility Entropy = 1

13 When noes belong to four communities. Mobility Entropy = 2

14 CSE an Mobility Entropy Mobility Entropy = 0 Mobility Entropy = 1 Mobility Entropy = 2 Mobility Entropy = 3

15 Table of Contents Introuction Mobility Entropy an Routing Potential-Base Approach Evaluation Conclusion

16 Potential Potential-Base Routing Internet Gateway Data Flow Live E! E! Data Flow Truck Sensor To eliver sensor reaings to the Internet GW : Wireless Device

17 Message Forwaring in Potential-Base Routing V x Message for x 2 F x x A message goes own the curve until it reaches the estination. x 1

18 t n V t k V D t n V t n V n nbr k,, min, 1, ) ( How to evelop potential-fiel in PEAR 0,, 0,0, t V t n V N n. 0) ( 0), ( const D Potential-Fiel Construction ) (,,, 1, n nbr k t n V t k V D t n V t n V Diffusion Equation Bounary Conition

19 Potential an Message Routing Small Entropy Case Distribution Potential Source Noe Source V Intermeiate Destination n, t 1 V n, t D min V k, tv n, t knbr ( n) Intermeiate Noes Message Delivery Destination Noe x

20 Message Delivery by PEAR Small Entropy Case Potential Source Intermeiate Destination

21 Potential an Message Routing Large Entropy Case Potential Direct Path Source Noe Intermeiate Noes Destination Noe V n, t 1 V n, t D min V k, tv n, t knbr ( n) Distribution Source Noe Destination Noe x

22 Message Delivery by PEAR Large Entropy Case source Potential Source estination Intermeiate Destination

23 Table of Contents Introuction Mobility Entropy an Routing Potential-Base Approach Evaluation Conclusion

24 Evaluation Evaluation of Delivery Rate an Total Transmissions on Mobility Entropy PEAR in comparison with: Epiemic Routing Spray an Wait Link-State Routing Minimum Expecte Delay (MED) Maximum Delivery Probability (MDP) Java-base CSE simulator Ignore: link-banwith, raio properties, messagepartitioning, storage size, etc...

25 Delivery Rate

26 Total Message Transmissions

27 Table of Contents Introuction Mobility Entropy an Routing Potential-Base Approach Evaluation Conclusion

28 Mobility Entropy Conclusion The new metrics that escribes mobile environment. Small entropy: Noes are locally istribute. Large entropy: Noes are wiely istribute. Community-Structure Environment PEAR achieve high elivery probability Small entropy: hop-by-hop routing Large entropy: multiplying messages

29 Thank you.. Mobility Entropy Small Entropy Case Large Entropy Case Distribution Potential Source Noe Source Intermeiate Destination V n, t 1 V n, t D min V k, tv n, t knbr ( n) Intermeiate Noes Message Delivery Destination Noe x Potential Distribution Source Noe Direct Path V n, t 1 V n, t D min V k, tv n, t knbr ( n) Source Noe Intermeiate Noes Destination Noe Destination Noe x