Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer

Abstract

In commercial networks, autonomous user nodes operating on batteries are assumed to be selfish to consume their energy solely to maximize their own benefits, e.g., data throughputs. In this letter a two-user cooperative game is proposed to perform the power allocation for selfish cooperative communication networks. In the game, one selfish user node could trade its transmission power for the other ones cooperative relaying directly, and both user nodes are willing to achieve an optimal data-rate increase through cooperative relaying. To find the Nash bargaining solution (NBS) of the game, a low-complexity numerical particle swarm optimizer (PSO) algorithm is also developed. Simulation results indicate that the NBS of the game is efficient, in that both users could experience better performance than they work independently, and fair, in that the degree of cooperation of a user node only depends on how much contribution its partner can make to improve its own performance.

Energy efficient opportunistic cooperative transmission with different ratio combinings: from a new perspective

“…Before the derivation of the optimal cooperative energy allocation strategy, we first try to answer the question: when is it more efficient for the relay node not to cooperative/transmit? By (12), E * s = E tot and E * r = 0 when γ 1. Substituting E * s and E * r into (4) and setting SNR mrc to ρ we can solve for E * tot , which can be expressed as E * tot = ρ/G s .…”

“…As shown in the simulation parts, these parameters not only have good physical meanings but also can give us a better illustration. By substituting (12) into (4), the SNR resulting from the optimal energy allocation can be computed as…”

“…When this condition does not hold, corresponding to 0 γ < 1, the allocation pair that minimizes E tot while meeting SNR mrc = ρ can be obtained similarly. According to (12), probability can be achieved due to the fact that SNR at the destination node equals ρ with probability 1 − p, otherwise equals 0.…”

“…In [11], a cross-layer design through the integration of physical (PHY) layer and medium access control (MAC) layer was investigated, and cooperative transmission protocol using Jackson queuing model was proposed with multiple relay nodes. Power allocation in cooperative communication systems with selfish users were also investigated using game-theoretical approaches [12,13]. It has been show that Nash bargaining solution (NBS) for these games can be successfully established.…”

A survey of next generation mobile communications research in China

“…In [54], based on a simple semi-orthogonal pilot structure, a low complexity channel estimation approach is proposed to obtain both performance and computational complexity advantages in bi-directional relaying networks, which also saves the frequency spectrum resource. Additionally, resource allocation policies in relay networks require the design of relay selection [55], access strategies [56], and power allocation [57], amongst others, under certain QoS constraints. Furthermore, the introduction of relay stations has made the handover process more complicated, requiring more signaling overhead and processing delay.…”