scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Optimized AODV routing protocol for Vehicular Ad hoc Networks

18 Oct 2010-pp 1-4
TL;DR: The paper uses network simulation tool(ns2) to simulate the two routing protocols in ad hoc networks based on Linux and compares and analyses the simulation results and do performance evolution.
Abstract: The paper presents the Vehicular Ad hoc Networks and the typical routing protocol: the ad hoc on-demand routing protocol (AODV) in mobile ad hoc networks and the optimized protocol AODV_OBD for protocol AODV; also presents a practical mobility model that enable the simulation experiment more veritable. Then it use network simulation tool(ns2) to simulate the two routing protocols in ad hoc networks based on Linux and then compares and analyses the simulation results and do performance evolution. We can infer that AODV_OBD routing protocol induces the packet delay to a certain extent compared with AODV routing protocol.
Citations
More filters
Proceedings ArticleDOI
08 Dec 2011
TL;DR: Simulation results show that the improved AODV routing protocol in VANET can get better performances in forms of link stability and packet delivery ratio and two steps optimization in route discovery and route selection process to improve the route stability and decrease overhead.
Abstract: The rise in the number of vehicles has led to a rapid increasing need for vehicle communication today. The emerging Vehicular Ad Hoc Network (VANET) is becoming more and more important, which can provide intelligent transportation application, comfort application and other services for people in vehicles. In order to provide stable routes and obtain good performance in VANET, proper routing protocols must be designed. At present, some kinds of routing protocol have been used in VANET. As one of the most important routing protocols used in Mobile Ad Hoc Networks (MANET), AODV routing protocol is also used in VANET, and is often evaluated with other kinds of protocols. However, due to the different characteristics of the two networks, AODV protocol suffers poor performances when it is applied in VANET directly. So in our improved AODV routing protocol in VANET, we make two steps optimization in route discovery and route selection process to improve the route stability and decrease overhead. Simulation results show that our proposed AODV protocol can get better performances in forms of link stability and packet delivery ratio.

70 citations

Proceedings Article
30 Mar 2012
TL;DR: A routing protocol IAODV (Improved AODV) that ensures giving timely and accurate information to drivers in V2V communication compare to A ODV protocols in city scenarios of vehicular ad hoc networks is proposed.
Abstract: Vehicular Ad hoc Network (VANET) is a new communication paradigm that enables the communication between vehicles on the road network which falls in two categories: 1) Vehicle to Vehicle (V2V) and 2) Vehicle to Infrastructure (V2I). Various approaches of data dissemination in vehicular Network are used to inform vehicles about dynamic road traffic condition for achieving safe and efficient transportation system. Types of VANET applications and inherent characteristics such as unpredictable node density, fast movement of vehicles, constrained mobility make data dissemination quite challenging and general purpose ad hoc network routing protocols cannot work efficiently with it. In this paper, we propose a routing protocol IAODV (Improved AODV) that ensures giving timely and accurate information to drivers in V2V communication compare to AODV protocols in city scenarios of vehicular ad hoc networks. Proposed IAODV is defined as limited source routing up to two hops with backup route between source node and destination node. The performance of the proposed IAODV protocol is compared with basic AODV protocol in terms of Avg. End-to-End Delay, Packet Loss Ratio, Packet Delivery Ratio and Normalized Routing Load. Simulation results show that IAODV performs better than AODV protocol in given city scenarios of VANETs.

33 citations

Journal ArticleDOI
TL;DR: This paper proposes a new approach, VANETomo, which uses statistical Network Tomography (NT) to infer transmission delays on links between vehicles with no cooperation from connected nodes, and shows VANetomo outperforming other congestion control strategies.

22 citations

Journal ArticleDOI
TL;DR: Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.
Abstract: A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.

22 citations

