Transcript 下載/瀏覽Download

A Novel Geographic Routing
Strategy over VANET
指導教授：許子衡 教授
報告學生：董藝興 學生
作者：Yan-Bo Wang; Tin-Yu Wu; Wei-Tsong Lee; Chih-Heng Ke;
出處：Advanced Information Networking and Applications
Workshops (WAINA), 2010 IEEE 24th International Conference
on
1
Introduction
• The structure of wireless network can be
divided into two modes: Infrastructure
Mode and Ad-Hoc Mode.
• In Infrastructure Mode, there are usually
Base Stations (BS) and Access Points (AP)
to connect to the large-scale wire network
for network communications.
2
Introduction
• In no matter MANET or VANET, a mobile
node must rely on Ad-hoc routing
protocols to determine how to deliver its
messages to the destination node.
3
Related work
4
Proposed algorithm
• A. System Model
– Assumes that each vehicle is equipped with
GPS to obtain the location information of itself.
– Every vehicle knows its own coordinates.
– In a fixed beacon interval, each vehicle
exchanges the information of the neighbouring
vehicles and updates the neighbour list table
by beacon messages.
– RNG and GG graphs are omitted to reduce the
calculating time and the complexity of the
algorithm.
5
Proposed algorithm
6
Proposed algorithm
• B. Proposed Algorithm
– Our proposed algorithm consists of four parts:
the purpose of beacon message, the strategy
in straight roads, the strategy at the
intersections, and the recovery strategy when
the algorithm fails.
7
Proposed algorithm
• Beacon Message Each vehicle broadcasts
beacon messages periodically to obtain the
information of the neighbouring vehicles.
• Therefore, the beacon message includes the
position, velocity and direction acquired
from GPS.
8
Proposed algorithm
9
Proposed algorithm
• Straight Road On a straight road, greedy
forwarding routing protocol is our chosen
strategy.
10
Proposed algorithm
• Intersection As above mentioned, we
assume that a vehicle can judge whether it
is the coordinator by beacon messages.
• When a vehicle broadcasts the signal that
it is a coordinator, the neighboring nodes
will change to predictive mode to predict
the movement of the neighboring nodes.
11
Proposed algorithm
12
Proposed algorithm
• When a vehicle broadcasts the signal that
it is a coordinator, the neighboring nodes
will change to predictive mode to predict
the movement of the neighboring nodes.
13
Proposed algorithm
14
Simulation scenario
15
Simulation scenario
16
Simulation scenario
17
Simulation scenario
18