Paper Info
Title
Opportunistic beamforming for finite horizon multicast
Abstract
Wireless multicasting suffers from the problem that the transmit rate is usually determined by the receiver with the worst channel. Composite or adaptive beamforming allows using beamforming patterns that trade off antenna gains between receivers. A common solution for wireless multicast with beamforming is to select the pattern that maximizes the minimum rate among all receivers (for a given transmit power). However, when using opportunistic multicast to transmit a finite number of packets to all receivers - the finite horizon problem - this is no longer optimal. Instead, the optimum beamforming pattern depends on instantaneous channel conditions as well as the number of received packets at each receiver. We formulate the finite horizon multicast beamforming problem as a dynamic programming problem to obtain the optimal solution. We further design a heuristic that has sufficiently low complexity to be implementable in practice and show through extensive simulations that our algorithm significantly outperforms prior solutions.
Year
DOI
Venue
2014
10.1109/WoWMoM.2014.6918923
WoWMoM
Keywords
Field
DocType
dynamic programming problem,opportunistic beamforming,beamforming pattern,array signal processing,multicast beamforming problem,composite beamforming,finite horizon problem,finite horizon multicast,dynamic programming,wireless multicasting,radiocommunication,multicast communication,adaptive beamforming,mathematical model,signal to noise ratio
WSDMA,Beamforming,Wireless,Adaptive beamformer,Transmitter power output,Computer science,Computer network,Communication channel,Multicast,Precoding
Conference
Citations 
PageRank 
References 
2
0.35
11
Authors
3
Name
Order
Citations
PageRank
Gek Hong Sim1386.93
Jörg Widmer23924328.38
Balaji Rengarajan311811.05