MDBG Tzu-Tung Liao 1 OUTLINE I. Introduction MANET VANET II. - - PowerPoint PPT Presentation
A ROUTING METHOD OF VANET MDBG Tzu-Tung Liao 1 OUTLINE I. Introduction MANET VANET II. Routing Protocols in VANET GSR AODV III. MOVING DIRECTION BASED GREEDY(MDBG) IV. MDBG Routing Algorithm V.
Tzu-Tung Liao
1
I. Introduction
II. Routing Protocols in VANET
III. MOVING DIRECTION BASED GREEDY(MDBG) IV. MDBG Routing Algorithm V. Comparisons & Simulations VI. Conclusion. VII. Q&A VIII. Reference
2
VANET(Vehicular Ad Hoc Network) is a kind of MANET MANET
VANET
3
Types of MANET:
Networks (VANETs) and Intelligent vehicular ad hoc networks (InVANETs)
Ad hoc Networks (iMANET)
Non-directional move Mobility devices connect to each others or internet.
4
Non-directional, but constrained by roads. Applications: 1. Vehicle-to-roadside communications
5
Param ameter ers MANET VANET
1. 1.
Cost of production Cheap Expensive
2. 2.
Change in n/w topology Slow Frequent and very fast
3. 3.
Mobility Low High
4. 4.
Node density Sparse Dense and frequently variable
5. 5.
Bandwidth Hundred kps Thousand kps
6. 6.
Range Up to100m Up to 500m
7. 7.
Node Lifetime Depends on power resource Depend on lifetime of vehicle
8. 8.
Multi hop routing Available Weakly available
9. 9.
Reliability Medium High
10.
Moving pattern of nodes Random Regular
11.
Addressing scheme Attribute based Location based
12.
Position acquisition Using ultrasonic Using GPS,RADAR
6
The routing protocols contains two major categories of topology-based and position-based routing.
7
Its routing table contains all destinations, the topology contains all timestamp that each nodes update, the next hop to destination, the number of nodes in the shortest path, and the sequence number identify the last updated. The shortest path using a well known Dijkstra’s Algorithm. Each nodes must know all destinations and construct a network topology. When a node moved, it sends to all neighbors to update table
Topology table is updated by neighbors after topology changed.
8
Neighbor MH2 MH6
Destination Sequence Distance Next Hop MH4 1256953732 MH4 MH1 1256962994 2 MH2 MH2 1256954512 1 MH2 MH3 1256963211 2 MH2 MH5 1256963140 2 MH6 MH6 1256954651 1 MH6 MH7 1256963178 2 MH6 MH8 1256964012 3 MH6
9
Neighbor MH2 MH6
Destination Sequence Distance Next Hop MH4 1256953732 MH4 MH1 1256966311 3 MH6 MH2 1256954512 1 MH2 MH3 1256963211 2 MH2 MH5 1256965991 2 MH6 MH6 1256965113 1 MH6 MH7 1256965976 2 MH6 MH8 1256966277 3 MH6
10
AODV is extended by DSR. Establish connection when a data want to send. When node in path is loss, reinitialize routing process. Different between AODV and DSR:
head when more nodes in path.
with the path nodes.
11
Searching destination node 14
12
Link 8-to-10 is broken
13
Based on the moving direction Used to enhance routing decision in packet delivery by finding a stable path while the source vehicle has packets to send to the target vehicle. MDBG uses three types of control messages to assist in packet delivery.
14
A. Basic Definitions and Environment Assumptions
card and a GPS module.
Vehicle) communication.
intersection.
each vehicle: north, east, south, west and none.
15
16
Definition of moving directions
17
18
19
B A The transmission range of vehicle A The upper bound of vehicle B The lower bound of vehicle B
20
reference point velocity is 0.
whose moving directions are opposite to reference point direction.
no forwarding vehicles are moving on the same direction.
21
Set 1: reference point (A) velocity is 0. Forwarding vehicle A stops at the traffic light of an intersection.
22
Set 2: Opposite to reference point(A, B) direction. Neighbor vehicles (C, D, E, F) stop at the traffic light.
23
Set 3: Moving on the same direction. Reference point and neighbor vehicles have the same moving directions.
24
Worst case: All Vehicles are opposite to reference point(A) direction. No neighbor vehicles move at the same direction as the reference point.
25
D. Path Broken Repair Strategy and Routing Loop Detection
26
D. Path Broken Repair Strategy and Routing Loop Detection (cont.)
27
28
29
30
31
Higher vehicle density can improve packet delivery ratio more. Higher vehicle density results in higher throughput. Higher vehicle density can reduce more number of broken links and more end-to-end delay. When the vehicle density becomes lower, the vehicle velocity becomes higher and there are fewer intermediate vehicles to select. The routing path is broken more frequently in lower vehicle density.
32
33
MDBG is used to enhance routing decision in packet delivery. MDBG algorithm is based on the geographical information collected by GPS. MDBG algorithm is proposed to leverage the problem while source vehicle and target vehicle move far apart in opposite directions. MDBG outperforms both AODV and DSR in packet arrival rate, throughput and average end-to-end delay.
34
35
Moving Direction Based Greedy Routing Algorithm for VANET/Print ISBN: 978-1-4244-7639-8 Padmini Misra, “Routing Protocols for Ad Hoc Mobile Wireless Networks”, http://www.cse.wustl.edu/~jain/cis788- 99/ftp/adhoc_routing/ Kevin C. Lee, Uichin Lee, Mario Gerla, "Survey of Routing Protocols in Vehicular Ad Hoc Networks“ http://www.scribd.com/doc/34832829/A-Comparative-study-
36