End-to-End Joint Antenna Selection Strategy and Distributed Compress and Forward Strategy for Relay Channels

Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time codes were proposed to maximize the achievable diversity-multiplexing tradeoff, however, they fail to achieve all the points of the optimal diversity-multiplexing tradeoff. In the presence of a low-rate feedback link from the destination to each relay stage and the source, this paper proposes an end-to-end antenna selection (EEAS) strategy as an alternative to distributed space-time codes. The EEAS strategy uses a subset of antennas of each relay stage for transmission of the source signal to the destination with amplify and forwarding at each relay stage. The subsets are chosen such that they maximize the end-to-end mutual information at the destination. The EEAS strategy achieves the corner points of the optimal diversity-multiplexing tradeoff (corresponding to maximum diversity gain and maximum multiplexing gain) and achieves better diversity gain at intermediate values of multiplexing gain, versus the best known distributed space-time coding strategies. A distributed compress and forward (CF) strategy is also proposed to achieve all points of the optimal diversity-multiplexing tradeoff for a two-hop relay channel with multiple relay nodes.Comment: Accepted for publication in the special issue on cooperative communication in the Eurasip Journal on Wireless Communication and Networkin

Signal-Aligned Network Coding in K-User MIMO Interference Channels with Limited Receiver Cooperation

In this paper, we propose a signal-aligned network coding (SNC) scheme for K-user time-varying multiple-input multiple-output (MIMO) interference channels with limited receiver cooperation. We assume that the receivers are connected to a central processor via wired cooperation links with individual limited capacities. Our SNC scheme determines the precoding matrices of the transmitters so that the transmitted signals are aligned at each receiver. The aligned signals are then decoded into noiseless integer combinations of messages, also known as network-coded messages, by physical-layer network coding. The key idea of our scheme is to ensure that independent integer combinations of messages can be decoded at the receivers. Hence the central processor can recover the original messages of the transmitters by solving the linearly independent equations. We prove that our SNC scheme achieves full degrees of freedom (DoF) by utilizing signal alignment and physical-layer network coding. Simulation results show that our SNC scheme outperforms the compute-and-forward scheme in the finite SNR regime of the two-user and the three-user cases. The performance improvement of our SNC scheme mainly comes from efficient utilization of the signal subspaces for conveying independent linear equations of messages to the central processor.Comment: 12 pages, 4 figures, submitted to the IEEE Transactions on Vehicular Technolog

Energy Efficient Cooperative Communication

