Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2016, Article ID 1901952, 11 pages
Research Article

Coordinated Precoding for D2D Communications Underlay Uplink MIMO Cellular Networks

College of Communications Engineering, PLA University of Science and Technology, Nanjing 210007, China

Received 8 November 2015; Accepted 13 March 2016

Academic Editor: Lin Gao

Copyright © 2016 Bing Fang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We study the coordinated precoding problem for device-to-device (D2D) communications underlay multiple-input multiple-output (MIMO) cellular networks. The system model considered here constitutes multiple D2D user pairs attempting to share the uplink radio resources of a cellular network. We first formulate the coordinated precoding problem for the D2D user pairs as a sum-rate maximization (SRM) problem, which is subject to a total interference power constraint imposed to protect the base station (BS) and individual transmit power budgets available for each D2D user pair. Since the formulated SRM problem is nonconvex in general, we reformulate it as a difference convex- (DC-) type programming problem, which can be iteratively solved by employing the famous successive convex approximation (SCA) method. Moreover, a proximal-point-based regularization approach is also pursued here to ensure the convergence of the proposed algorithm. Interestingly, the centralized precoding algorithm can also lend itself to a distributed implementation. By introducing a price-based interference management mechanism, we reformulate the coordinated precoding problem as a Stackelberg game. Then, a distributed precoding algorithm is developed based on the concept of Stackelberg equilibrium (SE). Finally, numerical simulations are also provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a satisfactory solution with guaranteed convergence.