Research of Improvement of GPSR Protocol in Vehicular Ad Hoc Networks

2015 ◽  
Vol 738-739 ◽  
pp. 1115-1118
Author(s):  
Li Cui Zhang ◽  
Xiao Nan Zhu ◽  
Zhi Gang Wang ◽  
Guang Hui Han
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Data Packet ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
End To End Delay ◽  
Hoc Networks

Considering the shortcoming of the traditional Greedy Perimeter Stateless Routing Protocol in the Vehicular Ad hoc Networks ,this paper focuses on an improved GPSR protocol based on the density of vehicle flow .This new scheme includes macro-directing algorithm , micro-forwarding strategy and the maintenance of the neighbor list.The simulation result shows that compared with the traditional GPSR protocol, the new GPSR protocol improves data packet delivery ratio, but its average end-to-end delay is slightly larger than before.

scholarly journals 802.11p Profile Adaptive MAC Protocol for Non-Safety Messages on Vehicular Ad Hoc Networks

2018 ◽  
Vol 12 (1) ◽  
pp. 208
Author(s):  
Shamsul J Elias ◽  
M. Elshaikh ◽  
M. Yusof Darus ◽  
Jamaluddin Jasmis ◽  
Angela Amphawan
Keyword(s):  
Ad Hoc Networks ◽  
Congestion Control ◽  
Data Transmission ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mac Protocol ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Hoc Networks

<p>Vehicular Ad hoc Networks (VANET) play a vital Vehicle to Infrastructure (V2I) correspondence frameworks where vehicle are convey by communicating and conveying data transmitted among each other. Because of both high versatility and high unique network topology, congestion control should be executed distributedly. Optimizing the congestion control in term of delay rate, packet delivery ratio (PDR) and throughput could limit the activity of data packet transmissions. These have not been examined altogether so far – but rather this characteristic will be fundamental for VANET system execution and network system performance. This paper exhibits a novel strategy for congestion control and data transmission through Service Control Channel (SCH) in VANET. The Taguchi strategy has been connected in getting the optimize value of parameter for congstion control in highway environment. This idea lessens the pointless activity of data transmission and decreases the likelihood of congested in traffic in view of execution for measuring the delay rate, packet delivery ratio (PDR) and throughput. The proposed execution performance is estimated with the typical VANET environment in V2I topology in highway driving conditions and the simulation results demonstrate and enhance network execution performance with effective data transmission capacity.</p>

Middle-Order Vehicle-Based Clustering Model for Reducing Packet Loss in Vehicular Ad-hoc Networks

2020 ◽  
Vol 29 (11) ◽  
pp. 2050180
Author(s):  
S. David ◽  
P. T. Vanathi
Keyword(s):  
Ad Hoc Networks ◽  
Packet Loss ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Frequency Variation ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Clustering Model ◽  
Hoc Networks

Vehicular Ad-hoc NETworks (VANETs) are typically termed as a wireless ad-hoc network that contains extreme node mobility and also the network carries a great significance in various traffic-oriented commercial applications and safety services. Due to its high mobility, routing in VANET has been a challenging work and also proving a higher rate of packet delivery ratio with reduced packet loss has been more important to be considered in route formations. With that note, this paper contributes to developing a clustering model called Middle-Order Vehicle-based Clustering (MOVC) model for managing the frequent topological change and high vehicle mobility, and efficiently handling the typical road traffic scenario. Moreover, the algorithm is intended to maintain the cluster to be constant for managing the vehicles in effective ways and also to provide uninterrupted communication between the vehicles. An algorithm for Effective Cluster Head Election (ECHE) is also derived in this paper for proficiently handling the frequency variation on the highways. Further, the model is simulated and evaluated on the basis of various metrics of VANET routing, specifically packet loss, packet delivery ratio, network lifetime and throughput. The results show that the proposed mechanism outperforms the results of existing models.

scholarly journals A Bipolar Traffic Density Awareness Routing Protocol for Vehicular Ad Hoc Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
David Chunhu Li ◽  
Li-Der Chou ◽  
Li-Ming Tseng ◽  
Yi-Ming Chen ◽  
Kai-Wei Kuo
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Path Selection ◽  
Traffic Density ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Hoc Networks

