• Title/Summary/Keyword: relay cooperative

Search Result 306, Processing Time 0.024 seconds

Performance Analysis of 1-2-1 Cooperative Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 1-2-1 협력 프로토콜에 관한 연구)

  • Choi, Dae-Kyu;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.113-119
    • /
    • 2008
  • Conventional 1-1-1 cooperative protocol offers path-loss gain as advantage of multi-hop and spatial diversity which is equivalent to MIMO system. This protocol is enable to get higher reliability and reduction of power consumption than those of the single-hop or multi-hop. But the 1-1-1 cooperative protocol get only the diversity order 2 and limited path-loss reduction gain because this protocol has a single cooperative relay. We propose 1-2-1 cooperative protocol using two cooperative relays R1, R2. The 1-2-1 cooperative protocol can improve path-loss reduction and increase diversity order 3. Moreover, the cooperative relay R2 attains diversity order 2. The signaling method in transmission uses DF (Decode and Forward) or DR (Decode and Reencode) and 1-2-1 DF/DR cooperative protocol are applied to clustering based wireless sensor networks (WSNs). Simulations are performed to evaluate the performance of the protocols under Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

  • PDF

Distributed Alamouti Space Time Block Coding Based On Cooperative Relay System (협동 중계 시스템을 이용한 분산 Alamouti 시공간 블록 부호)

  • Song, Wei;Cho, Kye-Mun;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.9
    • /
    • pp.16-23
    • /
    • 2009
  • In this paper, we propose a new distributed Alamouti space-time block coding scheme using cooperative relay system composed of one source node, three relay nodes and one destination node. The source node is assumed to be equipped with two antennas which respectively use a 2-beam array to communicate with two nodes selected from the three relay nodes. During the first time slot, the two signals which respectively were transmitted by one antenna at the source, are selected by one relay node, added, amplified, and forwarded to the destination. During the second time slot, the other two relay nodes implement the conjugate and minusconjugate operations to the two received signals, respectively, each in turn is amplified and forwarded to the destination node. This transmission scheme represents a new distributed Alamouti space-time block code that can be constructed at the relay-destination channel. Through an equivalent matrix expression of symbols, we analyze the performance of this proposed space-time block code in terms of the chernoff upper bound pairwise error probability (PEP). In addition, we evaluate the effect of the coefficient $\alpha$ ($0{\leq}{\alpha}{\leq}1$) determined by power allocation between the two antennas at the source on the received signal performance. Through computer simulation, we show that the received signals at the three relays have same variance only when the value of $\alpha$ is equal to $\frac{2}{3}$, as a consequence, a better performance is obtained at the destination. These analysis results show that the proposed scheme outperforms conventional proposed schemes in terms of diversity gain, PEP and the complexity of relay nodes.

Maximizing Secrecy Rate and Performance Analysis of Relay Selection for Cooperative Diversity Networks in Presence of an Eavesdropper (도청자가 존재하는 무선 협력 네트워크의 전달 단말 선택을 통한 보안 전송률 최대 전송기술 및 성능분석)

  • Ju, MinChul;Kwon, Tai-Gil;Cho, Jin-Woong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.4
    • /
    • pp.533-540
    • /
    • 2015
  • We study relay selection in decode-and-forward (DF)-based relay networks consisting of a source, a destination, an eavesdropper, and multiple relays, where each terminal has a single antenna and operates in a half-duplex mode. In these networks, it is desirable to protect the confidential message from the source to the destination against the eavesdropper with the help of a single selected relay. Specifically, we begin by investigating DF-based networks for the scenario instantaneous signal-to-noise ratios (SNRs) related to the eavesdropper are available. For the scenario, we propose relay selection to maximize the secrecy rate of DF-based networks with and without direct-paths, and we derive the exact secrecy outage probabilities in closed-form.

