An improved distance‐based ant colony optimization routing for vehicular ad hoc networks
Raghu Ramamoorthy, Menakadevi Thangavelu
Abstract
Summary Vehicular ad hoc network (VANET) has earned tremendous attraction in the recent period due to its usage in a wireless intelligent transportation system. VANET is a unique form of mobile ad hoc network (MANET). Routing issues such as high mobility of nodes, frequent path breaks, the blind broadcasting of messages, and bandwidth constraints in VANET increase communication cost, frequent path failure, and overhead and decrease efficiency in routing, and shortest path in routing provides solutions to overcome all these problems. Finding the shortest path between source and destination in the VANET road scenario is a challenging task. Long path increases network overhead, communication cost, and frequent path failure and decreases routing efficiency. To increase efficiency in routing a novel, improved distance‐based ant colony optimization routing (IDBACOR) is proposed. The proposed IDBACOR determines intervehicular distance, and it is triggered by modified ant colony optimization (modified ACO). The modified ACO method is a metaheuristic approach, motivated by the natural behavior of ants. The simulation result indicates that the overall performance of our proposed scheme is better than ant colony optimization (ACO), opposition‐based ant colony optimization (OACO), and greedy routing with ant colony optimization (GRACO) in terms of throughput, average communication cost, average propagation delay, average routing overhead, and average packet delivery ratio.