Presentation is loading. Please wait.

Presentation is loading. Please wait.

Content distribution and data retrieval in vehicular networks Broadnets 2005 Boston, Oct 2005 Mario Gerla Computer Science Dept UCLA.

Similar presentations


Presentation on theme: "Content distribution and data retrieval in vehicular networks Broadnets 2005 Boston, Oct 2005 Mario Gerla Computer Science Dept UCLA."— Presentation transcript:

1 Content distribution and data retrieval in vehicular networks Broadnets 2005 Boston, Oct 2005 Mario Gerla Computer Science Dept UCLA

2 Outline Opportunistic ad hoc networks Car to Car communications Car Torrent Ad Torrent Network games Cars as mobile sensor platforms

3 What is an opportunistic ad hoc net? wireless ad hoc extension of the wired/wireless infrastructure coexists with/bypasses the infrastructure generally low cost and small scale Examples –Indoor W-LAN extended coverage –Group of friends networked with Bluetooth to share an expensive resource (eg, 3G connection) –Peer to peer networking in the urban vehicle grid

4 Traditional ad hoc nets –Civilian emergency, tactical applications –Typically, large scale –Instant deployment –Infrastructure absent (so, must recreate it) –Very specialized mission/function (eg, UAV scouting behind enemy lines) –Critical: scalability, survivability, QoS, jam protection –Not critical: Cost, Standards, Privacy

5 Opportunistic ad hoc nets –Commercial, “commodity” applications –Mostly, small scale –Cost is a major issue (eg, ad hoc vs 2.5 G) –Connection to Internet often available –Need not recreate “infrastructure”, rather “bypass it” whenever it is convenient –Critical: Standards are critical to cut costs and to assure interoperability –Critical: Privacy, security is critical

6 Why opportunistic ad hoc networking? All Internet access will soon be wireless Most Internet terminals will be mobile with multiple radio interfaces (WiFi, Bluetooth, 3G etc) Yet, “single hop” access from terminal may not be feasible, or may not be efficient! –Obstacles; distance –Cost –Inefficient use of resources –Proximity networking application –etc Enter Opportunistic multi-hop networking

7 Urban “opportunistic” ad hoc networking From Wireless to Wired network Via Multihop

8 Opportunistic piggy rides in the urban mesh Pedestrian transmits a large file in blocks to passing cars, busses The carriers deliver the blocks to the hot spot

9 Car to Car communications for Safe Driving Vehicle type: Cadillac XLR Curb weight: 3,547 lbs Speed: 65 mph Acceleration: - 5m/sec^2 Coefficient of friction:.65 Driver Attention: Yes Etc. Vehicle type: Cadillac XLR Curb weight: 3,547 lbs Speed: 45 mph Acceleration: - 20m/sec^2 Coefficient of friction:.65 Driver Attention: No Etc. Vehicle type: Cadillac XLR Curb weight: 3,547 lbs Speed: 75 mph Acceleration: + 20m/sec^2 Coefficient of friction:.65 Driver Attention: Yes Etc. Vehicle type: Cadillac XLR Curb weight: 3,547 lbs Speed: 75 mph Acceleration: + 10m/sec^2 Coefficient of friction:.65 Driver Attention: Yes Etc. Alert Status: None Alert Status: Passing Vehicle on left Alert Status: Inattentive Driver on Right Alert Status: None Alert Status: Slowing vehicle ahead Alert Status: Passing vehicle on left

10 DSRC*/IEEE 802.11p : Enabler of Novel Applications Car-Car communications at 5.9Ghz Derived from 802.11a three types of channels: Vehicle-Vehicle service, a Vehicle-Gateway service and a control broadcast channel. Ad hoc mode; and infrastructure mode 802.11p: IEEE Task Group that intends to standardize DSRC for Car-Car communications * DSRC: Dedicated Short Range Communications

11 DSRC Channel Characteristics

12 Hot Spot Vehicular Grid as Opportunistic Ad Hoc Net

13 Hot Spot Power Blackout Power Blackout Vehicular Grid as Emergency Net

14 Power Blackout Power Blackout Vehicular Grid as Emergency Net

