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

Slides:



Advertisements
Similar presentations
Architecture and Algorithms for an IEEE 802
Advertisements

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Supporting Cooperative Caching in Disruption Tolerant Networks
Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
Understanding Stateful vs Stateless Communication Strategies for Ad hoc Networks Victoria Manfredi, Mark Crovella, Jim Kurose MobiCom 2011.
Aruna Balasubramanian, Ratul Mahajan Arun Venkataramani, Brian N Levine, John Zahorjan Interactive WiFi Connectivity from Moving Vehicles University of.
Augmenting Mobile 3G Using WiFi Sam Baek Ran Li Modified from University of Massachusetts Microsoft Research.
Aruna Balasubramanian Department of Computer Science University of Massachusetts Amherst Architecting Protocols to Improve Connectivity.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Anticipatory Wireless Bitrate Control for Blocks Xiaozheng Tie, Anand Seetharam,
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
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.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Informed Detour Selection Helps Reliability Boulat A. Bash.
Block-switched Networks: A New Paradigm for Wireless Transport Ming Li, Devesh Agrawal, Deepak Ganesan and Arun Venkataramani presented by zhen qin, marcel.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Is an Office Without Wires Feasible? Sharad Agarwal Jakob Eriksson, Victor Bahl, Jitu Padhye.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad-hoc Networks
Augmenting Mobile 3G Using WiFi Aruna Balasubramanian Ratul Mahajan Arun Venkataramani University of Massachusetts Microsoft Research.
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.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
Augmenting Mobile 3G Using WiFi Aruna Balasubramanian Ratul Mahajan Arun Venkataramani University of Massachusetts Microsoft Research.
Potential-Based Entropy Adaptive Routing for Disruption Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT DTNRG, IETF 76 Hiroshima,
Multimedia and Mobile communications Laboratory Augmenting Mobile 3G Using WiFi Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani Jimin.
Aruna Balasubramanian Brian Neil Levine Arun Venkataramani University of Massachusetts, Amherst Enhancing Interactive Web Applications in Hybrid Networks.
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Challenged Networking An Experimental Study of New Protocols and Architectures Erik Nordström.
Context-aware Adaptive Routing for Delay Tolerant Networking Mirco Musolesi Joint work with Cecilia Mascolo Department of Computer Science University College.
Reducing Traffic Congestion in ZigBee Networks: Experimental Results th International Wireless Communications and Mobile Computing Conference (IWCMC)
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Disruption Tolerant Networks Aruna Balasubramanian University of Massachusetts Amherst 1.
Disruption Tolerant Networks Aruna Balasubramanian University of Massachusetts Amherst 1.
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.
Dilshad Haleem CST593 summer 2007 Routing In Wireless Mesh Networks CST593 Final Project by Dilshad Haleem Division of Computing Studies, ASU Polytechnic.
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.
Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area.
Department of Computer Science Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani DTN Routing as a Resource Allocation Problem.
Dissertation Proposal Aruna Balasubramanian Department of Computer Science, University of Massachusetts, Amherst Architecting Protocols To Enable Mobile.
Outline Introduction Existing solutions for ad hoc
24 st Oct Correlated Coding: Efficient Network Coding under Unreliable Wireless Links Shuai Wang, Song Min Kim, Zhimeng Yin, and Tian He University.
Surviving Attacks on Disruption- Tolerant Networks without Authentication John Burgess, George Dean Bissias, Mark Corner, Brian Neil Levine University.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
Aruna Balasubramanian, Yun Zhou, W Bruce Croft, Brian N Levine and Arun Venkataramani Department of Computer Science, University of Massachusetts, Amherst.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Data Stashing: Energy-Efficient Information Delivery to Mobile Sinks through Trajectory Prediction (IPSN 2010) HyungJune Lee, Martin Wicke, Branislav Kusy,
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Towards a Robust Protocol Stack for Diverse Wireless Networks Arun Venkataramani.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Context-aware Adaptive Routing for Delay Tolerant Networking
Routing Metrics for Wireless Mesh Networks
Routing Metrics for Wireless Mesh Networks
Architecture and Algorithms for an IEEE 802
AODV-OLSR Scalable Ad hoc Routing
Sensor Network Routing
Ad hoc Routing Protocols
Routing Metrics for Wireless Mesh Networks
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
Augmenting Mobile 3G Using WiFi
A High-Throughput Path Metric for Multi-Hop Wireless Routing
Proactive vs. Reactive Routing
Routing in Mobile Ad-hoc Networks
EEL 6935 Wireless Ad Hoc Networks
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Kyu-Han Kim and Kang G. Shin
Presentation transcript:

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics Xiaozheng Tie, Arun Venkataramani, Aruna Balasubramanian University of Massachusetts Amherst University of Washington

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 2 Wireless routing compartmentalized Protocols designed for well-connected meshes OLSR, ETT, ETX, EDR, … Protocols designed for intermittently- connected MANETs AODV, DSDV, DSR, … Protocols designed for sparsely- connected DTNs DTLSR, RAPID, Prophet, Maxprop, EBR, Random, … Research question: Can we design a simple routing protocol that ensures robust performance across networks with diverse connectivity characteristics all the way from well-connected meshes to mostly- disconnected DTNs and everything in between? Research question: Can we design a simple routing protocol that ensures robust performance across networks with diverse connectivity characteristics all the way from well-connected meshes to mostly- disconnected DTNs and everything in between?

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 3 Outline Compartmentalized design harmful Quantifying replication gain R3 design and implementation Evaluation Conclusion

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 4 Fragile performance Protocols perform poorly outside target environment  DTN protocols perform poorly in mesh  Replication wasteful  Mesh protocols perform poorly in DTNs  No contemporaneous path Mesh testbed DTN testbed 2.1x Normalized delay 2.2x Normalized delay

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 5 Spatial connectivity diversity DieselNet-Hybrid Vehicular DTN + Wifi Mesh 20 buses in Vehicular DTN 4 open AP WiFi mesh clusters < 100 contacts 100 – 200 contacts > 200 contacts

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 6 Temporal connectivity diversity Haggle Mobile ad hoc network 8 mobile and 1 stationary imotes 9 hour trace in Intel Cambridge Lab Fraction of connected nodes

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 7 Compartmentalized design harmful 1.Fragile performance under spatio- temporal diversity 2.Makes interconnection of diverse networks difficult Makes management difficult Conflates cross-layer concerns Stifles long-term innovation

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 8 Outline Compartmentalized design harmful Quantifying replication gain R3 design and implementation Evaluation Conclusion

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 9 Replication: Key difference DTN Mesh MANET Sparsely connected Well connected Intermittently connected Replication Forwarding Key question: Under what conditions and by how much replication improves performance?

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 10 Model to quantify replication gain 10 Replication gain Src Dst Expected delay of forwarding Expected delay of replication Random variable denoting the delay of path i

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 11 Example of replication gain 11 Replication gain Src Dst Expected delay of forwarding Expected delay of replication Replication gain depends on path delay distributions, not just expected value 5x delay improvement

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 12 Trace-driven analysis on DieselNet-DTN and Haggle Replication gain vs. number of paths Vehicular DTN in DieselNet Haggle Two paths suffice to capture much of the gain

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 13 Compartmentalized design harmful Quantifying replication gain R3 design and implementation Evaluation Conclusion Outline

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 14 R3 design overview Link-state Estimate per-link delay distribution Replication Select replication paths using model Adapt replication to be load-aware Source routing along selected path(s) Src Dst

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 15 Link delay Estimate link delay distribution T=0 T=0: probe 0 unacked T=1 T=1: probe 1 unacked T=2 T=2: probe 2 acked at T=2.1 Delay = = 0.1 Delay = = 1.1 Delay = = 2.1 Delay samples = {2.1, 1.1, 0.1} Delay to successfully transfer packet Link availability delay Node 1 Node 2

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 16 R3 design overview Src Dst Link-state Estimate per-link delay distribution Replication Select replication paths using model Adapt replication to be load-aware Source routing along selected path(s)

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 17 First path Path s.t. is smallest Selected using Dijkstra’s shortest path algorithm Second path Path s.t. is smallest Selected using delay distributions and model Path selection using model Src Dst

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 18 Problem Replication hurts performance under high load Solution Load aware replication Adapting replication to load Forwarding Replication Start actual_delay > t * model_estimated_delay actual_delay ≤ t * model_estimated_delay

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 19 R3 design overview Link-state Estimate per-link delay distribution Replication Select replication paths using model Adapt replication to be load-aware Source routing along selected path(s) Src Dst

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 20 Compartmentalized design harmful Quantifying replication gain R3 design and implementation Evaluation Deployment on a DTN and mesh testbed Simulation based on real traces Emulation using mesh testbed Conclusion Outline

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 21 DieselNet DTN testbed 20 buses in a 150 sq. mile area Mesh testbed 16 nodes in one floor Simulator validation using DieselNet deployment < 10% of deployment result R3 Deployment

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 22 Experimental settings Temporal diversity inherent in Haggle Spatial diversity inherent in DieselNet-Hybrid Varying load Compared protocols Replication: RAPID, Probabilistic Forwarding: DTLSR, AODV, OLSR Multi-configuration: SWITCH (RAPID+OLSR) R3 Trace-driven simulation

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science Robustness to temporal diversity Simulation based on Haggle trace 23 R3 reduces delay by up to 60% R3 increases goodput by up to 30% Hour Delay (min) Goodput (pkt/min)

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science Robustness to spatial diversity Simulation based on DieselNet-Hybrid trace 24 R3 improves median delay by 2.1x Grid Delay (min)

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science Emulating intermediate connectivity Mesh-based emulation approach Brings link up and down to vary connectivity Emulates connectivity diversity (but not mobility) 25 R3 reduces delay by up to 2.2x Hour Delay (sec)

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 26 Compartmentalized design harmful R3 ensures robust performance across diverse connectivity characteristics Unified link metric based on delay distributions Replication based on delay uncertainty model Adaptive replication based on network load Conclusion Thank you!

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science 27

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science Robustness to varying load Simulation based on DieselNet-Hybrid trace 28 R3 reduces delay by up to 2.2x over SWITCH

U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science More paths in DieselNet-Hybrid 29 Average delay when R3 uses k=2, 3, 4, 5 replication paths.