z-logo
open-access-imgOpen Access
Modified Ant Colony Optimization (ACO) Algorithm for Routing in Vehicular Adhoc Networks
Author(s) -
Koppisetti Giridhar,
C Anbu Ananth
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.k1424.0981119
Subject(s) - computer science , node (physics) , ant colony optimization algorithms , computer network , routing protocol , mobile ad hoc network , heuristic , vehicular ad hoc network , wireless ad hoc network , optimized link state routing protocol , routing (electronic design automation) , stability (learning theory) , energy consumption , distributed computing , algorithm , engineering , wireless , artificial intelligence , telecommunications , structural engineering , machine learning , network packet , electrical engineering
Vehicular Ad hoc Network (VANET) is divided as Mobile Ad-hoc Networks (MANETs) application which comprises the capability to offer Intelligent Transportation System (ITS) and to enhance road safety. VANET has many difficulties that various from instability problem that gives higher topological change and higher energy utilization with many advantages. The main aim to construct a route optimal path technique is to reduce the probability of linkage failure and decrease the node energy utilization within the network. ACO heuristic for vehicle routing is proposed in this paper. In this method mobility prediction is employed for stability of network and to reduce the utilized energy two-tier mechanism is employed by Location Aided Routing (LAR) protocol. The simulation outcomes in Network simulator 2 of the proposed method enhanced the node energy utilization within the network and it takes lower energy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here