Computer Science – Information Theory
Scientific paper
2009-04-16
Computer Science
Information Theory
This paper has been withdrawn by the authors
Scientific paper
In the first part of this paper we have derived achievable transmission rates for the (single-band) interference relay channel (IRC) when the relay implements either the amplify-and-forward, decode-and-forward or estimate-and-forward protocol. Here, we consider wireless networks that can be modeled by a multi-band IRC. We tackle the existence issue of Nash equilibria (NE) in these networks where each information source is assumed to selfishly allocate its power between the available bands in order to maximize its individual transmission rate. Interestingly, it is possible to show that the three power allocation (PA) games (corresponding to the three protocols assumed) under investigation are concave, which guarantees the existence of a pure NE after Rosen [3]. Then, as the relay can also optimize several parameters e.g., its position and transmit power, it is further considered as the leader of a Stackelberg game where the information sources are the followers. Our theoretical analysis is illustrated by simulations giving more insights on the addressed issues.
Belmega Elena Veronica
Djeumou Brice
Lasaulce Samson
No associations
LandOfFree
Interference Relay Channels - Part II: Power Allocation Games 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 Interference Relay Channels - Part II: Power Allocation Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference Relay Channels - Part II: Power Allocation Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-140555