Distributed Relay Selection and Power Allocation Using Stackelberg and Auction Games in Multi-user Multi-relay Networks

This paper focuses on the problem of distributed relay selection and power allocation problem in a multi-user multi-relay network, aims to maximize users’ achievable rate while consume less power of relays which are selected for helping users transmit information. At first, we use the auction game theory to choose the relays for each user preliminarily, then for each user and the selected relays, we model the interaction between them as a two-level Stackelberg game, the relays modeled as the service provider and the users modeled as customers who will buy power from the providers. Based on this game model, we get the relays at relatively better locations for each user and the optimal power need to buy from them. Otherwise, as the users will not exchange information between themselves, we recalculate the power allocated to each user for relays the power users buy from it exceeds the maximizing transmit power. Simulation results show the effectiveness of our proposed scheme