A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
The wireless ad hoc networks have been attracting increasing attention of researchers owing to its good performance and special application. Multicast routing with QoS multi-constraints problem is a nonlinear combinatorial optimization problem, its goal is to find the minimum cost multicast tree which satisfies multi-constraints such as delay, jitter and bandwidth. Such constrained multicast tree problem is known to be an NP-Hard problem, and there are many heuristic algorithms to solve thisdoi:10.14257/ijsia.2015.9.8.09 fatcat:yifa2pbwgvecbknlnm4oypy5ie