1 Interactive WiFi Connectivity For Moving Vehicles Presented by Zhou Yinggui.

Slides:



Advertisements
Similar presentations
SoNIC: Classifying Interference in Sensor Networks Frederik Hermans et al. Uppsala University, Sweden IPSN 2013 Presenter: Jeffrey.
Advertisements

U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Advantage Century Telecommunication Corp. AIL: Actively Intelligent Link-Layer Handoff Guo-Yuan Mikko Wang
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Interactive WiFi Connectivity For Moving Vehicles Presented by: Amal Alhosban October
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
Enhancing Vehicular Internet Connectivity using Whitespaces, Heterogeneity and A Scouting Radio Tan Zhang ★, Sayandeep Sen†, Suman Banerjee ★ ★ University.
Vehicular Network Applications VoIP Web Cab scheduling Congestion detection Vehicle platooning Road hazard warning Collision alert Stoplight assistant.
Aruna Balasubramanian, Ratul Mahajan Arun Venkataramani, Brian N Levine, John Zahorjan Interactive WiFi Connectivity from Moving Vehicles University of.
Aruna Balasubramanian Department of Computer Science University of Massachusetts Amherst Architecting Protocols to Improve Connectivity.
Sustaining Cooperation in Multi-Hop Wireless Networks Ratul Mahajan, Maya Rodrig, David Wetherall, John Zahorjan University of Washington.
1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
6/3/ Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness CS495 – Spring 2005 Northwestern University.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
Cooperative protocols for wireless vehicular communication
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.
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.
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
1 A Comparison of Mechanisms for Improving TCP Performance over Wireless Links Course : CS898T Instructor : Dr.Chang - Swapna Sunkara.
Eric Rozner - ETX.ppt1 A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S.J. Couto Daniel Aguayo John Bicket Robert Morris Presented.
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.
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.
Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks CIS 888 Prof. Anish Arora The Ohio State University.
Lect3..ppt - 09/12/04 CIS 4100 Systems Performance and Evaluation Lecture 3 by Zornitza Genova Prodanoff.
Multimedia and Mobile communications Laboratory Augmenting Mobile 3G Using WiFi Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani Jimin.
Divert: Fine-grained Path Selection for Wireless LAN Allen Miu, Godfrey Tan, Hari Balakrishnan, John Apostolopoulos * MIT Computer Science and Artificial.
Unwanted Link Layer Traffic in Large IEEE Wireless Network By Naga V K Akkineni.
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.
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
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
William Stallings Data and Computer Communications 7 th Edition Chapter 1 Data Communications and Networks Overview.
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.
 SNU INC Lab MOBICOM 2002 Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, John Heidemann, and Fabio Silva.
ﺑﺴﻢﺍﷲﺍﻠﺭﺣﻣﻥﺍﻠﺭﺣﻳﻡ. Group Members Nadia Malik01 Malik Fawad03.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Multirate Anypath Routing in Wireless Mesh Networks Rafael Laufer †, Henri Dubois-Ferrière ‡, Leonard Kleinrock † Acknowledgments to Martin Vetterli and.
15-744: Computer Networking L-12 Wireless Broadcast.
Dissertation Proposal Aruna Balasubramanian Department of Computer Science, University of Massachusetts, Amherst Architecting Protocols To Enable Mobile.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
Trading Coordination For Randomness Szymon Chachulski Mike Jennings, Sachin Katti, and Dina Katabi.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
Muhammad Niswar Graduate School of Information Science
ACN: Transport Protocols in Mobile Environments 1 Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments Ramon Caceres.
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.
2012 1/6 NSDI’08 Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru, Kyle Jamieson, and Hari Balakrishnan MIT Computer Science and Artificial.
Mitigating Congestion in Wireless Sensor Networks Bret Hull, Kyle Jamieson, Hari Balakrishnan MIT Computer Science and Artificial Intelligence Laborartory.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Data Stashing: Energy-Efficient Information Delivery to Mobile Sinks through Trajectory Prediction (IPSN 2010) HyungJune Lee, Martin Wicke, Branislav Kusy,
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Presentation transcript:

