Discrete Mathematics - Topics on domination
Elements of information theory
Elements of information theory
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On-demand multicast routing protocol in multihop wireless mobile networks
Mobile Networks and Applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An adaptive strategy for maximizing throughput in MAC layer wireless multicast
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks
IEEE Transactions on Information Theory
An interference-aware fair scheduling for multicast in wireless mesh networks
Journal of Parallel and Distributed Computing
High throughput MAC layer multicasting over time-varying channels
Computer Communications
Performance comparison of different multicast routing strategies in disruption tolerant networks
Computer Communications
On multicast throughput scaling of hybrid wireless networks with general node density
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper, we consider the multicast throughput optimization problem in multi-hop wireless networks. Given a source, and a set of receivers, we would like to find the set of multicast trees and a schedule such that the rate that the source can multicast to the receivers is maximized. We consider two transmission models: broadcast and unicast. In the broadcast model, a transmission is received by multiple downstream nodes in a multicast tree. In the unicast model, a separate transmission has to be sent to each downstream node. We consider the fundamental constraint that a node can not be involved in multiple communications at the same time. We consider two multicast models: a single multicast tree per session and multiple multicast tree per session. In the single multicast tree case, (1) for the unicast model, we show that the problem is NP-hard and it is not approximable to a factor better than 1.5; we then give a 1.5-approximation algorithm if all links have the same data rate, a 5-approximation algorithm if all nodes have the same transmission power and a 24-approximation algorithm for a realistic heterogeneous ad hoc network where nodes can have different transmission power. (2) for the broadcast model, we show that the problem is NP-hard and it is not approximable to a factor better than 2; we then give a simple 2-approximation algorithm to find the multicast tree and the transmission schedule. In the multiple multicast tree case, (1) for the unicast model, we show that the problem is APX-hard, and give a 1.5Ρ-approximation where Ρ is the best approximation ratio of the minimal cost Steiner tree problem; (2) for the broadcast model, our results indicate that the problem is hard, may not be approximable within a factor better than log(n) where n is the number of multicast receivers. Our evaluation shows that the throughput achieved by our algorithms is much better than both the throughput achieved by using pruned shortest path tree and by using optimal unicast.