Approximation algorithms
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
An APTAS for Generalized Cost Variable-Sized Bin Packing
SIAM Journal on Computing
Optimal beam scheduling for multicasting in wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Practical beamforming based on RSSI measurements using off-the-shelf wireless clients
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
IEEE Transactions on Signal Processing
Far-Field Multicast Beamforming for Uniform Linear Antenna Arrays
IEEE Transactions on Signal Processing
Transmit beamforming for physical-layer multicasting
IEEE Transactions on Signal Processing - Part I
Convex approximation techniques for joint multiuser downlink beamforming and admission control
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Using beamforming antennas to improve wireless multicast transmissions has received considerable attention recently. A recent work proposes to partition all single-lobe beams into groups and to form composite multilobe beam patterns to transmit multicast traffic. Depending on how the power is split among the individual beams constituting a composite beam pattern, two power models are considered: 1) equal power split (EQP), and 2) asymmetric power split (ASP). This paper revisits the key challenge--beam partitioning in the beamforming-multicast problem--and makes significant progress in both algorithmic and analytic aspects of the problem. Under EQP, we propose a low-complexity optimal algorithm based on dynamic programming. Under ASP, we prove that it is NP-hard to have (3/2 -- ε) - approximation algorithm for any ε 0. For discrete rate functions under ASP, we develop an Asymptotic Polynomial-Time Approximation Scheme (APTAS), an asymptotic (3/2+ β)-approximation solution (where β ≥ 0 depends on the wireless technology), and an asymptotic 2-approximation solution to the problem by relating the problem to a generalized version of the bin-packing problem. In retrospect, we also obtain an asymptotic 2-approximation solution for the generalized bin-packing problem, which is of independent interest. For continuous rate functions under ASP, we develop sufficient conditions under which the optimal number of composite beams is 1, K, and arbitrary, respectively, where K is the total number of single-lobe beams. Both experimental results and simulations based on real-world channel measurements corroborate our analytical results by showing significant improvement compared to state-of-the-art algorithms.