JOURNAL ARTICLE

Ant Colony Algorithm Based Routing Protocol in Software Defined Vehicular Networks

Abstract

Aiming at the problem of low success rate of information transmission and poor network routing performance under urban dynamic traffic environment, this paper proposed an ant colony algorithm-based routing protocol in software defined vehicular networks (ACA-RP-SDVN). Firstly, the paper established a software defined vehicular network architecture under urban traffic environment. Then, the algorithm dispatched the forward ants to gradually explore the optimal neighbor nodes on the path so as to form a complete link from the source node to the destination node. At the same time, the backward ants were responsible for the update of the path pheromone. Besides, the method used the greedy algorithm to deliver data packets. Finally, the experiment results show that the proposed protocol outshines AODV and GPSR in terms of network routing lifetime, rate of routing change and communication performance

Keywords:
Computer science Computer network Dynamic Source Routing Routing protocol Link-state routing protocol Zone Routing Protocol Ant colony optimization algorithms Distributed computing Static routing Node (physics) Geographic routing Destination-Sequenced Distance Vector routing Wireless Routing Protocol Network packet Algorithm Engineering

Metrics

4
Cited By
0.20
FWCI (Field Weighted Citation Impact)
11
Refs
0.50
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Vehicular Ad Hoc Networks (VANETs)
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Opportunistic and Delay-Tolerant Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.