A cooperation strategy based on nash bargaining solution in cooperative relay networks

Zhaoyang Zhang, Jing Shi, Hsiao Hwa Chen, Mohsen Guizani, Peiliang Qiu

Research output: Contribution to journalArticlepeer-review

150 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)2570-2577
Number of pages8
JournalIEEE Transactions on Vehicular Technology
Issue number4
Publication statusPublished - 2008 Jul

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'A cooperation strategy based on nash bargaining solution in cooperative relay networks'. Together they form a unique fingerprint.

Cite this