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.
This PowerPoint covers VANET in general and illustrates its Components, standards, applications,Types of communications
Fleet Management Systems, Routing protocols, Challenges, and the deployment of VANET in Real Scenarios
vehicular Ad-Hoc Network:
this report contains a brief description on the VANET which can be considered as an application of MANET...
The report contains a basic overview, ITS, and routing algorithms.
This PowerPoint covers VANET in general and illustrates its Components, standards, applications,Types of communications
Fleet Management Systems, Routing protocols, Challenges, and the deployment of VANET in Real Scenarios
vehicular Ad-Hoc Network:
this report contains a brief description on the VANET which can be considered as an application of MANET...
The report contains a basic overview, ITS, and routing algorithms.
'' Internet of Vehicles (IoV) ,,
IoV is basically INTERNET of VEHICLES, a strong network between vehicles and living.
IoT is a proposed development of the Internet in which everyday objects have network connectivity, allowing them to send and receive data.
The new era of the Internet of Things is driving the evolution of conventional Vehicle Ad-hoc Networks into the Internet of Vehicles (IoV).
Being in generation of Internet connectivity, there is a need to stay in safe and hassle free environment.
According to recent predictions, 25 billion “things” will be connected to the Internet by 2020, of which vehicles will constitute a significant portion.
Objectives
IoV – distributed transport fabric capable of making its own decisions about driving customers to their destinations
IoV should have communications, processing, storage, intelligence, learning and strong security capabilities .
To be integrated in IoT framework and smart cities technologies.
Extended business models and the range of applications ( including mediaoriented) current vehicular networks.
Types Of Communication IoV
The IoV includes mainly five types of vehicular communications
1.Vehicle-to-Vehicle (V2V).
2.Vehicle to-Roadside Unit (V2R).
3.Vehicle-to-Infrastructure of cellular networks (V2I) .
4.Vehicle-to-Personal devices (V2P)
5.Vehicle-to-Sensors (V2S).
Network elements of IoV
A network model of IoV is proposed based on the three network elements, including cloud, connection, and client. The benefits of the design and development of IoV are highlighted by performing a qualitative comparison between IoV and VANETs
Hi guys,
This vehicular sensor networks is based on AD-hoc networks it is a real time project mmm..all most completed in US & UK...in india 50% of the project is completed.
ii had sent this ppt to NIT wgl out of 256 ppts only they were selected 12 ppts..in that my ppt is 3rd one...mmm..i felt soo gud at the moment..
if ur interested u can download and add ur thoughts...in the gud manner...
Vehicle to vehicle Communication Systems (V2V) are an emerging type of networks in which vehicles use a dynamic wireless exchange of data between nearby vehicles providing each other with information, such as safety warnings and traffic information.
The slides include the introduction to vehicular technology, two radio access vehicular technology DSRC & C-V2X. Also Vehicular Named Data Networking (V-NDN) along with research challenges and future research directions is presented.
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different
approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in
increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for
efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and
disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
'' Internet of Vehicles (IoV) ,,
IoV is basically INTERNET of VEHICLES, a strong network between vehicles and living.
IoT is a proposed development of the Internet in which everyday objects have network connectivity, allowing them to send and receive data.
The new era of the Internet of Things is driving the evolution of conventional Vehicle Ad-hoc Networks into the Internet of Vehicles (IoV).
Being in generation of Internet connectivity, there is a need to stay in safe and hassle free environment.
According to recent predictions, 25 billion “things” will be connected to the Internet by 2020, of which vehicles will constitute a significant portion.
Objectives
IoV – distributed transport fabric capable of making its own decisions about driving customers to their destinations
IoV should have communications, processing, storage, intelligence, learning and strong security capabilities .
To be integrated in IoT framework and smart cities technologies.
Extended business models and the range of applications ( including mediaoriented) current vehicular networks.
Types Of Communication IoV
The IoV includes mainly five types of vehicular communications
1.Vehicle-to-Vehicle (V2V).
2.Vehicle to-Roadside Unit (V2R).
3.Vehicle-to-Infrastructure of cellular networks (V2I) .
4.Vehicle-to-Personal devices (V2P)
5.Vehicle-to-Sensors (V2S).
Network elements of IoV
A network model of IoV is proposed based on the three network elements, including cloud, connection, and client. The benefits of the design and development of IoV are highlighted by performing a qualitative comparison between IoV and VANETs
Hi guys,
This vehicular sensor networks is based on AD-hoc networks it is a real time project mmm..all most completed in US & UK...in india 50% of the project is completed.
ii had sent this ppt to NIT wgl out of 256 ppts only they were selected 12 ppts..in that my ppt is 3rd one...mmm..i felt soo gud at the moment..
if ur interested u can download and add ur thoughts...in the gud manner...
Vehicle to vehicle Communication Systems (V2V) are an emerging type of networks in which vehicles use a dynamic wireless exchange of data between nearby vehicles providing each other with information, such as safety warnings and traffic information.
The slides include the introduction to vehicular technology, two radio access vehicular technology DSRC & C-V2X. Also Vehicular Named Data Networking (V-NDN) along with research challenges and future research directions is presented.
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different
approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in
increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for
efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and
disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols
Improved greedy routing protocol for VANETEditor IJCATR
VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols and along with its advantages and disadvantages. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
PERFORMANCE ANALYSIS OF AODV, DSDV AND AOMDV USING WIMAX IN NS-2IAEME Publication
WiMAX (IEEE 802.16) technology empowers ubiquitous delivery of wireless broadband facility for fixed and mobile users. WiMAX standard describes numerous physical and MAC layer characteristics. Here, an attempt is made to implement some of these physical and MAC layer structures including the mobility extension 802.16e. NS2 (Network Simulator-2) is chosen as the simulator to implement these features as NS2 provides suitable library to simulate network scenario. The performance of the simulated module is analyzed by running AODV, DSDV and AOMDV routing protocols on a wired-cum-wireless WiMAX scenario. The throughput for each routing protocol is calculated for varying number of mobile nodes or subscriber stations.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
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
