3,248 research outputs found
When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network
We develop and analyze new cooperative strategies for ad hoc networks that
are more spectrally efficient than classical DF cooperative protocols. Using
analog network coding, our strategies preserve the practical half-duplex
assumption but relax the orthogonality constraint. The introduction of
interference due to non-orthogonality is mitigated thanks to precoding, in
particular Dirty Paper coding. Combined with smart power allocation, our
cooperation strategies allow to save time and lead to more efficient use of
bandwidth and to improved network throughput with respect to classical RDF/PDF.Comment: 7 pages, 7 figure
Capacity Gain from Two-Transmitter and Two-Receiver Cooperation
Capacity improvement from transmitter and receiver cooperation is
investigated in a two-transmitter, two-receiver network with phase fading and
full channel state information available at all terminals. The transmitters
cooperate by first exchanging messages over an orthogonal transmitter
cooperation channel, then encoding jointly with dirty paper coding. The
receivers cooperate by using Wyner-Ziv compress-and-forward over an analogous
orthogonal receiver cooperation channel. To account for the cost of
cooperation, the allocation of network power and bandwidth among the data and
cooperation channels is studied. It is shown that transmitter cooperation
outperforms receiver cooperation and improves capacity over non-cooperative
transmission under most operating conditions when the cooperation channel is
strong. However, a weak cooperation channel limits the transmitter cooperation
rate; in this case receiver cooperation is more advantageous.
Transmitter-and-receiver cooperation offers sizable additional capacity gain
over transmitter-only cooperation at low SNR, whereas at high SNR transmitter
cooperation alone captures most of the cooperative capacity improvement.Comment: Accepted for publication in IEEE Transactions on Information Theor
Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels
Transmit signal and bandwidth optimization is considered in multiple-antenna
relay channels. Assuming all terminals have channel state information, the
cut-set capacity upper bound and decode-and-forward rate under full-duplex
relaying are evaluated by formulating them as convex optimization problems. For
half-duplex relays, bandwidth allocation and transmit signals are optimized
jointly. Moreover, achievable rates based on the compress-and-forward
transmission strategy are presented using rate-distortion and Wyner-Ziv
compression schemes. It is observed that when the relay is close to the source,
decode-and-forward is almost optimal, whereas compress-and-forward achieves
good performance when the relay is close to the destination.Comment: 16 pages, 10 figure
The Impact of CSI and Power Allocation on Relay Channel Capacity and Cooperation Strategies
Capacity gains from transmitter and receiver cooperation are compared in a
relay network where the cooperating nodes are close together. Under
quasi-static phase fading, when all nodes have equal average transmit power
along with full channel state information (CSI), it is shown that transmitter
cooperation outperforms receiver cooperation, whereas the opposite is true when
power is optimally allocated among the cooperating nodes but only CSI at the
receiver (CSIR) is available. When the nodes have equal power with CSIR only,
cooperative schemes are shown to offer no capacity improvement over
non-cooperation under the same network power constraint. When the system is
under optimal power allocation with full CSI, the decode-and-forward
transmitter cooperation rate is close to its cut-set capacity upper bound, and
outperforms compress-and-forward receiver cooperation. Under fast Rayleigh
fading in the high SNR regime, similar conclusions follow. Cooperative systems
provide resilience to fading in channel magnitudes; however, capacity becomes
more sensitive to power allocation, and the cooperating nodes need to be closer
together for the decode-and-forward scheme to be capacity-achieving. Moreover,
to realize capacity improvement, full CSI is necessary in transmitter
cooperation, while in receiver cooperation optimal power allocation is
essential.Comment: Accepted for publication in IEEE Transactions on Wireless
Communication
Joint Bandwidth and Power Allocation with Admission Control in Wireless Multi-User Networks With and Without Relaying
Equal allocation of bandwidth and/or power may not be efficient for wireless
multi-user networks with limited bandwidth and power resources. Joint bandwidth
and power allocation strategies for wireless multi-user networks with and
without relaying are proposed in this paper for (i) the maximization of the sum
capacity of all users; (ii) the maximization of the worst user capacity; and
(iii) the minimization of the total power consumption of all users. It is shown
that the proposed allocation problems are convex and, therefore, can be solved
efficiently. Moreover, the admission control based joint bandwidth and power
allocation is considered. A suboptimal greedy search algorithm is developed to
solve the admission control problem efficiently. The conditions under which the
greedy search is optimal are derived and shown to be mild. The performance
improvements offered by the proposed joint bandwidth and power allocation are
demonstrated by simulations. The advantages of the suboptimal greedy search
algorithm for admission control are also shown.Comment: 30 pages, 5 figures, submitted to IEEE Trans. Signal Processing in
June 201
- …