• Journal of electromagnetic engineering and science
• /
• v.13 no.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.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• 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
• /
• v.40 no.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
• /
• v.43 no.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)
• /
• v.8 no.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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.445-450
• /
• 2020

Cooperative networks provides the benefits of performance improvements and capacity increment when the source node transmits signal to the destination node using several relay nodes. In this paper, we consider the cooperative network where the transmission scheme between the source node and relay node use conventional binary signaling, whereas the transmission scheme between thee relay node and destination node adopt the differential space time coding signaling. We analyze the performance of the system depending on the modulation scheme, i.e., coherent and differential modulation, at the source-relay links. The performance depending on the relay location is also compared by considering modulation scheme and the number of relay node.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.51-53
• /
• 2015

In this paper, we propose a new relay selection technique which utilizes interference cancellation with decoding information at multiple relays for buffer-aided successive relaying systems. The transmitting relay is selected if its own transmission to the destination is successful and the number of relays which can successfully decode the data from the source is the maximum at the same time. Simulation results show that the proposed relay selection technique significantly outperforms the conventional relay selection scheme in terms of outage probability.

• Journal of Communications and Networks
• /
• v.10 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.651-659
• /
• 2014

In this paper, we consider a two way relay network for ship-to-ship communications in a fleet, where two communicating ships exchange the information with the help of a multi-antenna relay ship. For the network, we propose a rate-aware three-phase analog network coding to improve the reliability of the information exchange with asymmetric rates. The proposed scheme allows low-complex implementation of the relay without channel estimation by generating an improved analog network coded signal with the orthogonally received signals from two ships by using only the received signal power at each antenna. In addition, the proposed scheme reduces outages in the data exchange at asymmetric rates by adopting a rate-aware relay power allocation, which is confirmed by evaluating the outage performance via simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.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.