1 / 1

Kevin C. Lee, Uichin Lee, Mario Gerla

SRC. DST. DST. SRC. TO-GO: TOpology-assist Geo-Opportunistic Routing in Urban Vehicular Grids. Kevin C. Lee, Uichin Lee, Mario Gerla Network Research Lab , UCLA { kclee,uclee,gerla } @cs.ucla.edu. Motivation: unreliable wireless channel nature in vehicular urban grids.

Download Presentation

Kevin C. Lee, Uichin Lee, Mario Gerla

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. SRC DST DST SRC TO-GO: TOpology-assist Geo-OpportunisticRouting in Urban Vehicular Grids Kevin C. Lee, Uichin Lee, Mario Gerla Network Research Lab, UCLA{kclee,uclee,gerla}@cs.ucla.edu Motivation: unreliable wireless channel nature in vehicular urban grids Unreliable delivery, packet loss: Conventional geographic routinglack required robustness Obstacles • Greedy forwarding: forward a packet to its neighbor closest to the destination • But greedy forwarding is unreliable due to channel errors Mobility Exploit spatial diversity for robust networking Geographic Routing in Vehicular Urban Grids Greedy Perimeter Coordinator Routing (GPCR) GpsrJ+: 2-hop Junction Prediction DST DST DST Junction nodes Bypass junction 2-hop neighbor info based prediction enables a forwarder to decide whether to bypass junction area SRC SRC SRC Nodal planar graph: Recovery mode is expensive Road topology: use greedy forwarding in a road segment GPCR: always forwards packets to a junction node GpsrJ+: bypass junctions if there is no need to switch directions TO-GO: Geo-Opportunistic Routing in Vehicular Urban Grids Exploit spatial diversity in urban grids Forwarding set selection method DST DST Largest SRC SRC Target • Choose a set that can hear the target • Find a neighbor node with largest neighbors • Filter its neighbors to avoid hidden terminals Finding a max set w/o hidden terminals: clique problem  NP-hard Existing schemes only considered the direction to the destination: less efficient in vehicular urban grids TO-GO: forwarding direction is determined using GpsrJ+ prediction Simulation Results Wireless-free channel Wireless error-prone channel • To-Go obtains consistently high PDR with lower hop count • At node 150, high density helps GPSR and GPCR in delivery • GPCR always stopping at junctions hurts its delivery • GpsrJ+ has highest PDR b/c it is oblivious to hidden terminals • Higher standard deviation, higher channel errors • TO-GO’s PDR remains high while GpsrJ+ decreases • GpsrJ+ hop count: [5.05, 7.47]; TO-GO hop count: [5.85, 8.35]

More Related