EBCD: a routing algorithm based on bee colony for energy consumption reduction in wireless relay networks
Arash Ghorbannia Delavar, Elham Javiz

TL;DR
This paper introduces EBCD, a bee colony-based routing algorithm for wireless relay networks that reduces energy consumption by optimizing routing parameters and improving adaptability and service quality.
Contribution
It proposes a novel routing algorithm combining energy, distance, and traffic parameters using bee colony optimization for better energy efficiency.
Findings
Outperforms previous algorithms in energy reduction
Enhances adaptability to environmental conditions
Supports multi-hop routing with improved service quality
Abstract
One of the important issues in wireless networks is the Routing problem that is effective on system performance, in this article the attempt is made to propose a routing algorithm using the bee colony in order to reduce energy consumption in wireless relay networks. In EBCD algorithm, through combined of energy, distance and traffic parameters a routing algorithm for wireless networks is presented with more efficiency than its predecessor. Applying the bee colony method would allow the placement of the parameters under conventional conditions and to get closer to a mechanism with a better adaptability than that of the existing algorithm. According to the parameters considered, the proposed algorithm provides a fitness function that can be applied as a multi-hop. Unlike other algorithms of its kind this can increase service quality based on environmental conditions through its multiple…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
