Competitive Resource Sharing Based on Game Theory in Cooperative Relay Networks

Zhang, Guopeng; Li, Cong; Zhao, Liqiang; Yang, Kun; Zhang, Hailin

doi:10.4218/etrij.09.0208.0330

Cited by 39 publications

(42 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To tackle this problem, refs. [3][4][5] studied the problem of how a relay should allocate its power among multiple competing user nodes using noncooperative game theory. The studies of [3][4][5] were based on an asymmetric model where one node acts as a source and the other a potential relay.…”

Section: Introductionmentioning

confidence: 99%

“…[3][4][5] studied the problem of how a relay should allocate its power among multiple competing user nodes using noncooperative game theory. The studies of [3][4][5] were based on an asymmetric model where one node acts as a source and the other a potential relay. Different from [3][4][5], from the perspective of cooperative game theory [6], we will study the power allocation problem in the symmetric model where one user node could trade its resource for the other one's cooperative relaying directly [1].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer

Zhang

Yang

Ding

2010

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

In commercial networks, autonomous user nodes operating on batteries are assumed to be selfish to consume their energy solely to maximize their own benefits, e.g., data throughputs. In this letter a two-user cooperative game is proposed to perform the power allocation for selfish cooperative communication networks. In the game, one selfish user node could trade its transmission power for the other ones cooperative relaying directly, and both user nodes are willing to achieve an optimal data-rate increase through cooperative relaying. To find the Nash bargaining solution (NBS) of the game, a low-complexity numerical particle swarm optimizer (PSO) algorithm is also developed. Simulation results indicate that the NBS of the game is efficient, in that both users could experience better performance than they work independently, and fair, in that the degree of cooperation of a user node only depends on how much contribution its partner can make to improve its own performance.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer

Zhang

Yang

Ding

2010

Sci. China Inf. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In networks with multiple relays, the Nash equilibrium only exists under certain conditions. Zhang et al considered the network scenario where there is a single relay and multiple user nodes in [4]. The authors formulated this problem as a sellers' market competition.…”

Section: Related Workmentioning

confidence: 99%

Online auction-based relay selection for cooperative communication in CR networks

Jing

Zhang

Cheng

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

Cognitive radio and cooperative communication are two new network technologies. So, the combination of these two new technologies is a novel solution to solve the problem of spectrum scarcity. Two main challenges exist in the integration of cognitive radio and cooperative communication. First, there is a lack of incentives for the participating wireless devices to serve as relay nodes. Second, there is not an effective relay selection policy. In this paper, we propose an online auction-based relay selection scheme for cooperative communication in cognitive radio (CR) networks. Specifically, we design an auction scheme through adopting stopping theory. The proposed scheme ensures that the primary user (PU) can effectively select a CR relay to transmit its packets in a given time bound. In addition, we have analytically proven the truthfulness and the individual rationality of our online auction scheme. Extensive simulations demonstrate that the proposed relay selection scheme can always successfully and efficiently select a proper relay for a PU and can achieve a higher cooperative communication throughput compared with the conventional schemes.

show abstract

“…Moreover, we construct Markov chain [18][19][20] to evaluate the number of replicas. By introducing the concept of replication factor, we give the formulas for computing the appropriate location to place the replica.…”

Section: Introductionmentioning

confidence: 99%

An Optimized Replica Distribution Method in Cloud Storage System

Wang

2017

Journal of Control Science and Engineering

View full text Add to dashboard Cite

Aiming at establishing a shared storage environment, cloud storage systems are typical applications of cloud computing. Therefore, data replication technology has become a key research issue in storage systems. Considering the performance of data access and balancing the relationship between replica consistency maintenance costs and the performance of multiple replicas access, the methods of replica catalog design and the information acquisition method are proposed. Moreover, the deputy catalog acquisition method to design and copy the information is given. Then, the nodes with the global replica of the information replicate data resources, which have the high access frequency and the long response time. Afterwards, the Markov chain model is constructed. And a matrix geometric solution is used to export the steady-state solution of the model. The performance parameters in terms of the average response time, finish time, and the replica frequency are given to optimize the number of replicas in the storage system. Finally, numerical results with analysis are proposed to demonstrate the influence of the above parameters on the system performance.

show abstract

Competitive Resource Sharing Based on Game Theory in Cooperative Relay Networks

Cited by 39 publications

References 5 publications

Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer

Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer

Online auction-based relay selection for cooperative communication in CR networks

An Optimized Replica Distribution Method in Cloud Storage System

Contact Info

Product

Resources

About