K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks

摘要: In this paper, we address the problem of video multicast over Ad hoc wireless networks. Multicasting is an efficient means one-to-many communication and typically implemented by creating a tree. Video multicasting demands high quality service with continuous delivery to receivers. However, most existing solutions do not guarantee because they are resilient mobility nodes exploit error-resilient nature recently available coding techniques. Uninterrupted transmission requires reachability receivers which emphasizes usage path-diversity. Hence, propose multiple tree protocol maintains maximally node-disjoint trees in network attain robustness against path breaks. We further enhance using description (MDC) for encoding. prove that finding given number session NP-Hard. Then called K-Tree maximal node-disjointedness property K distributed online heuristic. Through extensive simulation experiments, show how proposed improves as use two or three instead single stream. also show, through simulations, efficiently, terms overhead, provides compared well known mesh-based protocol.