Congestion Managed Multicast Routing in Wireless Mesh Network

Abstract

To provide broad band connectivity to the mobile users and to build a self-structured network, where it is not possible to have wired network, “Wireless Mesh Networks” are the most vital suitable technology. Routing in Wireless Mesh Networks is a multi-objective nonlinear optimization problem with some constraints. We explore multicast routing for least-cost, delay-sensitive and congestion-sensitive in optimizing the routing in Wireless mesh networks (WMNs). In this work different parameters are associated like edge cost, edge delay and edge congestion. The aim is to create a tree traversing which the set of target nodes are spanned, so as to make the cost and congestion to be minimum with a bounded delay over the path between every pair of source and destination. Since searching optimal routing satisfying multi constraints concurrently is an NP complete problem, we have presented a competent estimated algorithm certified with experimental results, which shows that the performance of presented algorithm is nearly optimum.