Multilayered Video Multiple Trees Multicast Algorithms for Heterogeneous Wireless Ad Hoc 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; in which all nodes are of the same type (they have the same processing, data rate and communication capabilities and characteristics). 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 algorithms 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. Moreover, we do not consider only the capacities of nodes in the network but also the bandwidth of each link. Simulations show that the proposed schemes greatly improve the QoS requirements (improve user satisfaction ratio (USR)) for a set of destinations. In addition, simulations show that multiple trees schemes achieve substantially higher satisfaction ratio than the single tree scheme.