Nature-inspired metaheuristics for optimizing information dissemination in vehicular networks

Connected vehicles are revolutionizing the way in which transport and mobility are conceived. The main technology behind is the so-called Vehicular Ad-Hoc Networks (VANETs), which are communication networks that connect vehicles and facilitate various services. Usually these services require a centralized architecture where the main server collects and disseminates information from/to vehicles. In this paper, we focus on improving the downlink information dissemination in VANETs with this centralized architecture. With this aim, we model the problem as a Vertex Covering optimization problem and we propose four new nature-inspired methods to solve it: Bat Algorithm (BA), Firefly Algorithm (FA), Particle Swarm Optimization (PSO), and Cuckoo Search (CS). The new methods are tested over data from a real scenario. Results show that these metaheuristics, especially BA, FA and PSO, can be considered as powerful solvers for this optimization problem.

[1]  Gen-ke Yang,et al.  Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem , 2006 .

[2]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[3]  Broderick Crawford,et al.  A Binary Cuckoo Search Algorithm for Solving the Set Covering Problem , 2015, IWINAC.

[4]  Shahrokh Valaee,et al.  Vehicular ad hoc networks: architectures, research issues, methodologies, challenges, and trends , 2015, AdHocNets 2015.

[5]  Pedro M. d'Orey,et al.  NAVI: Neighbor-Aware Virtual Infrastructure for Information Collection and Dissemination in Vehicular Networks , 2015, 2015 IEEE 81st Vehicular Technology Conference (VTC Spring).

[6]  Juan Lin,et al.  Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem , 2018, Swarm Evol. Comput..

[7]  Barbara M. Masini,et al.  A Survey on Infrastructure-Based Vehicular Networks , 2017, Mob. Inf. Syst..

[8]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[9]  Ragheb Rahmaniani,et al.  A combined facility location and network design problem with multi-type of capacitated links , 2013 .

[10]  Javier Del Ser,et al.  A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem , 2018, Appl. Soft Comput..

[11]  Mohammed Essaid Riffi,et al.  A novel discrete bat algorithm for solving the travelling salesman problem , 2015, Neural Computing and Applications.

[12]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[13]  Zainal Abidin,et al.  Solving Maximal Covering Location with Particle Swarm Optimization , 2013 .

[14]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[15]  Xin-She Yang,et al.  A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy , 2016, Soft Comput..

[16]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

[17]  Xin-She Yang,et al.  Firefly algorithm, stochastic test functions and design optimisation , 2010, Int. J. Bio Inspired Comput..

[18]  Xu Zhou,et al.  A multiobjective discrete bat algorithm for community detection in dynamic networks , 2018, Applied Intelligence.

[19]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[20]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[21]  Iztok Fister,et al.  Community Detection in Weighted Directed Networks Using Nature-Inspired Heuristics , 2018, IDEAL.

[22]  Arindam Majumder,et al.  A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times , 2016, Swarm Evol. Comput..

[23]  Jian-Ping Li,et al.  Improved discrete cuckoo search for the resource-constrained project scheduling problem , 2018, Appl. Soft Comput..

[24]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[25]  Panagiotis Papadimitratos,et al.  Vehicular communication systems: Enabling technologies, applications, and future outlook on intelligent transportation , 2009, IEEE Communications Magazine.

[26]  Jong-Deok Choi,et al.  Hybrid dynamic data race detection , 2003, PPoPP '03.

[27]  Sidi-Mohammed Senouci,et al.  LTE4V2X: LTE for a Centralized VANET Organization , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[28]  Enrique Alba,et al.  Intelligent OLSR Routing Protocol Optimization for VANETs , 2012, IEEE Transactions on Vehicular Technology.

[29]  Christian Bonnet,et al.  Multicast and Virtual Road Side Units for Multi Technology Alert Messages Dissemination , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[30]  Xin-She Yang,et al.  An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems , 2016, Eng. Appl. Artif. Intell..

[31]  Radu-Emil Precup,et al.  Gravitational Search Algorithm-Based Evolving Fuzzy Models of a Nonlinear Process , 2015, ICINCO.

[32]  Parisutham Nirmala,et al.  Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks , 2015, Knowledge and Information Systems.

[33]  Enrique Onieva,et al.  A New Approach for Information Dissemination in VANETs Based on Covering Location and Metaheuristics , 2018 .

[34]  Moumena Chaqfeh,et al.  A survey on data dissemination in vehicular ad hoc networks , 2014, Veh. Commun..

[35]  Nilanjan Dey,et al.  Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem , 2017, Neural Computing and Applications.

[36]  José L. Verdegay,et al.  Fuzzy Models and Resolution Methods for Covering Location Problems: an Annotated Bibliography , 2016, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[37]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[38]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[39]  Christophe Chassot,et al.  A Parsimonious Monitoring Approach for Link Bandwidth Estimation within SDN-based Networks , 2018, 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft).

[40]  Hongyang Zhang,et al.  Vehicular Ad Hoc Networks: Architectures, Research Issues, Methodologies, Challenges, and Trends , 2015, Int. J. Distributed Sens. Networks.

[41]  Iztok Fister,et al.  A Discrete and Improved Bat Algorithm for solving a medical goods distribution problem with pharmacological waste collection , 2019, Swarm Evol. Comput..

[42]  M. Daoudi,et al.  Nature search-based approach to solve maximal covering species problem , 2016, 2016 International Conference on Control, Decision and Information Technologies (CoDIT).

[43]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[44]  Sooksan Panichpapiboon,et al.  A Review of Information Dissemination Protocols for Vehicular Ad Hoc Networks , 2012, IEEE Communications Surveys & Tutorials.

[45]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[46]  Idoia De-la-Iglesia,et al.  Reliable Communication in Cooperative Ad hoc Networks , 2014 .

[47]  Bruno Simeone,et al.  The maximum vertex coverage problem on bipartite graphs , 2014, Discret. Appl. Math..