SDN-based VANET routing: A comprehensive survey on architectures, protocols, analysis, and future challenges

As the automotive and telecommunication industries advance, more vehicles are becoming connected, leading to the realization of intelligent transportation systems (ITS). Vehicular ad-hoc network (VANET) supports various ITS services, including safety, convenience, and infotainment services for drivers and passengers. Generally, such services are realized through data sharing among vehicles and nearby infrastructures or vehicles over multi-hop data routing mechanisms. Vehicular data routing faces many challenges caused by vehicle dynamicity, intermittent connectivity, and diverse application requirements. Consequently, the software-defined networking (SDN) paradigm offers unique features such as programmability and flexibility to enhance vehicular network performance and management and meet the quality of services (QoS) requirements of various VANET services. Recently, VANET routing protocols have been improved using the multilevel knowledge and an up-to-date global view of traffic conditions offered by SDN technology. The primary objective of this study is to furnish comprehensive information regarding the current SDN-based VANET routing protocols, encompassing intricate details of their underlying mechanisms, forwarding algorithms, and architectural considerations. Each protocol will be thoroughly examined individually, elucidating its strengths, weaknesses, and proposed enhancements. Also, the software-defined vehicular network (SDVN) architectures are presented according to their operation modes and controlling degree. Then, the potential of SDN-based VANET is explored from the aspect of routing and the design requirements of routing protocols in SDVNs. SDVN routing algorithms are uniquely classified according to various criteria. In addition, a complete comparative analysis will be achieved to analyze the protocols regarding performance, optimization, and simulation results. Finally, the challenges and upcoming research directions for developing such protocols are widely stated here. By presenting such insights, this paper provides a comprehensive overview and inspires researchers to enhance existing protocols and explore novel solutions, thereby paving the way for innovation in this field

AC-RDV: a novel ant colony system for roadside units deployment in vehicular ad hoc networks

