A Stable Routing Protocol to Support ITS Services in VANET Networks Tarik Taleb, Ehssan Sakhaee, Abbas Jamalipour, Kazuo Hashimoto, Nei Kato, Yoshiaki.

Slides:



Advertisements
Similar presentations
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Advertisements

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.
overview Motivation Ongoing research on VANETs Introduction Objectives Applications Possible attacks Conclusion.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
TAODV: A Trust Model Based Routing Protocol for Secure Ad Hoc Networks Xiaoqi Li, Michael R. Lyu, and Jiangchuan Liu IEEE Aerospace Conference March 2004.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
University1 GVGrid: A QoS Routing Protocol for Vehicular Ad Hoc Networks Weihua Sun, Hirozumi Yamaguchi, Koji Yukimasa, Shinji.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Wireless Networks Final Project 2007/12/11. yctseng: 2 Subject Network communication  聊天室  Routing protocol  AODV RREP, RREQ, RERR  ZRP  DSR 
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Ad-hoc On-Demand Distance Vector Routing (AODV) Sirisha R. Medidi.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Dsr – dynamics source routing. basics Two types of routing –On-demand / reactive Information is only collected when required, I.e., when a packet needs.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Routing protocols MANET
Mobile Adhoc Network: Routing Protocol:AODV
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
A survey of Routing Attacks in Mobile Ad Hoc Networks Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaki Nemoto, Nei Kato, and Abbas Jamalipour Presented.
Enhancing Link Duration and Path Stability of Routing Protocols in VANETs Presented by: Sanjay Kumar, Haresh Kumar and Zahid Yousuf Supervised by: Dr.
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
Hop State Prediction Method using Distance Differential of RSSI on VANET 指導教授:許子衡 教授 學 生:董藝興 學生 1.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks Hrishikesh Gossain Mesh Networks Product Group, Motorola Tarun Joshi, Dharma.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:
Broadcast Methods for Inter-Vehicle Communications System T. Fukuhara, T. Warabino, T. Ohseki, K. Saito, K. Sugiyama, T. Nishida, K. Eguchi IEEE Communications.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
Video Streaming Transmission Over Multi-channel Multi-path Wireless Mesh Networks Speaker : 吳靖緯 MA0G WiCOM '08. 4th International.
A Receiver-Initiated Approach for Channel-Adaptive On-Demand Routing in Ad Hoc Mobile Computing Networks Xiao-Hui Lin, Yu-Kwong Kwok, and Vincent K. N.
6LoWPAN Ad Hoc On-Demand Distance Vector Routing Introduction Speaker: Wang Song-Ferng Advisor: Dr. Ho-Ting Wu Date: 2014/03/31.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
指導教授:許子衡 教授 學 生:黃群凱 2016/2/251 Proceedings of the 2008 IEEE International Conference on Vehicular Electronics and Safety Columbus, OH, USA. September 22-24,
Black-Burst-Based Multihop Broadcast Protocols for Vehicular Networks Gökhan Korkmaz, Eylem Ekici, and Füsun Özgüner Member, IEEE IEEE TVT 2007.
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.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
Mobile Ad Hoc Networking By Shaena Price. What is it? Autonomous system of routers and hosts connected by wireless links Can work flawlessly in a standalone.
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
TAODV: A Trusted AODV Routing Protocol for MANET
Analysis the performance of vehicles ad hoc network simulation based
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Internet Networking recitation #4
A comparison of Ad-Hoc Routing Protocols
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
by Saltanat Mashirova & Afshin Mahini
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Vinay Singh Graduate school of Software Dongseo University
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

A Stable Routing Protocol to Support ITS Services in VANET Networks Tarik Taleb, Ehssan Sakhaee, Abbas Jamalipour, Kazuo Hashimoto, Nei Kato, Yoshiaki Nemoto Tohoku University, Japan University of Sydney, Australia IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, TVT 2007

Outline Introduction Proposed routing protocol Performance evaluation Conclusion

Introduction IVC (Intervehicle Communication) AB

Introduction RVC (Road-vehicle Communication) A B

VANET is constrained by predefined roads, speed limits, and traffic control mechanisms. VANET network is a special case of MANET. Introduction

Introduction - scenario A B IVC and RVC coexist.

Introduction - motivation A B EDC

A B EDC Link breakage Introduction - motivation

Increasing link duration. Reducing the number of link-breakage events. Introduction - Goal

Proposed routing protocol (ROMSGP) -Grouping of vehicles -Calculation of LET (Link expiration time) -ROMSGP (Receive on Most Stable Group-Path) -Link breakage

Proposed routing protocol (ROMSGP) A Source C DF Destination B

A Source C DF Destination B

