Solve tree setup-break problem and minimize control overhead in delay-bounded distributed wireless multicast QoS routing

In wireless networks, the multicast QoS routing is a key technique to increase bandwidth utilization, but the multicast routing is typically complicated and difficult because it belongs to the NP-complete problem. The main goal of a delay-bounded wireless multicast algorithm is to determine the optimal multicast tree that has the least cost while satisfying the delay-bounded requirement. However, previous studies suffer from the Tree setup-break and dangling node problems, and yield a large number of control messages. This paper thus proposes the adaptive distributed multicast routing (ADMR) algorithm to guarantee cycle-free, and to overcome these two problems while yielding the least-cost delay-bounded multicast tree for high-density member multicast networks. Numerical results indicate that ADMR significantly outperforms the Jia-based algorithms in number of control messages and setup convergent time.