This document discusses geographical routing protocols for vehicular ad hoc networks (VANETs). It provides an overview of VANET characteristics and challenges, including changing network topology due to node mobility. Several geographical routing protocols are described, including GPSR, GPSR-AGF, GPCR, A-STAR, GSR, GyTAR and LOUVRE. The document compares GPSR and GPCR, and discusses how protocols like A-STAR may be better suited for urban environments compared to GPSR. Simulation tools for evaluating VANET protocols are also covered, along with considerations for implementing geographical routing in Bangladesh.
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Vanet Presentation
1. VANET(Vehicular Ad Hoc Networks)
Geographical Routing Protocol performance
evaluation inVANET
2. Group Member
Sayed Md. Mosarf Hossain
Dhali Md. Minhazul Abedin.
Supervised By
Md. Akter Hussain
3. Abstract
Vehicular Ad Hoc Network(VANET) has some characteristics
that are similar to the Mobile Ad Hoc Network(MANET) but
VANET has unique feature that make it special from
MANET.VANET is a form of network that provide
communication vehicle to vehicle and vehicle to roadside
wireless communication. It ensures that established routing
paths do not break before the end of data transmission. This is
a difficult problem because the network topology is constantly
changing and the wireless communication links are inherently
unstable, due to high node mobility.
4. Objectives
Eliminate of frequent disconnect of
network.
Making inter communication between
the node to avoid accident and journey
comfort and safely.
From out of network by using sensor
vehicles can communicate to the
destination.
Act as server and as a client.
5. A Vehicular Ad-Hoc Network, or VANET is a
technology that uses moving vehicles as nodes in a
network to create a mobile network. VANET turns
every participating vehicle into a wireless router or
node, allowing vehicles approximately 100 to 300
meters of each other to connect and, in turn, create
a network with a wide range.
The primary goal of VANET is to provide road
safety measures where information about vehicle’s
current speed, location coordinates are passed with
or without the deployment of Infrastructure.
Apart from safety measures, VANET also provides
value added services like email, audio/video sharing
etc,.
9. Goals Of VANET
• Improve traffic safety and comfort of
driving
• Minimize accidents, traffic intensity,
locating vehicles
• Up-to-date traffic information
• Intersection Collision warning
• Local danger warning
• Weather information
10. Function of VANET
•Each vehicle equipped with WiFi/WiMax device acts as a node
•Unique ID and IP address for each vehicle
•Each node can communicate with any other node
•Any vehicle can register its identity to a roadway WAP
•Information provided by the vehicles directly to the WAPs
•Collective information stored by the WAPs at a dynamic server
database
11. Challenges in VANET
•Changing topology due to mobile nodes
Routing / Broadcasting with reliability
Avoid collisions
•Critical response time for alerts
Sparse or Dense traffic
No prior control messages
•Security
Integrity and Authenticity
14. Geographical Routing Protocol
It is Based on Following Assumption:
All nodes can determine their own
position.
All nodes know the positions of their
direct neighbors.
The source node knows the position
of the destination.
16. DTN :
DelayTolerant Network (DTN) uses carry & forward strategy
to overcome frequent disconnection of nodes in the network.
Beacon :
Beacon means transmitting short hello message periodically
Overlay:
Overlay is a network that every node is connected by virtual
or logical links which is built on top of an existing network.
Some SpecialTerm to Know:
17. Beacon: Non Overlay
GPSR(Greedy Perimeter Stateless Routing )
•GPSR allows nodes to figure out who its closest
neighbors are (using beacons) that are also close to
the final destination the information is supposed to
travel to
•To calculate a path, GPSR uses a greedy forwarding
algorithm that will send the information to the final
destination using the most efficient path possible.
•The GPSR is a responsive and efficient routing
protocol for mobile, wireless networks. GPSR can be
applied to Sensor networks, Rooftop networks,
Vehicular networks and ad-hoc networks.
18. Beacon: Non Overlay
GPSR-AGF
GPSR we see that stale information of neighbors’ position are
often contained in the sending nodes’ neighbor table. For this
reason an approach which is called Advanced Greedy Forwarding
(AGF)
Though the destination node is moving its information in the
packet header of intermediate node is updated.
-Stale nodes of neighbor table can be detected.
Stale nodes of neighbor table can be detected
To find the shortest connected path it may not give desired optimal
solution.
19. Beacon: Overlay
GPCR(Greedy Perimeter Coordinator Routing)
GPCR is based upon the fact that city street form a natural
planner graph. GPCR does not require external static street
map for its operation. GPCR consists of two components: A
Restricted Greedy forwarding procedure, A repair strategy for
routing algorithm. A GPCR follows a destination based greedy
forwarding strategy, it routes messages to nodes at intersection.
Since GPCR does not use any external static street map so
nodes at intersection are difficult to find
20. Beacon: Overlay
A-STAR (Anchor-Based Street
andTraffic Aware Routing )
position based routing protocol which is specially design for city
scenarios for inter vehicle communication system. It ensures high
connectivity in packet delivery by using vehicular traffic city bus
information for an end-to-end connection
A-STAR routes based on two kinds of overlaid maps:
Statically rated map
Dynamically rated map
A statistically rated map is a graph that displays bus routes that
typically imply stable amount of traffic
21. Beacon: Overlay
GSR(Geographic Source
Routing)
As a strategy to deal with the high mobility of nodes on the one
hand and with the specific topological structure of a city on the
other hand, we have chosen a position-based routing method
that is supported by a map of the city
22. Beacon: Overlay
GyTAR(GreedyTraffic Aware Routing)
capable to find robust routes within city environments
GyTAR consists of two modules:
dynamic selection of the junctions
through which a packet must pass to reach Its destination
an improved greedy strategy used to forward packets between
two junctions.
23. Beacon: Overlay
LOUVRE
Geographic greedy overlay routing into two camps :
The first camp is geo-reactive overlay routing where the next
overlaid node is determined based on their neighboring nodes’
distance to the destination (STBR) or a combination of it and traffic
density (GyTAR)
The second camp is geo-proactive overlay routing where the
sequence of overlaid nodes is determined a-priori (GSR and A-STAR)
Landmark Overlays for UrbanVehicular Routing Environments
(LOUVRE) belongs to the second camp
24. Distinguish Between GPSR and
GPCR
Here we want to show the difference between two
routing protocol which is efficient for which
environment.
we choose here one simulation NSG-2.1.
Which is better performance for the evaluation a new
network and various routing protocol
Where we can set up length , node, bandwidth, and
other internet layer control with this simulator.
25.
26.
27. HowTo Implement
Here we can Implement the GPSR and A-STAR Routing
protocol in different graphical and comparative behavior
We will show which better for urban society and which
better in the rural society
We can analyze from here which is better for the high
density and low density road.
29. Basic of NS-2
Create a new simulator object
[Turn on tracing]
[Open your own trace files]
Create network (physical layer)
Create link and queue (data-link layer)
Define routing protocol
Create transport connection (transport layer)
Create traffic (application layer)
Insert errors
30. Simulation Setup: NS-2.35
[Step 1]
Before install NS2, you have to install some essential softwares:
sudo apt-get install tcl8.5-dev tk8.5-dev
sudo apt-get install build-essential autoconf automake
sudo apt-get install perl xgraph libxt-dev libx11-dev libxmu-dev
[Step 2]
Download NS2 source file from from ns2 site.
Then you will get a file named “ns-allinone-2.35.tar.gz“
[Step 3]
Unpack ns-allinone-2.35.tar.gz to your home directory.
(/home/Sayed is my home directory, you SHOULD change it to
your own!)
tar -zxvf ns-allinone-2.35.tar.gz -C /home/Sayed
[Step 4]
Install NS2:
cd /home/Sayed/ns-allinone-2.35
sudo ./install
31. WhyTwo Language Use in
Simulation NS-2
C++: Detailed protocol simulations require
systems programming language
byte manipulation, packet processing, algorithm
implementation
Run time speed is important
Turn around time (run simulation, find bug, fix bug,
recompile, re-run) is slower
Tcl: Simulation of slightly varying parameters or
configurations
quickly exploring a number of scenarios
iteration time (change the model and re -run) is more
important
32. SimpleTCl code for
Implementation
Now we implement simple TCL code in NS-2. Next it will
be present with more node and different routing
protocols.
34. Geographical Routing Protocol
In Bangladesh Perspective
In Bangladesh it is essential to use VANET in the highway to
reduce the traffic jam and others problem.
We choose A-STAR geographical routing protocol for our
urban environment. Here a lots of building situated in
the urban area and traffic congestion is maximum so
that it is efficient method for the city area.
In the Rural area or where no congestion at all there we
can use GPSR routing protocol. It will send packet by
greedy perimeter based.
35. Existing Work on Geographical
Routing Protocol
VANET Existing Project around the world-
CAR 2 CAR Communication Consortium
CARLINK Consortium
DIRICOM Project
SEISCIENTOS
WiSafeCar
Coopers
EVITA
GeoNet
SAFESPOT
36. Background Study & References
Kevin C. Lee, Uichin Lee, Mario Gerla .Oct(2009): "Survey of Routing Protocols in
Vehicular Ad Hoc Networks”, Advances inVehicular Ad-Hoc Networks: Developments
and Challenges, IGI Global.
Fan Li and Yu Wang; “Routing in Vehicular Ad Hoc Networks: A Survey”, IEEE
VehicularTechnology Magazine,Volume 2, Issue 2, June 2007; Pages: 12-22.
RAM SHRINGAR RAW, SANJOY DAS. “PERFORMANCECOMPARISONOF
POSITION-BASED ROUTING PROTOCOLS INVEHICLE-TOVEHICLE (V2V)
COMMUNICATION”, Ram Shringar Raw et al. / International Journal of
Engineering Science andTechnology (IJEST)
[Online] Available: http://en.wikipedia.org/wiki/Geographic_routing
37. Moez Jerbi, Sidi-Mohammed Senouci,Yacine Ghamri-Doudane. “Towards
Efficient Routing inVehicular Ad Hoc Networks”. Networks and Multimedia
Systems Research Group, ENSIIE, Evry, Cedex, France
WenjingWang, Fei Xie and Mainak Chatterjee. “An Integrated Study on
Mobility Models and Scalable Routing Protocols inVANETs” . IEEE
Communications Society subject matter experts for publication in the IEEE
INFOCOM 2008 proceedings.
Christian Lochert, Hannes Hartenstein, JingTian, Holger Füßler, Dagmar
Hermann, Martin Mauve.” A Routing Strategy forVehicularAd Hoc Networks in
City Environments”. FleetNet’ project as part of BMBF contract no. 01AK025D.J.
Tian acknowledges support from EU IST Project CarTalk 2000 (IST-2000-28185)
38. Brad Karp, H.T. Kung. “GPSR: Greedy Perimeter Stateless Routing
forWireless Networks”. AFOSR MURI Grant F49620-97-1-0382, and
NSF Grant CDA-94-0124, and in part by Microsoft Research, Nortel,
Sprint, ISI, and ACIRI
Ericson, “Communication and Mobility by Cellular Advanced Radio”,
ComCar project, [Online] Available: www.comcar. de, 2002
C.S. Murthy, B.S. Manoj,"AdHoc Wireless Networks", Pearson,
2004 pp. 336-338 and 627
[Online] Available: http://www.ist-drive.org/index2.html
39. S. Murthy, “An Efficient Routing Protocol for Wireless Networks,"
October 1996
M. Kihl, ”Reliable Geographical Multicast Routing inVehicular Adhoc
Networks”, 2007
Bilal Mustafa, Umar Waqas Raja,” Issues of Routing inVANET”, Master
Thesis, Computer Science, C m p t Si , andThesis no: MCS- 2010- 20
Jun 2010
Vehicular ad-hoc network, [Online]Available:
http://en.wikipedia.org/wiki/Intelligent_vehicular_ad-hoc_network
[Online]Available: http://www.isi.edu/nsnam/ns
40. Future Work
In realistic urban environment , there may be many obstacles
such as buildings and trees along the street, which make
communication of nodes in adjacent streets impossible
Some nodes are isolated when they go far from others, which
makes the network many sub-networks.We may change out
algorithm to adapt to DTN