Routing in Wireless Mesh Networks: Two Soft Computing Based Approaches
Sharad Sharma, Shakti Kumar, Brahmjit Singh

TL;DR
This paper introduces two soft computing algorithms, BB-BC and BBO, for efficient routing in wireless mesh networks, optimizing path selection based on delay, throughput, and jitter to improve network performance.
Contribution
It proposes a fuzzy logic-based cost measure combined with BB-BC and BBO algorithms for near shortest path routing in WMNs, demonstrating improved speed and accuracy.
Findings
BB-BC outperforms BBO in speed and accuracy
Both algorithms efficiently find near shortest paths
Simulation confirms effectiveness in dynamic network conditions
Abstract
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised. The routing strategies developed for WMNs must be efficient to make it an operationally self configurable network. Thus we need to resort to near shortest path evaluation. This lays down the requirement of some soft computing approaches such that a near shortest path is available in an affordable computing time. This paper proposes a Fuzzy Logic based integrated cost measure in terms of delay, throughput and jitter. Based upon this distance (cost) between two adjacent nodes we evaluate minimal shortest path that updates routing tables. We apply two recent soft computing approaches namely Big Bang Big Crunch (BB-BC) and Biogeography Based Optimization (BBO) approaches to enumerate shortest or near short paths. BB-BC theory is related with the evolution of the universe whereas BBO is…
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.
