Power allocation games in interference relay channels: Existence analysis of nash equilibria

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. Communications are assumed to be multiband, and transmitters are assumed to selfishly allocate their resources to optimize their individual transmission rate. The main objective of this paper is to show that this conflicting situation (modeled by a non-cooperative game) has some stable outcomes, namely, Nash equilibria. This result is proved for three different types of relaying protocols: decode-and-forward, estimate-and-forward, and amplify-and-forward. We provide additional results on the problems of uniqueness, efficiency of the equilibrium, and convergence of a best-response-based dynamics to the equilibrium. These issues are analyzed in a special case of the amplify-and-forward protocol and illustrated by simulations in general. © 2010 Elena Veronica Belmega et al.

Cite

CITATION STYLE

APA

Belmega, E. V., Djeumou, B., & Lasaulce, S. (2010). Power allocation games in interference relay channels: Existence analysis of nash equilibria. Eurasip Journal on Wireless Communications and Networking, 2010. https://doi.org/10.1155/2010/583462

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free