Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks

Similar documents
VEHICULAR TRAFFIC FLOW MODELS

Wireless Internet Exercises

Giuseppe Bianchi, Ilenia Tinnirello

Detecting Stations Cheating on Backoff Rules in Networks Using Sequential Analysis

requests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1

Exact Distribution of Access Delay in IEEE DCF MAC

Information in Aloha Networks

On queueing in coded networks queue size follows degrees of freedom

P e = 0.1. P e = 0.01

Modeling and Simulation NETW 707

Cooperative HARQ with Poisson Interference and Opportunistic Routing

Giuseppe Bianchi, Ilenia Tinnirello

VEHICULAR ad-hoc networks (VANETs) have drawn. Cooperative Content Transmission for Vehicular Ad Hoc Networks using Robust Optimization

Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks

These are special traffic patterns that create more stress on a switch

Modeling Approximations for an IEEE WLAN under Poisson MAC-Level Arrivals

Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting

CSE 123: Computer Networks

Queue Analysis for Wireless Packet Data Traffic

Channel Allocation Using Pricing in Satellite Networks

A Mathematical Model of the Skype VoIP Congestion Control Algorithm

TCP over Cognitive Radio Channels

Performance Evaluation of Deadline Monotonic Policy over protocol

TRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS

How do Wireless Chains Behave? The Impact of MAC Interactions

ANALYSIS OF THE RTS/CTS MULTIPLE ACCESS SCHEME WITH CAPTURE EFFECT

WiFi MAC Models David Malone

Capturing Network Traffic Dynamics Small Scales. Rolf Riedi

A New Technique for Link Utilization Estimation

Generalized Two-Hop Relay for Flexible Delay Control in MANETs

Lan Performance LAB Ethernet : CSMA/CD TOKEN RING: TOKEN

Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure

On the Information Propagation Speed in Mobile Vehicular Ad Hoc Networks

Solutions to COMP9334 Week 8 Sample Problems

Performance analysis of IEEE WLANs with saturated and unsaturated sources

A Capacity Upper Bound for Large Wireless Networks with Generally Distributed Nodes

Message Delivery Probability of Two-Hop Relay with Erasure Coding in MANETs

Design of IP networks with Quality of Service

Flow-level performance of wireless data networks

EE 550: Notes on Markov chains, Travel Times, and Opportunistic Routing

Cellular-Assisted Vehicular Communications: A Stochastic Geometric Approach

Random Access Protocols ALOHA

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel

INavehicular ad hoc network (VANET), maintaining time

Lecture on Sensor Networks

Cell throughput analysis of the Proportional Fair scheduler in the single cell environment

Mathematical Analysis of IEEE Energy Efficiency

Markov Chain Model for ALOHA protocol

Peterborough Distribution Inc Ashburnham Drive, PO Box 4125, Station Main Peterborough ON K9J 6Z5

PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control

Transmission Schemes for Lifetime Maximization in Wireless Sensor Networks: Uncorrelated Source Observations

Approximate Queueing Model for Multi-rate Multi-user MIMO systems.

Analysis and Performance Evaluation of Dynamic Frame Slotted-ALOHA in Wireless Machine-to-Machine Networks with Energy Harvesting

Traffic Modelling for Moving-Block Train Control System

Impact of traffic mix on caching performance

Analysis of Urban Millimeter Wave Microcellular Networks

Interference Reduction In Cognitive Networks via Scheduling

Power Controlled FCFS Splitting Algorithm for Wireless Networks

Performance Analysis of the IEEE e Block ACK Scheme in a Noisy Channel

Stochastic Hybrid Systems: Applications to Communication Networks

MODELING INTERFERENCE IN FINITE UNIFORMLY RANDOM NETWORKS

1646 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 64, NO. 4, APRIL 2016

Outline Network structure and objectives Routing Routing protocol protocol System analysis Results Conclusion Slide 2

2314 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 60, NO. 5, JUNE 2011

On the Validity of IEEE MAC Modeling Hypotheses

Design and Analysis of a Propagation Delay Tolerant ALOHA Protocol for Underwater Networks

Radio Network Clustering from Scratch

