Enhancing AODV routing protocol using mobility parameters in VANET
31 Mar 2008-pp 229-235
TL;DR: A modification on AODV as MANET routing protocol to make it adaptive for VANET, which has used direction as most important parameter to select next hop during a route discovery phase.
Abstract: VANET is new generation of ad hoc networks that implement between vehicles on a road. Because of high mobility, routing in VANET has more problems than MANET. Thereby, in this paper we propose a modification on AODV as MANET routing protocol to make it adaptive for VANET. When a node is mobile, it has three mobility parameters: position, direction and speed. In our method, we have used direction as most important parameter to select next hop during a route discovery phase. With respect to mobility model, if nodes has same direction with source and/or destination nodes, our solution might selects them as a next hop. Position is another parameter that we used for next hop selection.
Citations
More filters
TL;DR: The challenges in designing the essential functional components of AHVN and the corresponding protocols for radio link control, routing, congestion control, security and privacy, and application development are discussed and the related work in the literature are reviewed.
201 citations
Cites background from "Enhancing AODV routing protocol usi..."
...Therefore, modifications of regular topology-based routing protocols were proposed to make them applicable to VANETs [74,75], and completely new topology-based routing protocols were proposed as well [76–78]....
[...]
TL;DR: An overview on current research state, challenges, potentials of VANETs as well as the ways forward to achieving the long awaited ITS is provided.
Abstract: Recent advances in wireless communication technologies and auto-mobile industry have triggered a significant research interest in the field of vehicular ad-hoc networks (VANETs) over the past few years. A vehicular network consists of vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications supported by wireless access technologies such as IEEE 802.11p. This innovation in wireless communication has been envisaged to improve road safety and motor traffic efficiency in near future through the development of intelligent transportation system (ITS). Hence, governments, auto-mobile industries and academia are heavily partnering through several ongoing research projects to establish standards for VANETs. The typical set of VANET application areas, such as vehicle collision warning and traffic information dissemination have made VANET an interesting field of mobile wireless communication. This paper provides an overview on current research state, challenges, potentials of VANETs as well as the ways forward to achieving the long awaited ITS.
139 citations
TL;DR: A unified formal model of the bio-inspired multimodular approaches applied to VANET routing is proposed and is highlighted to highlight main future research directions in this area.
Abstract: Vehicular Ad hoc NETworks (VANETs) play a key role in the design and development of Intelligent Transportation Systems (ITS) that aim to improve road safety and transportation productivity VANETs cover vehicle-to-vehicle and vehicle-to-roadside communications One of the most important challenges of this type of network is the timely and reliable dissemination of messages among vehicular nodes that enable drivers to take appropriate decisions to improve road safety In the past decade, many routing protocols for VANETs that can support reliability and safety requirements have been proposed These protocols suffer from several limitations, including complexity, lack of scalability to large scale networks, routing overheads, etc To address these limitations, various bio-inspired approaches have been proposed to route packets among vehicular nodes in an optimized manner We survey recent proposed bio-inspired routing algorithms for the VANET environment In particular, we identify the key features, strengths, and weaknesses of these algorithms and compare them by using various criteria Moreover, we propose a unified formal model of the bio-inspired multimodular approaches applied to VANET routing We highlight main future research directions in this area
125 citations
Cites background from "Enhancing AODV routing protocol usi..."
...Topology-based routing protocols determine routes based on topological links between nodes along the source-destination path [13], [14]....
[...]
...Over the last couple of years, several routing protocols [13]–[17] have been proposed in the literature to support road safety, multimedia, and comfort applications in VANETs....
[...]
TL;DR: In this article, a number of location information security mechanisms for VANETs are presented, which meet the requirements of the Confidentiality, Integrity, and Availability (CIA) information security model.
Abstract: It is fair to say that most, if not all, VANET applications rely on accurate location information. It is therefore imperative to provide mechanisms that ensure the integrity, availability, and confidentiality of location information. In this article we present a number of location security mechanisms specifically designed for VANETs. Proposed mechanisms for location integrity range from the use of onboard radar devices and GPS to simpler methods that rely on information fusion. We also address ways to enhance the availability of location information by selecting and maintaining stable routing paths. Finally, we discuss a mechanism that promotes location confidentiality through encryption/decryption and access control using geographical information. Our location information security mechanisms meet the requirements of the Confidentiality, Integrity, and Availability (CIA) information security model.
92 citations
TL;DR: HyBR is a unicast and a multipath routing protocol which guarantees road safety services by transmitting packets with minimum delays and high packet delivery and obtained better performance results with HyBR in contrast to results obtained from traditional routing algorithms.
85 citations
References
More filters
01 Jul 2003
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.
11,490 citations
"Enhancing AODV routing protocol usi..." refers background in this paper
...There are many routing protocols for ad hoc networks [9], [10], [11]....
[...]
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
"Enhancing AODV routing protocol usi..." refers background in this paper
...There are many routing protocols for ad hoc networks [9], [10], [11]....
[...]
TL;DR: Routing protocols for ad hoc networks are examined by providing an overview of eight different protocols by presenting their characteristics and functionality, and then a comparison and discussion of their respective merits and drawbacks are provided.
Abstract: An ad hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This article examines routing protocols for ad hoc networks and evaluates these protocols based on a given set of parameters. The article provides an overview of eight different protocols by presenting their characteristics and functionality, and then provides a comparison and discussion of their respective merits and drawbacks.
4,278 citations
"Enhancing AODV routing protocol usi..." refers background in this paper
...There are many routing protocols for ad hoc networks [9], [10], [11]....
[...]
TL;DR: This paper proposes to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets, which do not require any communication overhead in addition to maintaining positions of neighboring nodes.
Abstract: In a multihop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. In this paper, we propose to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets. Their maintenance does not require any communication overhead in addition to maintaining positions of neighboring nodes. Retransmissions by only internal nodes in a dominating set is sufficient for reliable broadcasting. Existing dominating sets are improved by using node degrees instead of their ids as primary keys. We also propose to eliminate neighbors that already received the message and rebroadcast only if the list of neighbors that might need the message is nonempty. A retransmission after negative acknowledgements scheme is also described. The important features of the proposed algorithms are their reliability (reaching all nodes in the absence of message collisions), significant rebroadcast savings, and their localized and parameterless behavior. The reduction in communication overhead for the broadcasting task is measured experimentally. Dominating set based broadcasting, enhanced by a neighbor elimination scheme and highest degree key, provides reliable broadcast with /spl les/53 percent of node retransmissions (on random unit graphs with 100 nodes) for all average degrees d. Critical d is around 4, with <48 percent for /spl les/3, /spl les/40 percent for d/spl ges/10, and /spl les/20 percent for d/spl ges/25. The proposed methods are better than existing ones in all considered aspects: reliability, rebroadcast savings, and maintenance communication overhead. In particular, the cluster structure is inefficient for broadcasting because of considerable communication overhead for maintaining the structure and is also inferior in terms of rebroadcast savings.
930 citations