Fair and Efficient Resource Sharing for Selfish Cooperative Communication Networks Using Cooperative Game Theory

Abstract

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 datarate 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. We formulate this two-node fair and efficient resource sharing problem as a bargaining game. Since the Nash bargaining solution (NBS) to the game is computationally complex to obtain, a low-complexity algorithm to search the suboptimal NBS is proposed. Simulation results show that the NBS results are fair in that both nodes could experience better performance than if they work independently. And the NBS results are efficient in that the performance loss of the game to that of the maximal overall rate scheme is small while the maximal-rate scheme is unfair.

Multistage Dynamic Packet Access Mechanism of Internet of Things

“…e research in [24] provides a cost-e cient analytic model which can predict device performance according to a limited capacity queueing system with prioritized services and is speci c to heterogeneous IoT devices with the feature of postponing sensitive information. e literature in [25,26] discusses a kind of resource allocation algorithm which concentrates on searching for the Nash equilibrium. e literature [27] discusses the request access control mechanism for limited resources based on the Zero-sum Game, which makes a decision as to whether a request is to be accessed or not based on the request's utility function.…”

“…e work in [20,24] is only applicable to small-size access requests. e research in [22,[25][26][27][28] does not have answers to address competition when core request services match high-quality resources. Generally, these models are not able to solve the problem of competition between important and urgent service requests in the process of IoT mass access.…”

Energy efficient incentive resource allocation in D2D cooperative communications

“…The direct reciprocity based scheme can help solve the unfair issue which rewards user's cooperation directly. In direct reciprocity based scheme, relay users are rewarded with time, power resources [9]- [12] or scheduling priority [13] during the cooperation period. Moreover, it is well-known that the mobile terminals are strictly energy constrained, hence the energy consumption of the cooperation should be taken into consideration when designing the incentive schemes.…”

“…Moreover, it is well-known that the mobile terminals are strictly energy constrained, hence the energy consumption of the cooperation should be taken into consideration when designing the incentive schemes. Power allocation was studied in two source nodes with the same destination case to maximize users' bits-per-energy efficiency [12]. Two pair nodes model was studied to stimulate cooperation by improving throughput with no more energy consumption from the perspective of users [13].…”

On the power allocation strategies in coordinated multi-cell networks using Stackelberg game

“…Also, [24] presents a resource allocation based on cooperative game. But, in addition to the user satisfaction, profit of the service provider is another important factor that should be considered in the network.…”