A novel equivalent definition of modified Bessel functions for performance analysis of multi-hop wireless communication systems

A statistical model is derived for the equivalent signal-to-noise ratio of the Source-to-Relay-to-Destination (S-R-D) link for Amplify-and-Forward (AF) relaying systems that are subject to block Rayleigh-fading. The probability density function and the cumulated density function of the S-R-D link SNR involve modified Bessel functions of the second kind. Using fractional-calculus mathematics, a novel approach is introduced to rewrite those Bessel functions (and the statistical model of the S-R-D link SNR) in series form using simple elementary functions. Moreover, a statistical characterization of the total receive-SNR at the destination, corresponding to the S-R-D and the S-D link SNR, is provided for a more general relaying scenario in which the destination receives signals from both the relay and the source and processes them using maximum ratio combining (MRC). Using the novel statistical model for the total receive SNR at the destination, accurate and simple analytical expressions for the outage probability, the bit error probability, and the ergodic capacity are obtained. The analytical results presented in this paper provide a theoretical framework to analyze the performance of the AF cooperative systems with an MRC receiver

Distributed space-time block codes for two-hop wireless relay networks

Recently, the idea of space-time coding has been applied to wireless relay networks wherein a set of geographically separated relay nodes cooperate to process the received signal from the source and forward them to the destination such that the signal received at the destination appears like a Space-Time Block Code (STBC). Such STBCs (referred to as Distributed Space-Time Block Codes (DSTBCs)) when appropriately designed are known to offer spatial diversity. It is known that different classes of DSTBCs can be designed primarily depending on (i) whether the Amplify and Forward (AF) protocol or the Decode and Forward (DF) protocol is employed at the relays and (ii) whether the relay nodes are synchronized or not. In this paper, we present a survey on the problems and results associated with the design of DSTBCs for the following classes of two-hop wireless relay networks: (i) synchronous relay networks with AF protocols, (ii) asynchronous relay networks with AF protocols (iii) synchronous relay networks with DF protocols and (iv) asynchronous relay Fig. 1. Co-located MIMO channel model networks with DF protocols

A virtual MIMO dual-hop architecture based on hybrid spatial modulation

International audienceIn this paper, we propose a novel Virtual Multiple-Input-Multiple-Output (VMIMO) architecture based on the concept of Spatial Modulation (SM). Using a dual-hop and Decode-and-Forward protocol, we form a distributed system, called Dual-Hop Hybrid SM (DH-HSM). DH-HSM conveys information from a Source Node (SN) to a Destination Node (DN) via multiple Relay Nodes (RNs). The spatial position of the RNs is exploited for transferring information in addition to, or even without, a conventional symbol. In order to increase the performance of our architecture, while keeping the complexity of the RNs and DN low, we employ linear precoding using Channel State Information (CSI) at the SN. In this way, we form a Receive-Spatial Modulation (R-SM) pattern from the SN to the RNs, which is able to employ a centralized coordinated or a distributed uncoordinated detection algorithm at the RNs. In addition, we focus on the SN and propose two regularized linear precoding methods that employ realistic Imperfect Channel State Information at the Transmitter. The power of each precoder is analyzed theoretically. Using the Bit Error Rate (BER) metric, we evaluate our architecture against the following benchmark systems: 1) single relay; 2) best relay selection; 3) distributed Space Time Block Coding (STBC) VMIMO scheme; and 4) the direct communication link. We show that DH-HSM is able to achieve significant Signal-to-Noise Ratio (SNR) gains, which can be as high as 10.5 dB for a very large scale system setup. In order to verify our simulation results, we provide an analytical framework for the evaluation of the Average Bit Error Probability (ABEP)

Cellular Underwater Wireless Optical CDMA Network: Potentials and Challenges

