Collaborative Multicast Beamforming for Content Delivery by Cache-Enabled Ultra Dense Networks

Caching and multicast have surged as effective tools to alleviate the heavy load from the backhaul links while enabling content-centric delivery in communication networks. The main focus of work in this area has been on the cache placements to manage the network delay and backhaul transmission cost....

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 67; no. 5; pp. 3396 - 3406
Main Authors: Nguyen, Huy T., Tuan, Hoang Duong, Duong, Trung Q., Poor, H. Vincent, Hwang, Won-Joo
Format: Journal Article
Language:English
Published: New York IEEE 01-05-2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Caching and multicast have surged as effective tools to alleviate the heavy load from the backhaul links while enabling content-centric delivery in communication networks. The main focus of work in this area has been on the cache placements to manage the network delay and backhaul transmission cost. An important issue of optimizing the cost efficiency in content delivery has not been addressed. This paper tackles this issue by proposing collaborative multicast beamforming in cache-enabled ultra-dense networks. The objective is to maximize the cost efficiency, which is defined as the ratio of the content throughput to the sum of power consumption and backhaul cost, in providing quality-of-service for content delivery. Zero-forcing beamforming and generalized zero-forcing beamforming are employed to force the multi-content interference to zero or mitigate it while amplifying the desired signals for users. These problems of collaborative multicast beamforming design are computationally difficult. Path-following algorithms, which invoke a simple convex quadratic program at each iteration, are developed for their solution. Numerical results are provided to demonstrate the computational efficiency of the proposed algorithms and also give insights into the impact of caching on the cost efficiency.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2019.2894797