Presentation is loading. Please wait.

Presentation is loading. Please wait.

Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.

Published byLillian Fuller Modified over 10 years ago

Similar presentations

Presentation on theme: "Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future."— Presentation transcript:

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

2 Table of Contents Introduction Mobility Entropy and Routing Potential-Based Approach Evaluation Conclusion

3 Introduction Message delivery in DTNs How can they manage routing, when 100 nodes? A large number of node mobility patterns Contribution of this work: –Mobility Entropy, Community-Structured Environment (CSE) –Potential-based Entropy Adaptive Routing (PEAR) A B Message Circle: Transmission Range

4 Table of Contents Introduction Mobility Entropy and Routing Potential-Based Approach Evaluation Conclusion

5 Mobility Entropy and Message Routing Mobility Entropy represents uniformity of node distribution. Small EntropyLarge Entropy Locally Distributed Contact with only a small set of nodes Message Delivery by Routing Widely Distributed Contact with many nodes Message Delivery by Mobility

6 Distribution of Nodes Small Entropy Case Distribution Short overlapping of node distribution Small Contact Areas

7 Distribution of Nodes Large Entropy Case Long overlapping of node distribution Large Contact Areas Distribution

8 Message Delivery Small Entropy Case SourceDestination Distribution Contact Areas Intermediate Nodes

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

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

11 CSE and Mobility Entropy c0 c2 c1 c0 c2 c1 Mobility Entropy If every node belongs to 2 communities. If every node belongs to 3 communities.

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

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

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

15 Table of Contents Introduction Mobility Entropy and Routing Potential-Based Approach Evaluation Conclusion

16 Sensor Truck Internet Gateway Live E! To deliver sensor readings to the Internet GW Potential Data Flow : Wireless Device Potential-Based Routing

17 Message Forwarding in Potential-Based Routing Message for d A message goes down the curve until it reaches the destination.

18 How to develop potential-field in PEAR Potential-Field Construction Diffusion Equation Boundary Condition

19 Potential and Message Routing Small Entropy Case Distribution Potential Destination Node Source Node Intermediate Nodes Source Destination Intermediate Message Delivery

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

21 Potential and Message Routing Large Entropy Case Distribution Intermediate Nodes Source Node Destination Node Source Node Destination Node Direct Path Potential

22 Message Delivery by PEAR Large Entropy Case Source Destination Intermediate Potential destination source

23 Table of Contents Introduction Mobility Entropy and Routing Potential-Based Approach Evaluation Conclusion

24 Evaluation Evaluation of Delivery Rate and Total Transmissions on Mobility Entropy PEAR in comparison with: –Epidemic Routing –Spray and Wait –Link-State Routing Minimum Expected Delay (MED) Maximum Delivery Probability (MDP) Java-based CSE simulator –Ignored: link-bandwidth, radio properties, message- partitioning, storage size, etc...

25 Delivery Rate

26 Total Message Transmissions

27 Table of Contents Introduction Mobility Entropy and Routing Potential-Based Approach Evaluation Conclusion

28 Mobility Entropy –The new metrics that describes mobile environment. Small entropy: Nodes are locally distributed. Large entropy: Nodes are widely distributed. –Community-Structured Environment PEAR achieved high delivery probability –Small entropy: hop-by-hop routing –Large entropy: multiplying messages

29 Thank you.. Mobility Entropy

Download ppt "Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future."

Similar presentations

What Is an Ad Hoc Network?

What Is an Ad Hoc Network?
Transportation-aware Routing in Delay Tolerant Networks (DTNs) Asia Future Internet 2008 Taekyoung Kwon Seoul National University.

Transportation-aware Routing in Delay Tolerant Networks (DTNs) Asia Future Internet 2008 Taekyoung Kwon Seoul National University.
1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.

1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.
Scalable Routing In Delay Tolerant Networks

Scalable Routing In Delay Tolerant Networks
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.

ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
A Presentation by: Noman Shahreyar

A Presentation by: Noman Shahreyar
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.

1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.

Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”

CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)

Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
SUSTAIN: An Adaptive Fault Tolerance Service for Geographically Overlapping Wireless Cyber-Physical Systems Gholam Abbas Angouti Kolucheh, Qi Han

SUSTAIN: An Adaptive Fault Tolerance Service for Geographically Overlapping Wireless Cyber-Physical Systems Gholam Abbas Angouti Kolucheh, Qi Han
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,

Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,

Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
By Libo Song and David F. Kotz Computer Science,Dartmouth College.

By Libo Song and David F. Kotz Computer Science,Dartmouth College.
DTNs Delay Tolerant Networks. Fall, Kevin. Intel Research, Berkeley. SIGCOMM 2003 Aug25, 2003. A Delay- Tolerant Network Architecture for Challenged Internets.

DTNs Delay Tolerant Networks. Fall, Kevin. Intel Research, Berkeley. SIGCOMM 2003 Aug25, A Delay- Tolerant Network Architecture for Challenged Internets.
Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.

Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.

An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.

Similar presentations

Ads by Google