1 Interactive WiFi Connectivity For Moving Vehicles Presented by Zhou Yinggui

2 Cellular networks tend to be expensive 1 2 Background the ubiquity of WiFi

3 Background Can WiFi deployments support common applications from moving vehicles ? Vi-Fi

4 Introduction 1 Outlines Experimental platform 2 Handoff strategies 3 ViFi design & implementation 4 Evaluation 5 Conclusion 6

5 Introduction  ViFi is a protocol that minimizes disruptions to support interactive applications.  Hard Handoff --Clients communicate with only one basestation at any given time.

6  Hard handoffs are limited by 1.gray periods --- connectivity drops sharply and unpredictably; 2.the difficulty of estimating the continuously changing channel quality.  Hard handoff methods has frequent disruptions even when clients are close to WiFi basestations. Introduction

7  Diversity--using multiple basestations simultaneously.  ViFi exploits diversity and opportunistic receptions to minimize disruptions. Introduction

8 Experiment  Experiments are performed on two vehicular mobile network testbeds: VanLAN and DieselNet.  DieselNet--Downtown of Amherst, Massachusetts trace-driven study  VanLAN--Microsoft campus in Washington. live experiments.

9 VanLAN Eleven basestations (BSes) Two vehicles equipped with Atheros 5213 chipset, omnidirectional antennae, GPS unit. The box covers 828×559 m2 area. in which at least one packet is received by vehicles from any BS. Not all pairs of BSes are within wireless range of one another. The vehicles shuttle around the campus ten times a day, with a speed of 40 Km/h. Experiment

10 The equipment of vehicles are the same with VanLAN log all beacons heard from nearby BSes traces from Channels 1 and 6 log more than 100,000 beacons in 3 days Only analysis to BSes in the core of the town and to BSes that are visible on all three days DieselNet Experiment

11 Handoff strategies Using a trace-driven evaluation on VanLAN Each BS and vehicle broadcasts a 500-byte packet at 1Mbps every 100 ms. criterions: aggregate performance--total number of packets delivered and the total time or distance… periods of uninterrupted connectivity--contiguous time intervals when the performance of an application is above a threshold.

12  hard handoff 1.RSSI:client associates to BSes with higher signal strength. 2.BRR:client associates to the BS with the highest strength. 3.Sticky:client does not disassociate from the current BS until connectivity is absent. 4.History:client associates to the BS that has historically provided the best average performance. 5.BestBS:not practical, represents an upper bound of hard handoff. AllBSes:client opportunistically uses all BSes.Ideal method that represents an upper bound of any handoff protocol  diversity methods Handoff strategies

13 Handoff strategies Aggregate Performance pick BRR as representative Average number of packets delivered per day in Van-LAN by various methods.

14 adequate (uninterrupted) connectivity: at least 50% of the packets are received in a one-second interval. black dot (gray periods) : areas that connectivity drops sharply and unpredictably Handoff strategies Uninterrupted Connectivity go to 34

15 connectivity is often undermined by gray periods even close to BSes. gray periods tend to be short- lived, and do not severely impact aggregate performance. Handoff strategies Uninterrupted Connectivity

16 other definitions of adequate connectivity Handoff strategies Uninterrupted Connectivity

17 The insight of losses upstream direction losses are roughly independent across BSes and a packet sent by the vehicle is received by at least one BS with a high probability. the conclusion has been shown previously by S. Biswas and R. Morris. ExOR: opportunistic multi-hop routing for wireless networks. In SIGCOMM, Aug Handoff strategies

18 downstream direction gray period:even when a vehicle is associated to a BS with a low average loss rate, it can lose many packets in a small time period,hurting interactive applications. The insight of losses Handoff strategies

19 most burst losses are path dependent rather than receiver dependent. The insight of losses Handoff strategies downstream direction

20 ViFi protocol environment Diversity: A packet sent by a moving vehicle can often be heard by multiple BSes, and multiple BSes can often deliver packets to a moving vehicle. Bandwidth-limited inter-BS communication

21 Motivated by AllBSes imposes minimal additional load does not increase per packet latency can handle rapidly changing sets of BSes. ViFi protocol

