A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs
AbstractThe 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). View Full-Text
Share & Cite This Article
Yang, W.; Chen, Y. A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs. Future Internet 2016, 8, 38.
Yang W, Chen Y. A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs. Future Internet. 2016; 8(3):38.Chicago/Turabian Style
Yang, Weijun; Chen, Yuanfeng. 2016. "A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs." Future Internet 8, no. 3: 38.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.