IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v13y2022i2p1-14.html
   My bibliography  Save this article

A PSO Enable Multi-Hop Clustering Algorithm for VANET

Author

Listed:
  • Ankit Temurnikar

    (Bhagwant University, India)

  • Pushpneel Verma

    (Bhagwant University, India)

  • Gaurav Dhiman

    (Government Bikaram College of Commerce, India)

Abstract

VANET (Vehicle Ad-hoc Network) is an emerging technology in today’s intelligent transport system. In VANET, there are many moving nodes which are called the vehicle running on the road. They communicate with each other to provide the information to driver regarding the road condition, traffic, weather and parking. VANET is a kind of network where moving nodes talk with each other with the help of equipment. There are various other things which also make complete to VANET like OBU (onboard unit), RSU (Road Aside Unit) and CA (Certificate authority). In this paper, a new PSO enable multi-hop technique is proposed which helps in VANET to Select the best route and find the stable cluster head and remove the malicious node from the network to avoid the false messaging. The false can be occurred when there is the malicious node in a network. Clustering is a technique for making a group of the same type node. This proposed work is based on PSO enable clustering and its importance in VANET. While using this approach in VANET, it has increased the 20% packet delivery ratio.

Suggested Citation

  • Ankit Temurnikar & Pushpneel Verma & Gaurav Dhiman, 2022. "A PSO Enable Multi-Hop Clustering Algorithm for VANET," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 13(2), pages 1-14, April.
    • Handle: RePEc:igg:jsir00:v:13:y:2022:i:2:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.20220401.oa7
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jsir00:v:13:y:2022:i:2:p:1-14. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.