574 research outputs found
Capacity Bounds for Two-Hop Interference Networks
This paper considers a two-hop interference network, where two users transmit
independent messages to their respective receivers with the help of two relay
nodes. The transmitters do not have direct links to the receivers; instead, two
relay nodes serve as intermediaries between the transmitters and receivers.
Each hop, one from the transmitters to the relays and the other from the relays
to the receivers, is modeled as a Gaussian interference channel, thus the
network is essentially a cascade of two interference channels. For this
network, achievable symmetric rates for different parameter regimes under
decode-and- forward relaying and amplify-and-forward relaying are proposed and
the corresponding coding schemes are carefully studied. Numerical results are
also provided.Comment: 8 pages, 5 figures, presented in Allerton Conference'0
Coordination and Bargaining over the Gaussian Interference Channel
This work considers coordination and bargaining between two selfish users
over a Gaussian interference channel using game theory. The usual information
theoretic approach assumes full cooperation among users for codebook and rate
selection. In the scenario investigated here, each selfish user is willing to
coordinate its actions only when an incentive exists and benefits of
cooperation are fairly allocated. To improve communication rates, the two users
are allowed to negotiate for the use of a simple Han-Kobayashi type scheme with
fixed power split and conditions for which users have incentives to cooperate
are identified. The Nash bargaining solution (NBS) is used as a tool to get
fair information rates. The operating point is obtained as a result of an
optimization problem and compared with a TDM-based one in the literature.Comment: 5 pages, 4 figures, to appear in Proceedings of IEEE ISIT201
- …