A Hybrid Routing Approach for Opportunistic Networks Ling-Jyh Chen 1, Chen-Hung Yu 2, Tony Sun 3, Yung-Chih Chen 1, and Hao-hua Chu 2 1 Academia Sinica.

Slides:

Advertisements

Similar presentations

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

Advertisements

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

Thesis Presentation Supervisor: Prof. Jörg Ott Student: Junxi Yin Espoo,

Supporting Cooperative Caching in Disruption 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.

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

Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.

1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.

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.

A Probabilistic Misbehavior Detection Scheme towards Efficient Trust Establishment in Delay-tolerant Networks Haojin Zhu, Suguo Du, Zhaoyu Gao, Mianxiong.

University of Waterloo & UOIT & INRIA Lille Presenter: Rongxing Lu

Improving Bluetooth EDR Data Throughput Using FEC and Interleaving Ling-Jyh Chen*, Tony Sun**, Yung-Chih Chen* *Institute of Information Science, Academia.

End-to-end Asymmetric Link Capacity Estimation Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Dept. of Computer Science, University of.

Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,

Adaptive Video Streaming in Vertical Handoff: A Case Study Ling-Jyh Chen, Guang Yang, Tony Sun, M. Y. Sanadidi, Mario Gerla Computer Science Department,

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

Compressive Oversampling for Robust Data Transmission in Sensor Networks Infocom 2010.

Scalable Team Multicast in Wireless Ad hoc networks Exploiting Coordinated Motion Mario Gerla University of California, Los Angeles.

Using Redundancy to Cope with Failures in a Delay Tolerant Network Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall Source:

Exploiting the Unicast Functionality of the On- Demand Multicast Routing Protocol Sung-Ju Lee, William Su, and Mario Gerla

Finding Self-similarity in Opportunistic People Networks Yung-Chih Chen 1 Ling-Jyh Chen 1, Yung-Chih Chen 1, Tony Sun 2 Paruvelli Sreedevi 1, Kuan-Ta Chen.

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

Opportunistic Networking (aka Pocket Switched Networking)

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

Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,

Potential-Based Entropy Adaptive Routing for Disruption Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT DTNRG, IETF 76 Hiroshima,

Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,

Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville

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.

Context-aware Adaptive Routing for Delay Tolerant Networking Mirco Musolesi Joint work with Cecilia Mascolo Department of Computer Science University College.

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.

Lab for Advanced Network Design, Evaluation and Research Mobility Profile based Routing Within Intermittently Connected Mobile Ad hoc Networks (ICMAN)

Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.

Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.

On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.

PPWEB: A Peer-to-Peer Approach for Web Surfing On the Go Ling-Jyh Chen, Ting-Kai Huang Institute of Information Science, Academia Sinica, Taiwan Guang.

Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim

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

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.

Department of Computer Science Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani DTN Routing as a Resource Allocation Problem.

Web Surfing on the Move: Needs, Opportunities, and Challenges Ling-Jyh Chen Institute of Information Science Academia Sinica,

SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.

PhD program in Computing Science and Engineering Cycle 26 Evaluation study of DTN Routing Protocols for WSN data gothering environment Khalil Massri, Alessandro.

An Evaluation of Routing Reliability in Non-Collaborative Opportunistic Networks Ling-Jyh Chen, Che-Liang Chiou, and Yi-Chao Chen Institute of Information.

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

a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.

Multipath TCP in a Lossy ad hoc Wireless Network Medhocnet 2004 Bodrum, June 2004 Jiwei Chen, Kaixin Xu, Mario Gerla UCLA.

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

Path Capacity Estimation in Time-Slotted Wireless Networks

Evaluating Mobility Support in ZigBee Networks

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.

Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.

Structure-Free Data Aggregation in Sensor Networks.

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

Ad-hoc Storage Overlay System (ASOS): A Delay-Tolerant Approach in MANETs Guang Yang 1, Ling-Jyh Chen 2, Tony Sun 1, Biao Zhou 1, Mario Gerla 1 1 University.

Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.

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

SPIN: Sensor Protocols for Information via Negotiation

Context-aware Adaptive Routing for Delay Tolerant Networking

A Cluster-based Routing Protocol for Mobile Ad hoc Networks

Delay-Tolerant Networks (DTNs)

ECE 544 Protocol Design Project 2016

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

Improving Opportunistic Data Dissemination via Known Vector