22 the vehicle designates one of the nearby BSes as the anchor(by BRR). The vehicle designates other nearby BSes as auxiliary. The vehicle embeds the identity of the current anchor and auxiliary into the beacons which are broadcasted periodically. The vehicle also embeds the identity of the previous anchor for salvaging. Protocol overview ViFi protocol

23 1. src transmits the packet P. 2. If dst receives P, it broadcasts an ACK. 3. If an auxiliary overhears P, but within a small window has not heard an ACK, it probabilistically relays P. 4. If dst receives relayed P and has not already sent an ACK, it broadcasts an ACK. 5. If src does not receive an ACK within a retransmission interval, it retransmits P. Protocol overview ViFi protocol

24 1. src transmits the packet P. 2. If dst receives P, it broadcasts an ACK. 3. If an auxiliary overhears P, but within a small window has not heard an ACK, it probabilistically relays P. 4. If dst receives relayed P and has not already sent an ACK, it broadcasts an ACK. 5. If src does not receive an ACK within a retransmission interval, it retransmits P. Upstream packets are relayed on the inter-BS backplane and downstream packets on the vehicle-BS channel why relaying is better than a retransmission ? Protocol overview ViFi protocol

25 Computing relaying probability balance the trade-off between false negative(no diversity) and false positive (excessive load) The guidelines of probability computation G1: Account for relaying decisions made by other potentially relaying auxiliaries. G2: Prefer auxiliaries with better connectivity to the destination. G3: Limit the expected number of relayed transmissions. ViFi protocol

26 The overall strategy is to compute relaying probabilities locally and the expected number of packets is equal to 1. C i is the B i’s probability that B i has heard the packet but not an acknowledgment r i is B i’s relay times ( relay probability ) which is less than one. Computing relaying probability ViFi protocol

27 P ab represents the probability that b correctly receives a transmission from a Computing relaying probability ViFi protocol

28 C i = P src,Bi (1 − P src,dst P dst,Bi ) Ci is the Bi’s probability that Bi has heard the packet but not an acknowledgment(assumed independent) Computing relaying probability ViFi protocol

29 Opportunistic receptions provide a low-overhead but unreliable means. With probabilistic relaying, each BS relays based on an independently computed relaying probability, which avoids the need for explicit coordination messages between BSes. The resulting protocol is lightweight, decentralized,simple and works well. ViFi protocol

30 Salvaging Sometimes a vehicle moves out of range before the anchor BS can deliver packets from the Internet. newly designated anchors salvage packets by contacting the previous anchor over the backplane. the old anchor transfers any unacknowledged packets within a certain time threshold(based on the minimum TCP retransmission timeout,3s). ViFi protocol

31 current incoming reception probability packet reception probability from them to other nodes(learn from other nodes) Estimating packet reception probabilities using beacons P ab:the number of beacons received in a given time interval divided by the number that must have been sent. Beacons ViFi protocol

32 close to ideal two-fold compared to current methods low false positive and false negative rates Evaluation link- layer interactive application coordination mechanism

33 Link-layer performance Evaluation

34 Link-layer performance Evaluation back to 14

35 most of ViFi’s gain is a result from diversity. Given that only 1.2% of the packets are salvaged, this benefit of salvaging is disproportionate ( 10% ). application performance Evaluation TCP

36 VoIP VoIP is more challenging than TCP because quality is sensitive to both loss and delay. The standard for evaluating a voice call is the Mean Opinion Score (MoS) application performance Evaluation

37 interruption:the MoS value drops below 2 for a three-second period. ViFi average MoS is 3.4 compared with 3.0 of BRR. VoIP application performance Evaluation

38 Effectiveness of coordination Evaluation

39 Conclusion 1.current WiFi is unsuitable for vehicular client 2.firstly studyed basestation diversity , then designed ViFi 3.key to its effectiveness is a decentralized probabilistic algorithm 4.excellent link-layer performance 5.doubled the number of successful TCP transfers and the length of disruption-free VoIP calls

40 Appendix Extent of diversity Efficiency of medium usage Limitations Deployment