Abstract
The problem of optimal multicast routing in Wireless Mess Networks (WMNs) with Quality-of-Service (QoS) provisioning, which is Non-Deterministic Polynomial (NP)-complete, is studied in this paper. The existing algorithms are not very efficient or effective. In order to find an approximation optimal solution for WMNs in feasible time from source to the set of destination nodes, combining the previous deterministic algorithm with the well-known Minimum Path Cost Heuristic (MPH) algorithm, a novel multicast heuristic approximation (NMHA) algorithm with QoS provisioning is proposed in this paper to deal with it. The theoretical validations for the proposed algorithm are presented to show its performance and efficiency. After that, the random static networks with different destination nodes are evaluated. Simulations in these networks show that the proposed algorithm can achieve the approximate optimal solution with the approximation factor of 2(1 + ε)(1 − 1/q) and the time complexity of O(qmn2τK−1).
Highlights
In a relatively short period of time, the Internet has become a critical information delivery infrastructure for global commerce and multimedia [1]
The challenge of multicast routing subject to multiple QoS constraints is usually known as the multiply constrained multicast routing (MCMR) problem
There has been much work involved in designing heuristic solutions for this problem [5,6,7,8,9,10,11,12,13], and they can find multicast trees close to the optimal multicast tree in feasible time, which is more suitable for network multicast use, due to the computing and processing performance of network nodes
Summary
In a relatively short period of time, the Internet has become a critical information delivery infrastructure for global commerce and multimedia [1]. There has been much work involved in designing heuristic solutions for this problem [5,6,7,8,9,10,11,12,13], and they can find multicast trees close to the optimal multicast tree in feasible time, which is more suitable for network multicast use, due to the computing and processing performance of network nodes It seems that much work has been turned to focus on approximation algorithms to deal with the multiply constrained multicast routing (MCMR) problem. The authors did research on the optimal constrained path routing in WMNs in the previous paper [20]; following that, the Fast Minimum Path Cost Heuristic (FMPH) algorithm was put forward to deal with the MCMR problem in WMNs. Recently, Athanasios Vasilakos and his co-authors proposed the cross-layer protocol to decrease the delay [21,22,23,24,25] and devised a novel energy-saving algorithm.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
