Soft Computing Framework for Routing in Wireless Mesh Networks: An Integrated Cost Function Approach

by   Brahmjit Singh, et al.

Dynamic behaviour of a WMN imposes stringent constraints on the routing policy of the network. In the shortest path based routing the shortest paths needs to be evaluated within a given time frame allowed by the WMN dynamics. The exact reasoning based shortest path evaluation methods usually fail to meet this rigid requirement. Thus, requiring some soft computing based approaches which can replace "best for sure" solutions with "good enough" solutions. This paper proposes a framework for optimal routing in the WMNs; where we investigate the suitability of Big Bang-Big Crunch (BB-BC), a soft computing based approach to evaluate shortest/near-shortest path. In order to make routing optimal we first propose to replace distance between the adjacent nodes with an integrated cost measure that takes into account throughput, delay, jitter and residual energy of a node. A fuzzy logic based inference mechanism evaluates this cost measure at each node. Using this distance measure we apply BB-BC optimization algorithm to evaluate shortest/near shortest path to update the routing tables periodically as dictated by network requirements. A large number of simulations were conducted and it has been observed that BB-BC algorithm appears to be a high potential candidate suitable for routing in WMNs.


page 6

page 7


Routing in Wireless Mesh Networks: Two Soft Computing Based Approaches

Due to dynamic network conditions, routing is the most critical part in ...

Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem

In this paper, we consider the Delay Constrained Unsplittable Shortest P...

User Preferences and the Shortest Path

Indoor navigation systems leverage shortest path algorithms to calculate...

Delay-aware Backpressure Routing Using Graph Neural Networks

We propose a throughput-optimal biased backpressure (BP) algorithm for r...

Distributed Pharaoh System for Network Routing

In this paper it is introduced a biobjective ant algorithm for construct...

Machine Learning-Assisted Least Loaded Routing to Improve Performance of Circuit-Switched Networks

The Least Loaded (LL) routing algorithm has been in recent decades the r...

Learning from A Single Graph is All You Need for Near-Shortest Path Routing in Wireless Networks

We propose a learning algorithm for local routing policies that needs on...

Please sign up or login with your details

Forgot password? Click here to reset