555 research outputs found

    H2-ARQ-relaying: spectrum and energy efficiency perspectives

    Get PDF
    In this paper, we propose novel Hybrid Automatic Repeat re-Quest (HARQ) strategies used in conjunction with hybrid relaying schemes, named as H2-ARQ-Relaying. The strategies allow the relay to dynamically switch between amplify-and-forward/compress-and-forward and decode-and-forward schemes according to its decoding status. The performance analysis is conducted from both the spectrum and energy efficiency perspectives. The spectrum efficiency of the proposed strategies, in terms of the maximum throughput, is significantly improved compared with their non-hybrid counterparts under the same constraints. The consumed energy per bit is optimized by manipulating the node activation time, the transmission energy and the power allocation between the source and the relay. The circuitry energy consumption of all involved nodes is taken into consideration. Numerical results shed light on how and when the energy efficiency can be improved in cooperative HARQ. For instance, cooperative HARQ is shown to be energy efficient in long distance transmission only. Furthermore, we consider the fact that the compress-and-forward scheme requires instantaneous signal to noise ratios of all three constituent links. However, this requirement can be impractical in some cases. In this regard, we introduce an improved strategy where only partial and affordable channel state information feedback is needed

    On the Performance of the Relay-ARQ Networks

    Full text link
    This paper investigates the performance of relay networks in the presence of hybrid automatic repeat request (ARQ) feedback and adaptive power allocation. The throughput and the outage probability of different hybrid ARQ protocols are studied for independent and spatially-correlated fading channels. The results are obtained for the cases where there is a sum power constraint on the source and the relay or when each of the source and the relay are power-limited individually. With adaptive power allocation, the results demonstrate the efficiency of relay-ARQ techniques in different conditions.Comment: Accepted for publication in IEEE Trans. Veh. Technol. 201

    The Impact of Channel Feedback on Opportunistic Relay Selection for Hybrid-ARQ in Wireless Networks

    Full text link
    This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol supports hybrid automatic-repeat-request transmission where relays forward parity information to the destination in the event of a decoding error. Channel feedback is employed for refining the relay selection process and for selecting an appropriate transmission mode in a proposed adaptive modulation transmission framework. An approximation of the throughput of the proposed adaptive modulation strategy is presented, and the dependence of the throughput on system parameters such as the relay contention probability and the adaptive modulation switching point is illustrated via maximization of this approximation. Simulations show that the throughput of the proposed selection strategy is comparable to that yielded by a centralized selection approach that relies on geographic information.Comment: 30 pages, 9 figures, submitted to the IEEE Transactions on Vehicular Technology, revised March 200

    A Simple Cooperative Diversity Method Based on Network Path Selection

    Full text link
    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

    Opportunistic Relay Selection with Limited Feedback

    Full text link
    It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission approach where relays forward parity information to the destination in the event of a decoding error. Such an approach, however, suffers a loss compared to centralized strategies that select relays with the best channel gain to the destination. This paper closes the performance gap by adding another level of channel feedback to the decentralized relay selection problem. It is demonstrated that only one additional bit of feedback is necessary for good throughput performance. The performance impact of varying key parameters such as the number of relays and the channel feedback threshold is discussed. An accompanying bit error rate analysis demonstrates the importance of relay selection.Comment: 5 pages, 6 figures, to appear in Proceedings of 2007 IEEE Vehicular Technology Conference-Spring in Dublin, Irelan

    Stochastic Geometry Analysis of a Class of Cooperative Relaying Protocols

    Get PDF
    This thesis examines wireless relay networks that use hybrid-ARQ protocols. Relays networks efficiently combat fading and exploit the spatial diversity present in the channel. Hybrid-ARQ involves retransmitting the signal if it is not decoded correctly. In conventional HARQ, the retransmission comes from the source, but in cooperative HARQ the retransmission could come from a relay that has successfully decoded the message, thus attaining transmit diversity.;A Markov chain model is conceived and used to compute the effective throughput and outage probability in the presence of Rayleigh fading. The analytical results are validated with simulations. The spatial configuration of the network plays an important role in the performance of the network. The behavior of the protocols for fixed network topologies and random topologies is examined. The impact of parameters such as path loss exponent, number of relays, and Signal to Noise Ratio are determined.;Spatial averaging is helpful in capturing the spatial variations present in the system. When network topology is random, the analysis proceeds by first assuming the number of relays is fixed, in which case they are drawn from a Binomial Point Process (BPP). For each network realization, the outage probability, throughput and effective throughput are found, and the spatial average of these quantities are found by averaging over a large number of network realizations. Moreover, the maximum throughput is found for each network realization, leading to a characterization of the distribution of throughputs achievable in a random network. Finally, networks with a random number of relays are considered, including the important case that the number of relays in a given area is Poisson distributed, in which case they are drawn from a Poisson Point Process (PPP)
    • …
    corecore