15 CarTorrent : Opportunistic Ad Hoc networking to download large multimedia files Alok Nandan, Shirshanka Das Giovanni Pau, Mario Gerla WONS 2005

16 You are driving to Vegas You hear of this new show on the radio Video preview on the web (10MB)

17 Highway Infostation download Internet file

18 Incentive for “ad hoc networking” Problems: Stopping at gas station to download is a nuisance Downloading from GPRS/3G too slow and quite expensive Observation: many other drivers are interested in download sharing (like in the Internet) Solution: Co-operative P2P Downloading via Car-Torrent

19 CarTorrent: Basic Idea Download a piece Internet Transferring Piece of File from Gateway Outside Range of Gateway

20 Co-operative Download Vehicle-Vehicle Communication Internet Exchanging Pieces of File Later

21 Bit Torrent review Swarming: Parallel downloads among a mesh of cooperating peers –Scalable: System capacity increases with increase in number of peers Tracker –Handles peer discovery Centralized Tracker, single point of failure Observation: Might not work for Wireless scenarios, because of intermittent connectivity Issue: Mobility increases churn of nodes participating in a download

22 BitTorrent…. A picture.. Uploader/downloader Tracker Uploader/downloader

23 Experimental Evaluation

24 CarTorrent: Gossip protocol A Gossip message containing Torrent ID, Chunk list and Timestamp is “propagated” by each peer Problem: how to select the peer for downloading

25 Peer Selection Strategies Possible selections: 1) Rarest First: BitTorrent-like policy of searching for the rarest bitfield in your peerlist and downloading it 2) Closest Rarest: download closest missing piece (break ties on rarity) 3) Rarer vs Closer: weighs the rare pieces based on the distance to the closest peer who has that piece.

26 Impact of Selection Strategy

27 Analytical Model n √n log n

28 Why is the Car-Torrent solution attractive? Bandwidth at the infostation is limited and “not convenient” –It can become congested if all vehicles stop –It is a nuisance as I must stop and waste time GPRS and 3G bandwidth is also limited and expensive The car to car bandwidth on the freeway is huge and practically unlimited! Car to car radios already paid for by safe navigation requirement CarTorrent transmissions are reliable - they involve only few hops (proximity routing)

29 AdTorrent: Digital BillBoards for Vehicular Networks V2V COM Workshop Mobiquitous 2005 Alok Nandan, Shirshanka Das Biao Zhou, Giovanni Pau, Mario Gerla

30 Digital Billboard Safer : Physical billboards can be distracting for drivers Aesthetic : The skyline is not marred by unsightly boards. Efficient : With the presence of a good application on the client (vehicle) side, users will see the Ad only if they actively search for it or are interested in it. Localized : The physical wireless medium automatically induces locality characteristics into the advertisements.

31 Digital Billboard Every Access Point (AP) disseminates Ads that are relevant to the proximity of the AP from simple text-based Ads to trailers of nearby movies, virtual tours of hotels etc business owners in the vicinity subscribe to this digital billboard service for a fee. Need a location-aware distributed application to search, rank and deliver content to the end-user (the vehicle)

32 AdTorrent Features Keyword Set Indexing to reduce Communication Overhead Epidemic Scoped Query Data Dissemination – optimized for vehicular ad hoc setting Broadcast medium leveraged for “communication efficiency” of gossip messaging Torrent Ranking Algorithm Swarming in actual content delivery Discourage Selfishness

33 Modeling Approach What is the impact of scope of epidemic dissemination on query hit rates? Model the network of caches, from the perspective of a single file i LRU-managed caches –Model Local requests –Model Remote requests i = file id, k = Number of hops, B = cache size P local (i,j,k): probability of finding the file in the local cache in the top j positions when the hop-limit is k Given p local (i,B,k) we can compute the hit rate for k-hop neighborhood as follows: P(i,B,k) = [1-(1 -p local (i,B,k)) M(k) ] we used M(k) ~ k 1.4 –M(k) derived from real-track mobility model

34 Neighborhood Model

35 Hit Rate vs. Hop Count with LRU

