Fair resource sharing for cooperative relay networks using Nash bargaining solutions

Authors:
Guopeng Zhang;Hailin Zhang;Liqiang Zhao;Wei Wang;Li Cong
Affiliations:
State Key Lab of ISN, Xidian University, Xi'an, China;State Key Lab of ISN, Xidian University, Xi'an, China;State Key Lab of ISN, Xidian University, Xi'an, China;State Key Lab of ISN, Xidian University, Xi'an, China;State Key Lab of ISN, Xidian University, Xi'an, China
Venue:
IEEE Communications Letters
Year:
2009

Citing 2
Cited 1

A game theoretic framework for bandwidth allocation and pricing in broadband networks

IEEE/ACM Transactions on Networking (TON)
A survey on sensor networks

IEEE Communications Magazine

Multi-user symmetric cooperation based on nash bargaining solution in cooperative relay networks

International Journal of Automation and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This letter considers the problem of resource sharing between two selfish nodes in cooperative relay networks. In our system, each node can act as a source as well as a potential relay, and both nodes are willing to achieve an optimal signal-to-noise ratio (SNR) increase by adjusting their power levels for cooperative relaying. We formulate this problem as a two-person bargaining game, and use the Nash bargaining solution (NBS) to achieve a win-win strategy for both nodes. Simulation results indicate the NBS resource sharing is fair in that the degree of cooperation of a node only depends on how much contribution its partner can make to its SNR increase.