Multilayered multicast algorithms for ad hoc wireless networks

In this paper, we address the issue of multilayered multicast routing in wireless ad hoc networks (WAHNs). Existing multilayered multicast protocols assume homogeneous ad hoc wireless networks. A more realistic assumption is a heterogeneous network; in which nodes have different processing, communication capabilities and other characteristics. In this paper, we assume heterogeneous network; in which nodes have different capabilities. Two,multilayered multicast routing schemes are proposed, namely, Multiple Trees Based on Shortest Path Tree (MSPT) and Multiple Trees based on Steiner Minimum Tree (MSMT). We assume that each destination has a preference number of video layers; which is equal to its capacity. The basic idea is to: (i) construct tree(s) that can meet the destinations' QoS requirements, i.e., the number of required video layers (ii) distribute a number of video layers across the nodes. (i) and (ii) are done in a centralized manner, i.e., by the multicast source node. Simulations show that the proposed schemes greatly improve the QoS requirements (improve user satisfaction ratio) for a set of destinations. In addition, simulations show that multiple trees schemes achieve substantially higher satisfaction ratio than the single tree schemes.