Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in EURASIP Journal on Wireless Communications and Networking (JWCN)

Scientific paper

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 multi-band 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-161121

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.