Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.

Slides:

Advertisements

Similar presentations

Transportation-aware Routing in Delay Tolerant Networks (DTNs) Asia Future Internet 2008 Taekyoung Kwon Seoul National University.

Advertisements

Enabling Inter-domain DTN Communications by Networked Static Gateways Ting He*, Nikoletta Sofra, Kang-Won Lee*, and Kin K Leung * IBM Imperial College.

Supporting Cooperative Caching in Disruption Tolerant Networks

- Paper By Yunfeng Lin, Baochun Li, Ben Liang. Outline Motivation Constraints in DTN Network coding Vs Replication Binary Spraying Vs Epidemic routing.

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.

Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,

Ranveer Chandra , Kenneth P. Birman Department of Computer Science

Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.

On Using Probabilistic Forwarding to Improve HEC-based Data Forwarding in Opportunistic Networks Ling-Jyh Chen 1, Cheng-Long Tseng 2 and Cheng-Fu Chou.

An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks Chan-Myung Kim

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,

By Libo Song and David F. Kotz Computer Science,Dartmouth College.

SOCIAL-BASED FORWARDING SCHEMES Rance Fredericksen CMPE 257 Wireless Networks.

DTNLite: Reliable Data Delivery in Sensornets Rabin Patra and Sergiu Nedevschi UCB Nest Retreat 2004.

Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)

MAC Layer Protocols for Sensor Networks Leonardo Leiria Fernandes.

Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.

Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.

Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.

GUI: GPS-Less Traffic Congestion Avoidance in Urban Area with Inter-Vehicular Communication Presenter: Zhen Jiang or

Social Feature-based Multi-path Routing in Delay Tolerant Networks

Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.

Deadline-sensitive Opportunistic Utility-based Routing in Cyclic Mobile Social Networks Mingjun Xiao a, Jie Wu b, He Huang c, Liusheng Huang a, and Wei.

Routing Protocol Evaluation David Holmer

Wireless Access Research Congestion Avoidance in Source Routed Ad-Hoc Networks Bryan Hogan, Michael Barry, Ronan Skehill, Sean McGrath

Exploiting Temporal Dependency for Opportunistic Forwarding in Urban Vehicular Network [MANET-2] Presented by Cui Kai 2011/5/25 Hongzi Zhu, Sherman Shen,

Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,

Socially-aware pub-sub system for human networks Yaxiong Zhao Jie Wu Department of Computer and Information Sciences Temple University Philadelphia

Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group.

Cross-Layer Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks IEEE Journal of Selected Areas in Communications, 2008 Yu.

1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.

Energy Efficient Phone-to-Phone Communication Based on WiFi Hotspots in PSN En Wang 1,2, Yongjian Yang 1, and Jie Wu 2 1 Dept. of Computer Science and.

Content Sharing over Smartphone-Based Delay- Tolerant Networks.

ALeRT Project Georgia Tech and UMass Amherst DARPA DTN Meeting 2 August 2005 Washington, DC.

Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-

PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.

User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.

Research into the hybridization of the PRoPHET and ERP network routing algorithms George Mason University INFS 612 (Spring 2013) Project Group 4: Richard.

A Sociability-Based Routing Scheme for Delay-Tolerant Networks May Chan-Myung Kim

Complex Contagions Models in Opportunistic Mobile Social Networks Yunsheng Wang Dept. of Computer Science, Kettering University Jie Wu Dept. of Computer.

Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.

K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲教授學生 : 李京釜.

ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

1 An Efficient, Low-Cost Inconsistency Detection Framework for Data and Service Sharing in an Internet-Scale System Yijun Lu †, Hong Jiang †, and Dan Feng.

Opportunistic Flooding in Low-Duty- Cycle Wireless Sensor Networks with Unreliable Links Shuo Goo, Yu Gu, Bo Jiang and Tian He University of Minnesota,

UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.

Troubleshooting Mesh Networks Lili Qiu Joint Work with Victor Bahl, Ananth Rao, Lidong Zhou Microsoft Research Mesh Networking Summit 2004.

Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,

A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.

Multicasting in delay tolerant networks a social network perspective networks October2012 In-Seok Kang

© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.

A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.

Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.

On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)

Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, Cheng-Fu Chou, and Ting-Kai Huang.

Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.

Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.

2010 IEEE Global Telecommunications Conference, GLOBECOM 2010 Zheng Guo; Bing Wang; Jun-Hong Cui Prediction Assisted Single-copy Routing in Underwater.

Delay-Tolerant Networks (DTNs)

Mesh-based Geocast Routing Protocols in an Ad Hoc Network

1 Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks Eyuphan Bulut, Student Member, IEEE, and Boleslaw K Szymanski, Fellow,

A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks

Zhen Jiang Comp. Sci. Dept. West Chester University

En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2

Kevin Lee & Adam Piechowicz 10/10/2009

A survey in Delay Tolerant Networks Andrew Steinberg and Rafael Papa.

Presentation transcript:

Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy IUPUI

Outline Background Motivation Replication-Migration-based Routing Simulation and evaluation Conclusion

Delay Tolerant Networks (DTNs) Occasionally connected networks Examples of DTNs Deep space communication Wildlife monitoring Vehicular communication Social contact networks  Efficient routing is still a main challenge!

Motivation 1 Existing DTN routing:  Neighborhood Information (1-hop) Limited local view We use 2-hop information as the forwarding metric for routing guidance.

Motivation 2 Limited buffer space Resource Congestion  Message Discard Our approach:  Migrate the message to an alternative node when the available buffer space is below a threshold.

Replication-Migration-based Routing Replication-migration-based routing is based on prioritizing the schedule of the messages being transmitted to other nodes when there are multiple messages in the buffer based on message hop-count.  Message Replication  Message Migration

Message Replication Replication message selection Replication node selection

Replication message selection Hop-count (H m ): the number of forwardings that the message m has made Select the smallest hop-count message m (H m ) as the candidate replication message Hop-count threshold (T h ): control the message replication speed H m < T h (the message is new), replicate without node selection

Hop-count threshold

Replication node selection 2-hop activity level: the combination of its own encounter history and its neighbors’ encounter histories (number of contacts) Replicate the message to a higher 2-hop activity level node

An illustration of message replication

Message Migration When the available buffer space is below a threshold, the node will migrate a message to an alternative node that has enough buffer space early on.  Migration message selection : select the largest hop-count message to migrate  Migration node selection : migrate the message to an alternative node with enough buffer space

An illustration of message migration

Simulation Synthetic trace: 20 nodes follow random waypoint mobility model Real trace: Intel trace

Evaluation metrics Delivery rate Number of forwardings Latency Number of lost messages

Simulation Scenarios 1. Comparisons between joint replication- migration scheme and the replication scheme in different buffer space thresholds. 2. Comparisons between joint replication- migration scheme and the replication scheme in different hop-count thresholds. 3. Comparisons between using 2-hop information and 1-hop information schemes

Different buffer space thresholds Synthetic

Different hop-count thresholds Real

Different buffer space thresholds Synthetic Real

Conclusion A Joint Replication-Migration-based Routing  Message Replication  Message Migration Implementation and Simulation

Questions ?