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

Slides:



Advertisements
Similar presentations
What Is an Ad Hoc Network?
Advertisements

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.
Scalable Routing In Delay Tolerant Networks
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.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
A Presentation by: Noman Shahreyar
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.
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)
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,
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.
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.
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.
Using Redundancy to Cope with Failures in a Delay Tolerant Network Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall Source:
Mobile Agents for Adaptive Routing Presented by Hong-Jiun Chen & Manu Prasanna Gianni Di Caro & Marco Dorigo.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
1 Minimizing End-to-End Delay: A Novel Routing Metric for Multi- Radio Wireless Mesh Networks Hongkun Li, Yu Cheng, Chi Zhou Department of Electrical and.
Potential-Based Entropy Adaptive Routing for Disruption Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT DTNRG, IETF 76 Hiroshima,
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
Link Estimation, CTP and MultiHopLQI. Motivation Data Collection needs to estimate the link quality –To select a good link.
Wireless Sensor Networks COE 499 Energy Aware Routing
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group.
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
Effects of Multi-Rate in Ad Hoc Wireless Networks
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Simulation of DeReClus Yingyue Xu September 6, 2003.
On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic Sundar Subramanian, Sanjay Shakkottai and Piyush Gupta INFOCOM 2007.
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Delay-Tolerant Networks (DTNs)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Technical University of Cluj-Napoca
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Routing.
Presentation transcript:

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

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

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

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

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

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

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

Message Delivery Small Entropy Case SourceDestination Distribution Contact Areas Intermediate Nodes

Source Destination Distribution Message Delivery Large Entropy Case A Contact Area

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.

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.

Mobility Entropy = 1 When nodes belong to two communities.

Mobility Entropy = 2 When nodes belong to four communities.

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

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

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

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

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

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

Message Delivery by PEAR Small Entropy Case Source Destination Intermediate Potential

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

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

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

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...

Delivery Rate

Total Message Transmissions

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

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

Thank you.. Mobility Entropy