Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3319619.3326847acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Nature-inspired metaheuristics for optimizing information dissemination in vehicular networks

Published: 13 July 2019 Publication History

Abstract

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.

References

[1]
Nicola Apollonio and Bruno Simeone. 2014. The maximum vertex coverage problem on bipartite graphs. Discrete Applied Mathematics 165 (2014), 37 -- 48.
[2]
Esmaeil Atashpaz-Gargari and Caro Lucas. 2007. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In 2007 IEEE congress on evolutionary computation. IEEE, 4661--4667.
[3]
Kirils Bibiks, Yim Fun Hu, Jian-Ping Li, Prashant Pillai, and Aleister Smith. 2018. Improved discrete cuckoo search for the resource-constrained project scheduling problem. Applied Soft Computing (2018).
[4]
E. Bonfoh, S. Medjiah, and C. Chassot. 2018. A Parsimonious Monitoring Approach for Link Bandwidth Estimation within SDN-based Networks. In 4th IEEE Conference on Network Softwarization and Workshops (NetSoft). 512--516.
[5]
Moumena Chaqfeh, Abderrahmane Lakas, and Imad Jawhar. 2014. A survey on data dissemination in vehicular ad hoc networks. Vehicular Communications 1, 4 (2014), 214--225.
[6]
Ai-ling Chen, Gen-ke Yang, and Zhi-ming Wu. 2006. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University-Science A 7, 4 (2006), 607--614.
[7]
Jianer Chen, Iyad A Kanj, and Weijia Jia. 2001. Vertex cover: further observations and further improvements. Journal of Algorithms 41, 2 (2001), 280--301.
[8]
Daniel D. Camara, Christian Bonnet, Navid Nikaein, and Michelle Wetterwald. 2011. Multicast and virtual road side units for multi technology alert messages dissemination. In 2011 IEEE 8th International Conference on Mobile Adhoc and Sensor Systems (MASS). 947--952.
[9]
M Daoudi. 2016. Nature search-based approach to solve maximal covering species problem. In 2016 International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 349--354.
[10]
Joaquin Derrac, Salvador García, Daniel Molina, and Francisco Herrera. 2011. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation 1, 1 (2011), 3--18.
[11]
Pedro M. D'Orey, Nitin Maslekar, Idoia de la Iglesia, and Nikola K. Zahariev. 2015. NAVI: Neighbor-Aware Virtual Infrastructure for Information Collection and Dissemination in Vehicular Networks. In 2015 IEEE Vehicular Technology Conference (VTC Spring). 1--6.
[12]
Marshall L. Fisher and Pradeep Kedia. 1990. Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics. Management Science 36, 6 (1990), 674--688.
[13]
David E Goldberg. 1989. Genetic algorithms in search. Optimization, and MachineLearning (1989).
[14]
Virgilio C. Guzmán, Antonio D. Masegosa, David Pelta, and Jose L. Verdegay. 2016. Fuzzy models and resolution methods for covering location problems: an annotated bibliography. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 24, 04 (2016), 561--591.
[15]
WALWM Hatta, Cheng Siong Lim, Amar Faiz Zainal Abidin, Mohd Hafiz Azizan, and Soo Siang Teoh. 2013. Solving maximal covering location with particle swarm optimization. International Journal of Engineering and Technology 5, 4 (2013), 3301--3306.
[16]
Unai Hernandez-Jayo, Aboobeker Sidhik Koyamparambil Mammu, and Idoia De-la Iglesia. 2014. Contemporary Issues in Wireless Communications. InTech, Chapter Reliable Communication in Cooperative Ad hoc Networks.
[17]
Dervis Karaboga and Bahriye Basturk. 2008. On the performance of artificial bee colony (ABC) algorithm. Applied soft computing 8, 1 (2008), 687--697.
[18]
James Kennedy. 2010. Particle swarm optimization. Encyclopedia of machine learning (2010), 760--766.
[19]
Sami Khuri and Thomas Bäck. 1994. An evolutionary heuristic for the minimum vertex cover problem. In Proceedings of the KI-94 Workshop Genetic Algorithms within the Framework of Evolutionary Computation. 86--90.
[20]
Zixiang Li, Nilanjan Dey, Amira S Ashour, and Qiuhua Tang. 2018. Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem. Neural Computing and Applications 30, 9 (2018), 2685--2696.
[21]
Wenshuang Liang, Zhuorong Li, Hongyang Zhang, Shenling Wang, and Rongfang Bie. 2015. Vehicular ad hoc networks: architectures, research issues, methodologies, challenges, and trends. International Journal of Distributed Sensor Networks 11, 8 (2015).
[22]
Arindam Majumder and Dipak Laha. 2016. A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times. Swarm and Evolutionary Computation 28 (2016), 131--143.
[23]
Antonio D. Masegosa, Idoia de la Iglesia, Unai Hernandez-Jayo, Luis Enrique Diez, Alfonso Bahillo, and Enrique Onieva. 2018. A New Approach for Information Dissemination in VANETs Based on Covering Location and Metaheuristics. Springer International Publishing, 179--202.
[24]
Parisutham Nirmala, Ramasubramony Sulochana Lekshmi, and Rethnasamy Nadarajan. 2016. Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. Knowledge and Information Systems 48, 1 (2016), 229--252.
[25]
Robert O'Callahan and Jong-Deok Choi. 2003. Hybrid Dynamic Data Race Detection. In Proceedings of the Ninth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '03). ACM, 167--178.
[26]
Eneko Osaba, Javier Del Ser, David Camacho, Akemi Galvez, Andres Iglesias, and Iztok Fister. 2018. Community Detection in Weighted Directed Networks Using Nature-Inspired Heuristics. In International Conference on Intelligent Data Engineering and Automated Learning. Springer, 325--335.
[27]
Eneko Osaba, Javier Del Ser, Ali Sadollah, Miren Nekane Bilbao, and David Camacho. 2018. A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Applied Soft Computing 71 (2018), 277--290.
[28]
Eneko Osaba, Xin-She Yang, Fernando Diaz, Pedro Lopez-Garcia, and Roberto Carballedo. 2016. An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Engineering Applications of Artificial Intelligence 48 (2016), 59--71.
[29]
Eneko Osaba, Xin-She Yang, Fernando Diaz, Enrique Onieva, Antonio D Masegosa, and Asier Perallos. 2017. A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Computing 21, 18 (2017), 5295--5308.
[30]
Eneko Osaba, Xin-She Yang, Iztok Fister Jr, Javier Del Ser, Pedro Lopez-Garcia, and Alejo J Vazquez-Pardavila. 2019. A Discrete and Improved Bat Algorithm for solving a medical goods distribution problem with pharmacological waste collection. Swarm and Evolutionary Computation 44 (2019), 273--286.
[31]
Aziz Ouaarab, Belaïd Ahiod, and Xin-She Yang. 2014. Discrete cuckoo search algorithm for the travelling salesman problem. Neural Computing and Applications 24, 7-8 (2014), 1659--1669.
[32]
Sooksan Panichpapiboon and Wasan Pattara-Atikom. 2012. A review of information dissemination protocols for vehicular ad hoc networks. IEEE Communications Surveys & Tutorials 14, 3 (2012), 784--798.
[33]
P. Papadimitratos, A. La Fortelle, K. Evenssen, R. Brignolo, and S. Cosenza. 2009. Vehicular communication systems: Enabling technologies, applications, and future outlook on intelligent transportation. IEEE Communications Magazine 47, 11 (2009), 84--95.
[34]
Radu-Emil Precup, Emil-Ioan Voisan, Emil M Petriu, Mircea-Bogdan Radac, and Lucian-Ovidiu Fedorovici. 2016. Gravitational search algorithm-based evolving fuzzy models of a nonlinear process. In Informatics in Control, Automation and Robotics 12th International Conference (ICINCO). Springer, 51--62.
[35]
Ragheb Rahmaniani and Abdolsalam Ghaderi. 2013. A combined facility location and network design problem with multi-type of capacitated links. Applied Mathematical Modelling 37, 9 (2013), 6400--6414.
[36]
Guillaume Rémy, Sidi-Mohammed Senouci, François Jan, and Yvon Gourhant. 2011. LTE4V2X: LTE for a centralized vanet organization. In 2011 IEEE Global Telecommunications Conference (GLOBECOM). 1--6.
[37]
Yassine Saji and Mohammed Essaid Riffi. 2016. A novel discrete bat algorithm for solving the travelling salesman problem. Neural Computing and Applications 27, 7 (2016), 1853--1866.
[38]
Cristiano M Silva, Barbara M Masini, Gianluigi Ferrari, and Ilaria Thibault. 2017. A survey on infrastructure-based vehicular networks. Mobile Information Systems 2017 (2017).
[39]
Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Jorge Barraza, Franklin Johnson, and Fernando Paredes. 2015. A binary cuckoo search algorithm for solving the set covering problem. In International Work-Conference on the Interplay Between Natural and Artificial Computation. Springer, 88--97.
[40]
Gilbert Syswerda. 1989. Uniform crossover in genetic algorithms. In Proceedings of the third international conference on Genetic algorithms. Morgan Kaufmann Publishers, 2--9.
[41]
J. Toutouh, J. Garcia-Nieto, and E. Alba. 2012. Intelligent OLSR Routing Protocol Optimization for VANETs. IEEE Transactions on Vehicular Technology 61, 4 (2012), 1884--1894.
[42]
Xin-She Yang. 2010. Firefly algorithm, stochastic test functions and design optimisation. International Journal of Bio-Inspired Computation 2, 2 (2010), 78--84.
[43]
Xin-She Yang. 2010. A new metaheuristic bat-inspired algorithm. In Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, 65--74.
[44]
Xin-She Yang and Suash Deb. 2009. Cuckoo search via Lévy flights. In World Congress on Nature & Biologically Inspired Computing, 2009 (NaBIC 2009). IEEE, 210--214.
[45]
Yiwen Zhong, Juan Lin, Lijin Wang, and Hui Zhang. 2018. Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm and Evolutionary Computation (2018).
[46]
Xu Zhou, Xiaohui Zhao, and Yanheng Liu. 2018. A multiobjective discrete bat algorithm for community detection in dynamic networks. Applied Intelligence 48, 9 (2018), 3081--3093.

