Skip to main content
Log in

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

  • Original article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ramin Danehchin.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Danehchin, R. Enhancing fault tolerance in vehicular ad-hoc networks using artificial bee colony algorithm-based spanning trees. Int J Syst Assur Eng Manag 13, 1722–1732 (2022). https://doi.org/10.1007/s13198-021-01530-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-021-01530-z

Keywords

Navigation