IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v84y2023i2d10.1007_s11235-023-01040-2.html
   My bibliography  Save this article

Data dissemination protocol for VANETs to optimize the routing path using hybrid particle swarm optimization with sequential variable neighbourhood search

Author

Listed:
  • S. Harihara Gopalan

    (Sri Ramakrishna Engineering College)

  • J. Ashok

    (V. S. B. Engineering College)

  • A. Manikandan

    (SSM Institute of Engineering and Technology)

  • S. Ramalingam

    (Sri Eshwar College of Engineering)

Abstract

A vehicular Ad-Hoc Network (VANET) is a form of Mobile Ad-Hoc Network (MANET) which employs wireless routers that are inside every vehicle to operate as a node. The process of data dissemination is used to improve the quality of travel to avoid unnecessary accidents in VANET. Many legacy protocols use this type of messaging activity to ensure fair road safety without concern for network congestion. Node congestion increases with control of routing overhead packets. Therefore, this paper proposes a Data Dissemination Protocol (DDP). VANET routing protocols can be divided into two categories: topology-based routing protocols and location-based routing protocols. The goal is to relay emergency signals to stationary nodes as soon as possible. The standard messages will be routed to the FIFO queue. Multiple routes were found using the Time delay-based Multipath Routing (TMR) approach to transmit these messages to a destination node, and Particle Swarm Optimisation (PSO) is utilized to find the optimal and secure path. Sequential Variable Neighborhood Search (SVNS) algorithm is applied in order to optimize the particles’ position with Local Best particle and Global Best particle (LBGB). The proposed method PSO-SVNS-LBGB is compared with different methods such as PSO-SVNS-GB, PSO-SVNS-LB, PSO-SVNS-CLB, PSO-SVNS-CGB. The experimental results show significant improvements in throughput and packet loss ratio, reduced end-to-end delay, rounding overhead ratio, and energy consumption. The simulation environment was conducted in NS2.34 is preferred for network simulation, and the VANET simulator used is SUMO and MOVE software. With a 98.41 ms delay and an average speed of 60 km/h, the PSO-SVNS-LBGB approach is suggested.

Suggested Citation

  • S. Harihara Gopalan & J. Ashok & A. Manikandan & S. Ramalingam, 2023. "Data dissemination protocol for VANETs to optimize the routing path using hybrid particle swarm optimization with sequential variable neighbourhood search," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 84(2), pages 153-165, October.
    • Handle: RePEc:spr:telsys:v:84:y:2023:i:2:d:10.1007_s11235-023-01040-2
    DOI: 10.1007/s11235-023-01040-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-023-01040-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-023-01040-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vignesh Prasanna Natarajan & Kavitha Thandapani, 2022. "An improvement of communication stability on underwater sensor network using balanced energy efficient joining distance matrix," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(1), pages 690-698, March.
    2. James C. Bean, 1994. "Genetic Algorithms and Random Keys for Sequencing and Optimization," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 154-160, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Paola Festa & Panos Pardalos, 2012. "Efficient solutions for the far from most string problem," Annals of Operations Research, Springer, vol. 196(1), pages 663-682, July.
    2. Ayşegül Altın & Bernard Fortz & Mikkel Thorup & Hakan Ümit, 2013. "Intra-domain traffic engineering with shortest path routing protocols," Annals of Operations Research, Springer, vol. 204(1), pages 65-95, April.
    3. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    4. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Qingzheng Xu & Na Wang & Lei Wang & Wei Li & Qian Sun, 2021. "Multi-Task Optimization and Multi-Task Evolutionary Computation in the Past Five Years: A Brief Review," Mathematics, MDPI, vol. 9(8), pages 1-44, April.
    6. Xiao, Lei & Zhang, Xinghui & Tang, Junxuan & Zhou, Yaqin, 2020. "Joint optimization of opportunistic maintenance and production scheduling considering batch production mode and varying operational conditions," Reliability Engineering and System Safety, Elsevier, vol. 202(C).
    7. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    8. J Renaud & F F Boctor & G Laporte, 2004. "Efficient heuristics for Median Cycle Problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 179-186, February.
    9. Wei Wang & Yaofeng Xu & Liguo Hou, 2019. "Optimal allocation of test times for reliability growth testing with interval-valued model parameters," Journal of Risk and Reliability, , vol. 233(5), pages 791-802, October.
    10. Dalila B. M. M. Fontes & S. Mahdi Homayouni, 2023. "A bi-objective multi-population biased random key genetic algorithm for joint scheduling quay cranes and speed adjustable vehicles in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 241-268, March.
    11. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.
    12. Zong-Zhi Lin & James C. Bean & Chelsea C. White, 2004. "A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 27-38, February.
    13. Christos Koulamas, 1997. "Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 109-125, February.
    14. Yanling Chang & Alan Erera & Chelsea White, 2015. "A leader–follower partially observed, multiobjective Markov game," Annals of Operations Research, Springer, vol. 235(1), pages 103-128, December.
    15. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    16. Fernanda Nakano Kazama & Aluizio Fausto Ribeiro Araujo & Paulo Barros Correia & Elaine Guerrero-Peña, 2021. "Constraint-guided evolutionary algorithm for solving the winner determination problem," Journal of Heuristics, Springer, vol. 27(6), pages 1111-1150, December.
    17. H. Faria & M. G. C. Resende & D. Ernst, 2017. "A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem," Journal of Heuristics, Springer, vol. 23(6), pages 533-550, December.
    18. F. Stefanello & L. S. Buriol & M. J. Hirsch & P. M. Pardalos & T. Querido & M. G. C. Resende & M. Ritt, 2017. "On the minimization of traffic congestion in road networks with tolls," Annals of Operations Research, Springer, vol. 249(1), pages 119-139, February.
    19. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:84:y:2023:i:2:d:10.1007_s11235-023-01040-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.