Inkyu Bang

Prof. Inkyu Bang

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 August 2017 in IEEE Communications Letters
Verified
Journal Article
Closed access
TKTaehoon Kim
Taehoon Kim
IBInkyu Bang
Inkyu Bang
DSDan Keun Sung
Dan Keun Sung
We propose an enhanced physical random access channel (PRACH) preamble detector, which efficiently identifies non-orthogonal preambles while suppressing the noise rise. The proposed PRACH preamble detector reconstructs preambles from the received signal and efficiently utilizes them to improve the detection performance. Through simulations, we verify that the proposed detector successfully detects the desired preambles while suppressing the undesired noise rise, and, thus, it can detect ten non-orthogonal preambles simultaneously with an extremely low mis-detection probability lower than $10^{-5}$ , while achieving a false alarm probability of approximately $10^{-3}$ .

26 March 2025 in IEEE Communications Letters
Verified
Journal Article
Closed access
CLChungnyeong Lee
Chungnyeong Lee
IBInkyu Bang
Inkyu Bang
TKTaehoon Kim
Taehoon Kim
HLHowon Lee
Howon Lee
Bang Chul JungBang Chul Jung
Bang Chul Jung
SCSeong Ho Chae
Seong Ho Chae
The high rotation speeds and mega-constellations of low earth orbit satellites (LEO SATs) cause the inter-satellite frequent handovers (HOs) problem which can lead to substantial performance degradation. This paper proposes a novel distributed multi-agent deep Q-network based SAT HO strategy for the LEO SAT networks to simultaneously minimize the number of HOs and maximize the throughputs and the visible times of UEs while satisfying the quality-of-service (QoS) constraints of all UEs. The proposed HO scheme allows UEs to independently and simultaneously perform the HO decision makings based on their own local information, which enables to immediately adapt to the dynamic changes of the LEO SAT network environments. The numerical results demonstrated that our proposed HO strategy achieves the lowest average HO rate and the highest achievable throughputs compared to other conventional HO strategies, while ensuring a higher QoS guarantee time ratio.

16 November 2016 in IEEE Communications Letters
Verified
Journal Article
Closed access
IBInkyu Bang
Inkyu Bang
SKSu Min Kim
Su Min Kim
DSDan Keun Sung
Dan Keun Sung
In this letter, we propose a user scheduling scheme, which enables non-scheduled users to generate artificial noise in order to enhance wireless security in a multiuser wiretap network, where there exist N users, a single desired receiver, and K eavesdroppers. Our proposed scheme can achieve the optimal multiuser diversity gain (i.e., log log N) by adopting appropriate threshold values for scheduling feedback, which is also able to significantly reduce signaling overhead. We mathematically prove the achievability based on the derivation of a secure user-scaling law. Simulation results demonstrate that the proposed scheme achieves a better average secrecy rate than the conventional scheme in a finite N case, even if both schemes obtain the same secure user-scaling law as N → ∞.

4 March 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
SCSeong Ho Chae
Seong Ho Chae
IBInkyu Bang
Inkyu Bang
HLHoojin Lee
Hoojin Lee
Quasi-orthogonal space time block codes with power scaling (QSTBC-PS) that linearly combines two Alamouti codes with unequal power scaling has been known to achieve full diversity in multi-input multi-output (MIMO) systems. In this correspondence, we evaluate the physical layer security performance of QSTBC-PS in MIMO wiretap channels under Rayleigh fading. We derive the tight closed-form approximate formula of secrecy outage probability for QSTBC-PS by using moment matching approximation technique and then derive its high signal-to-noise ratio (SNR) approximation and the probability of strictly positive secrecy capacity in explicit form. The numerical examples validate that our analytical results match well to the Monte-Carlo simulation results for general number of receive antennas in Bob and Eve.

15 February 2022 in IEEE Access
Verified
Journal Article
Open access
JLJin-Taek Lim
Jin-Taek Lim
TKTaehoon Kim
Taehoon Kim
IBInkyu Bang
Inkyu Bang
To provide reliable connectivity in recent and future wireless communication systems, it is necessary to deploy several relay nodes. Further, a full-duplex (FD) technique has been in the spotlight since it can significantly improve spectral efficiency, and thus recent studies in relaying networks have considered FD relays. In relaying networks, confidentiality between the source and destination nodes from the relay node should be carefully kept since the relay node cannot be fully trusted, so called untrusted relay node. To this end, in this paper, we consider physical-layer security taking into account an untrusted FD relay node. We investigate a secure relaying protocol against the untrusted relay node where the destination generates artificial noise to prevent the untrusted relay from decoding the source information. We derive the analytical expression of the lower bound of the ergodic secrecy rate ( $\bar {R}$ ). We find two main factors affecting the secrecy performance: residual self-interference (RSI) at the FD-available nodes (i.e., relay and destination), and outdated channel state information (CSI) at the destination. Thereafter, we evaluate their effects on $\bar {R}$ and suggest the algorithm to find the sub-optimal artificial noise power level at the destination for maximizing $\bar {R}$ . Through simulations, we have verified our mathematical derivation and shown that our secure relaying protocol can achieve near-optimal secrecy performance. Numerical results imply that the artificial noise power level should be carefully considered when the channel is severely outdated and RSI is irresistible.

8 September 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
IBInkyu Bang
Inkyu Bang
SKSu Min Kim
Su Min Kim
DSDan Keun Sung
Dan Keun Sung
Simultaneous wireless information and power transfer (SWIPT) is a promising technique to transmit information and harvest energy at the same time. In this paper, we investigate multiuser scheduling criteria in a multiuser SWIPT system taking into account co-channel interference in a multicell environment, where each transmitter operate independently. We propose an $\alpha $ -adaptive scheduling scheme, which is able to adjust a scheduling criterion between maximizing achievable rate and maximizing harvested energy of the scheduled device by adjusting $\alpha $ factor. Employing a power splitting receiver, we derive closed-form analytical results including cumulative distribution function (CDF) of the harvested energy, CDF of the achievable rate, average harvested energy, and average achievable rate. We also investigate the effect of adjustable $\alpha $ factor in the proposed scheduling scheme and multiuser diversity in terms of the CDF of the harvested energy, the CDF of the achievable rate, and rate-energy tradeoff, compared with two conventional scheduling schemes: random scheduling and max-SNR scheduling. Our analytical results provide insightful information for designing multiuser scheduling criteria considering co-channel interference in the SWIPT systems.