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

Ultra Reliable UAV Communication Using Altitude and Cooperation Diversity

The use of unmanned aerial vehicles (UAVs) that serve as aerial base stations is expected to become predominant in the next decade. However, in order for this technology to unfold its full potential it is necessary to develop a fundamental understanding of the distinctive features of air-to-ground (A2G) links. As a contribution in this direction, this paper proposes a generic framework for the analysis and optimization of the A2G systems. In contrast to the existing literature, this framework incorporates both height-dependent path loss exponent and small-scale fading, and unifies a widely used ground-to-ground channel model with that of A2G for analysis of large-scale wireless networks. We derive analytical expressions for the optimal UAV height that minimizes the outage probability of a given A2G link. Moreover, our framework allows us to derive a height-dependent closed-form expression and a tight lower bound for the outage probability of an \textit{A2G cooperative communication} network. Our results suggest that the optimal location of the UAVs with respect to the ground nodes does not change by the inclusion of ground relays. This enables interesting insights in the deployment of future A2G networks, as the system reliability could be adjusted dynamically by adding relaying nodes without requiring changes in the position of the corresponding UAVs

Generalized Area Spectral Efficiency: An Effective Performance Metric for Green Wireless Communications

Area spectral efficiency (ASE) was introduced as a metric to quantify the spectral utilization efficiency of cellular systems. Unlike other performance metrics, ASE takes into account the spatial property of cellular systems. In this paper, we generalize the concept of ASE to study arbitrary wireless transmissions. Specifically, we introduce the notion of affected area to characterize the spatial property of arbitrary wireless transmissions. Based on the definition of affected area, we define the performance metric, generalized area spectral efficiency (GASE), to quantify the spatial spectral utilization efficiency as well as the greenness of wireless transmissions. After illustrating its evaluation for point-to-point transmission, we analyze the GASE performance of several different transmission scenarios, including dual-hop relay transmission, three-node cooperative relay transmission and underlay cognitive radio transmission. We derive closed-form expressions for the GASE metric of each transmission scenario under Rayleigh fading environment whenever possible. Through mathematical analysis and numerical examples, we show that the GASE metric provides a new perspective on the design and optimization of wireless transmissions, especially on the transmitting power selection. We also show that introducing relay nodes can greatly improve the spatial utilization efficiency of wireless systems. We illustrate that the GASE metric can help optimize the deployment of underlay cognitive radio systems.Comment: 11 pages, 8 figures, accepted by TCo

A Simple Cooperative Diversity Method Based on Network Path Selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M nodes is required, such as those proposed in [7]. The simplicity of the technique, allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability and efficiency in future 4G wireless systems.Comment: To appear, IEEE JSAC, special issue on 4

Near-Capacity Turbo Coded Soft-decision Aided DAPSK/Star-QAM for Amplify-and-Forward based Cooperative Communications

Multilevel Differential Amplitude and Phase-Shift Keying (DAPSK) schemes do not require any channel estimation, which results in low complexity. In this treatise we derive the soft-output probability formulas required for a soft-decision based demodulation of high-order DAPSK, in order to facilitate iterative detection by exchanging extrinsic information with an outer Turbo Code (TC). Furthermore, when the TC block size is increased, the system operates closer to the channel capacity. Compared to the identical-throughput TC assisted 64-ary Differential Phase-Shift Keying (64-DPSK) scheme, the 4-ring based TC assisted 64-ary DAPSK arrangement has a power-efficiency improvement of 2.3 dB at a bit error rate (BER) of 10-5 . Furthermore, when the TC block size is increased, the system operates closer to the channel capacity. More specifically, when using a TC block length of 400 modulated symbols, the 64 DAPSK (4, 16) scheme is 7.56 dB away from its capacity curve, while it had a reduced gap as low as 2.25 dB, when using a longer TC block length of 40 000 modulated symbols. Finally, as a novel application example, the soft-decision M-DAPSK scheme was incorporated into an Amplify-and-Forward (AF) based cooperative communication system, which attains another 4.5 dB SNR improvement for a TC block length of 40 000 modulated symbols

Partner selection in indoor-to-outdoor cooperative networks: an experimental study

In this paper, we develop a partner selection protocol for enhancing the network lifetime in cooperative wireless networks. The case-study is the cooperative relayed transmission from fixed indoor nodes to a common outdoor access point. A stochastic bivariate model for the spatial distribution of the fading parameters that govern the link performance, namely the Rician K-factor and the path-loss, is proposed and validated by means of real channel measurements. The partner selection protocol is based on the real-time estimation of a function of these fading parameters, i.e., the coding gain. To reduce the complexity of the link quality assessment, a Bayesian approach is proposed that uses the site-specific bivariate model as a-priori information for the coding gain estimation. This link quality estimator allows network lifetime gains almost as if all K-factor values were known. Furthermore, it suits IEEE 802.15.4 compliant networks as it efficiently exploits the information acquired from the receiver signal strength indicator. Extensive numerical results highlight the trade-off between complexity, robustness to model mismatches and network lifetime performance. We show for instance that infrequent updates of the site-specific model through K-factor estimation over a subset of links are sufficient to at least double the network lifetime with respect to existing algorithms based on path loss information only.Comment: This work has been submitted to IEEE Journal on Selected Areas in Communications in August 201