Transcript 下載/瀏覽Download

An Improved Vehicular Ad Hoc Routing
Protocol for City Environments
指導教授：許子衡 教授
學
生：董藝興
INTRODUCTION
• Routing in conventional mobile ad hoc
networks is a challenging task because of
the network's dynamic topology changes.
• Numerous studies and proposals of routing
protocols have been conducted to relay
data in such a context.
Challenges of VANET vs MANET
• VANET properties that derive this
difference are:
– Communication, energy and processing capacity:
– Displacement environment and mobility model:
– Network topology and connectivity:
GYTAR – IMPROVED GREEDY TRAFFIC
AWARE ROUTING PROTOCOL
• (J) = α × [ 1 - D p ] + β × [ min (Navg /Ncon , 1) ]
– J: the next candidate junction.
– I: the current junction
– D j : the curvemetric distance from the candidate
junction J to the destination.
– D i : the curvemetric distance from the current
junction to the destination.
– D p=Dj/Di(Dp determines the closeness of the
candidate junction to the destination point)
GYTAR – IMPROVED GREEDY TRAFFIC
AWARE ROUTING PROTOCOL
• Nv : total number of vehicles between I and J
• N c : number of cells 5 between I and J
• Navg: average number of vehicles per cell (N
avg = N v /N c )
• N con : constant which represents the ideal
connectivity degree we can have within a cell.
GYTAR – IMPROVED GREEDY TRAFFIC
AWARE ROUTING PROTOCOL
GYTAR – IMPROVED GREEDY TRAFFIC
AWARE ROUTING PROTOCOL