Proceedings ArticleDOI
03 Mar 2016
TL;DR: By considering the performance of each protocol it has been observed that LSGR protocol perform better than the DSDV and AODV protocol in ad hoc networks.
Abstract: Ad Hoc network is a infrastructureless network which are mainly used for various types of wireless communication. This network is broadly categorized in to two types mobile ad hoc networks (MANET) vehicular ad hoc network (VANET) utilizes vehicles as mobile nodes in a MANET to constitute a mobile network. Many routing protocols for MANET have designed. The main protocols involved Ad-hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance-Vector (DSDV) routing protocol and Link State Geographical Routing Protocol (LSGR). The performance of each protocol has been evaluated in terms of throughput, the normalized routing load, packet delivery ratio, delay etc. A network simulator-2.35 (NS-2) has been utilized for performance assessment of LSGR, AODV and DSDV. By considering the performance of each protocol it has been observed that LSGR protocol perform better than the DSDV and AODV protocol in ad hoc networks.

12 citations

References
More filters
Proceedings ArticleDOI
25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Abstract: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

11,360 citations


"Optimized AODV routing protocol for..." refers background in this paper

  • ...A. AODV Routing Protocol AODV[ 5 ] (Ad hoc On-Demand Distance Vector Routing) based on business needs to establish and maintain routing is a combination of DSR[6] (Dynamic Source Routing) and DSDV[7] (Destination Sequence Distance Vector) which is known as a typical on-demand routing protocol....

    [...]

Book
01 Jan 2008
TL;DR: In this article, the authors present a series of technical papers about ad hoc networks from a variety of laboratories and experts, and explain the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity.
Abstract: Ad hoc networks are to computing devices what Yahoo Personals are to single people: both help individuals communicate productively with strangers while maintaining security. Under the rules of ad hoc networking--which continue to evolve--your mobile phone can, when placed in proximity to your handheld address book, establish a little network on its own and enable data sharing between the two devices. In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts. The collection explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity. In this treatment, ad hoc networking covers a broad swath of situations. An ad hoc network might consist of several home-computing devices, plus a notebook computer that must exist on home and office networks without extra administrative work. Such a network might also need to exist when the people and equipment in normally unrelated military units need to work together in combat. Though the papers in this book are much more descriptive of protocols and algorithms than of their implementations, they aim individually and collectively at commercialization and popularization of mobile devices that make use of ad hoc networking. You'll enjoy this book if you're involved in researching or implementing ad hoc networking capabilities for mobile devices. --David Wall Topics covered: The state-of-the-art in protocols and algorithms to be used in ad hoc networks of mobile devices that move in and out of proximity to one another, to fixed resources like printers, and to Internet connectivity. Routing with Destination-Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), and other resource-discovery and routing protocols; the effects of ad hoc networking on bandwidth consumption; and battery life.

2,022 citations

Journal ArticleDOI
TL;DR: WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.
Abstract: We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.

1,452 citations

Patent
Christopher A. Tillman1
28 Sep 2011
TL;DR: In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts that explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity.
Abstract: Embodiments disclosed herein relate to ad hoc networking. An embodiment includes computing a routing score for a source node based on at least hardware capabilities of the source node, applications available to the source node, and networking capabilities of the source node. The embodiment further includes receiving at the source node, one or more routing scores from intermediate nodes directly or indirectly connected to the source node, and sending the data to the destination node based on at least the routing scores received from each intermediate node and one or more route paths associated with each intermediate node.

1,378 citations


"Optimized AODV routing protocol for..." refers background in this paper

  • ...So Ad hoc Networks is a wireless, distributed, multi-hop, self-organization, no-center, mobile networks[ 2 ]....

    [...]

01 Jan 2010
TL;DR: This research paper provides an overview of several routing protocols for mobile ad hoc networks by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance.
Abstract: Mobile Ad Hoc Network (MANET) is collection of multi-hop wireless mobile nodes that communicate with each other without centralized control or established infrastructure. The wireless links in this network are highly error prone and can go down frequently due to mobility of nodes, interference and less infrastructure. Therefore, routing in MANET is a critical task due to highly dynamic environment. In recent years, several routing protocols have been proposed for mobile ad hoc networks and prominent among them are DSR, AODV and TORA. This research paper provides an overview of these protocols by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance. The objective is to make observations about how the performance of these protocols can be improved.

334 citations