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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communication Networks and Information Security (IJCNIS)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
