Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

Author(s):  
v. p. patil

A Mobile Ad hoc Network (MANET) is a class of wireless mobile nodes that dynamically organize themselves in arbitrary network topologies. Due to mobility of nodes, routing plays an important role in communication and routing protocols are divided into two basic classes: proactive and reactive. AODV is an on demand routing network protocol which is specially design for ad hoc networks. This protocol starts to, only when a certain node claims to send data and is an establish the route efficient ad hoc network routing protocol for data transfer. AODV suffers from the limitation of low bandwidth. In the AODV routing protocol, wherever a link breaks an error message is sent to the source indicating the link failure and further communication is stopped temporarily. This paper proposes an improved AODV routing protocol by including route repair scheme to overcome the link failure problems of its predecessor. In the proposed scheme the data packet is sent through alternate routes instead of dropping it. It is shown through simulation results that the proposed scheme improves data delivery rate.


Author(s):  
Kirthana Akunuri ◽  
Ritesh Arora ◽  
Ivan G. Guardiola

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks.


Author(s):  
Baban A. Mahmood ◽  
Dakshnamoorthy Manivanann

Purpose The purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking. Design/methodology/approach It uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol. Findings A new routing algorithm for MANETs which performs better than some of the existing algorithms. Research limitations/implications A major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks. Practical implications The authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature. Originality/value To the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.


Author(s):  
Kirthana Akunuri ◽  
Ritesh Arora ◽  
Ivan G. Guardiola

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks.


2017 ◽  
Vol MCSP2017 (01) ◽  
pp. 38-41
Author(s):  
Hari Shankar Sahu ◽  
Rupanita Das

Now a days telecommunication technology leads to a rapid growth of number of users, these number of users nothing but number of nodes in MANET.A wireless ad hoc network is a decentralized type of wireless network. The mobility of nodes effect on the performance of the network. Due to mobility of nodes the link breaks number of times which effect on the packet delivery. Therefore to analyze the performance, packet delivery fraction (PDF)can be used. This paper describe the packet delivery fraction of on demand routing protocol AODV and DSR on different terrain areas using GLOMOSIM.


2005 ◽  
Vol 11 (1-2) ◽  
pp. 21-38 ◽  
Author(s):  
Yih-Chun Hu ◽  
Adrian Perrig ◽  
David B. Johnson

Sign in / Sign up

Export Citation Format

Share Document