2 research outputs found
Scaling Laws and Techniques in Decentralized Processing of Interfered Gaussian Channels
The scaling laws of the achievable communication rates and the corresponding
upper bounds of distributed reception in the presence of an interfering signal
are investigated. The scheme includes one transmitter communicating to a remote
destination via two relays, which forward messages to the remote destination
through reliable links with finite capacities. The relays receive the
transmission along with some unknown interference. We focus on three common
settings for distributed reception, wherein the scaling laws of the capacity
(the pre-log as the power of the transmitter and the interference are taken to
infinity) are completely characterized. It is shown in most cases that in order
to overcome the interference, a definite amount of information about the
interference needs to be forwarded along with the desired message, to the
destination. It is exemplified in one scenario that the cut-set upper bound is
strictly loose. The results are derived using the cut-set along with a new
bounding technique, which relies on multi letter expressions. Furthermore,
lattices are found to be a useful communication technique in this setting, and
are used to characterize the scaling laws of achievable rates.Comment: Submitted to European Transactions on Telecommunicatio
Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria
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.Comment: To appear in EURASIP Journal on Wireless Communications and
Networking (JWCN