This paper investigates how much the rate region of the two-user Gaussian interference channel can be enlarged by allowing the two source nodes to cooperate. Two cooperative transmission schemes are proposed, based on dirty-paper coding and the assumption that the radio bandwidth is partitioned into two parts, and each part is utilized by one source node. The achievable rate regions and the outage performance of these two schemes are compared with the simplified Han-Kobayashi scheme, which is an efficient coding scheme for the interference channel. Simulation results show that in some channel realizations, the rate region of the Han-Kobayashi scheme is a subset of the rate regions of our two proposed cooperative transmission schemes. Furthermore, a significant gain in outage performance can be obtained, as the cooperative schemes have twice the diversity order of the simplified Han-Kobayashi scheme. While both cooperative schemes are able to yield large diversity gain, one of them can be implemented by simple decoder. Besides, it has an efficient algorithm for maximizing its weighted sum rate, and can be extended easily to the multi-channel case.

We consider fair resource allocation in Gaussian frequency-division broadcast channel with intersymbol interference. The goal is to allocate power and subchannels in a way such that proportional fairness is achieved. We show that the subchannel allocation problem is NP-hard. If multiple users are allowed to time-share a subchannel, the relaxed problem is equivalent to the cake cutting problem and can be efficiently solved. For the joint power and subchannel allocation problem, we propose an iterative method, which solves the power allocation problem and subchannel allocation problem alternately. Simulation results show that its performance is nearly optimal.

A pricing game is derived for cooperative transmission among selfish nodes. Each source node is assigned an orthogonal channel. By overhearing other channels, the source nodes can help relaying other nodes’ messages at a rate based on the received payments. At Nash Equilibrium, the total transmission power is minimized. We also propose a simplified implementation for low rate regime. Simulation results illustrate the significant improvement of power consumption over direct transmission scheme and the high convergence rate of our implementation.

In this paper, we consider cooperative transmission between two source and destination pairs. Exchange of data is allowed between the two source nodes. In addition to the direct transmission link from the source to the intended destination, we have a two-hop relay link that sends the data via the neighboring source node. We partition the bandwidth into two parts, and each part is utilized by one source node, such that the transmissions from the two sources are orthogonal to each other. In this way, the cooperative interference channel is reduced to two independent broadcast channels. The bandwidth of each source node is divided into orthogonal sub-channels, and results from parallel broadcast channel is used to find the optimal allocation of power and rate to each links. We propose an iterative algorithm that maximizes the weighted sum rate, and plot the achievable rate region.