An Optimal Technique in VANET Routing Using Metaheuristic Approach

Authors

  • Chaudhary P SDDIET, Barwala Pkl, Kurukshetra University, Kurukshetra, India
  • Kumar K SDDIET, Barwala Pkl, Kurukshetra University, Kurukshetra, India

Keywords:

Vehicular ad-hoc network (VANET), Ant colony optimization, Routing Protocols, Performance Parameter, and Simulators etc

Abstract

For accurate network performance analysis of routing protocols and access technology for VANET (Vehicular Ad hoc Network), realistic road map scenarios are required. This paper refers to analysis of network performance for VANET.[1,3] Simulation of routing protocols for VANET using realistic road map scenarios provides accurate results and can be useful for design and deployment of VANET applications. For VANET, speed of mobile nodes affects the routing path stability. It is important to use real world mobility models; so that the results obtained from the simulation of VANET routing protocols correctly reflect the real-world performance. In this paper, analyses the performance in terms of throughput, packet delivery ratio, packet loss and overhead. Routing protocols like OSPF are used for performance analysis. it supposed to handle high traffic rate as well as frequent interrupt in connection. It should consume less power and utilize bandwidth efficiently. At the same time, the VANET nodes must be simple, cheap, smaller in size and efficient enough to handle traffic. In VANET system Vehicles need to communicate with the other node, for that node continuously sending RTS-CTS signals. As if number of signals increases, there is high probability of collision. Collision damages data packets .so it requires retransmission, in this we use different routing protocols through which overhead can be reduced. Effect of flooding can be suppressed by eliminating or dropping certain nodes. Hence, reliability of communication can be improved. [5]

References

Zhang.Y, Han.Y and Wu.P “Community Detection Using Maximum ConnectionProbability in Opportunistic Network”,IEEE, JAN 2013

Zhu.H,Mianxiong Dong and Shan “ZOOM: Scaling the Mobility for Fast Opportunistic Forwarding in Vehicular Networks”,2013

Ganesh S. Khekare andApeksha V. Sakhare “A Smart City Framework for Intelligent Traffic System Using VANET”,2013

Huan Zhou and Liusheng Huang “heuristic-based ant colony optimization to enhance security in vanets”,2015

Daraghmi.Y and WeI.C “Forwarding Methods in Data Dissemination and Routing Protocols for Vehicular Ad Hoc Networks”,2013

Rodrigues.J and Farahmand.F “GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks” in Institute of Telecommunications,(2011)

Gerla.M and Sanadidi.M “Scalable Opportunistic VANET Content Routing With Encounter Information” in University of California,2013

Sehgal.J and Arora.P“Delay Optimization in VANET Using AntColony Optimization and WI-MAX” in International Journal of Advanced Research in Electrical Engineering, AUGUST(2014)

Xiao.M and Wu.J, “Community-Aware Opportunistic Routing in Mobile Social Networks” IEEE TRANSACTIONS ON COMPUTERS, JULY (2014)

Guo.P and Zhou.H, “QoS Evaluation of VANET Routing Protocols”Computer and Information Technology, Gorges University, January 2013

Shi.X and Wang.Y, “A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects”, IEEE COMMUNICATIONS SURVEYS (2013)

Moreira.W and Mendes.P, “Opportunistic Routing Based on Daily Routines” IT, University of Aveiro, july(2014)

Guo.B and Kuo.Y, “A Community-Based Data Dissemination Scheme in Opportunistic Networks”,International Journal of Future Computer and Communication, October(2015)

Balmahoon.R and Peplow.R, “Vehicular Ad-Hoc Networks: An Introduction to Privacy”(2013)

Zohdy.M and Nafie.M “Maximum Throughput Opportunistic NetworkCoding in Two-Way Relay Networks” in Wireless Intelligent Networks Center (WINC),2015

Downloads

Published

2025-11-11

How to Cite

[1]
P. Chaudhary and K. Kumar, “An Optimal Technique in VANET Routing Using Metaheuristic Approach”, Int. J. Comp. Sci. Eng., vol. 4, no. 6, pp. 92–96, Nov. 2025.

Issue

Section

Research Article