IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v13y2022i4d10.1007_s13198-021-01530-z.html
   My bibliography  Save this article

Enhancing fault tolerance in vehicular ad-hoc networks using artificial bee colony algorithm-based spanning trees

Author

Listed:
  • Ramin Danehchin

    (University of Tabriz)

Abstract

Providing efficient unicast communication is a crucial challenge in Vehicular Ad-hoc Networks (VANETs). Road-Side Unit (RSU) guarantees unicast communication by constructing the spanning tree among vehicles. Recent papers proposed artificial intelligence-based algorithms for constructing a group of spanning trees in VANETs to deal with the failure of nodes and fast-moving vehicles. The algorithms consider the Euclidean distance between vehicles as a weight function. In such approaches, it is possible for a common non-leaf vehicle in all obtained spanning trees to become unavailable; the spanning trees of the VANETs become paralyzed. To address this challenge, in this paper, a two-phase near-optimal spanning tree contraction in the RSU that is named Fault Tolerance near-optimal Spanning Trees (FTST) is proposed. In the FTST, first, the Multi-objective Artificial Bee Colony (MABC) algorithm is used to construct a spanning tree for the input VANET’s graph with the near-minimum weight and the maximum number of leaves. Then, the second phase of the FTST tries to construct a near-minimum spanning tree with the maximum number of leaves so that the first step spanning tree’s non-leaves can leave off. Implementation results demonstrate the FTST will be suitable for VANET’s applications by improving the fault tolerance of the network and reducing the injected traffic into it.

Suggested Citation

  • Ramin Danehchin, 2022. "Enhancing fault tolerance in vehicular ad-hoc networks using artificial bee colony algorithm-based spanning trees," 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(4), pages 1722-1732, August.
    • Handle: RePEc:spr:ijsaem:v:13:y:2022:i:4:d:10.1007_s13198-021-01530-z
    DOI: 10.1007/s13198-021-01530-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-021-01530-z
    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/s13198-021-01530-z?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. Ramesh C. Poonia, 2018. "A performance evaluation of routing protocols for vehicular ad hoc networks with swarm intelligence," 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. 9(4), pages 830-835, August.
    2. Snehlata Sheoran & Neetu Mittal & Alexander Gelbukh, 2020. "Artificial bee colony algorithm in data flow testing for optimal test suite generation," 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. 11(2), pages 340-349, April.
    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.

      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:ijsaem:v:13:y:2022:i:4:d:10.1007_s13198-021-01530-z. 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.