3,292 research outputs found
Dispensing with channel estimation: differentially modulated cooperative wireless communications
As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective
Algorithmic Aspects of Energy-Delay Tradeoff in Multihop Cooperative Wireless Networks
We consider the problem of energy-efficient transmission in delay constrained
cooperative multihop wireless networks. The combinatorial nature of cooperative
multihop schemes makes it difficult to design efficient polynomial-time
algorithms for deciding which nodes should take part in cooperation, and when
and with what power they should transmit. In this work, we tackle this problem
in memoryless networks with or without delay constraints, i.e., quality of
service guarantee. We analyze a wide class of setups, including unicast,
multicast, and broadcast, and two main cooperative approaches, namely: energy
accumulation (EA) and mutual information accumulation (MIA). We provide a
generalized algorithmic formulation of the problem that encompasses all those
cases. We investigate the similarities and differences of EA and MIA in our
generalized formulation. We prove that the broadcast and multicast problems
are, in general, not only NP hard but also o(log(n)) inapproximable. We break
these problems into three parts: ordering, scheduling and power control, and
propose a novel algorithm that, given an ordering, can optimally solve the
joint power allocation and scheduling problems simultaneously in polynomial
time. We further show empirically that this algorithm used in conjunction with
an ordering derived heuristically using the Dijkstra's shortest path algorithm
yields near-optimal performance in typical settings. For the unicast case, we
prove that although the problem remains NP hard with MIA, it can be solved
optimally and in polynomial time when EA is used. We further use our algorithm
to study numerically the trade-off between delay and power-efficiency in
cooperative broadcast and compare the performance of EA vs MIA as well as the
performance of our cooperative algorithm with a smart noncooperative algorithm
in a broadcast setting.Comment: 12 pages, 9 figure
Downlink Noncoherent Cooperation without Transmitter Phase Alignment
Multicell joint processing can mitigate inter-cell interference and thereby
increase the spectral efficiency of cellular systems. Most previous work has
assumed phase-aligned (coherent) transmissions from different base transceiver
stations (BTSs), which is difficult to achieve in practice. In this work, a
noncoherent cooperative transmission scheme for the downlink is studied, which
does not require phase alignment. The focus is on jointly serving two users in
adjacent cells sharing the same resource block. The two BTSs partially share
their messages through a backhaul link, and each BTS transmits a superposition
of two codewords, one for each receiver. Each receiver decodes its own message,
and treats the signals for the other receiver as background noise. With
narrowband transmissions the achievable rate region and maximum achievable
weighted sum rate are characterized by optimizing the power allocation (and the
beamforming vectors in the case of multiple transmit antennas) at each BTS
between its two codewords. For a wideband (multicarrier) system, a dual
formulation of the optimal power allocation problem across sub-carriers is
presented, which can be efficiently solved by numerical methods. Results show
that the proposed cooperation scheme can improve the sum rate substantially in
the low to moderate signal-to-noise ratio (SNR) range.Comment: 30 pages, 6 figures, submitted to IEEE Transactions on Wireless
Communication
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Secure communications can be impeded by eavesdroppers in conventional relay
systems. This paper proposes cooperative jamming strategies for two-hop relay
networks where the eavesdropper can wiretap the relay channels in both hops. In
these approaches, the normally inactive nodes in the relay network can be used
as cooperative jamming sources to confuse the eavesdropper. Linear precoding
schemes are investigated for two scenarios where single or multiple data
streams are transmitted via a decode-and-forward (DF) relay, under the
assumption that global channel state information (CSI) is available. For the
case of single data stream transmission, we derive closed-form jamming
beamformers and the corresponding optimal power allocation. Generalized
singular value decomposition (GSVD)-based secure relaying schemes are proposed
for the transmission of multiple data streams. The optimal power allocation is
found for the GSVD relaying scheme via geometric programming. Based on this
result, a GSVD-based cooperative jamming scheme is proposed that shows
significant improvement in terms of secrecy rate compared to the approach
without jamming. Furthermore, the case involving an eavesdropper with unknown
CSI is also investigated in this paper. Simulation results show that the
secrecy rate is dramatically increased when inactive nodes in the relay network
participate in cooperative jamming.Comment: 30 pages, 7 figures, to appear in IEEE Transactions on Signal
Processin
Directional Relays for Multi-Hop Cooperative Cognitive Radio Networks
In this paper, we investigate power allocation and beamforming in a relay assisted cognitive radio (CR) network. Our objective is to maximize the performance of the CR network while limiting interference in the direction of the primary users (PUs). In order to achieve these goals, we first consider joint power allocation and beamforming for cognitive nodes in direct links. Then, we propose an optimal power allocation strategy for relay nodes in indirect transmissions. Unlike the conventional cooperative relaying networks, the applied relays are equipped with directional antennas to further reduce the interference to PUs and meet the CR network requirements. The proposed approach employs genetic algorithm (GA) to solve the optimization problems. Numerical simulation results illustrate the quality of service (QoS) satisfaction in both primary and secondary networks. These results also show that notable improvements are achieved in the system performance if the conventional omni-directional relays are replaced with directional ones
- …