Kevin C. Lee, Uichin Lee, Mario Gerla Network Research Lab, UCLA

Slides:



Advertisements
Similar presentations
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Advertisements

Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
A Presentation by: Noman Shahreyar
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector; Link State Proactive ad hoc routing:
Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Ant Rowstron Microsoft Research Cambridge, UK Joint work with Giovanni Pau (UCLA/sabbatical at MSRC) Wireless Workshop 31/7/20071.
Receiver Based Forwarding for Wireless Sensor Networks Rodrigo Fonseca OASIS Retreat January 2005 Joint work with Ana Sanz Merino, Ion Stoica.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
When does opportunistic routing make sense? Rahul C. Shah, Jan Rabaey University of California, Berkeley Sven Wiethölter, Adam Wolisz Technical University,
GeoLANMAR Routing: Asymptotic Analysis in Large and Dense Networks Broadnets 2005 Boston, Oct 5, 2005 Mario Gerla, Biao Zhou (UCLA) F. de Rango, S. Marano.
TO-GO: TOpology-assist Geo- Opportunistic Routing in Urban Vehicular Grids Kevin Lee, Uichin Lee, Mario Gerla WONS /2/2009.
Exploiting Opportunism in Wireless Networks Aruna Balasubramanian Guest Lecture, CS 653 (Some slides borrowed from the ExOr and MORE presentations at SigComm.
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
Georouting in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Presented by Scott McLaren Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia.
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
Data Pouring and Buffering on the Road - A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks Δημόκας Νικόλαος Data Engineering Laboratory,
MAC Reliable Broadcast in Ad Hoc Networks Ken Tang, Mario Gerla University of California, Los Angeles (ktang,
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad-hoc Networks
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
CCH: Cognitive Channel Hopping in Vehicular Ad Hoc Networks Brian Sung Chul Choi, Hyungjune Im, Kevin C. Lee, and Mario Gerla UCLA Computer Science Department.
Geographic Routing in Vehicular Ad Hoc Networks (VANETS) Kevin C. Lee Computer Science Department University of California, Los Angeles Chair – Professor.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
Geocast DTNs Presented by: Khulood Azwary Kratika Gupta Khulood 1.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
Evgueni (Eugene) Khokhlov1 A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks (MDDV) Evgueni (Eugene) Khokhlov.
Topic: Vehicular Networks Team 6 R 陳彥璋 R 梁逸安 R 洪晧瑜.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
EILEEN BALCI GPSR: Greedy Perimeter Stateless Routing for Wireless Networks.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
VAPR: Void Aware Pressure Routing for Underwater Sensor Networks
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
PLASMA: A New Routing Paradigm for Wireless Multihop Networks R. Laufer 1 P. Velloso 2 L. Vieira 3 L. Kleinrock 1 1 University of California, Los Angeles.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Geo Location Service CS218 Fall 2008 Yinzhe Yu, et al : Enhancing Location Service Scalability With HIGH-GRADE Yinzhe Yu, et al : Enhancing Location Service.
Efficient Flooding in Ad Hoc Networks: a Comparative Performance Study
Minimizing Recovery State In Geographic Ad-Hoc Routing Noa Arad School of Electrical Engineering Tel Aviv University Yuval Shavitt School of Electrical.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Multipath TCP in a Lossy ad hoc Wireless Network Medhocnet 2004 Bodrum, June 2004 Jiwei Chen, Kaixin Xu, Mario Gerla UCLA.
1 Presented by Jing Sun Computer Science and Engineering Department University of Conneticut.
Directional Routing for Wireless Mesh Networks: A Performance Evaluation Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
A New Recovery Method for Greedy Routing Protocols in High Mobile Vehicular Communications 指導教授:許子衡 教授 學 生:董藝興.
ProgessFace: An Algorithm to Improve Routing Efficiency of GPSR-like Routing Protocols in Wireless Ad Hoc Networks Chia-Hung Lin, Shiao-An Yuan, Shih-Wei.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Network Valery Naumov, and Thomas R. Gross Proceedings of IEEE 26 th International Conference on Computer.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
A Location-Based Routing Method for Mobile Ad Hoc Networks
Virtual Domain and Coordinate Routing in Wireless Sensor Networks
Pressure Routing for Underwater Sensor Networks
GPSR Greedy Perimeter Stateless Routing
TCP and MAC interplay in Wireless Ad Hoc Networks
Surviving Holes and Barriers in Geographic Data Reporting for
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
MobEyes: Smart Mobs for Urban Monitoring in Vehicular Sensor Networks
Greedy Distributed Spanning tree routing (gdstr)
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Presentation transcript:

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 Unreliable delivery, packet loss: Conventional geographic routing lack required robustness Obstacles SRC DST 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 SRC DST 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]