Dynamic Power Allocation and Routing for Time Varying Wireless Networks

Distributed Scheduling for Achieving Multi-User Diversity (Capacity of Opportunistic Scheduling in Heterogeneous Networks)

October Characterizing Information Propagation Through Inter-Vehicle Communication on a Simple Network of Two Parallel Roads

Communications and Signal Processing Spring 2017 MSE Exam

Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks

Performance analysis of IEEE WLANs with saturated and unsaturated sources

Power Allocation and Coverage for a Relay-Assisted Downlink with Voice Users

Channel Selection in Cognitive Radio Networks with Opportunistic RF Energy Harvesting

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

I2V Highway and Urban Vehicular Networks: A Comparative Analysis of the Impact of Mobility on Broadcast Data Dissemination

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 57, NO. 6, NOVEMBER

Upper Bounds on Expected Hitting Times in Mostly-Covered Delay-Tolerant Networks

Reliable Data Transport: Sliding Windows

A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying

Delay-Based Connectivity of Wireless Networks

A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch

Line-of-Sight Obstruction Analysis for Vehicle-to-Vehicle Network Simulations in a Two-Lane Highway Scenario

STABILITY OF FINITE-USER SLOTTED ALOHA UNDER PARTIAL INTERFERENCE IN WIRELESS MESH NETWORKS

Optimal Association of Stations and APs in an IEEE WLAN

Node-based Distributed Optimal Control of Wireless Networks

On the Energy-Delay Trade-off of a Two-Way Relay Network

Throughput and Fairness Analysis of based Vehicle-to-Infrastructure Data Transfers

Performance Evaluation of Queuing Systems

Wireless Network Security Spring 2016

A Stochastic Control Approach for Scheduling Multimedia Transmissions over a Polled Multiaccess Fading Channel

Towards Achieving Full Secrecy Rate in Wireless Networks: A Control Theoretic Approach

Half-Duplex Gaussian Relay Networks with Interference Processing Relays

ECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process

Adaptive Distributed Algorithms for Optimal Random Access Channels

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1

Empirical Study of Traffic Velocity Distribution and its Effect on VANETs Connectivity

Solutions. 9. Ans. C. Memory size. 11. Ans. D. a b c d e f a d e b c f a b d c e f a d b c e f a b d e c f a d b e c f. 13. Ans. D. Merge sort n log n

Transcription:

VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada ECI Lab, General Motors Global R&D, Warren, MI 48105, USA 1

Outline Content Transmission in VANET Introduction Problem Statement Integrity-Oriented Content Transmission in Highway Vehicular Networks System Model Analytical Framework Call Admission Control Simulation Verification Conclusion 2

Content Transmission Digitalized information is always transformed into certain form of content files, of the heterogeneous sizes, for storage and transmissions Text contents: email, social blogs, etc. Video/audio contents: movie trailers, MP3 music files, etc. Infotainment applications in VANET typically boil down to the consecutive transmissions of the different types of content files Social communications with images, texts and video/audio clip transmission 3

Integrity of Content Transmission Content files need to be transmitted in their entirety so as to guarantee the successful presentation by the on-top application at the receiver Downloads stuck at 99% is annoying to BitTorrent users a Content transmissions over VANET are susceptible to frequent interruptions due to the dynamic motilities 1. Content transmissions take time to finish 2. The inter-vehicular connections tend to be short-lived This leads to fragment contents that are partially transmitted only during the connection time 1. Annoying to end-hosts causing wait but failure of media playout 2. Waste the precious VANET bandwidth e.g., transmission of a 3MB file over a 300kbps connection takes 82 seconds a TorrentFreak, How to Bring Dead Torrents Back to Life 4

Problem Statement Given the size of a content file to be transmitted and the density of vehicles on the road, we question on how likely the file can be transmitted successfully, and how to guarantee the integrity of the content transmissions We propose the integrity-oriented content transmission framework in VANET which is composed of 1. Analytical framework to evaluate the data volume that can be transmitted from sender to receiver within a given period of time 2. Admission control to filter suspicious transmission requests which are unlikely to be finished over the transient inter-vehicle connection time Assumptions Single-hop transmissions: multi-hop can be future work No multi-party download Throughput? Safe to transmit? 5