[EN] Vehicular ad hoc network (VANET) is a mobile and wireless network that consists of connected vehicles, and stationary nodes called roadside units (RSUs) placed on the aboard of roads to improve traffic safety and to ensure drivers' and passengers' comfort. However, deploying RSUs is one of the most important challenges in VANETs due to the involved placement, configuration, and maintenance costs in addition to the network connectivity. This study focuses on the issue of deploying a set of RSUs that is able to maximize network coverage with a reduced cost. In this paper, we propose a new formulation of RSUs deployment issue as a maximum intersection coverage problem through a graph-based modeling. Moreover, we propose a new bio-inspired RSU placement system called Ant colony optimization system for RSU deployment in VANET (AC-RDV). AC-RDV is based on the idea of placing RSUs within the more popular road intersections, which are close to popular places like touristic and commercial areas. Since RSU deployment problem is considered as NP-Hard, AC-RDV inspires by the foraging behavior of real ant colonies to discover the minimum number of RSU intersections that ensures the maximum network connectivity. After a set of simulations and comparisons against traditional RSU placement strategies, the results obtained showed the effectiveness of the proposed AC-RDV in terms of number of RSUs placed, the average area coverage, the average connectivity and the overlapping ratio.Guerna, A.; Bitam, S.; Tavares De Araujo Cesariny Calafate, CM. (2021). AC-RDV: a novel ant colony system for roadside units deployment in vehicular ad hoc networks. Peer-to-Peer Networking and Applications. 14(2):627-643. https://doi.org/10.1007/s12083-020-01011-3S627643142Mejri MN, Ben-Othman J, Hamdi M (2018) Survey on security challenge and possible cryptographic solutions. Vehic Commun 1(2):53–66Hanshi SM, Wan T, Kadhum MM, Bin-Salem AA (2018) Review of geographic forwarding strategies for inter-vehicular communications from mobility and environment perspectives. Vehic Commun 14:64–79Bitam S, Mellouk A (2014) Routing for vehicular Ad Hoc networks, Bio-Inspired Routing Protocols for Vehicular Ad Hoc Networks, Wiley EditionMuhammad M, Safdar GA (2018) Survey on existing authentication issues for cellular-assisted V2X communication. Vehic Commun 12:50–65Wang Z, Zheng J, Wu Y, Mitton N (2017) A centrality-based RSU deployment approach for vehicular ad hoc networks. In : 2017 IEEE International Conference on Communications (ICC). IEEE, p 1–5Liu H, Ding S, Yang L, Yang T (2014) A -based strategy for roadside units placement in vehicular ad hoc networks. Int J Hybrid Info Technol 7(1):91–108Trullols O, Fiore M, Casetti C, Chiasserini C, Ordinas JB (2010) Planning roadside infrastructure for information dissemination in intelligent transportation systems. Comput Commun 33(4):432–442Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Courier CorporationHromkovič J (2013) Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics, ed: Springer Science & Business MediaJo Y, Jeong J (2016) RPA: Road-Side Units Placement Algorithm for Multihop Data Delivery in Vehicular Networks. In: IEEE 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA), pp 262–266Chi J, Jo Y, Park H, Park S (2013) Intersection-priority based optimal RSU allocation for VANET, in: Fifth International Conference on Ubiquitous and Future Networks (ICUFN), pp 350–355Dorigo M, Birattari M, Blum C, Gambardella LM, Mondada F, Stützle T (2004) Ant Colony Optimization and Swarm Intelligence, In: 6th International Conference (ANTS), Belgium, ed: Springer, 5217Guerna A, Bitam S (2019) GICA: An evolutionary strategy for roadside units deployment in vehicular networks,in: International Conference on Networking and Advanced Systems (ICNAS). IEEE, p 1–6Liya X, Chuanhe H, Peng L, Junyu Z (2013) A Randomized Algorithm for Roadside Units Placement in Vehicular Ad Hoc, In: IEEE 9th International Conference on Mobile Ad-hoc and Sensor Networks MSN, pp 193–197Liu C, Huang H, Du H (2017) Optimal RSUs deployment with delay bound along highways in VANET. J Comb Optim 33(4):1168–1182Aslam B, Amjad F, Zou CC (2012) Optimal roadside units placement in urban areas for vehicular networks. In: IEEE Symposium on Computers and Communications ISCC, pp 423–429Patil P, Gokhale A (2013) Voronoi-based placement of road-side units to improve dynamic resource management in Vehicular Ad Hoc Net-works. In: International Conference on Collaboration Technologies and Systems (CTS), pp 389–396Ghorai C, Banerjee I (2018) A constrained Delaunay triangulation based RSUs deployment strategy to cover a convex region with obstacles for maximizing communications probability between V2I. Vehic Commun 13:89–103Cavalcante ES, Aquino AL, Pappa GL (2012) Roadside unit deployment for information dissemination in a VANET: an evolutionary approach, In: Proceedings of the 14th annual conference companion on genetic and evolutionary computation, ACM, New York, pp. 27–34Sarubbi JFM, Vieira D, Wanner E, Silva CM (2016) A GRASP-based heuristic for allocating the roadside infrastructure maximizing the number of distinct vehicles experiencing contact opportunities. IEEE Symposium on Network Operations and Management (NOMS), pp 1187–1192Kim D, Velasco Y, Wang W, Uma RN, Hussain R, Lee S (2017) A new comprehensive RSU installation strategy for cost-efficient VANET deployment. IEEE Trans Veh Technol 66(5):4200–4211Irit D, Safra S (2005) On the hardness of approximating minimum vertex cover. Annals Math: 439–485Srinivanas M, Patnaik LM (1994) Genetic algorithms: A survey. Computer 27(6):17–26Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66Dorigo M, Caro GD, Gambardella LM (1999) Ant algorithms for discrete optimization. Art&Life 5(2):137–172Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput 11(8):5360–5366Reis AB, Sargento S, Neves F (2014) Deploying roadside units in sparse vehicular networks: What really works and what does not. IEEE Trans Veh Technol 63(6):2794–2806Lessing L, Dumitrescu I, Stützle T (2004) A comparison between ACO algorithms for the set covering problem, in: International Workshop on ant colony optimization and swarm, ed: Springer, Berlin, pp 1–12Zaki MJ, Meira W Jr (2014) Data mining and analysis fundamental concept and algorithms. Cambridge University Press, Cambridg