Fair and Efficient Resource Sharing for Selfish Cooperative Communication Networks Using Cooperative Game Theory
This paper proposes a cooperative game to perform a fair and efficient resource allocation for the Time Division Multiple Access (TDMA) based cooperative communication networks. In the considered system, two selfish user nodes can act as a source as well as a relay for each other. A transmission node with energy limitation is willing to seek cooperative relaying only if the data-rate achieved through cooperation is not lower than that achieved without cooperation by consuming the same amount of energy. The cooperative strategy of a node can be defined as the number of data-symbols and power that it is willing to contribute for relaying purpose. The authors formulate this two-node fair and efficient resource sharing problem as a bargaining game.