D2D Social Selection Relay Algorithm Combined with Auction Principle

. 2022 Nov 28;22(23):9265. doi: 10.3390/s22239265

Algorithm 1 Calculate

Initialize all parameters : P_{c}, P_{r}, γ_{t h}, γ_{t h 2}, N_{0}

For i = 1:L

Compute : S_{i, j}

for each RUE,

w_{i}^{'}

If S_{i, j} \geq w_{i}^{'}

Then Enter set Q

According to Formula (18), get P_{o u t}

Select the node with small P_{o u t}

to enter the set H
End if
For i = 1:H

Bring C_{i}

into C_{m a x} = C_{s} - C_{i}

If C_{m a x}

is the largest, i

is the optimal relay node
End if
End for
End for