438 research outputs found

    Outage probability analysis for hybrid TSR-PSR based SWIPT systems over log-normal fading channels

    Get PDF
    Employing simultaneous information and power transfer (SWIPT) technology in cooperative relaying networks has drawn considerable attention from the research community. We can find several studies that focus on Rayleigh and Nakagami-m fading channels, which are used to model outdoor scenarios. Differing itself from several existing studies, this study is conducted in the context of indoor scenario modelled by log-normal fading channels. Specifically, we investigate a so-called hybrid time switching relaying (TSR)-power splitting relaying (PSR) protocol in an energy-constrained cooperative amplify-and-forward (AF) relaying network. We evaluate the system performance with outage probability (OP) by analytically expressing and simulating it with Monte Carlo method. The impact of power-splitting (PS), time-switching (TS) and signal-to-noise ratio (SNR) on the OP was as well investigated. Subsequently, the system performance of TSR, PSR and hybrid TSR-PSR schemes were compared. The simulation results are relatively accurate because they align well with the theory

    Performance analysis for power-splitting energy harvesting based two-way full-duplex relaying network over nakagami-m fading channel

    Get PDF
    Energy harvesting relay network is considered as the promising solution for a wireless communication network in our time. In this research, we present and demonstrate the system performance of the energy harvesting based two-way full-duplex relaying network over Nakagami-m fading environment. Firstly, we propose the analytical expressions of the achievable throughput and outage probability of the proposed system. In the second step, the effect of various system parameters on the system performance is presented and investigated. In the final step, the analytical results are also demonstrated by Monte-Carlo simulation. The numerical results demonstrated and convinced the analytical and the simulation results are agreed with each other

    DMT Optimal Cooperative Protocols with Destination-Based Selection of the Best Relay

    Get PDF
    We design a cooperative protocol in the context of wireless mesh networks in order to increase the reliability of wireless links. Destination terminals ask for cooperation when they fail in decoding data frames transmitted by source terminals. In that case, each destination terminal D calls a specific relay terminal B with a signaling frame to help its transmission with source terminal S. To select appropriate relays, destination terminals maintain tables of relay terminals, one for each possible source address. These tables are constituted by passively overhearing ongoing transmissions. Hence, when cooperation is needed between S and D, and when a relay B is found by terminal D in the relay table associated with terminal S, the destination terminal sends a negative acknowledgment frame that contains the address of B. When the best relay B has successfully decoded the source message, it sends a copy of the data frame to D using a selective decode-andforward transmission scheme. The on-demand approach allows maximization of the spatial multiplexing gain and the cooperation of the best relay allows maximization of the spatial diversity order. Hence, the proposed protocol achieves optimal diversitymultiplexing trade-off performance. Moreover, this performance is achieved through a collision-free selection process

    Multi-points cooperative relay in NOMA system with N-1 DF relaying nodes in HD/FD mode for N user equipments with energy harvesting

    Get PDF
    Non-Orthogonal Multiple Access (NOMA) is the key technology promised to be applied in next-generation networks in the near future. In this study, we propose a multi-points cooperative relay (MPCR) NOMA model instead of just using a relay as in previous studies. Based on the channel state information (CSI), the base station (BS) selects a closest user equipment (UE) and sends a superposed signal to this UE as a first relay node. We have assumed that there are N UEs in the network and the N-th UE, which is farthest from BS, has the poorest quality signal transmitted from the BS compared the other UEs. The N-th UE received a forwarded signal from N - 1 relaying nodes that are the UEs with better signal quality. At the i-th relaying node, it detects its own symbol by using successive interference cancellation (SIC) and will forward the superimposed signal to the next closest user, namely the (i + 1)-th UE, and include an excess power which will use for energy harvesting (EH) intention at the next UE. By these, the farthest UE in network can be significantly improved. In addition, closed-form expressions of outage probability for users over both the Rayleigh and Nakagami-m fading channels are also presented. Analysis and simulation results performed by Matlab software, which are presented accurately and clearly, show that the effectiveness of our proposed model and this model will be consistent with the multi-access wireless network in the future.Web of Science82art. no. 16

    Energy harvesting AF relaying in the presence of interference and Nakagami-m fading

    Get PDF
    Energy-harvesting relaying is a promising solution to the extra energy requirement at the relay. It can transfer energy from the source to the relay. This will encourage more idle nodes to be involved in relaying. In this paper, the outage probability and the throughput of an amplify-and-forward relaying system using energy harvesting are analyzed. Both time switching and power-splitting harvesting schemes are considered. The analysis takes into account both the Nakagami-mm fading caused by signal propagation and the interference caused by other transmitters. Numerical results show that time switching is more sensitive to system parameters than power splitting. Also, the system performance is more sensitive to the transmission rate requirement, the signal-to-interference-plus-noise ratio in the first hop and the relaying method
    corecore