• Journal of electromagnetic engineering and science
• /
• 제13권3호
• /
• pp.173-177
• /
• 2013

This paper presents a new method for analyzing the maximum efficiency of a wireless power transfer (WPT) system with multiple n resonators. The method is based on ABCD matrices and allows transformation of the WPT system with multiple n resonators into a single two-port network system. The general maximum efficiency equation of a WPT system with multiple n resonators is derived using the ABCD matrix. Use of this equation allows placement of the relay resonators for maximum efficiency even though they are asymmetrical. The general maximum efficiency equation and the method of the optimum placement are verified by a full wave simulation. The results show that the method is useful for the analysis of a WPT system with relay resonators.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.147-148
• /
• 2007

BICC protocol is a relay protocol adaptable to ATM and IP based core networks compared to ISUP protocol to TDM networks. Using BICC protocol, multi-rate bearer traffic such as voice and video can flow in the relay core networks. BICC protocol is standardized as WCDMA circuit switching networks in 3GPP Release 4. Thus KTF is now operating core networks using BICC protocol. In this paper, we describe the background and characteristics of BICC protocol. We also provide the status of KTF WCDMA core networks using BICC. To show the efficiency of BICC protocol an analytical simulation is given in which the results can be expected by intuitive observation.

• ETRI Journal
• /
• 제40권6호
• /
• pp.714-725
• /
• 2018

Destination-assisted jamming (DAJ) is usually used to protect confidential information against untrusted relays and eavesdroppers in wireless networks. In this paper, a DAJ-based untrusted relay network with multiple antennas installed is presented. To increase the secrecy, a joint optimization of beamforming and power allocation at the source and destination is studied. A matched-filter precoder is introduced to maximize the cooperative jamming signal by directing cooperative jamming signals toward untrusted relays. Then, based on generalized singular-value decomposition (GSVD), a novel transmitted precoder for confidential signals is devised to align the signal into the subspace corresponding to the confidential transmission channel. To decouple the precoder design and optimal power allocation, an iterative algorithm is proposed to jointly optimize the above parameters. Numerical results validate the effectiveness of the proposed scheme. Compared with other schemes, the proposed scheme shows significant improvement in terms of security performance.

• ETRI Journal
• /
• 제43권4호
• /
• pp.758-768
• /
• 2021

In this work, the secrecy of a typical wireless cooperative dual-hop non-orthogonal multiple access (NOMA)-enabled decode-and-forward (DF) relay network is investigated with the impact of collaborative and non-collaborative eavesdropping. The system model consists of a source that broadcasts the multiplexed signal to two NOMA users via a DF relay, and information security against the eavesdropper nodes is provided by a helpful jammer. The performance metric is secrecy rate and ergodic secrecy capacity is approximated analytically. In addition, a differential evolution algorithm-based power allocation scheme is proposed to find the optimal power allocation factors for relay, jammer, and NOMA users by employing different jamming schemes. Furthermore, the secrecy rate analysis is validated at the NOMA users by adopting different jamming schemes such as without jamming (WJ) or conventional relaying, jamming (J), and with control jamming (CJ). Simulation results demonstrate the superiority of CJ over the J and WJ schemes. Finally, the proposed power allocation outperforms the fixed power allocation under all conditions considered in this work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• 한국전자통신학회논문지
• /
• 제15권3호
• /
• pp.445-450
• /
• 2020

협력 네트워크는 전송기에서 송신기로 신호를 전송할 때 여러 개의 중계기를 통해 신호를 전송함으로써 통신성능을 향상시키고 전송용량을 증가시키는 장점을 제공한다. 본 논문에서는 송신기와 중계기 사이에서는 일반적인 이진변조방식을 이용하여 신호를 전송하고 중계기와 수신기 사이에서는 차등 공간 시간 코드 방식을 적용한 신호전송 시스템을 고려한다. 먼저 송신기와 중계기 사이에서 동기방식과 차등변조 방식을 적용했을 때의 성능을 분석한다. 변조방식 및 중계기의 개수를 고려한 다양한 중계기 위치에서의 성능 또한 비교한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 춘계학술대회
• /
• pp.51-53
• /
• 2015

본 논문에서는 버퍼가 장착된 복수 개의 중계기가 존재하는 연쇄적 데이터 중계 시스템에서 다수의 중계기에서 복호에 성공한 데이터를 활용하여 간섭을 원천적으로 제거할 수 있는 특징을 이용하는 새로운 중계기 선택 기법을 제안한다. 제안된 중계기 선택 기법에서는 수신단으로 데이터를 전송할 중계기는 데이터가 수신단에 잘 도착할 수 있고, 나머지 중계기들 중 송신단 신호를 성공적으로 복호할 수 있는 중계기의 수를 최대화하도록 선택된다. 컴퓨터 시뮬레이션을 통하여 제안된 중계기 선택 방식이 기존 중계기 선택 기법에 비하여 훨씬 더 좋은 성능을 보이는 것을 확인한다.

• Journal of Communications and Networks
• /
• 제10권2호
• /
• pp.186-193
• /
• 2008

A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

• 한국통신학회논문지
• /
• 제39C권8호
• /
• pp.651-659
• /
• 2014

본 논문은 선단 내 해상 통신에서 두 통신 선박이 다중 안테나 릴레이 선박의 도움으로 데이터를 교환하는 양방향 릴레이 네트워크를 고려한다. 상기 네트워크에서 두 통신 선박의 정보 전송률이 다를 때 정보 전송 신뢰도를 높이는 전송률 인지 세 단계 아날로그 네트워크 부호화 기법을 제안한다. 제안 기법은 릴레이에서 직교하게 수신된 각 통신 선박의 신호로부터 향상된 품질의 아날로그 네트워크 부호화 신호를 안테나 수신 전력만을 이용하여 생성함으로써 릴레이를 채널 추정 기능 없이 낮은 복잡도로 구현할 수 있도록 한다. 또한, 제안 기법은 두 통신 선박의 서로 다른 전송률을 고려한 전송률-인지 릴레이 전력 할당 방법을 적용하여 비대칭 전송률을 갖는 데이터 교환의 아웃티지 확률을 크게 줄일 수 있음을 모의실험으로 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3120-3137
• /
• 2021

Small-sized IoT wireless sensing devices can be deployed with small aircraft such as drones, and the deployment of mobile IoT devices can be relocated to suit data collection with efficient relocation algorithms. However, the terrain may not be able to predict its shape. Mobile IoT devices suitable for these terrains are hopping devices that can move with jumps. So far, most hopping sensor relocation studies have made the unrealistic assumption that all hopping devices know the overall state of the entire network and each device's current state. Recent work has proposed the most realistic distributed network environment-based relocation algorithms that do not require sharing all information simultaneously. However, since the shortest path-based algorithm performs communication and movement requests with terminals, it is not suitable for an area where the distribution of obstacles is uneven. The proposed scheme applies a simple Monte Carlo method based on relay nodes selection random variables that reflect the obstacle distribution's characteristics to choose the best relay node as reinforcement learning, not specific relay nodes. Using the relay node selection random variable could significantly reduce the generation of additional messages that occur to select the shortest path. This paper's additional contribution is that the world's first distributed environment-based relocation protocol is proposed reflecting real-world physical devices' characteristics through the OMNeT++ simulator. We also reconstruct the three days-long disaster environment, and performance evaluation has been performed by applying the proposed protocol to the simulated real-world environment.