Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Interference Relay Channels - Part II: Power Allocation Games (0904.2587v2)

Published 16 Apr 2009 in cs.IT and math.IT

Abstract: 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.

Citations (4)

Summary

We haven't generated a summary for this paper yet.