Hyuck Moo Kwon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hyuck Moo Kwon has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Amitav Mukherjee
6 shared publications- Amitav Mukherjee
Wichita State University, Wichita, KS 67260
4 shared publications - Vidhi Rana
Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA
3 shared publications - Amitav Mukherjee
Dept. of Electrical Engineering & Computer Science School of Engineering Henry Samueli University of California Irvine Irvine 92697 CA
2 shared publications Don Torrieri
US Army Research Laboratory, Adelphi, MD USA
2 shared publications- Don Torrieri
U.S. Army Research Laboratory
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 11324-11340
Quantum-Inspired Raute Optimizer for Terrain-Aware NextG Network Coverage
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 11324-11340
Quantum-Inspired Raute Optimizer for Terrain-Aware NextG Network Coverage
- Open Access
Secret Sharing from Correlated Gaussian Random Variables and Public Communication
In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints: (i) authorized sets of users can recover the secret by pooling their shares, and (ii) non-authorized sets of colluding users cannot learn any information about the secret. We assume that the dealer and participants observe the realizations of correlated Gaussian random variables and that the dealer can communicate with participants through a one-way, authenticated, rate-limited, and public channel. Unlike traditional secret sharing protocols, in our setting, no perfectly secure channel is needed between the dealer and the participants. Our main result is a closed-form characterization of the fundamental trade-off between secret rate and public communication rate.
Open AccessSecret Sharing from Correlated Gaussian Random Variables and Public Communication
In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints: (i) authorized sets of users can recover the secret by pooling their shares, and (ii) non-authorized sets of colluding users cannot learn any information about the secret. We assume that the dealer and participants observe the realizations of correlated Gaussian random variables and that the dealer can communicate with participants through a one-way, authenticated, rate-limited, and public channel. Unlike traditional secret sharing protocols, in our setting, no perfectly secure channel is needed between the dealer and the participants. Our main result is a closed-form characterization of the fundamental trade-off between secret rate and public communication rate.
- 27 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (1) , 549-559
Information-Theoretic Secret Sharing From Correlated Gaussian Random Variables and Public Communication
In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints: (i) authorized sets of users can recover the secret by pooling their shares, and (ii) non-authorized sets of colluding users cannot learn any information about the secret. We assume that the dealer and participants observe the realizations of correlated Gaussian random variables and that the dealer can communicate with participants through a one-way, authenticated, rate-limited, and public channel. Unlike traditional secret sharing protocols, in our setting, no perfectly secure channel is needed between the dealer and the participants. Our main result is a closed-form characterization of the fundamental trade-off between secret rate and public communication rate.
- 27 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (1) , 549-559
Information-Theoretic Secret Sharing From Correlated Gaussian Random Variables and Public Communication
In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints: (i) authorized sets of users can recover the secret by pooling their shares, and (ii) non-authorized sets of colluding users cannot learn any information about the secret. We assume that the dealer and participants observe the realizations of correlated Gaussian random variables and that the dealer can communicate with participants through a one-way, authenticated, rate-limited, and public channel. Unlike traditional secret sharing protocols, in our setting, no perfectly secure channel is needed between the dealer and the participants. Our main result is a closed-form characterization of the fundamental trade-off between secret rate and public communication rate.
- 15 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 7, 660-675
Distributed Network Time Synchronization: Social Learning Versus Consensus
The objective of this paper is to investigate a social learning-based distributed network time synchronization (SLDNTS) and compare it to a classic approach: consensus-based distributed network time synchronization (CDNTS). An observation random variable (ORV), which is a conditional likelihood (e.g., Gaussian) given a synchronized true time hypothesis, is used to generate clock times at each node and each iteration. A time offset and time quality of each node clock are represented, respectively, by a mean shift from the true time and variance of a Gaussian random variable (RV) to consider a practical environment. Then, this paper proposes a simple method to construct an observation matrix that satisfies both the identifiability condition (IC) and the prevailing observation signal existence condition (POSEC) required for the social learning (SL). Each node quantizes its ORV into a heads and tails Bernoulli RV with (1) and probability, respectively, where is a control parameter for the SLDNTS convergence speed. Using this proposed observation matrix, each node computes its intermediate belief on each possible time hypothesis, shares the information with its connected neighbor nodes, and updates its belief probabilities. Then, this paper verifies, through simulation, that the proposed SLDNTS shows superior performance compared to the classic CDNTS including average time synchronization (ATS) algorithm, maximum time synchronization (MTS) algorithm, and least square time synchronization (LSTS) algorithm under the same observation environment.
- 15 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 7, 660-675
Distributed Network Time Synchronization: Social Learning Versus Consensus
The objective of this paper is to investigate a social learning-based distributed network time synchronization (SLDNTS) and compare it to a classic approach: consensus-based distributed network time synchronization (CDNTS). An observation random variable (ORV), which is a conditional likelihood (e.g., Gaussian) given a synchronized true time hypothesis, is used to generate clock times at each node and each iteration. A time offset and time quality of each node clock are represented, respectively, by a mean shift from the true time and variance of a Gaussian random variable (RV) to consider a practical environment. Then, this paper proposes a simple method to construct an observation matrix that satisfies both the identifiability condition (IC) and the prevailing observation signal existence condition (POSEC) required for the social learning (SL). Each node quantizes its ORV into a heads and tails Bernoulli RV with (1) and probability, respectively, where is a control parameter for the SLDNTS convergence speed. Using this proposed observation matrix, each node computes its intermediate belief on each possible time hypothesis, shares the information with its connected neighbor nodes, and updates its belief probabilities. Then, this paper verifies, through simulation, that the proposed SLDNTS shows superior performance compared to the classic CDNTS including average time synchronization (ATS) algorithm, maximum time synchronization (MTS) algorithm, and least square time synchronization (LSTS) algorithm under the same observation environment.
- 1 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 282-286
Time-Varying Diffusion Social Learning
This paper studies a time-varying diffusion social learning algorithm, for an agent in a network trying to learn a true hypothesis (or state). We will show that agents in a weakly connected sub-network will be under the influence of agents in the strongly connected sub-network, which leads to a mind control scenario. We will derive analytical expressions of the limiting beliefs of the agents in the time-varying network. Moreover, we will extend the results of time-varying weakly connected networks to the case where agents assign decreasing weights to neighboring agents.
- 1 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 282-286
Time-Varying Diffusion Social Learning
This paper studies a time-varying diffusion social learning algorithm, for an agent in a network trying to learn a true hypothesis (or state). We will show that agents in a weakly connected sub-network will be under the influence of agents in the strongly connected sub-network, which leads to a mind control scenario. We will derive analytical expressions of the limiting beliefs of the agents in the time-varying network. Moreover, we will extend the results of time-varying weakly connected networks to the case where agents assign decreasing weights to neighboring agents.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 141-144
Satellite Digital Channelizer with Predistorted High-Power Amplifier
A geostationary earth orbit satellite requires high transmitting power (e.g., 20 dBW=100 watts) because the waveform traveling distance can be more than 36,000 km. Thus, it is necessary to operate close to the saturation point in an analog high-power amplifier (HPA), thereby causing undesirable intermodulation and nonlinear impairments when multiple-accesses subband signals of different subcarriers are simultaneously transmitted. This paper considers a future digital HPA instead of an analog HPA. This is because today a digital channelizer can convert the sample stream of multiple-access subband user signals into a single sample stream before an HPA with no overlapping in samples, thereby reducing the intermodulation products significantly. In this paper, we study for the first time a digital channelizer for multiple-access user subband signals combined with a nonlinear HPA and a simple predistorter (PD). Both phase and amplitude predistortion can compensate almost perfectly for the distortion due to the HPA's nonlinear characteristics. Simulation results verify an almost negligible bit error rate (BER) degradation. Therefore, a future satellite communication system using the proposed digital channelizer, PD, and digital HPA can have high-frequency utilization efficiency, multicast, and broadcast capabilities, and gain control for each subchannel.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 141-144
Satellite Digital Channelizer with Predistorted High-Power Amplifier
A geostationary earth orbit satellite requires high transmitting power (e.g., 20 dBW=100 watts) because the waveform traveling distance can be more than 36,000 km. Thus, it is necessary to operate close to the saturation point in an analog high-power amplifier (HPA), thereby causing undesirable intermodulation and nonlinear impairments when multiple-accesses subband signals of different subcarriers are simultaneously transmitted. This paper considers a future digital HPA instead of an analog HPA. This is because today a digital channelizer can convert the sample stream of multiple-access subband user signals into a single sample stream before an HPA with no overlapping in samples, thereby reducing the intermodulation products significantly. In this paper, we study for the first time a digital channelizer for multiple-access user subband signals combined with a nonlinear HPA and a simple predistorter (PD). Both phase and amplitude predistortion can compensate almost perfectly for the distortion due to the HPA's nonlinear characteristics. Simulation results verify an almost negligible bit error rate (BER) degradation. Therefore, a future satellite communication system using the proposed digital channelizer, PD, and digital HPA can have high-frequency utilization efficiency, multicast, and broadcast capabilities, and gain control for each subchannel.
- 2 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (1) , 780-796
Utility-Optimal Wireless Routing in the Presence of Heavy Tails
Due to emerging mobile applications and an Internet of things, data traffic carried by wireless networks has increased dramatically. As a result, maximizing the utilization of the limited network resource is a top priority. To date, there exists a large body of work on the stochastic network utility maximization (NUM) problem. On the one hand, the stochastic NUM problem and its associated solutions have been mainly investigated under the light-tailed (LT) data condition. On the other hand, empirical results show that data delivered by wireless networks is not only large in volume but also highly variable, which can be characterized by heavy-tailed (HT) distributions. Such HT traffic exhibits high burstiness and strong temporal correlations, which are fundamentally different from the behavior of LT traffic. In this paper, first it is shown that the classic stochastic gradient algorithms (SGAs), as effective solutions for stochastic NUM problems, fail to prevent HT traffic flows from aggressively competing with LT flows for limited resources. This leads to unbounded queueing delay for LT flows, which results in network instability. To counter such a challenge, the time-average stochastic gradient routing algorithm (TA-SGRA) is proposed, which prevents competition among HT and LT traffic flows so that utility optimality and network stability can be achieved simultaneously. Moreover, because HT data has unbounded moments, such as mean and variance, it is not feasible to apply the conventional convergence analysis, which assumes the moment boundedness of traffic arrivals. To address this problem, the ordinary differential equation (ODE) method is adopted to prove that the proposed algorithm still converges even with highly variable HT traffic. Comprehensive simulation results are shown to verify the derived theoretical results.
- 2 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (1) , 780-796
Utility-Optimal Wireless Routing in the Presence of Heavy Tails
Due to emerging mobile applications and an Internet of things, data traffic carried by wireless networks has increased dramatically. As a result, maximizing the utilization of the limited network resource is a top priority. To date, there exists a large body of work on the stochastic network utility maximization (NUM) problem. On the one hand, the stochastic NUM problem and its associated solutions have been mainly investigated under the light-tailed (LT) data condition. On the other hand, empirical results show that data delivered by wireless networks is not only large in volume but also highly variable, which can be characterized by heavy-tailed (HT) distributions. Such HT traffic exhibits high burstiness and strong temporal correlations, which are fundamentally different from the behavior of LT traffic. In this paper, first it is shown that the classic stochastic gradient algorithms (SGAs), as effective solutions for stochastic NUM problems, fail to prevent HT traffic flows from aggressively competing with LT flows for limited resources. This leads to unbounded queueing delay for LT flows, which results in network instability. To counter such a challenge, the time-average stochastic gradient routing algorithm (TA-SGRA) is proposed, which prevents competition among HT and LT traffic flows so that utility optimality and network stability can be achieved simultaneously. Moreover, because HT data has unbounded moments, such as mean and variance, it is not feasible to apply the conventional convergence analysis, which assumes the moment boundedness of traffic arrivals. To address this problem, the ordinary differential equation (ODE) method is adopted to prove that the proposed algorithm still converges even with highly variable HT traffic. Comprehensive simulation results are shown to verify the derived theoretical results.
- 3 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 13 (10) , 2369-2381
PHY-Supported Frame Aggregation for Wireless Local Area Networks
An aggregate medium access control (MAC) service data unit (A-MSDU) contains multiple subframes with a single sequence number. Hence, it has a major drawback in environments with high error rates because if any subframes are corrupted, then the entire A-MSDU will be lost. In addition, performance of the A-MSDU depends strongly on the choice of parameters, such as frame size, modulation level, coding rate, and spatial mode. In this paper, a novel link-adaptation mechanism, dubbed physical (PHY)supported frame aggregation (PSFA), is proposed over IEEE 802.11 networks, and its performance is analyzed. The proposed PSFA technique is based on a cross-layer interaction that enables joint optimization of various parameters between the PHY and MAC layers. This paper derives a new packet error rate (PER) expression for convolutionally coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems as an example. Then, this PER expression is used to efficiently estimate the link quality, given the channel conditions and system parameters, and most importantly, it is able to facilitate a parametric study of the cross-layer interaction. In the proposed PSFA algorithm, we present a rule for selecting the parameters so that MAC throughput is maximized. It is shown analytically and verified using Monte Carlo simulations that this choice of parameters can improve throughput performance significantly and also ensure quality of service (QoS) requirements compared to existing conventional algorithms.
- 3 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 13 (10) , 2369-2381
PHY-Supported Frame Aggregation for Wireless Local Area Networks
An aggregate medium access control (MAC) service data unit (A-MSDU) contains multiple subframes with a single sequence number. Hence, it has a major drawback in environments with high error rates because if any subframes are corrupted, then the entire A-MSDU will be lost. In addition, performance of the A-MSDU depends strongly on the choice of parameters, such as frame size, modulation level, coding rate, and spatial mode. In this paper, a novel link-adaptation mechanism, dubbed physical (PHY)supported frame aggregation (PSFA), is proposed over IEEE 802.11 networks, and its performance is analyzed. The proposed PSFA technique is based on a cross-layer interaction that enables joint optimization of various parameters between the PHY and MAC layers. This paper derives a new packet error rate (PER) expression for convolutionally coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems as an example. Then, this PER expression is used to efficiently estimate the link quality, given the channel conditions and system parameters, and most importantly, it is able to facilitate a parametric study of the cross-layer interaction. In the proposed PSFA algorithm, we present a rule for selecting the parameters so that MAC throughput is maximized. It is shown analytically and verified using Monte Carlo simulations that this choice of parameters can improve throughput performance significantly and also ensure quality of service (QoS) requirements compared to existing conventional algorithms.
- 1 January 2014
- Published by EJournal Publishing in Journal of Industrial and Intelligent Information
- Vol. 3 (2)
A Study on Situation Analysis for ASIL Determination
Journal of Industrial and Intelligent Information
- 1 January 2014
- Published by EJournal Publishing in Journal of Industrial and Intelligent Information
- Vol. 3 (2)
A Study on Situation Analysis for ASIL Determination
Journal of Industrial and Intelligent Information
- 1 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Hybrid Multi-Dimensional Modulation for Gaussian and Fading Channels
This paper proposes a novel multi-dimensional modulation (MDM) scheme that achieves better performance than conventional modulation without any diversity or coding gain. We exploit the additional degrees of freedom offered by higher dimensional Euclidean space to construct the proposed constellation design. Analytical results are obtained for the exact symbol and bit error performance of the MDM design over Gaussian and Rayleigh fading channels. Through simulation, we compare the error performance of the MDM scheme with conventional orthogonal modulation.
- 1 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Hybrid Multi-Dimensional Modulation for Gaussian and Fading Channels
This paper proposes a novel multi-dimensional modulation (MDM) scheme that achieves better performance than conventional modulation without any diversity or coding gain. We exploit the additional degrees of freedom offered by higher dimensional Euclidean space to construct the proposed constellation design. Analytical results are obtained for the exact symbol and bit error performance of the MDM design over Gaussian and Rayleigh fading channels. Through simulation, we compare the error performance of the MDM scheme with conventional orthogonal modulation.