Cited by 116Metaheuristic Optimization Algorithms ResearchMobile Ad Hoc NetworksWireless Networks and Protocols

Artificial Bee Colony Optimization Algorithm for Enhancing Routing in Wireless Networks

Open access
Jacob, I. Jeena, Darney, P. Ebby·2021·Journal of Artificial Intelligence and Capsule Networks

Abstract

The throughput of wireless multi-channel networks are enhanced using artificial intelligence algorithm. The performance of the network may be improved while reducing the interference. This technique involves three steps namely creation of wireless environment specific model, performance optimization using the right tools and improvement of routing by selecting the performance indicators cautiously. Artificial bee colony optimization algorithm and its evaluative features positively affects communication in wireless networks. The simple behavior of bee agents in this algorithm assist in making synchronous and decentralized routing decisions. The advantages of this algorithm is evident from the MATLAB simulations. The nature inspired routing algorithm offers improved performance when compared to the existing state-of-the-art models. The simple agent model can improve the performance values of the network. The breadth first search variant is utilized for discovery and deterministic evaluation of multiple-paths in the network increasing the overall routing protocol output.

Integrity signals

Registry

Crossref · 10.36548/jaicn.2021.1.006

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • DL can be used to analyze traffic patterns and optimize routes for taxi drivers, helping them avoid congestion and take the most efficient route, which can save time and reduce fuel costs.

    “DL can be used to analyze traffic patterns and optimize routes for taxi drivers. This can help them avoid congestion and take the most efficient route to their destination, which can save time and reduce fuel costs [129] .”

Cited by

Sorted by citations

Authors
Jacob, I. J., & Darney, P. E.
Affiliations
  • GITAM University (IN)
  • Professor, Department of EEE, SCAD CET, Tirunelveli, India
Venue
Journal of Artificial Intelligence and Capsule Networks
Published
2021-03-29
Volume
3
Issue
1
Pages
62-71
ISSN
2582-2012 (ISSN-L)
OpenAlex
W3147167903
Cited by
116
References
0
Citations by year
2026: 4 · 2025: 11 · 2024: 12 · 2023: 13 · 2022: 45 · 2021: 31
FWCI
8.51
Type
journal article
Language
en
Open access
Locations
Journal of Artificial Intelligence and Capsule Networks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
Keywords
artificial bee colony algorithm, wireless network routing, multi-channel wireless networks, throughput improvement, interference suppression, multipath routing, breadth-first search, performance indicators

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review