To support an increasing amount of various new applications in vehicular ad hoc networks (VANETs), routing protocol design has become an important research challenge. In this paper, we propose a Bipolar Traffic Density Awareness Routing (BTDAR) protocol for vehicular ad hoc networks. The BTDAR aims at providing reliable and efficient packets delivery for dense and sparse vehicle traffic network environments. Two distinct routing protocols are designed to find an optimal packet delivery path in varied vehicular networks. In dense networks, a link-stability based routing protocol is designed to take vehicles connectivity into consideration in its path selection policy and maximize the stability of intervehicle communications. In sparse networks, a min-delay based routing protocol is proposed to select an optimal route by analyzing intermittent vehicle connectivity and minimize packets delivery latency. Intervehicles connectivity model is analyzed. The performance of BTDAR is examined by comparisons with three distinct VANET routing protocols. Simulation results show that the BTDAR outperforms compared counterpart routing protocols in terms of packet delivery delay and packet delivery ratio.

FSR Evaluation Using the Suboptimal Operational Values

2009 ◽  
pp. 203-211
Author(s):  
Osama H.S. Khader
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Large Populations ◽  
Mobile Ad Hoc ◽  
Hoc Networks

In mobile ad hoc networks, routing protocols are becoming more complicated and problematic. Routing in mobile ad hoc networks is multi-hop because of the limited communication range of wireless radios. Since nodes in the network can move freely and randomly, an efficient routing protocol is needed in order for such networks to be able to perform well in such an environment. In this environment the routing strategy is applied such that it is flexible enough to handle large populations and mobility and be able to minimize the use of the battery. Also it should be designed to achieve maximum packet delivery ratio. Further more, the routing protocol must perform well in terms of fast convergence, low routing delay, and low control overhead traffic. In this paper an improved implementation of the Fisheye State Routing (FSR) protocols is presented, where a new selection routing criteria that utilizes a minimum number of hops is a selection metric. The results obtained from simulation indicate that the fewer number of hops used the better and more efficient the output for packet delivery ratio was generated.

Performance Analysis of TCP Variants using AODV and DSDV Routing Protocols in MANETs

2019 ◽  
Vol 13 ◽  
Author(s):  
Rajnesh Singh ◽  
Neeta Singh ◽  
Aarti Gautam Dinker
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Transport Layer ◽  
Destination Node ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Two Measures ◽  
Hoc Networks

TCP is the most reliable transport layer protocol that provides reliable data delivery from source to destination node. TCP works well in wired networks but it is assumed that TCP is less preferred for ad-hoc networks. However, for application in ad-hoc networks, TCP can be modified to improve its performance. Various researchers have proposed improvised variants of TCP by only one or two measures. These one or two measures do not seem to be sufficient for proper analysis of improvised version of TCP. So, in this paper, the performance of different TCP versions is investigated with DSDV and AODV routing Protocols. We analyzed various performance measures such as throughput, delay, packet drop, packet delivery ratio and number of acknowledgements. The simulation results are carried out by varying number of nodes in network simulator tool NS2. It is observed that TCP Newreno achieved higher throughput and packet delivery ratio with both AODV and DSDV routing protocols.Whereas TCP Vegas achieved minimum delay and packet loss with both DSDV and AODV protocol. However TCP sack achieved minimum acknowledgment with both AODV and DSDV routing protocols. In this paper the comparison of all these TCP variants shows that TCP Newreno provides better performance with both AODV and DSDV protocols.

An Efficient Two-Mode Routing Protocol in Dense and Sparse Vehicular Ad Hoc Networks

2015 ◽  
Vol 764-765 ◽  
pp. 817-821
Author(s):  
Ing Chau Chang ◽  
Yuan Fen Wang ◽  
Chien Hsun Li ◽  
Cheng Fu Chou
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Intersection Graph ◽  
Least Cost Path ◽  
Transmission Delays ◽  
Packet Delivery ◽  
Hoc Networks

This paper adopts a two-mode intersection graph-based routing protocol to support efficient packet forwarding for both dense and sparse vehicular ad hoc networks (VANET). We first create an intersection graph (IG) consisting of all connected road segments, which densities are high enough. Hence, the source vehicle leverages the proposed IG/IG bypass mode to greedily forward unicast packets to the boundary intersection via the least cost path of current IG. We then perform the IG-Ferry mode to spray a limited number of packet copies via relay vehicles to reach the boundary intersection of another IG where the destination vehicle resides. NS2 simulations are conducted to show that the two-mode IG/IG-Ferry outperforms well-known VANET routing protocols, in terms of average packet delivery ratios and end-to-end transmission delays.

scholarly journals Performance Assessment of QoS Using AODV, TORA and ZRP Routing Protocol in MANET

