69 research outputs found

    Combining coded signals with arbitrary modulations in orthogonal relay channels

    Get PDF
    We consider a relay channel for which the following assumptions are made. (1) The source-destination and relay-destination channels are orthogonal (frequency division relay channel). (2) The relay implements the decode-and-forward protocol. (3) The source and relay implement the same channel encoder, namely, a onvolutional encoder. (4) They can use arbitrary and possibly different modulations. In this framework, we derive the best combiner in the sense of the maximum likelihood (ML) at the destination and the branch metrics of the trellis associated with its channel decoder for the ML combiner and also for the maximum ratio combiner (MRC), cooperative-MRC (C-MRC), and the minimum mean-square error (MMSE) combiner

    DMT Optimal On-Demand Relaying for Mesh Networks

    Get PDF
    This paper presents a new cooperative MAC (Medium Access Control) protocol called BRIAF (Best Relay based Incremental Amplify-and-Forward). The proposed protocol presents two features: on-demand relaying and selection of the best relay terminal. “On-demand relaying” means that a cooperative transmission is implemented between a source terminal and a destination terminal only when the destination terminal fails in decoding the data transmitted by the source terminal. This feature maximizes the spatial multiplexing gain r of the transmission. “Selection of the best relay terminal” means that a selection of the best relay among a set of (m-1) relay candidates is implemented when a cooperative transmission is needed. This feature maximizes the diversity order d(r) of the transmission. Hence, an optimal DMT (Diversity Multiplexing Tradeoff) curve is achieved with a diversity order d(r) = m(1-r) for 0 ≀ r ≀ 1

    Dual-hop transmissions with fixed-gain relays over Generalized-Gamma fading channels

    Get PDF
    In this paper, a study on the end-to-end performance of dual-hop wireless communication systems equipped with fixed-gain relays and operating over Generalized-Gamma (GG) fading channels is presented. A novel closed form expression for the moments of the end-to-end signal-to-noise ratio (SNR) is derived. The average bit error probability for coherent and non-coherent modulation schemes as well as the end-to-end outage probability of the considered system are also studied. Extensive numerically evaluated and computer simulations results are presented that verify the accuracy of the proposed mathematical analysis.\u

    Optimal Cooperative MAC Protocol with Efficient Selection of Relay Terminals

    Get PDF
    A new cooperative protocol is proposed in the context of wireless mesh networks. The protocol implements ondemand cooperation, i.e. cooperation between a source terminal and a destination terminal is activated only when needed. In that case, only the best relay among a set of available terminals is re-transmitting the source message to the destination terminal. This typical approach is improved using three additional features. First, a splitting algorithm is implemented to select the best relay. This ensures a fast selection process. Moreover, the duration of the selection process is now completely characterized. Second, only terminals that improve the outage probability of the direct link are allowed to participate to the relay selection. By this means, inefficient cooperation is now avoided. Finally, the destination terminal discards the source message when it fails to decode it. This saves processing time since the destination terminal does not need to combine the replicas of the source message: the one from the source terminal and the one from the best relay. We prove that the proposed protocol achieves an optimal performance in terms of Diversity-Multiplexing Tradeoff (DMT)

    Comparison of Cooperative Diversity Protocols in Various Relay Locations through Network Coding

    Get PDF
    In this paper, the performance of Network Coded (NC) based cooperative network for various relay location over Rayleigh fading channels is studied. Comparisons of Amplify and Forward (AAF), Detect and Forward (DTF) and Decode and forward (DCF) protocols for the proposed system are shown. The performance of relays in AAF, DTF and DCF is analyzed in terms of bit error rate (BER) vs signal to noise ratio (SNR). Matlab is used to build Monte-Carlo link level simulation. The effect of relays at different position is studied

    On-Demand Cooperation MAC Protocols with Optimal Diversity-Multiplexing Tradeoff

    Get PDF
    This paper presents access protocols with optimal Diversity-Multiplexing Tradeoff (DMT) performance in the context of IEEE 802.11-based mesh networks. The protocols are characterized by two main features: on-demand cooperation and selection of the best relay terminal. The on-demand characteristic refers to the ability of a destination terminal to ask for cooperation when it fails in decoding the message transmitted by a source terminal. This approach allows maximization of the spatial multiplexing gain. The selection of the best relay terminal allows maximization of the diversity order. Hence, the optimal DMT curve is achieved with these protocols

    Study of Power Consumption in a Cooperative Wireless Network

    Get PDF
    A cooperative wireless network is defined to be a network where nodes cooperate in routing and/or improving the quality of transmission of each other’s packets [1]-[5]. The cooperation is especially useful when the channel between a pair of nodes (source and destination) is in a deep shadow-fading state. In this situation increasing the power level may either not resolve the problem or be too power consuming, while generating interference for other receivers on the same channel. A cooperating node, which has good propagation channels to both the source and the destination, may be used to relay the packets between them. This paper presents the comparison of the average amounts of power consumed by nodes in a standard wireless network that uses single-hop transmission and a cooperative wireless network that uses two-hop transmission. It is shown that under certain conditions the ratio of the average power consumptions in the two networks, when N cooperating nodes on average are available for each node, can be approximated by k ln N + q . The constants k and q are related to the propagation channel. For a Nakagami fading channel with parameter m, k =1/ lnm and q=1, while for a shadowing channel with standard deviation σ dB, k =σdB/ √ π and q = 0.23σdB dB

    A high efficiency BPSK receiver for short range wireless network

    Get PDF
    In this paper, a 910MHz high efficiency BPSK receiver is presented with Colpitts oscillator for short range wireless network. In this research, with injection-lock technique and using Colpitts oscillator, the efficiency of receiver has been improved. And also, behavior of an oscillator under injection of another signal has been investigated. Also, variation of output signal amplitude versus injected signal phase variation, the effect of varying the amplitude of injected signal and quality factor of the oscillator has been investigated. The designed receiver has 0.474 mW dc power and -60 dBm sensitivity. Data rate of receiver is 5 Mbps. The FOM of receiver is 94 pJ/bit. This receiver was designed and simulated in 0.18 ÎŒm RFCMOS technology. This proposed receiver can be used in short range wireless network for example, Wireless Body array network and wireless sensor network

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

    Get PDF
    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
    • 

    corecore