Underwater wireless optical communications is an emerging solution to the expanding demand for broadband links in oceans and seas. In this paper, a cellular underwater wireless optical code division multiple-access (UW-OCDMA) network is proposed to provide broadband links for commercial and military applications. The optical orthogonal codes (OOC) are employed as signature codes of underwater mobile users. Fundamental key aspects of the network such as its backhaul architecture, its potential applications and its design challenges are presented. In particular, the proposed network is used as infrastructure of centralized, decentralized and relay-assisted underwater sensor networks for high-speed real-time monitoring. Furthermore, a promising underwater localization and positioning scheme based on this cellular network is presented. Finally, probable design challenges such as cell edge coverage, blockage avoidance, power control and increasing the network capacity are addressed.Comment: 11 pages, 10 figure

MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm

This document is the Accepted Manuscript version. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, we consider the problem of cooperative communication between relays and base station in an advanced MIMO-OFDM framework, under the assumption that the relays are supplied by electric power drawn from energy harvesting (EH) sources. In particular, we focus on the relay selection, with the goal to guarantee the required performance in terms of capacity. In order to maximize the data throughput under the EH constraint, we model the transmission scheme as a non-transferable coalition formation game, with characteristic function based on an approximated capacity expression. Then, we introduce a powerful mathematical tool inherent to coalitional game theory, namely: the Shapley value (Sv) to provide a reliable solution concept to the game. The selected relays will form a virtual dynamically-configuredMIMO network that is able to transmit data to destination using efficient space-time coding techniques. Numerical results, obtained by simulating the EH-powered cooperativeMIMO-OFDMtransmission with Algebraic Space-Time Coding (ASTC), prove that the proposed coalitional game-based relay selection allows to achieve performance very close to that obtained by the same system operated by guaranteed power supply. The proposed methodology is finally compared with some recent related state-of-the-art techniques showing clear advantages in terms of link performance and goodput.Peer reviewe

Effects of channel estimation on multiuser virtual MIMO-OFDMA relay-based networks

A practical multiuser cooperative transmission scheme denoted as Virtual Maximum Ratio Transmission (VMRT) for multiple-input multiple-output-orthogonal frequency division multiple access (MIMO-OFDMA) relay-based networks is proposed and evaluated in the presence of a realistic channel estimation algorithm and using low-density parity-check (LDPC) codes. It is shown that this scheme is robust against channel estimation errors. It offers diversity and array gain, keeping the complexity low with a multiuser and multiantenna channel estimation algorithm that is simple and efficient. In addition, the combination with LDPC codes provides improved gains; diversity gains larger than 6 dB can be easily obtained with a reduced number of relays. Thus, this scheme can be used to extend coverage or increase system throughput by using simple cooperative OFDMA-based relays.The authors would like to thank Jae-Yun Ko for his valuable help at the beginning of our work. This work has been partly funded by the projects MULTIADAPTIVE (TEC2008-06327- C03-02), COMONSENS (CSD2008-00010) and CODIV (ICT-2007-215477).Publicad

Algebraic Network Coding Approach to Deterministic Wireless Relay Networks

The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian relay networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference. Avestimehr et al. showed that the Min-cut Max-flow theorem holds in the ADT network. In this paper, we show that the ADT network model can be described within the algebraic network coding framework introduced by Koetter and Medard. We prove that the ADT network problem can be captured by a single matrix, called the "system matrix". We show that the min-cut of an ADT network is the rank of the system matrix; thus, eliminating the need to optimize over exponential number of cuts between two nodes to compute the min-cut of an ADT network. We extend the capacity characterization for ADT networks to a more general set of connections. Our algebraic approach not only provides the Min-cut Max-flow theorem for a single unicast/multicast connection, but also extends to non-multicast connections such as multiple multicast, disjoint multicast, and two-level multicast. We also provide sufficiency conditions for achievability in ADT networks for any general connection set. In addition, we show that the random linear network coding, a randomized distributed algorithm for network code construction, achieves capacity for the connections listed above. Finally, we extend the ADT networks to those with random erasures and cycles (thus, allowing bi-directional links). Note that ADT network was proposed for approximating the wireless networks; however, ADT network is acyclic. Furthermore, ADT network does not model the stochastic nature of the wireless links. With our algebraic framework, we incorporate both cycles as well as random failures into ADT network model.Comment: 9 pages, 12 figures, submitted to Allerton Conferenc