System Model Highway vehicular networks Vehicles move along a linear topology Vehicle i (sender) File size F ij Vehicle j (receiver) Investigate on content transmissions between a random selected pair of vehicles i (sender) and j (receiver) Let R(t) denote the transmission throughput from i to j at time t Let A(Υ) = Υ R(t)dt denote the data volume that can be 0 transmitted within a time period of Υ Provided Υ and content file size F ij to transmit, our goal is to 1. derive the expression of A(Υ) 2. evaluated the likelihood that A(Υ) > F ij 6

Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 0 Download subscription submitted at t = 0 7

Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 8

Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 2 Evaluate physical-layer capacity (function of distance) 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 9

Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 3 MAC throughput (function of physical-layer capacity) 2 Evaluate physical-layer capacity (function of distance) 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 10

Analytical Framework At time t = 0, the evaluation is performed We perform the following 4 steps 3 MAC throughput (function of physical-layer capacity) 4 Evaluate download volume as throughput integrated over time 2 Evaluate physical-layer capacity (function of distance) 1 Estimate headway distance At time t 0 Download subscription submitted at t = 0 11

Headway Distance Let H(t) denote the headway distance from i to j at time t H(t) 0 if i is ahead of j in the moving direction, otherwise, H(t) < 0 Let v i (resp. v j ) and a i (resp. a j ) denote the mean and variance, respectively, of the velocity of vehicle i (resp. j) We model H(t) as the queue length of a G/G/1 queue in the unit of meter We resort to the diffusion approximation to obtain the pdf of H(t) over time t The headway distance H(t) is modeled to follow the Wiener process, i.e., within the infinitesimal interval t, the increment of H is normally distributed as where µ = v j v i and σ = a j + a j H (t) = H (t + t) H (t) = µ t + Θ σ t,,,, G/G/1 12

Headway Distance (cont d) Let f H (x; r, t) denote the probability density function (pdf) of H (t) at time t, conditional on the initial queue length, and f H (x; r, t) = Pr{ x H (t) x + x H (0) = r}. where r denotes the initial headway distance, i.e., H(0) f H (x, r, t) can be characterized by the Kolmogorov equation (alternatively known as Fokker Planck equation) as 1 2 σ 2 x 2 f H (x; r, t) + µ x f H (x; r, t) = t f H (x; r, t) subject to the initial condition of the headway distance, According to [1], we have f H (x; r, t) = f H (x; r, 0) = δ (r), { } 1 (x r µt)2 exp 2πσt 2σt [1] D. R. Cox and H. D. Miller, The Theory of Stochastic Processes. Chapman & Hall/CRC, 1977 13

Physical-layer Transmission Rate Let C(t) denote the physical-layer transmission rate from i to j C(t) is dependent on H(t) C(t) is subjected to the fast channel fadings from i and j We adopt the model in [2, 3] to derive the expression of C(t), which is represented by H(t) Ref. [2] characterizes the fast channel fading between two vehicles Ref. [3] provides a model to evaluate the capacity with multiple modulation rates applied [2] L. Cheng, B. E. Henty, D. D. Stancil, F. Bai, and P. Mudalige, Mobile Vehicle-to-Vehicle Narrow-band Channel Measurement and Characterization of the 5.9 GHz Dedicated Short Range Communication (DSRC) Frequency Band, IEEE Journal on Selected Areas in Communications, vol. 25, no. 8, pp. 1501-1516, Oct. 2007. [3] J. Yoo, B. S. C. Choi, and M. Gerla, An Opportunistic Relay Protocol for Vehicular Road-side Access with Fading Channels, in Proc. of IEEE ICNP, 2010. 14

MAC Throughput The MAC throughput represents the effective transmission rate from i to j with channel contentions taken into consideration We assume that the fundamental DCF MAC with RTS/CTS handshake is applied to schedule the channel access of nodes Let N denote the number of vehicles contending for the transmission with i N follows the Poisson distribution with known mean value Let τ denote the transmission probability of each vehicle and 1 τ = W/2 + 1 where W is the minimum contention window size The MAC throughput R is evaluated as R (t) =τp suc FL i T where P suc is the successful transmission probability. FL i is the frame length of i. T is the average length of a time slot (where C (t) comes into play) 15

