Auction-based power allocation for relay communication

In this paper, the auction theory based power allocation is investigated for relay communications, wherein all relays bid for the transmit power from a server. A target BER at the destination is introduced as the power-bidding criterion to guarantee the received signal´s availability. For maximizing the revenue, all relay nodes compete for the limit power resource and attain the Nash equilibrium. Given the local information, we develop a dynamic updating algorithm to adjust the allocation. Moreover, the stability of the dynamic algorithm is demonstrated and analyzed.