Cited By

View all
  • (2022)Metaheuristics on quantum computersFuture Generation Computer Systems10.1016/j.future.2021.12.015130:C(164-180)Online publication date: 1-May-2022
  • (2022)Internet of Vehicles and Intelligent Routing: A Survey-Based StudyThe 8th International Conference on Advanced Machine Learning and Technologies and Applications (AMLTA2022)10.1007/978-3-031-03918-8_43(517-531)Online publication date: 17-Apr-2022
  • (2021)An Intelligent Optimized Route-Discovery Model for IoT-Based VANETsProcesses10.3390/pr91221719:12(2171)Online publication date: 2-Dec-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion
July 2019
2161 pages
ISBN:9781450367486
DOI:10.1145/3319619
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. VANETs
  2. inteligent transportation systems
  3. nature-inspired metaheuristics
  4. vehicular communications
  5. vertex covering

Qualifiers

  • Research-article

Funding Sources

Conference

GECCO '19
Sponsor:
GECCO '19: Genetic and Evolutionary Computation Conference
July 13 - 17, 2019
Prague, Czech Republic

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)1
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Metaheuristics on quantum computersFuture Generation Computer Systems10.1016/j.future.2021.12.015130:C(164-180)Online publication date: 1-May-2022
  • (2022)Internet of Vehicles and Intelligent Routing: A Survey-Based StudyThe 8th International Conference on Advanced Machine Learning and Technologies and Applications (AMLTA2022)10.1007/978-3-031-03918-8_43(517-531)Online publication date: 17-Apr-2022
  • (2021)An Intelligent Optimized Route-Discovery Model for IoT-Based VANETsProcesses10.3390/pr91221719:12(2171)Online publication date: 2-Dec-2021
  • (2020)New Discrete Cuckoo Search Optimization Algorithms for Effective Route Discovery in IoT-Based Vehicular Ad-Hoc NetworksIEEE Access10.1109/ACCESS.2020.30147368(145469-145488)Online publication date: 2020

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media