VADD: Vehicle-Assisted Data Delivery in Vehicular Ad-hoc Networks

Slides:



Advertisements
Similar presentations
Low Overhead With Speed Aware Routing (LOWSAR) in VANETs By Kannikar Siriwong Na Ayutaya.
Advertisements

1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
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
CSLI 5350G - Pervasive and Mobile Computing Week 6 - Paper Presentation “Exploiting Beacons for Scalable Broadcast Data Dissemination in VANETs” Name:
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
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,
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Wenrui Zhao, Mostafa Ammar, and Ellen Zegura (2004) Presented by Justin Yackoski.
TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta.
TO-GO: TOpology-assist Geo- Opportunistic Routing in Urban Vehicular Grids Kevin Lee, Uichin Lee, Mario Gerla WONS /2/2009.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Data Dissemination in Vehicular Ad Hoc Networks Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University
Data Pouring and Buffering on the Road - A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks Δημόκας Νικόλαος Data Engineering Laboratory,
Ad Hoc Wireless Routing COS 461: Computer Networks
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Research Projects in the Mobile Computing and Networking (MCN) Lab Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University.
1 Meeyoung Cha and DK Lee Advisor - Sue Moon (Korea Advanced Institute of Science and Technology) IEEE INFOCOM 2005 Student Workshop Split-n-Save : Path.
Evgueni (Eugene) Khokhlov1 A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks (MDDV) Evgueni (Eugene) Khokhlov.
Topic: Vehicular Networks Team 6 R 陳彥璋 R 梁逸安 R 洪晧瑜.
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Outline Introduction Existing solutions for ad hoc
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Thesis Presentation Chayanin Thaina Advisor : Asst.Prof. Dr. Kultida Rojviboonchai.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Nour KADI, Khaldoun Al AGHA 21 st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications 1.
An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network.
RPB-MD: A Novel Robust Message Dissemination Method for VANETs Congyi Liu and Chunxiao Chigan Michigan Technological University GLOBECOM 2008.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
MDDV: A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks H. Wu, R. Fujimoto, R. Guensler and M. Hunter (gatech) VANET 2004: First ACM.
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,
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
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.
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov, Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
A Location-Based Routing Method for Mobile Ad Hoc Networks
Delay-Tolerant Networks (DTNs)
DELAY TOLERANT NETWORK
Ad hoc Data Dissemination in Vehicular Networks
GPSR Greedy Perimeter Stateless Routing
Sensor Network Routing
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Presentation transcript:

VADD: Vehicle-Assisted Data Delivery in Vehicular Ad-hoc Networks Jing Zhao Guohong Cao The Pennsylvania State University

Vehicular ad hoc networks - VANET The Big Picture Vehicular ad hoc networks - VANET Moving vehicles Stationary sites Local broadcasting infostations Sensors Hotspots Task Delivery a message from mobile vehicle to the fixed site besides street miles away. For delay tolerant applications (DTN) Multi-hop forwarding through VANET VANET Certain Kind Composed future devices share trans {… comm…} Organize ad hoc without specific Cover area up to Signi attention

End-to-end connection through multi-hop hard to set up Challenges Partitions Large scale sparse networks Uneven vehicle distribution High mobility End-to-end connection through multi-hop hard to set up Most current Ad hoc routing protocols implicitly rely on the existence of end-to-end connectivity; otherwise, drop packets. DSR AODV DSDV

Store, Carry and Forward Mobility creates opportunities Buffer and carry the packet when no routes Forward the packet to the nodes moves into the vicinity which can help packet delivery Possible to deliver the packet without an end-to-end connection Current “Store, Carry and Forward” protocols No control on mobility - Epidemic packet exchange A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks”. J. Davis, A. Fagg and B. Levine, “Wearable Computers As Packet Transport Mechanisms In Highly-partitioned Ad-hoc Networks” Controlled mobility W. Zhao, M. Ammar and E. Zegura, "A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks”, ACM MobiHoc 04’.

Vehicle-Assisted Data Delivery (VADD) Approach Adopt the idea of “carry and forward” Use predictable traffic pattern and vehicle mobility to assist efficient data delivery Objective Delivery ratio Delay Network traffic Assumptions A vehicle knows its own location via GPS, knows its neighbors’ location by beacon message. Vehicles are equipped with pre-loaded digital maps Road information and traffic statistics available