Joint Precoding Technique for Interference Cancellation in Multiuser MIMO Relay Networks for LTE-Advanced System (LTE-Advanced 시스템의 다중 사용자 MIMO Relay 네트워크에서 간섭 제거를 위한 Joint Precoding 기술)

  • Malik, Saransh;Moon, Sang-Mi;Kim, Bo-Ra;Kim, Cheol-Sung;Hwang, In-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.15-26
    • /
    • 2012
  • In this paper, we perform interference cancellation in multiuser MIMO (Multiple Input Multiple Output) relay network with improved Amplify-and-Forward (AF) and Decode-and-Forward (DF) relay protocols. The work of interference cancellation is followed by evolved NodeB (eNB), Relay Node (RN) and User Equipment (UE) to improve the error performance of whole transmission system with the explicit use of relay node. In order to perform interference cancellation, we use Dirty Paper Coding (DPC) and Thomilson Harashima Precoding (THP) allied with detection techniques Zero Forcing (ZF), Minimum Mean Square Error (MMSE), Successive Interference Cancellation (SIC) and Ordered Successive Interference Cancellation (OSIC). These basic techniques are studied and improved in the proposal by using the functions of relay node. The performance is improved by Decode-and-Forward which enhance the cancellation of interference in two layers at the cooperative relay node. The interference cancellation using weighted vectors is performed between eNB and RN. In the final results of the research, we conclude that in contrast with the conventional algorithms, the proposed algorithm shows better performance in lower SNR regime. The simulation results show the considerable improvement in the bit error performance by the proposed scheme in the LTE-Advanced system.

Optimal Relay Selection and Power Allocation in an Improved Low-Order-Bit Quantize-and-Forward Scheme

  • Bao, Jianrong;He, Dan;Xu, Xiaorong;Jiang, Bin;Sun, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5381-5399
    • /
    • 2016
  • Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

Relay Selection Schemes Using STBC Technique in OFDM-Based Cooperative Wireless Communications (OFDM 기반의 무선 협력 통신에서 STBC 기술을 적용한 선택적 릴레이 통신 기법)

  • Lee, Je-Yeon;Yang, Mo-Chan;Yoo, Sung-Cheol;Shin, Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7A
    • /
    • pp.640-648
    • /
    • 2011
  • We propose relay selection schemes using STBC (Space Time Block Coding) technique in OFDM (Orthogonal Frequency Division Multiplexing)-based wireless systems. The proposed schemes select the optimum relay having the maximum instantaneous equivalent channel gain among multiple candidate relays. Also, in order to reduce the system overhead, a symbol grouping method which groups some amount of symbols before selecting the optimum relay is proposed. The simulation results show that the proposed relay selection schemes can obtain more selection diversity gain as the number of selectable relay candidates increases. Furthermore, the proposed scheme with the symbol grouping can reduce system overhead without any degradation of the performance in fading channels with low frequency selectivity.

Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

  • Zhan, Jun;Tang, Xiaohu;Chen, Qingchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3542-3566
    • /
    • 2018
  • In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

Network-Coding Based Two-way Relay Communication Using Adaptive Modulation Sheme (적응형 변조 기법을 이용한 네트워크 부호화 기반 양방향 중계 통신)

  • Lee, Jin-Hee;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.147-151
    • /
    • 2010
  • In this paper, we propose network-coding based two-way relay communication using adaptive modulation scheme for satisfying relay QoS(Quality of Service) according to channel environment between user and relay. Two-way relay communication is bidirectional cooperative communication that users exchange own signal with help of relay. Network-coding based two-way relay communication can achieve high throughput compared to conventional scheme through reducing time slots. we propose adaptive M-QAM modulation scheme in network-coding based two-way relay communication for satisfying QoS of relay. Simulation result shows that the proposed scheme satisfies goal QoS of system.

Dual-Hop Amplify-and-Forward Multi-Relay Maximum Ratio Transmission

  • Erdogan, Eylem;Gucluoglu, Tansal
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.19-26
    • /
    • 2016
  • In this paper, the performance of dual-hop multi-relay maximum ratio transmission (MRT) over Rayleigh flat fading channels is studied with both conventional (all relays participate the transmission) and opportunistic (best relay is selected to maximize the received signal-to-noise ratio (SNR)) relaying. Performance analysis starts with the derivation of the probability density function, cumulative distribution function and moment generating function of the SNR. Then, both approximate and asymptotic expressions of symbol error rate (SER) and outage probability are derived for arbitrary numbers of antennas and relays. With the help of asymptotic SER and outage probability, diversity and array gains are obtained. In addition, impact of imperfect channel estimations is investigated and optimum power allocation factors for source and relay are calculated. Our analytical findings are validated by numerical examples which indicate that multi-relay MRT can be a low complexity and reliable option in cooperative networks.

Cooperation Models and Cooperative Routing for Exploiting Hop-by-Hop Cooperative Diver sity in Ad Hoc Networks

  • Shin, Hee-Wook;Moh, Sang-Man;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.12
    • /
    • pp.1559-1571
    • /
    • 2011
  • In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.