A Heuristic Algorithm Based on Ant Colony Optimization for Multi-objective Routing in Vehicle Ad Hoc Networks

Silva, Rodrigo; Lopes, Heitor Silvério; Godoy, Walter

doi:10.1109/brics-cci-cbic.2013.78

Cited by 16 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…R.Silva et al in [8] propose an ACO-based algorithm for multi-objective routing in VANET. The proposed algorithm, called AntRs, find routes considering the best commitment between shortest path (number of nodes/vehicles in a route) and the lowest probability of disconnection.…”

Section: Literature Surveymentioning

confidence: 99%

“…Choosing VANET environment was necessary for its network characteristics. First, the VANET network is homogeneous; vehicles have the same physical capacity and the same radio power [1,8].Second, there is no hierarchy between vehicles thus the network can be described as Flat. Finally the dynamic topology of the VANETs network enables communication during movement.…”

Section: Proposed Workmentioning

confidence: 99%

See 1 more Smart Citation

An enhanced routing algorithm using ant colony optimization and VANET infrastructure

Melaouene

Romadi

2019

MATEC Web Conf.

View full text Add to dashboard Cite

For the last fifty years, finding efficient vehicle routes has been studied as a representative logistics problem. In the transportation field, finding the shortest path in a road network is a common problem. VANET presents an innovation opportunity in the transportation field that enables services for intelligent transportation system (ITS) especially communication features. Because of VANET features [1] and despite road obstacles, a route for the shortest path can be established at a given moment. This paper proposes an enhanced algorithm, based on ACO Ant Colony Optimization and related to VANET infrastructure that aims to find the shortest path from the source to destination through the optimal path; in addition, a storage on static nodes is installed in each intersection in a VANET environment and for a specific time.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Section: Proposed Workmentioning

confidence: 99%

An enhanced routing algorithm using ant colony optimization and VANET infrastructure

Melaouene

Romadi

2019

MATEC Web Conf.

View full text Add to dashboard Cite

show abstract

“…In TIGeR, the vehicles which ate at intersections only make the routing decision by utilizing the traffic information on various roads and the angle of the roads. The work in [7] A Vehicular routing protocol based on Ant Colony Optimization (VACO) has been proposed in [8]. The VACO is an adaptive multi-criteria VANET routing protocol that detects the best routing paths from a source to the destination with some quality metrics estimated regarding latency, bandwidth, and delivery ratio.…”

Section: Related Workmentioning

confidence: 99%

Ant Colony Optimization Based Qos Routing Protocol (ACORP) for Vanets

Hotkar*,

Biradar

2019

IJRTE

View full text Add to dashboard Cite

Vehicular Ad Hoc Network (VANET ) is a special type of communication network that promises wide applications ranging from road safety to driving comfort. The rich applications enhance the safety and comfort of travelers by establishing a cooperative communication among the vehicles. To increase communication efficiency this work proposes an Ant Colony Optimization based Quality of Service Routing protocol(ACORP) for VANETs that aims to enhance the road safety and travel convenience in VANETs.

show abstract

“…Ant colonization is bio-inspired algorithm in which agents simulates the behavior of ants and solve the major problem with cooperation among themselves. Ant colonies have a high organization degree capable of selforganizing into groups and develop complex tasks [5]. Ant colonization determined ant's behavior that ants able to search food from source end in minimum time and shortest path [21].…”

Section: A Ant Colonizationmentioning

confidence: 99%

“…In VANET vehicles can communicates with each other (V2V) and also to infrastructure (V2I) [4]. VANETs have boundless power supply due to recharging of batteries and highspeed movement of vehicles makes network dynamic [5].…”

Section: Introductionmentioning

confidence: 99%

Favorable Trail Detection using ACO-Bellman Algorithm in VANETs

Singh¹

2016

IJMECS

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) are the networks, which configured themselves, where the nodes are moving vehicles. These provide the communications required to deploy Intelligent Transportation Systems (ITS). A major dispute in VANETs is distribution of efficient and computable information because during communication nodes may leave or join the network dynamically. There is no guarantee about node availability at any given time, which leads to traffic problem, congestion problem. Therefore trailing the favorable path is a challengeable issue. Multiple routing algorithms have been developed for routing solution. In this paper the swarm-based algorithm has been presented, which helps to find out the optimal route using Bellman Ford algorithm. Ant colonization searches out the path using pheromones level. Higher the pheromone count of a route gives the optimal choice of path that can be used for packet delivery. Bellman Ford Algorithm optimizes the paths found by Ant Colony Optimization (ACO) by comparing the distance of source to all the nodes of network or cost given to the networks.

show abstract

A Heuristic Algorithm Based on Ant Colony Optimization for Multi-objective Routing in Vehicle Ad Hoc Networks

Cited by 16 publications

References 6 publications

An enhanced routing algorithm using ant colony optimization and VANET infrastructure

An enhanced routing algorithm using ant colony optimization and VANET infrastructure

Ant Colony Optimization Based Qos Routing Protocol (ACORP) for Vanets

Favorable Trail Detection using ACO-Bellman Algorithm in VANETs

Contact Info

Product

Resources

About