Skip to content
naulon
Not checkedNot checked for notices yet.

Joint Interference Alignment and Power Allocation Based on Stackelberg Game in Device-to-Device Communications Underlying Cellular Networks

Dan Wang, Shunliang Zhang, Qian Cheng and 1 more

IEEE Access · 2021

doi:10.1109/access.2021.3086148 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

As a promising wireless communication technique, Device-to-Device (D2D) can improve the utilization of spectrum resources, overall system throughput and reduce end-to-end delay, energy consumption by exploiting the direct radio link between local devices. Meanwhile, introducing D2D in cellular networks is very challenging due to the complex interference problem. To deal with the complex interference of D2D Underlying Cellular Networks, Interference alignment (IA) as an efficient interference management technique is extensively studied for D2D communications underlaying the cellular networks. However, most of the previous researches on IA only consider the equal power allocation for users, which leads to suboptimal overall system throughput. In order to further improve the system performance, in this paper, we propose a joint power allocation based on stackelberg game and interference alignment algorithm (STPA-IA) to eliminate the complex interference in D2D communications underlaying cellular networks. In this joint approach, the base station (BS) is modeled as the leader while the D2D pairs are followers. The performance of network system and that of D2D users are regarded as the revenues of leader and followers in stackelberg game. The strategy of the leader (BS) is to get the maximum benefits by reducing the interference, while the followers tend to (D2D pairs) maximize their own utility according to leader’s strategy. The non-cooperative game is proved to get the nash equilibrium by the above strategies. Moreover, the close-form expression of the allocated power by maximum the unity function of leader and followers is derived. Extensive simulation results demonstrate that the proposed algorithm outperforms previous works in terms of sum-rate with lower time complexity.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.