Skip to main content
Log in

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

  • Brief Report
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Sendonaris A, Erkip E, Aazhang B. User cooperation diversity part I: system description. IEEE Trans Commun, 2003, 51: 1927–1938

    Article  Google Scholar 

  2. Himsoon T, Siriwongpairat W, Liu K J R, et al. Lifetime maximization framework by cooperative nodes and relay deployment in wireless networks. IEEE J Select Areas Commun, 2007, 25: 306–317

    Article  Google Scholar 

  3. Huang J W, Han Z, Liu K J R, et al. Auction-based resource allocation for cooperative communications. IEEE J Select Areas Commun, 2008, 26: 1226–1237

    Article  Google Scholar 

  4. Zhang G, Cong L, Yang K, et al. Competitive resource sharing based on game theory in cooperative relay networks. ETRI J, 2009, 31: 89–91

    Article  Google Scholar 

  5. Wang B, Han Z, Liu K J R, et al. Distributed relay selection and power control for multiuser cooperative communication networks using Stackelberg game. IEEE Trans Mobile Comput, 2009, 8: 975–990

    Article  Google Scholar 

  6. Yaiche H, Mazumdar R R, Rosenberg C, et al. A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans Netw, 2000, 8: 667–678

    Article  Google Scholar 

  7. Shi Y, Eberhart R C. A modified particle swarm optimizer. In: Proc of IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, USA, 1998. 69–73

  8. Wang J, Chen J. Performance of wideband CDMA systems with complex spreading and imperfect channel estimation. IEEE J Select Areas Commun, 2001, 19: 152–163

    Article  Google Scholar 

  9. Wang J, Milstein L B. CDMA overlay situations for microcellular mobile communications. IEEE Trans Commun, 1995, 43: 603–614

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to GuoPeng Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, G., Yang, K. & Ding, E. Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer. Sci. China Inf. Sci. 53, 1908–1912 (2010). https://doi.org/10.1007/s11432-010-4055-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-4055-0

Keywords

Navigation