Distributed beamforming algorithm based on game theory in device-to-device communications

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the device-to-device communication network, there is the interference problem when device-to-device users share the same spectrum with cellular users, a distributed beamforming scheme based on non-cooperative game is proposed to maximize weighted sum rate under the rated transmit power and the users’ quality of service. Since the optimization problem is non-concave, we first obtain the solution of the Karush-Kuhn-Tucher (KKT) condition for the downlink beamforming problem of each sender by dual decomposition. Second, a distributed beamforming algorithm based on the non-cooperative game is proposed, which can quickly converge to the Nash equilibrium point with a lower information exchange overhead. Finally, the simulation results show that the proposed algorithm has better performance in terms of system sum rate and fairness than the existing algorithms.

Cite

CITATION STYLE

APA

Xie, X. Z., Li, C. W., Cheng, S. G., Yang, H. L., & Tang, S. (2018). Distributed beamforming algorithm based on game theory in device-to-device communications. International Journal of Distributed Sensor Networks, 14(8). https://doi.org/10.1177/1550147718786929

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free