This dissertation studies several problems centered around developing a better understanding of the energy efficiency of cooperative wireless communication systems. Cooperative communication is a technique where two or more nodes in a wireless network pool their antenna resources to form a virtual antenna array . Over the last decade, researchers have shown that many of the benefits of real antenna arrays, e.g. spatial diversity, increased range, and/or decreased transmission energy, can be achieved by nodes using cooperative transmission. This dissertation extends the current body of knowledge by providing a comprehensive study of the energy efficiency of two-source cooperative transmission under differing assumptions about channel state knowledge, cooperative protocol, and node selfishness. The first part of this dissertation analyzes the effect of channel state information on the optimum energy allocation and energy efficiency of a simple cooperative transmission protocol called orthogonal amplify-and-forward (OAF). The source nodes are required to achieve a quality-of service (QoS) constraint, e.g. signal to noise ratio or outage probability, at the destination. Since a QoS constraint does not specify a unique transmit energy allocation when the nodes use OAF cooperative transmission, minimum total energy strategies are provided for both short-term and long-term QoS constraints. For independent Rayleigh fading channels, full knowledge of the channel state at both of the sources and at the destination is shown to significantly improve the energy efficiency of OAF cooperative transmission as well as direct (non-cooperative) transmission. The results also demonstrate how channel state knowledge affects the minimum total energy allocation strategy. Under identical channel state knowledge assumptions, the results demonstrate that OAF cooperative transmission tends to have better energy efficiency than direct transmission over a wide range of channel conditions. The second part of this dissertation focuses on the development of an opportunistic hybrid cooperative transmission protocol that achieves increased energy efficiency by not only optimizing the resource allocation but also by selecting the most energy efficient cooperative transmission protocol from a set of available protocols according to the current channel state. The protocols considered in the development of the hybrid cooperative transmission protocol include compress-and-forward (CF), estimate-and-forward (EF), non-orthogonal amplify-and-forward (NAF), and decode-and-forward (DF). Instantaneous capacity results are analyzed under the assumption of full channel state knowledge at both of the sources and the destination node. Numerical results are presented showing that the delay limited capacity and outage probability of the hybrid cooperative transmission protocol are superior to that of any single protocol and are also close to the cut-set bound over a wide range of channel conditions. The final part of this dissertation focuses on the issue of node selfishness in cooperative transmission. It is common to assume in networks with a central authority, e.g. military networks, that nodes will always be willing to offer help to other nodes when requested to do so. This assumption may not be valid in ad hoc networks operating without a central authority. This section of the dissertation considers the effect selfish behavior on the energy efficiency of cooperative communication systems. Using tools from non-cooperative game theory, a two-player relaying game is formulated and analyzed in non-fading and fading channel scenarios. In non-fading channels, it is shown that a cooperative equilibrium can exist between two self-interested sources given that the end of the cooperative interaction is uncertain, that the sources can achieve mutual benefit through cooperation, and that the sources are sufficiently patient in the sense that they value future payoffs. In fading channels, a cooperative conditional trigger strategy is proposed and shown to be an equilibrium of the two-player game. Sources following this strategy are shown to achieve an energy efficiency very close to that of a centrally-controlled system when they are sufficiently patient. The results in this section show that cooperation can often be established between two purely self-interested sources without the development of extrinsic incentive mechanisms like virtual currency

Regenerative and Adaptive schemes Based on Network Coding for Wireless Relay Network

Recent technological advances in wireless communications offer new opportunities and challenges for relay network.To enhance system performance, Demodulate-Network Coding (Dm-NC) scheme has been examined at relay node; it works directly to De-map the received signals and after that forward the mixture to the destination. Simulation analysis has been proven that the performance of Dm-NC has superiority over analog-NC. In addition, the Quantize-Decode-NC scheme (QDF-NC) has been introduced. The presented simulation results clearly provide that the QDF-NC perform better than analog-NC. The toggle between analogNC and QDF-NC is simulated in order to investigate delay and power consumption reduction at relay node.Comment: 11 pages, 8 figures, International Journal of Computer Networks & Communications (IJCNC), Vol.4, No.3, May 201

Compute-and-Forward: Harnessing Interference through Structured Codes

Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that relays should decode linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise. After decoding these linear equations, the relays simply send them towards the destinations, which given enough equations, can recover their desired messages. The underlying codes are based on nested lattices whose algebraic structure ensures that integer combinations of codewords can be decoded reliably. Encoders map messages from a finite field to a lattice and decoders recover equations of lattice points which are then mapped back to equations over the finite field. This scheme is applicable even if the transmitters lack channel state information.Comment: IEEE Trans. Info Theory, to appear. 23 pages, 13 figure

On the Outage Probability of the Full-Duplex Interference-Limited Relay Channel

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and interfering users are distributed as a Poisson point process. In this case, the asymptotic error probability is upper bounded by the outage probability (OP). We investigate the outage behavior for well-known cooperative schemes, namely, decode-and-forward (DF) and compress-and-forward (CF) considering fading and path loss. For DF we determine the exact OP and develop upper bounds which are tight in typical operating conditions. Also, we find the correlation coefficient between source and relay signals which minimizes the OP when the density of interferers is small. For CF, the achievable rates are determined by the spatial correlation of the interferences, and a straightforward analysis isn't possible. To handle this issue, we show the rate with correlated noises is at most one bit worse than with uncorrelated noises, and thus find an upper bound on the performance of CF. These results are useful to evaluate the performance and to optimize relaying schemes in the context of full-duplex wireless networks.Comment: 30 pages, 4 figures. Final version. To appear in IEEE JSAC Special Issue on Full-duplex Wireless Communications and Networks, 201