2020 ◽  
Vol 39 (4) ◽  
pp. 744-750
Author(s):  
Irfan Ahmad ◽  
Fahad Masood ◽  
Arbab Wajid Ullah Khan
Keyword(s):  
Performance Assessment ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

In Mobile Ad hoc Networks (MANET) nodes often change their location independently where neither fixed nor centralized infrastructure is present. Nodes communicate with each other directly or via intermediate nodes. The advantages of the MANET layout lead to self-structure and compatibility to most important functions such as traffic distribution and load balancing. Whenever the host moves rapidly in the network the topology becomes updated due to which the structure of MANET varies accordingly. In the literature, different routing protocols have been studied and compared by researchers. Still, there are queries regarding the performance of these protocols under different scenarios. MANETs are not based on a predesigned structure. In this paper, the performance assessment of the Quality of Services (QoS) for different protocols such as Ad hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) in the existence of the various number of communicating nodes is studied. The performance matrices throughput, end – to – end delay and packet delivery ratio are considered for simulations. Ns 2.35 simulator is used for carrying out these simulations. Results are compared for AODV, TORA, and ZRP routing protocols. The results show that AODV and TORA perform well in end – to – end delay as compared to zone routing protocol. Zone routing protocol performs well in packet delivery ratio and throughput as compared to both the other protocols.

scholarly journals W-GPCR Routing Method for Vehicular Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3406 ◽  
Author(s):  
Min Li ◽  
Zhiru Gu ◽  
Yonghong Long ◽  
Xiaohua Shu ◽  
Qing Rong ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Rapid Change ◽  
Relay Node ◽  
Geographic Routing ◽  
Delivery Ratio ◽  
Local Optimum ◽  
Hoc Networks

The high-speed dynamics of nodes and rapid change of network topology in vehicular ad hoc networks (VANETs) pose significant challenges for the design of routing protocols. Because of the unpredictability of VANETs, selecting the appropriate next-hop relay node, which is related to the performance of the routing protocol, is a difficult task. As an effective solution for VANETs, geographic routing has received extensive attention in recent years. The Greedy Perimeter Coordinator Routing (GPCR) protocol is a widely adopted position-based routing protocol. In this paper, to improve the performance in sparse networks, the local optimum, and the routing loop in the GPCR protocol, the Weighted-GPCR (W-GPCR) protocol is proposed. Firstly, the relationship between vehicle node routing and other parameters, such as the Euclidean distance between node pairs, driving direction, and density, is analyzed. Secondly, the composite parameter weighted model is established and the calculation method is designed for the existing routing problems; the weighted parameter ratio is selected adaptively in different scenarios, so as to obtain the optimal next-hop relay node. In order to verify the performance of the W-GPCR method, the proposed method is compared with existing methods, such as the traditional Geographic Perimeter Stateless Routing (GPSR) protocol and GPCR. Results show that this method is superior in terms of the package delivery ratio, end-to-end delay, and average hop count.

scholarly journals RESP: Relay Suitability-based Routing Protocol for Video Streaming in Vehicular Ad Hoc Networks

2019 ◽  
Vol 14 (1) ◽  
pp. 21-38
Author(s):  
Omar A. Hammood ◽  
Mohd Nizam ◽  
Muamer Nafaa ◽  
Waleed A. Hammood
Keyword(s):  
Ad Hoc Networks ◽  
Video Streaming ◽  
Routing Protocol ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Packet Delay ◽  
Delivery Ratio ◽  
Link Stability ◽  
Hoc Networks

Video streaming in Vehicular Ad Hoc Networks (VANETs) is a fundamental requirement for a roadside emergency and smart video surveillance services. However, vehicles moving at a high speed usually create unstable wireless links that drop video frames qualities. In a high-density network, network collision between vehicles is another obstacle in improving the scalability of unicast routing protocols. In this paper, the RElay Suitability-based Routing Protocol (RESP) which makes a routing decision based on the link stability measurement was proposed for an uninterrupted video streaming. The RESP estimates the geographic advancement and link stability of a vehicle towards its destination only in the small region. To ensure the reliability while extending the scalability of routing, the relay suitability metric integrates the packet delay, collision dropping, link stability, and the Expected Transmission Count (ETX) in the weighted division algorithm, and selects a high-quality forwarding node for video streaming. The experimental results demonstrated that the proposed RESP outperformed the link Lifetime-aware Beacon-less Routing Protocol (LBRP) and other traditional geographical streaming protocols in providing a high packet delivery ratio and less packet delay with various network densities, and proved the scalability support of RESP for video streaming.

Sign in / Sign up

Export Citation Format

Share Document