36 Car to car on-line games Claudio Palazzi (UCLA)

37 Massive Multiplayer Online Games Exploding market: –Tot Games industry revenues: $40 billion in 2003 –MMOG revenues: $1 billion in 2003, expected $10 billion in 2009 Jan-98Jan-05 8 millions Tot MMOG Subscribers MMOG Revenue by Region 2003

38 Design Challenges in On Line Games Consistency –contemporary uniformity of game state view in all nodes Responsiveness: –multiplayer gaming is extremely delay-sensitive Scalability: –the number of contemporary players should not be bounded Resilience to network conditions: –players’ performance should not depend on network conditions (Fairness)

39 New challenges in car to car on-line games Frequent changes in routing; handoffs Highly variable latency Highly variable bandwidth Intermittent connectivity Packet loss

40 Proposed Approach: Mirrored Game Server Architecture + Car-networking Scenario

41 Vehicular Sensor Network (VSN) Uichin Lee, Eugenio Magistretti (UCLA) Infostation Car-Car multi-hop 1. Fixed Infrastructure 2. Processing and storage 1. On-board “black box” 2. Processing and storage Car to Infostation Applications –Monitoring road conditions for Navigation Safety or Traffic control –Imaging for accident or crime site investigation

42 VSN Scenario: storage and retrieval Private Cars: –Continuously collect images on the street (store data locally) –Process the data and detect an event –Classify the event as Meta-data (Type, Option, Location, Vehicle ID) –Post it on distributed index Police retrieve data from distributed storage CRASH Meta-data : Img, -. (10,10), VID10 Meta-data : Img, Crash, (10,5), VID12

43 Distributed Index options Info station based index “Epidemic diffusion” index –Mobile nodes periodically broadcast meta-data of events to their neighbors (via epidemic diffusion) –A mobile agent (the police) queries nodes and harvests events –Data may be dropped when temporally stale and geographically irrelevant

44 Epidemic: diffusion

45 VSN: Mobility-Assist Data Harvesting * Relay its Event to Neighbors * Listen and store other’s relayed events

46 VSN: Mobility-Assist Data Harvesting Data Req 1.Agent (Police) harvests situation specific data from its neighbors 2.Nodes return the relevant data they have collected so far Data Rep

47 VSN: Mobility-Assist Data Harvesting (cont) Assumption –N disseminating nodes; each node n i advertises event e i “k”-hop relaying (relay an event to “k”-hop neighbors) –v: average speed, R: communication range –ρ : network density of disseminating nodes –Discrete time analysis (time step Δt) Metrics –Average event “percolation” delay –Average delay until all relevant data is harvested

48 VSN: Simulation Simulation Setup –Implemented using NS-2 –802.11a: 11Mbps, 250m transmission range –Average speed: 10 m/s –Network: 2400m x 2400m –Mobility Models Random waypoint (RWP) Road-track model (RT) : Group mobility model with merge and split at intersections –Westwood map is used for a realistic simulation

49 Road Track Mobility Model

50 Event diffusion delay:Random Way Point 1. ‘k’-hop relaying 2. m event sources Fraction of Infected Nodes K=1,m=1 K=1,m=10 K=2,m=10 K=2,m=1

51 Event diffusion delay: Route Tracks 1. ‘k’-hop relaying 2. m event sources Fraction of Infected Nodes

52 Data harvesting delay with RWP Agent Regular Nodes

53 Data harvesting results with RT AGENT REGULAR

54 Vehicular Grid Research Opportunities Lots of research done on ad hoc nets Most of it addressed large scale, tactical, civilian emergency problems New, research (beyond tactical) is critical for “opportunistic” deployment: –Security, privacy –Reward Third Party forwarding; prevent “cheating” –Realistic mobility models (waypoint mobility not enough!) –Delay tolerant networking –P2P protocols; proximity routing - epidemic dissemination

55 The End Thank You


Download ppt "Content distribution and data retrieval in vehicular networks Broadnets 2005 Boston, Oct 2005 Mario Gerla Computer Science Dept UCLA."

Similar presentations


Ads by Google