VADD Key issue Why not GPSR? Guidelines Select a forwarding path with smallest packet delivery delay Why not GPSR? Guidelines Transmit through wireless channel as much as possible Forward the packet via high density area Use intersection as an opportunity to switch the forwarding direction and optimize the forwarding path Geographically shortest path Fast speed wireless communication

VADD: Three Modes Intersection Mode StraightWay Mode Destination Mode Optimize the packet forwarding direction StraightWay Mode Geographically greedy forwarding towards next target intersection Destination Mode broadcast packet to destination Switch between on the forwarding path until

VADD: Intersection Mode Problem Which direction to go? VADD Model Which carrier to take? VADD Protocols Carrier: The node who can forward the packet as the next hop

VADD Model Find out the next forwarding direction with probabilistically the shortest delay Probabilistic Method Estimate the expected delivery delay from current intersection to the destination for each possible forwarding directions

Compute The Optimal Forwarding Direction Computation Steps 1. Place a boundary including source and destination 2. Derive a linear equation for each intersection within the boundary using Equation (1). 3. Generate a Linear equation system Can be proved to have unique solution 4. Solve the equation systems by Gaussian Elimination Complexity is Output: Priority list of the outgoing directions for the packet forwarding

Intersection Forwarding Protocol Known the priority list of outgoing directions, check the available carriers to ensure packet is forwarded to the preferred directions Not trivial, need to consider Location Mobility VADD Intersection Protocols Location First VADD (L-VADD) Direction First VADD (D-VADD) Multi-Path D-VADD (M-VADD) Hybrid VADD (H-VADD) B best neighbor towards optimal dir In terms of location

Location First VADD (L-VADD) Simple L-VADD The closest carrier towards the preferred direction in term of location as the next hop, whatever the moving direction of the chosen carrier. e.g. AB Vulnerable to Forwarding Loop Loop-free L-VADD Detection: Check previous hop Recovery: Mark suspect node Drawback Due to mobility, a lot of loops can be self-released with node still marked. Thus many valid carrier cannot be used Negative on delivery ratio Use Priority 2 The process continues until the selected direction has lower priority Use Priority 1

Direction First VADD (D-VADD) Basic Idea Only probe the carrier moving towards the preferred direction. Pick the one closest towards the preferred direction as the next hop. e.g. AC Can be proved no Forwarding Loop Drawback Delay may be higher

Multi-path D-VADD (MD-VADD) Basic idea Continue holds the packet after the packet is forwarded to sub-optimal direction Record dsent as the moving direction Extends the staying time of a packet at the intersection to increase the opportunity of meeting contact towards better direction. Pros: Higher delivery ratio Lower delay Cons: Duplicated packet More overhead

Hybrid VADD (H-VADD) Basic Idea Pros: Hybrid of L-VADD and D-VADD/MD-VADD “Try and Error” Try L-VADD first, switch to D-VADD/MD-VADD when L-VADD fails. Pros: Capture the advantages of both L-VADD and D-VADD.

Performance Evaluation Packet level simulation by ns2 Metrics Delivery ratio Delay Network traffic Compare the performance with: Epidemic Routing GPSR (with buffer) Mobility Scenario Traffic model derived from from TIGER database Map data are transformed into ns-2 readable data

Low node density VS High node density Delivery ratio Low node density VS High node density 150 nodes 210 nodes

Low node density VS High node density Delay Low node density VS High node density 150 nodes 210 nodes

Network Traffic Comparison between different protocols

Conclusion Existing routing protocols are not suitable for DTN applications in VANET. VADD adopts the idea of “carry and forward”, and also explores the predictable vehicle mobility. VADD use a linear equation model combining with probabilistic method to compute the optimal forwarding direction. Four VADD protocols to forward the packet towards the optimal direction/path at the intersection. Simulation results shows that the VADD protocols are better suitable for the multi-hop data delivery in VANET.

Jing Zhao jizhao@cse.psu.edu http://www.cse.psu.edu/~jizhao Thank You Jing Zhao jizhao@cse.psu.edu http://www.cse.psu.edu/~jizhao