A Game Theoretical Approach to Distributed Relay Selection in Randomized Cooperation

In this paper, the problem of node management in the presence of randomized cooperation is tackled. First, game theory is exploited to model the problem of setting up a cluster of cooperative nodes in a wireless network as a multiplayer noncooperative game. In this game the set of players is made of all the nodes belonging to a potential relay cluster an d the set of actions for each player consists of two options only (characterized by different payoffs), namely transmitting a data packet or remaining silent. Then, a novel strategy for the management of node participation to a distributed cooperative link is derived. The proposed solution is fully distributed, is characterized by autonomous choices made by each potential relay and is of significant practical interest since it guarantees the participation of a proper number of nodes to a virtual antenna array (so avoiding an energy waste associated with an excessive number of cooperating nodes) without requiring any overhead for node management.