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.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[2]  H. Saunders,et al.  Probability, Random Variables and Stochastic Processes (2nd Edition) , 1989 .

[3]  D. Fudenberg,et al.  The Theory of Learning in Games , 1998 .

[4]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[5]  Narayan B. Mandayam,et al.  Pricing for enabling forwarding in self-configuring ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[6]  Bin Zhao,et al.  Practical relay networks: a generalization of hybrid-ARQ , 2005, IEEE Journal on Selected Areas in Communications.

[7]  Kenneth Lange,et al.  Numerical analysis for statisticians , 1999 .

[8]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[9]  Anna Scaglione,et al.  Randomized Space-Time Coding for Distributed Cooperative Communication , 2007, IEEE Transactions on Signal Processing.

[10]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[11]  Alain Haurie,et al.  An Introduction to Dynamic Games , 2000 .

[12]  Fabrizio Pancaldi,et al.  A Game Theory Approach to Selection Diversity in Wireless Ad-Hoc Networks , 2009, 2009 IEEE International Conference on Communications.

[13]  A. Scaglione,et al.  Randomized distributed space-time coding for cooperative communication in self organized networks , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[14]  Mohamed Oussama Damen,et al.  A New Class of Asynchronous Distributed Space-Time Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[15]  Evelyn C. Fink,et al.  Game Theory Topics: Incomplete Information, Repeated Games and N-Player Games , 1998 .

[16]  Younghwan Yoo,et al.  Why does it pay to be selfish in a MANET? , 2006, IEEE Wireless Communications.

[17]  V. Trailli.  On the Energy Efficiency of Multihop Communication in Wireless Sensor Networks , 2005, 2005 2nd International Symposium on Wireless Communication Systems.

[18]  Narayan B. Mandayam,et al.  Pricing for enabling forwarding in self-configuring ad hoc networks , 2005 .

[19]  Xiang-Gen Xia,et al.  Distributed Linear Space-Time Convolutional Codes Achieving Asynchronous Full Cooperative Diversity with MMSE-DFE Receivers (Special Paper) , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[20]  Umberto Spagnolini,et al.  Distributed Orthogonal Space-Time Coding: Design and Outage Analysis for Randomized Cooperation , 2007, IEEE Transactions on Wireless Communications.