Multipoint communication by hierarchically encoded data
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
LVMSR: an efficient algorithm to multicast layered video
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ad Hoc Wireless Networks: Architectures and Protocols
Ad Hoc Wireless Networks: Architectures and Protocols
Multiple description video multicast in wireless ad hoc networks
Mobile Networks and Applications - Special issue: Recent advances in wireless networking
QoS routing in ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Multiple Tree Video Multicast Over Wireless Ad Hoc Networks
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
In wireless ad hoc networks nodes are expected to be heterogeneous with a set of multicast destinations greatly differing in their end devices and QoS re uirements. This paper proposes two algorithms for multilayered video multicast over heterogeneous wireless ad hoc networks. The two algorithms are, Multiple Shortest Path Tree (MSPT) and Multiple Steiner Minimum Tree (MSMT). In this paper, we assume that each destination has a preference number of video layers; which is e ual to its capacity. Moreover, we do not consider only the capacities of nodes in the network but also the bandwidth of each link. In order to increase user satisfaction for a group of heterogeneous destinations, we exploit different types of multiple multicast trees policy. Simulations show that the proposed schemes greatly improve the QoS re uirements (increase user satisfaction) for a set of destinations. In addition, simulations show that multiple Hybrid-II multicast trees offer higher user satisfaction than multiple Hybrid-I multicast trees and multiple node-disjoint trees. The cost of that is the robustness against link failure. Therefore, it is a trade off between providing robustness against path breaks and increasing user satisfaction.