TY - JOUR
T1 - A cooperation strategy based on nash bargaining solution in cooperative relay networks
AU - Zhang, Zhaoyang
AU - Shi, Jing
AU - Chen, Hsiao Hwa
AU - Guizani, Mohsen
AU - Qiu, Peiliang
N1 - Funding Information:
Manuscript received April 9, 2007; revised August 19, 2007, October 14, 2007, and October 15, 2007. This work was supported in part by the National Natural Science Foundation of China under Grant 60472079 and Grant 60572115, by the National Hi-Tech Research and Development Program under Grant 2007AA01Z257, by the Natural Science Foundation of Zhejiang Province under Grant Z104252, and by the National Science Council, Taiwan, R.O.C., under Grant NSC96-2221-E-006-345 and Grant NSC96-2221-E-006-346. The review of this paper was coordinated by Prof. V. Leung.
PY - 2008/7
Y1 - 2008/7
N2 - This paper proposes a cooperation strategy among rational nodes in a wireless cooperative relaying network as an effort to solve two basic problems, i.e., when to cooperate and how to cooperate. First, a symmetric system model comprising two users and an access point (AP) is presented. In this model, each user plays an equal role and acts as a source as well as a potential relay and has the right to decide the amount of bandwidth it should contribute for cooperation. Second, referring to the cooperative game theory, the above problems are formulated as a two-person bargaining problem. Then, a cooperation bandwidth allocation strategy based on the Nash bargaining solution is proposed, in which if a derived condition is satisfied, users will cooperatively work, and each will share a certain fraction of its bandwidth for relaying; otherwise, they will independently work. Simulation results demonstrate that when cooperation takes place, users benefit from the proposed strategy in terms of utility, and those with longer distance to the AP should spend more bandwidth to cooperate with others.
AB - This paper proposes a cooperation strategy among rational nodes in a wireless cooperative relaying network as an effort to solve two basic problems, i.e., when to cooperate and how to cooperate. First, a symmetric system model comprising two users and an access point (AP) is presented. In this model, each user plays an equal role and acts as a source as well as a potential relay and has the right to decide the amount of bandwidth it should contribute for cooperation. Second, referring to the cooperative game theory, the above problems are formulated as a two-person bargaining problem. Then, a cooperation bandwidth allocation strategy based on the Nash bargaining solution is proposed, in which if a derived condition is satisfied, users will cooperatively work, and each will share a certain fraction of its bandwidth for relaying; otherwise, they will independently work. Simulation results demonstrate that when cooperation takes place, users benefit from the proposed strategy in terms of utility, and those with longer distance to the AP should spend more bandwidth to cooperate with others.
UR - http://www.scopus.com/inward/record.url?scp=48749105529&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=48749105529&partnerID=8YFLogxK
U2 - 10.1109/TVT.2007.912960
DO - 10.1109/TVT.2007.912960
M3 - Article
AN - SCOPUS:48749105529
SN - 0018-9545
VL - 57
SP - 2570
EP - 2577
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 4
ER -