• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.260-279
• /
• 2015

In this paper, we investigate physical layer security for multiple decode-and-forward (DF) relaying underlay cognitive radio networks (CRNs) with fixed transmit power at the secondary network against passive eavesdropping attacks. We propose a simple relay selection scheme to improve wireless transmission security based on the instantaneous channel information of all legitimate users and the statistical information about the eavesdropper channels. The closed-form expressions of the probability of non-zero secrecy capacity and the secrecy outage probability (SOP) are derived over independent and non-identically distributed Rayleigh fading environments. Furthermore, we conduct the asymptotic analysis to evaluate the secrecy diversity order performance and prove that full diversity is achieved by using the proposed relay selection. Finally, numerical results are presented to verify the theoretical analysis and depict that primary interference constrain has a significant impact on the secure performance and a proper transmit power for the second transmitters is preferred to be energy-efficient and improve the secure performance.

• Journal of information and communication convergence engineering
• /
• 제9권5호
• /
• pp.515-522
• /
• 2011

In this paper, we investigate cooperative diversity in a spectrum sharing environment where secondary users utilize primary users' spectrum only if the interference power received at the primary users is maintained below a predetermined level. The outage probability of a selective decode-and-forward (DF) based cooperative diversity scheme in the secondary network is derived to analyze the effects of spectrum sharing on cooperative diversity. Our analytical and simulation results show that the outage probability is saturated at a certain level of transmit power of secondary users due to interference regulation, and, hence, cooperative diversity gains are lost. Through asymptotic analysis, we also identify the critical value of transmit SNR beyond which the outage probability is saturated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1111-1130
• /
• 2016

Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3431-3445
• /
• 2017

Due to the advantages of low transmit power consumption, high spectral efficiency and extended system coverage, Device-to-Device (D2D) communication has drawn explosive attention in wireless communication field. Considering that intra-cell interference caused between cellular signals and D2D signals, in this paper, a network coding-based D2D relay cooperative transmission algorithm is proposed. Under D2D single-hop relay transmission mode, cellular interfering signals can be regarded as useful signals to code with D2D signals at D2D relay node. Using cellular interfering signals and network coded signals, D2D receiver restores the D2D signals to achieve the effect of interference suppression. Theoretical analysis shows that, compared with Amplify-and-forward (AF) mode and Decode-and-forward (DF) mode, the proposed algorithm can dramatically increase the link achievable rate. Furthermore, simulation experiment verifies that by employing the proposed algorithm, the interference signals in D2D communication can be eliminated effectively, and meanwhile the symbol error rate (SER) performance can be improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1594-1617
• /
• 2018

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

• 한국인터넷방송통신학회논문지
• /
• 제10권6호
• /
• pp.99-105
• /
• 2010

통신 시스템의 성능을 유도하기위하여 가장 많이 가정하는 잡음의 모델은 부가성 백색 잡음이다. 그러나 실제 통신 시스템을 사용하는 환경에서는 임펄시브 잡음이 더욱 현실적인 모델이기 때문에 최근에는 임펄시브 잡음 하에서의 통신 시스템의 성능을 분석하는 연구가 증가하고 있다. 따라서 본 논문에서는 최근에 집중적인 연구 주제가 되고 있는 협동다이버시티 시스템을 대상으로 하여 임펄시브 잡음하에서 시스템의 성능을 유도하였다. 특히 릴레이 방식으로 복조후 전송방식과 증폭후 전송방식을 사용하였을 때의 성능을 해석적으로 유도하고 비교하였다. 연구결과 레일레이 페이딩을 받는 무선 채널에서, 임펄시브 잡음의 평균 임펄스의 수가 감소할수록 잡음의 임펄시브 성분이 증가하고, 그 결과 신호 대 잡음비(SNR)가 큰 영역에서 시스템의 성능은 열화되었다. 그리고 동일한 조건에서 복조후 전송 릴레이를 채택한 협동 다이버시티 시스템이 증폭후 전송방식을 채택하였을 때보다 우수한 성능을 나타내었다.

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.547-554
• /
• 2010

UWB(Ultra-Wideband)는 낮은 전력으로 초고속 통신을 실현하는 근거리 무선 통신 기술로써 주파수 부족 현상을 넘어서서 신규 기술을 도입할 수 있는 획기적인 기술 방식이다. 본 논문에서는 UWB 전송방식 중 하나인 MB-OFDM(Multi-Band Orthogonal Frequency Division Multiplexing) 시스템을 기반으로 열악한 채널 환경을 극복할 수 있도록, 시공간 블록 부호(STBC, Space Time Block Code)와 순환 지연 다이버시티(CDD, Cyclic Delay Diversity)기법이 결합된 STCDD 협력 전송 기법 및 적응적 DF 중계 기술을 제안한다. 제안된 STCDD 협력 전송 기법은 기존의 STBC를 사용하는 수신기에서도 구조 변경 없이 바로 적용 가능하며 기존의 STBC 협력 전송 기법에 비해 향상된 성능을 보인다. 또한, 다중 홉 환경에서 순환 중복 검사를 통해 중계 채널의 상태를 파악하고, 중계 채널의 상태에 따라 적응적으로 DF 중계 기술을 선택함으로써 시스템의 성능을 향상시킬 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5943-5962
• /
• 2017

A resource allocation algorithm based on simultaneous wireless information and power transfer (SWIPT) to maximize the system throughput is proposed in orthogonal frequency division multiplexing (OFDM) relay networks. The algorithm formulates the problem under the peak power constraints of the source and each subcarrier (SC), and the energy causality constraint of the relay. With the given SC allocation of the source, we give and prove the optimal propositions of the formulated problem. Then, the formulated problem could be decomposed into two separate throughput maximization sub-problems by setting the total power to transfer energy. Finally, several SC allocation schemes are proposed, which are energy priority scheme, information priority scheme, balanced allocation scheme and exhaustive scheme. The simulation results reveal that the energy priority scheme can significantly reduce computational complexity and achieve approximate performance with the exhaustive scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2416-2432
• /
• 2017

In this paper, we investigate the security performance for cooperative networks over Nakagami-m fading channels. Based on whether the channel state information (CSI) of wiretap link is available or not, optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes are considered. Also, multiple relays combining (MRC) scheme is considered for comparison purpose. The exact and asymptotic closed-form expressions for secrecy outage probability (SOP) are derived and simulations are presented to validate the accuracy of our proposed analytical results. The numerical results illustrate that the ORS is the best scheme and SRS scheme is better than MRC scheme in some special scenarios such as when the destination is far away from the relays. Furthermore, through asymptotic analysis, we obtain the closed-form expressions for the secrecy diversity order and secrecy array gain for the three different selection schemes. The secrecy diversity order is closely related to the number of relays and fading parameter between relay and destination.