MIMO cooperative communication network design with relay selection and CSI feedback

In this paper, we investigate an amplify-and-forward (AF) multiple-input multiple-output - spatial division multiplexing (MIMO-SDM) cooperative wireless networks, where each network node is equipped with multiple antennas. In order to deal with the problems of signal combining at the destination and cooperative relay selection, we propose an improved minimum mean square error (MMSE) signal combining scheme for signal recovery at the destination. Additionally, we propose two distributed relay selection algorithms based on the minimum mean squared error (MSE) of the signal estimation for the cases where channel state information (CSI) from the source to the destination is available and unavailable at the candidate nodes. Simulation results demonstrate that the proposed combiner together with the proposed relay selection algorithms achieve higher diversity gain than previous approaches in both flat and frequency-selective fading channels.

Full-Duplex Spectrum Sharing in Cooperative Single Carrier Systems

In this paper, we propose cyclic prefix single carrier (CP-SC) full-duplex transmission in cooperative spectrum sharing to achieve multipath diversity gain and full-duplex spectral efficiency. Integrating full-duplex transmission into cooperative spectrum sharing systems results in two intrinsic problems: 1) the peak interference power constraint at the PUs are concurrently inflicted on the transmit power at the secondary source (SS) and the secondary relays (SRs); and 2) the residual loop interference occurs between the transmit and the receive antennas at the secondary relays. Thus, examining the effects of residual loop interference under peak interference power constraint at the primary users and maximum transmit power constraints at the SS and the SRs is a particularly challenging problem in frequency selective fading channels. To do so, we derive and quantitatively evaluate the exact and the asymptotic outage probability for several relay selection policies in frequency selective fading channels. Our results manifest that a zero diversity gain is obtained with full-duplex.

Cooperative Beamforming and User Selection for Improving the Security of Relay-aided Systems

A relay network in which a source wishes to convey a confidential message to a legitimate destination with the assistance of trusted relays is considered. In particular, cooperative beamforming and user selection techniques are applied to protect the confidential message. The secrecy rate (SR) and secrecy outage probability (SOP) of the network are investigated first, and a tight upper bound for the SR and an exact formula for the SOP are derived. Next, asymptotic approximations for the SR and SOP in the high signal-to-noise ratio (SNR) regime are derived for two different schemes: i) cooperative beamforming and ii) multiuser selection. Further, a new concept of cooperative diversity gain, namely, adapted cooperative diversity gain (ACDG), which can be used to evaluate security level of a cooperative relaying network, is investigated. It is shown that the ACDG of cooperative beamforming is equal to the conventional cooperative diversity gain of traditional multiple-input single-output networks, while the ACDG of the multiuser scenario is equal to that of traditional single-input multiple-output networks.

Query Suggestions for Textual Problem Solution Repositories

Textual problem-solution repositories are available today in
various forms, most commonly as problem-solution pairs from community
question answering systems. Modern search engines that operate on
the web can suggest possible completions in real-time for users as they
type in queries. We study the problem of generating intelligent query
suggestions for users of customized search systems that enable querying
over problem-solution repositories. Due to the small scale and specialized
nature of such systems, we often do not have the luxury of depending on
query logs for finding query suggestions. We propose a retrieval model
for generating query suggestions for search on a set of problem solution
pairs. We harness the problem solution partition inherent in such
repositories to improve upon traditional query suggestion mechanisms
designed for systems that search over general textual corpora. We evaluate
our technique over real problem-solution datasets and illustrate that
our technique provides large and statistically significant