Maximizing throughput multicast routing forwireless networks

Abstract

Multicast routing for wireless networks has been widely studied in the literature. In this paper, we design efficient algorithm for maximizing multicast throughput in wireless networks. We assume that we are given a set of wireless devices. All wireless devices are assumed to have the uniform (or quasi-uniform) transmission ranges and have the uniform interference range (or quasi-uniform interference range). We further assume that each wireless node Vi will have a capacity Wi when no interference occurred during its transmission and it can transmit continuously. We present an efficient routing and node scheduling algorithms such that the achieved multicast capacity is within a constant factor of the optimum. Our theoretical throughput performance guarantees are proved under a various number interference models.