Outage Probability of Dual-Hop Selective AF With Randomly Distributed and Fixed Interferers

The outage probability performance of a dual-hop amplify-and-forward selective relaying system with global relay selection is analyzed for Nakagami-$m$ fading channels in the presence of multiple interferers at both the relays and the destination. Two different cases are considered. In the first case, the interferers are assumed to have random number and locations. Outage probability using the generalized Gamma approximation (GGA) in the form of one-dimensional integral is derived. In the second case, the interferers are assumed to have fixed number and locations. Exact outage probability in the form of one-dimensional integral is derived. For both cases, closed-form expressions of lower bounds and asymptotic expressions for high signal-to-interference-plus-noise ratio are also provided. Simplified closed-form expressions of outage probability for special cases (e.g., dominant interferences, i.i.d. interferers, Rayleigh distributed signals) are studied. Numerical results are presented to show the accuracy of our analysis by examining the effects of the number and locations of interferers on the outage performances of both AF systems with random and fixed interferers.Comment: 35 pages, 11 figures, accepted with minor revisions for publication as a regular paper in the IEEE Transactions on Vehicular Technology on 21/09/201

Outage probability of wireless ad hoc networks with cooperative relaying

In this paper, we analyze the performance of cooperative transmissions in wireless ad hoc networks with random node locations. According to a contention probability for message transmission, each source node can either transmits its own message signal or acts as a potential relay for others. Hence, each destination node can potentially receive two copies of the message signal, one from the direct link and the other from the relay link. Taking the random node locations and interference into account, we derive closed-form expressions for the outage probability with different combining schemes at the destination nodes. In particular, the outage performance of optimal combining, maximum ratio combining, and selection combining strategies are studied and quantified.This work was supported in part by the Australian Research Council's Discovery Projects funding scheme (project no. DP110102548)

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics

Performance analysis for cooperative wireless communications

Cooperative relaying has been proposed as a promising solution to mitigate and combat the deleterious effects of fading by sending and receiving independent copies of the same signal at different nodes. It has attracted huge attention from both industry and academia. The purpose of this thesis is to provide an analytical performance evaluation of the cooperative wireless systems while taking some realistic conditions into consideration. To achieve this, first, performance analysis of amplify-and-forward (AF) relaying using pilot-aided maximum likelihood estimation is studied in this thesis. Both disintegrated channel estimation (DCE) and cascaded channel estimation (CCE) are considered. Based on this analysis, optimal energy allocation is proposed. Then, performance analysis for AF relaying corrupted by interferers are investigated. Both randomly distributed and fixed interferers are considered. For random interferers, both the number and the locations of the interferers are random while for fixed interferers, both the number and the locations are fixed. Next, multihop relaying and multiple scattering channels over α - μ fading are analyzed. Channels with interferences and without interferences are considered. Exact results in the form of one-dimensional integral are derived. Also, approximate results with simplified structure and closed-form expressions are provided. Finally, a new hard decision fusion rule that combines arbitrary numbers of bits for different samples taken at different nodes is proposed. The best thresholds for the fusion rules using 2 bits, 3 bits and 4 bits are obtained through simulation. The bit error rate (BER) for hard fusion rule with 1 bit is provided. Numerical results are presented to show the accuracy of our analysis and provide insights. First, they show that our optimal energy allocation methods outperform the conventional system without optimal energy allocation, which could be as large as several dB’s in some cases. Second, with the increase of signal-to-interference-plus-noise ratio (SINR) for AF relaying with interference, the outage probability decreases accordingly for both random and fixed interferers. However, with the change of interference-to-noise ratio (INR) but with the SINR fixed, the outage probability for random interferers change correspondingly while the outage probability for fixed interferers remains almost the same. Third, our newly derived approximate expressions are shown to have acceptable performances in approximating outage probability in wireless multihop relaying system and multiple scattering channel considering interferences and without interferences. Last, our new hard decision fusion rule is shown to achieve better performance with higher energy efficiency. Also they show that there is a tradeoff between performance and energy penalty in the hard decision fusion rule