Aruna Balasubramanian, Ratul Mahajan Arun Venkataramani, Brian N Levine, John Zahorjan Interactive WiFi Connectivity from Moving Vehicles University of.

Slides:



Advertisements
Similar presentations
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Advertisements

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
1 Interactive WiFi Connectivity For Moving Vehicles Presented by Zhou Yinggui.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Vehicular Network Applications VoIP Web Cab scheduling Congestion detection Vehicle platooning Road hazard warning Collision alert Stoplight assistant.
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.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Ratul Mahajan Microsoft Research John Zahorjan University of Washington Brian Zill Microsoft Research Understanding WiFi-based connectivity from moving.
P561: Network Systems Week 4: Internetworking II Tom Anderson Ratul Mahajan TA: Colin Dixon.
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
Limited Application of ExOR Yao Zhao. Limited Application Static –No mobility Small Scale –Tens of nodes Dense network Maybe Only Rooftop Networks File.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Exploiting Opportunism in Wireless Networks Aruna Balasubramanian Guest Lecture, CS 653 (Some slides borrowed from the ExOr and MORE presentations at SigComm.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL Presented by: Ao-Jan Su.
E-ODMRP: Enhanced ODMRP with Motion Adaptive Refresh Soon Y. Oh, Joon-Sang Park, Mario Gerla Computer Science Dept. UCLA.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
ExOR: Opportunistic Multi-Hop Routing For Wireless Networks Sanjit Biswas & Robert Morris.
Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
Augmenting Mobile 3G Using WiFi Aruna Balasubramanian Ratul Mahajan Arun Venkataramani University of Massachusetts Microsoft Research.
SourceSync: A Distributed Architecture for Sender Diversity Hariharan Rahul Haitham Hassanieh Dina Katabi.
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.
Niranjan Balasubramanian Aruna Balasubramanian Arun Venkataramani University of Massachusetts Amherst Energy Consumption in Mobile Phones: A Measurement.
Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Tamer Nadeem Dept. of Computer Science Lec #7: MAC Multi-Rate.
CIS 725 Wireless networks. Low bandwidth High error rates.
Multimedia and Mobile communications Laboratory Augmenting Mobile 3G Using WiFi Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani Jimin.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
Divert: Fine-grained Path Selection for Wireless LAN Allen Miu, Godfrey Tan, Hari Balakrishnan, John Apostolopoulos * MIT Computer Science and Artificial.
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:
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
ECE 256, Spring 2008 Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So & Nitin Vaidya.
Using redundancy to enable interactive connectivity for moving vehicles Ratul Mahajan Microsoft Research Collaborators: Aruna Balasubramanian, Jitu Padhye,
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Wireless Sensor Networks COE 499 Energy Aware Routing
Disruption Tolerant Networks Aruna Balasubramanian University of Massachusetts Amherst 1.
Disruption Tolerant Networks Aruna Balasubramanian University of Massachusetts Amherst 1.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Wireless and Mobility The term wireless is normally used to refer to any type of electrical or electronic operation which is accomplished without the use.
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
15-744: Computer Networking L-12 Wireless Broadcast.
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.
High-performance vehicular connectivity with opportunistic erasure coding Ratul MahajanJitu PadhyeSharad AgarwalBrian Zill.
Challenges to Reliable Data Transport Over Heterogeneous Wireless Networks.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
1 UFlood: High-Throughput Wireless Flooding Jayashree Subramanian Collaborators: Robert Morris, Ramakrishna Gummadi, and Hari Balakrishnan.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
RBP: Robust Broadcast Propagation in Wireless Networks Fred Stann, John Heidemann, Rajesh Shroff, Muhammad Zaki Murtaza USC/ISI In SenSys 2006.
Energy-Efficient Protocol for Cooperative Networks.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Dirk Grunwald Dept. of Computer Science, ECEE and ITP University of Colorado, Boulder.
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
Topics in Distributed Wireless Medium Access Control
Xors in the air Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft.
Augmenting Mobile 3G Using WiFi
Augmenting Mobile 3G Using WiFi
Network: Non Traditional Routing
Opportunistic Routing in Multi-hop Wireless Networks
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Javad Ghaderi, Tianxiong Ji and R. Srikant
Presentation transcript:

Aruna Balasubramanian, Ratul Mahajan Arun Venkataramani, Brian N Levine, John Zahorjan Interactive WiFi Connectivity from Moving Vehicles University of Massachusetts Amherst Microsoft Research University of Washington

Motivation Increasing demand for network access from vehicles E.g., VoIP, Web, Cellular access expensive Ubiquity of WiFi Cheaper, higher peak throughput compared to cellular 2

Our work Internet Given enough coverage, can WiFi technology be used to access mainstream applications from vehicles? 3 Existing work shows the feasibility of WiFi access at vehicular speeds focus on non-interactive applications. e.g., road monitoring

Talk outline Can popular applications be supported using vehicular WiFi today? Performance is poor due to frequent disruptions How can we improve application performance? ViFi, a new handoff protocol that significantly reduces disruptions Does ViFi really improve application performance? VoIP, short TCP transfers 4

VanLAN: Our Vehicular Testbed Uses MS campus vans Base stations(BSes) are deployed on roadside buildings Currently 2 vans, 11 BSes 5

Measurement study Study application performance in vehicular WiFi setting Focus on basic connectivity Study performance of different handoff policies Trace-driven analysis Nodes send periodic packets and log receptions 6

Handoff policies studied Practical hard handoff Associate with one BS Current Ideal hard handoff Use future knowledge Impractical 7

Handoff policies studied Practical hard handoff Associate with one BS Current Ideal hard handoff Use future knowledge Impractical Ideal soft handoff Use all BSes in range Performance upper bound 8

Comparison of handoff policies Practical hard handoffIdeal hard handoffIdeal soft handoff Disruption Summary Performance of interactive applications poor when using existing handoff policies Soft handoff policy can decrease disruptions and improve performance of interactive applications 9

Talk outline Can popular applications be accessed using vehicular WiFi? How can we improve application performance? ViFi, a practical diversity-based handoff protocol Does ViFi really improve application performance? VoIP, short TCP transfers 10

Designing a practical soft handoff policy Goal: Leverage multiple BSes in range Not straightforward Internet 11 Constraints in Vehicular WiFi 1. Inter-BS backplane often bandwidth-constrained 2. Interactive applications require timely delivery 3. Fine-grained scheduling of packets difficult

Why are existing solutions inadequate? Opportunistic protocols for WiFi mesh (ExOR, MORE) Uses batching: Not suitable for interactive applications Path diversity protocols for enterprise WLANs (Divert ) Assumes BSes are connected through a high speed back plane Soft handoff protocols for cellular (CDMA-based) Packet scheduling at fine time scales Signals can be combined 12

ViFi protocol set up Internet A B D C Vehicle chooses anchor BS Anchor responsible for vehicle’s packets Vehicle chooses a set of BSes in range to be auxiliaries e.g., B, C and D can be chosen as auxiliaries ViFi leverages packets overheard by the auxiliary 13

ViFi protocol (1)Source transmits a packet (2)If destination receives, it transmits an ack (3)If auxiliary overhears packet but not ack, it probabilistically relays to destination (4)If destination received relay, it transmits an ack (5)If no ack within retransmission interval, source retransmits A B D C A B D C Downstream: Anchor to vehicle Upstream: Vehicle to anchor 14 Dest Source Dest Source

Why relaying is effective? Losses are bursty Independence Losses from different senders independent Losses at different receivers independent AB D C Upstream 15 AB D C Downstream

Guidelines for probability computation 1. Make a collective relaying decision and limit the total number of relays 2. Give preference to auxiliary with good connectivity with destination How to make a collective decision without per-packet coordination overhead? 16

Determine the relaying probability Goal: Compute relaying probability R B of auxiliary B Step 1: The probability that auxiliary B is considering relaying C B = P(B heard the packet). P(B did not hear ack) Step 2: The expected number of relays by B is E(B) = C B ¢ R B Step 3: Formulate ViFi probability equation,  E(x) = 1, x 2 auxiliary to solve uniquely, set R B proportional to P(destination hears B) Step 4: B estimates P(auxiliary considering relaying) and P(destination heard auxiliary) for each auxiliary 17 ViFi: Practical soft handoff protocol uses probabilistic relaying for coordination without per-packet coordination cost

ViFi Implementation Implemented ViFi in windows operating system Use broadcast transmission at the MAC layer No rate adaptation Deployed ViFi on VanLAN BSes and vehicles 18

Talk outline Can popular applications be accessed using vehicular WiFi? Due to frequent disruptions, performance is poor How can we improve application performance? ViFi, a practical diversity-based soft handoff protocol Does ViFi really improve application performance? 19

Evaluation Evaluation based on VanLAN deployment ViFi reduces disruptions ViFi improves application performance ViFi’s probabilistic relaying is efficient Also in the paper: Trace-driven evaluation on DieselNet testbed at UMass, Amherst Results qualitatively consistent 20

ViFi reduces disruptions in our deployment Practical hard handoff ViFi 21

ViFi improves VoIP performance > 100% Disruption = When mean opinion score (mos) is lower than a threshold Length of voice call before disruption Use G.729 codec 22 seconds ViFi Practical hard handoff

ViFi improves performance of short TCP transfers Median transfer time (sec) > 50% > 100% Number of transfers before disruption Workload: repeatedly download/upload 10KB files Disruption = lack of progress for 10 seconds 23 ViFi Practical hard handoff

ViFi uses medium efficiently efficiency Efficiency: Number of unique packets delivered/ Number of packets sent 24 ViFi Practical hard handoff

Conclusions Our work improves performance of interactive applications for vehicular WiFi networks Interactive applications perform poorly in vehicular settings due to frequent disruptions ViFi, a diversity-based handoff protocol significantly reduces disruptions Experiments on VanLAN shows that ViFi significantly improves performance of VoIP and short TCP transfers 25

Practical soft handoff Internet AllBS itself is not a practical protocol How does diversity even work in the downstream? 26

Distributed computation B needs to compute for each auxiliary (1) contending probabilities (2) P(V will hear from the auxiliary) Can be computed using loss rates between the auxiliary and its neighbors Compute loss rates using beacon receptions Embeds its loss rates in beacons Learns loss rates of auxiliaries from their beacons Estimates relaying probability of B, C and D A B D C V 27

Distributed probability computation A B D V B need to know for C and D 1.Probability that C and D are making a relaying decision 2.Probability that vehicle will hear from C and D Both can be estimated using loss probabilities between C and D and their neighbors Nodes exchange 2-hop loss rates using beacons B computes relaying probabilities for B, C and D Compute consistent relaying probabilities Compute consistent relaying probabilities C 28