Data Volume That Can Be Transmitted The data volume that can be transmitted within a time period Υ is thus A(Υ) = Υ 0 R(t)dt Evaluating A(Υ) with the above equation involves stochastic integral We evaluate its mean, E (A(Υ)), and the upper-bound of its variance, V(A(Υ)) instead Call Admission Control: with file size F ij known, the transmission request is admitted iff Pr { A(Υ) > F ij } > ξ Vehicle i (sender) File size Fij We apply the one-sided Chebyshev inequality to derive a sufficient condition on E (A(Υ)) and V(A(Υ)) to have above inequality satisfied, with Pr { } V (A) A F ij V (A) + [ ] 2 1 ξ E (A) F ij Vehicle j (receiver) 16

Simulation We evaluate the accuracy of the analysis and effectiveness of the call admission control scheme using a simulator coded in C++ We simulate 1000 vehicles on a highway section with mean inter-distance 60 meters The velocity of vehicles follows the normal distribution with the mean and standard deviation uniformly selected from [70, 130] km/h and [21, 39] km/h, respectively Channel fading between vehicles follows the Nakagami-m distribution with parameters derived in [2] Legacy DCF with RTS/CTS handshake is deployed as MAC Mean 60 meters [2] L. Cheng, B. E. Henty, D. D. Stancil, F. Bai, and P. Mudalige, Mobile Vehicle-to-Vehicle Narrow-band Channel Measurement and Characterization of the 5.9 GHz Dedicated Short Range Communication (DSRC) Frequency Band, IEEE Journal on Selected Areas in Communications, vol. 25, no. 8, pp. 1501-1516, Oct. 2007. 17

Accuracy of Analysis We focus on a randomly selected pair of vehicles and report the mean and variance of its data volume download over time Mean Data Volume (in bytes) 2.5 2 1.5 1 0.5 3 x 107 Analysis Simulation 30 60 90 120 150 180 210 240 Simulation Time (in seconds) Variance of Data Volume 14 12 10 8 6 4 2 x 10 13 Analysis Simulation 30 60 90 120 150 180 210 240 Simulation Time (in seconds) The analysis of the mean data volume matches the simulations well As time increases, the gap between the upper bound of download volume variance and the simulation increases In real-world applications, connection time would be typically short 18

Effectiveness of Call Admission Control (CAC) Fraction of Fragment Contents 0.6 0.5 0.4 0.3 0.2 0.1 std = 54 km/h, without CAC std = 30.6 km/h, without CAC std = 10.8 km/h, without CAC std = 54 km/h, with CAC std = 30.6 km/h, with CAC std = 10.8 km/h, with CAC Valid Data Volume (in bytes) 6 x 107 5 4 3 2 1 std = 54 km/h, without CAC std = 30.6 km/h, without CAC std = 10.8 km/h, without CAC std = 54 km/h, with CAC std = 30.6 km/h, with CAC std = 10.8 km/h, with CAC 0 within [0,100s] within [0,450s] 0 within [0, 100s] within [0, 450s] With CAC applied, portion of fragment content transmissions reduces dramatically With CAC applied, the download volume of valid contents increases Small file size is favored 19

Conclusion The infotainment applications in VANET may boil down to the transmission of consecutive content files from send to receiver The contents need to be transmitted in their entirety so as to be useful to the on-top applications Existing literature largely focus on the packet-level performance in throughput and delay of packet transmissions, but neglect the session-level performance in terms of the integrity of content transmissions Given the mobility statistics of vehicles, we develop a mathematical framework to evaluate the data volume that can be transmitted among a random pair of vehicles Based on the model, we then propose a call admission control mechanism to filter to suspicious transmission requests Future work Extend the framework to multi-hop transmissions Develop the channel scheduling scheme to guarantee the integrity of content transmissions 20

Thank You! Slides are available at author s (Tom H. Luan) website: http://bbcr.uwaterloo.ca/ hluan Please forward your questions to the author through email: hluan@uwaterloo.ca 21