S1S1 S2S2 S3S3 S4S4 Group 1Group 3 Group 4 Group 2 Grouping of vehicles A Unit vector S 1 =(1,0), S 2 =(0,1), S 3 =(-1,0), S 4 =(0,-1) V A =(v x,v y ) VA.SNVA.SN V A =(10,0) V A . S 1 = 10 V A . S 2 = 0 V A . S 3 =-10 V A . S 4 = 0 Max + + _ _

Proposed routing protocol (ROMSGP) S1S1 S2S2 S3S3 S4S4 Group 1Group 3 Group 4 Group 2 Grouping of vehicles B Unit vector S 1 =(1,0), S 2 =(0,1), S 3 =(-1,0), S 4 =(0,-1) V B =(v x,v y ) VB.SNVB.SN V B =(0,-15) V B . S 1 = 0 V B . S 2 = -15 V B . S 3 = 0 V B . S 4 = 15 Max + + _ _

Proposed routing protocol (ROMSGP) Calculation of LET( Link expiration time ) r : Transmission or line-of-sight range V: Velocity Ө: Velocity angle ӨiӨi ӨjӨj vjvj vivi (x j, y j ) (x i, y i ) r i j

Proposed routing protocol (ROMSGP) Calculation of LET Ө i =30 度 Ө j = 0 度 v j =20 m/s (0,0 )(5,0 ) 5 LET = 1.2 v i =10 m/s Ө i = 0 度 Ө j = 0 度 v j =20 m/s (0,0 ) (5,0 ) 5 v i =10 m/s LET = 5.5 j j i i

CNARequired Data Required Time LifetimeGroup ID RREQ packet format Cached node address is where the address of the forwarding vehicle stored. The Required Data field defines the requested data. The Required Time field defines the time needed for the data transmission. Lifetime field will determine the expiration parameters for the request packet. The Group ID field identifies the group to which the requesting vehicle belongs. Proposed routing protocol (ROMSGP)

CNARequired Data Required Time LifetimeGroup ID RREQ packet format Cached node address is where the address of the forwarding vehicle stored. The Required Data field defines the requested data. The Required Time field defines the time needed for the data transmission. Lifetime field will determine the expiration parameters for the request packet. The Group ID field identifies the group to which the requesting vehicle belongs. Proposed routing protocol (ROMSGP)

CNARequired Data Required Time LifetimeGroup ID RREQ packet format Cached node address is where the address of the forwarding vehicle stored. The Required Data field defines the requested data. The Required Time field defines the time needed for the data transmission. Lifetime field will determine the expiration parameters for the request packet. The Group ID field identifies the group to which the requesting vehicle belongs. Proposed routing protocol (ROMSGP)

CNARequired Data Required Time LifetimeGroup ID RREQ packet format Cached node address is where the address of the forwarding vehicle stored. The Required Data field defines the requested data. The Required Time field defines the time needed for the data transmission. Lifetime field will determine the expiration parameters for the request packet. The Group ID field identifies the group to which the requesting vehicle belongs. Proposed routing protocol (ROMSGP)

CNARequired Data Required Time LifetimeGroup ID RREQ packet format Cached node address is where the address of the forwarding vehicle stored. The Required Data field defines the requested data. The Required Time field defines the time needed for the data transmission. Lifetime field will determine the expiration parameters for the request packet. The Group ID field identifies the group to which the requesting vehicle belongs. Proposed routing protocol (ROMSGP)

CNARequired Data Mobility Information Bottleneck LET RREP packet format Each node inputs its mobility information into this field before forwarding the RREP packet. The Bottleneck LET field represents the shortest lived link on the path. Proposed routing protocol (ROMSGP)

CNARequired Data Mobility Information Bottleneck LET RREP packet format Each node inputs its mobility information into this field before forwarding the RREP packet. The Bottleneck LET field represents the shortest lived link on the path. Proposed routing protocol (ROMSGP)

A SC GD F I E B J RREQ packet format CNARequired Data Required Time LifetimeGroup ID

Proposed routing protocol (ROMSGP) A SC GD F I E B J CNARequired Data Mobility Information Bottleneck LET RREP packet format

–With alternative path Choose the alternative path, and sent the RERR packet to the source vehicle. –Without alternative path If the broken link is less than h hops from the source, a RERR message with the details of the broken link is sent to the source vehicle. The source vehicle then initiates a route discovery. A local route recovery procedure. Link breakage Proposed routing protocol (ROMSGP)

Link breakage with alternative path RERR Proposed routing protocol (ROMSGP) A SC GD F I E B J

SEDFAGBCI Link breakage with local recovery Broadcast two-hop recovery request Proposed routing protocol (ROMSGP) RREC

Performance evaluation Vehicles move along the roads until they reach intersections. Their probabilities of continuing straight, turning right, or turning left are set to 0.5, 0.25, and 0.25, respectively.

Performance evaluation

Conclusion The ROMSGP can increase link duration, reduce the number of link-breakage. The ROMSGP can provide good stability and maintain high throughput in VANET. Guaranteeing a stable and reliable routing mechanism over VANET.

Thank you!