Ling-Jyh Chen and Ting-Kai Huang

PPWEB: A Peer-to-Peer Approach for Web Surfing On the Go

Efficient flooding with Passive clustering (PC) in Ad Hoc Networks

Presentation transcript:

A Hybrid Routing Approach for Opportunistic Networks Ling-Jyh Chen 1, Chen-Hung Yu 2, Tony Sun 3, Yung-Chih Chen 1, and Hao-hua Chu 2 1 Academia Sinica 2 National Taiwan University 3 University of California at Los Angeles

Opportunistic Networks A type of DTN  Intermittent Links  Very Large Delays  High Link Error Rates Network contacts appear arbitrarily w/o prior information; neither scheduled optimal routing nor mobile ferry based approaches can be applied. Delay Tolerant Networks (DTN) Opportunistic Networks Scheduled Networks Predictable Networks

Opportunistic Networks Potential Applications  interconnect mobile search and rescue nodes in disaster areas  allow message exchanges in developing areas  permit scientific monitoring of wilderness Examples  ZebraNet, DieselNet, CenWits, UWSN, …

Our Contribution We proposed an effective data forwarding scheme for opportunistic networks, called H-EC. H-EC combines the strength of erasure coding and the advantages of aggressive forwarding. aggressively robust We showed that H-EC performs aggressively for very small delay performance cases and remain robust for worst-case delay performance cases.

Outline Background and Overview  Related Work  Erasure coding H-EC details Evaluation Summary and Future Work

Related Work Data forwarding schemes for opportunistic networks  Flooding based Epidemic routing (Vahdat ‘00) Controlled flooding (Harras ‘05)  Coding based Erasure coding based data forwarding (Wang ‘05, Liao ‘06) Network coding based data forwarding (Widmer ‘05) Prediction based schemes  Probabilistic routing (Lindgren ‘04)  Mobility pattern based forwarding (Leguay ‘05)

Erasure Coding Provide better fault-tolerance by adding redundancy without the overhead of strict replication (e.g., Reed-Solomon, Gallager, Tornado, and IRA codes) Applications: P2P, overlay routing, WSN, data storage, etc. Our work is based on the generic erasure coding concept.

Erasure Coding ABCD A-1 A-2 A-3 A-4 B-1 B-2 B-3C-1 C-4 D-1 ABC DA-1 A-2 A-3 A-4 B-1 B-2 B-3 B-4 C-1 C-2 C-3 C-4 D-1 D-2 D-3 D-4 Lossy Channel (r,n)=(2,4)

Previous Approaches direct contact (DC) simple replication (srep) (k=2) EC: erasure coding based data forwarding (r=2, n=4)

Proposed Approach (I) A-EC A-EC: erasure coding + aggressive forwarding (r=2, n=4) Issues: Black-holes  unreliable (limited battery power and/or buffer size)  hardly moving closer towards the destination

Proposed Approach (II) H-EC H-EC: Hybrid of EC and A-EC  First copy is sent using EC  Second copy is sent using A-EC during the residual contact duration after sending the first EC block *Algorithms for scheduling the 2 nd copy of EC blocks: SF, FI, and BI

Simulation DTNSIM: a java based simulator Implementation  EC: erasure coding based data forwarding  R-EC: EC + simple replication  A-EC: erasure coding + aggressive forwarding  H-EC: EC + A-EC Scenarios:  34 nodes (including source and destination)  two-hop scenario  1200 bytes/msg, 12 msg/day, 160 days  Contact time & Inter-contact time: power-law w/ coefficient 0.6  EC: block size = 150 bytes, r = 2, n = 16  Black-holes: buffer size = 2 msg

Results I: General scenario

Results II: Black-hole scenario

Overhead Analysis r: replication factor of erasure coding n: the number of relays among which erasure code blocks are split k: the replication factor of srep algorithm Strategies to reduce overhead  Explicit ACK (or passive cure)  Adaptive Coding  Probabilistic Forwarding

Summary An effective data forwarding scheme is essential for opportunistic networks. H-EC combines the strength of erasure coding and the advantages of aggressive forwarding. H-EC is effective and robust, even when black-holes are present.

Future Work H-EC Evaluation  Using realistic mobility traces*  Analytical model H-EC Adaptation  Redundancy level  Probabilistic forwarding H-EC Applications  Scalable data transfer*  Testbed

Thank You! For more information…