Search

Your search keyword '"Kwon, Hyuck M."' showing total 177 results
Start Over Author "Kwon, Hyuck M." Publication Year Range Last 50 years Publisher ieee
177 results on '"Kwon, Hyuck M."'

10. Information-Theoretic Secret Sharing From Correlated Gaussian Random Variables and Public Communication.

Author

Rana, Vidhi, Chou, Remi A., and Kwon, Hyuck M.

Subjects
PUBLIC communication, INFORMATION-theoretic security, SHARING, RANDOM variables, GAUSSIAN channels
Abstract

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. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

15. Utility-Optimal Wireless Routing in the Presence of Heavy Tails.

Author

Xia, Shuang, Wang, Pu, and Kwon, Hyuck M.

Subjects
WIRELESS communications, STOCHASTIC processes, MOBILE apps, INTERNET of things, ROUTING (Computer network management), ALGORITHMS
Abstract

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 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 have 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 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. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

45. Spreading-Sequence Design for Partially Connected Multirelay Networks Under Multipath Fading.

Author

Yang, Jie, Kwon, Hyuck M., Mukherjee, Amitav, and Pham, Khanh D.

Subjects
*LONG-Term Evolution (Telecommunications), *MULTIPATH channels, *RADIO transmitter fading, *RADIO relay systems, *ORTHOGONAL frequency division multiplexing, *SIGNAL-to-noise ratio, *TELECOMMUNICATION channels
Abstract

Multipath fading can degrade the performance of a wireless communication system significantly when the data rate is as high as those systems beyond Long-Term Evolution Advanced (LTE-A). To combat the multipath-fading effects, orthogonal frequency-division multiplexing (OFDM) techniques have been extensively studied and used in existing systems. However, another effective method to combat multipath fading is a code-division multiple access (CDMA) scheme, which has not been extensively investigated for relay network communication systems. This paper considers uplink CDMA relay networks (consisting of multiple sources, multiple relays, and a single destination) and downlinks (consisting of a combined source, multiple relays, and multiple destinations) under multipath fading. The objective of this paper is to propose a unique, simple, and effective method of finding optimum nonbinary pseudo noise (PN) spreading and despreading sequences employing a maximum signal-to-interference-plus-noise ratio (SINR) criterion and channel state information (CSI). This paper also examines the sensitivity of the proposed schemes to 1-bit quantization, mistiming alignment, wideband jamming, and imperfect CSI. Simulation results verify that the proposed method shows much faster convergence in finding optimum PN sequences and better performance than existing schemes under the same environment. [ABSTRACT FROM AUTHOR]

Published
2016
Full Text
View/download PDF

46. MIMO Cognitive Radio User Selection With and Without Primary Channel State Information.

Author

Xiong, Wenhao, Mukherjee, Amitav, and Kwon, Hyuck M.

Subjects
COGNITIVE radio, MIMO systems, TRANSMITTERS (Communication), INTERFERENCE (Telecommunication), RECEIVING antennas
Abstract

In this paper, we study user selection (US) strategies for a multiple-input–multiple-output (MIMO) cognitive radio (CR) downlink network, where the r-antenna underlay CR secondary users (SUs) coexist with a primary user (PU), and all terminals are equipped with multiple antennas. Two main scenarios are considered: 1) The t-antenna cognitive base station (CBS) has perfect or partial channel state information at the transmitter (CSIT) from the CBS to the PU receiver (RX), and 2) the CBS has absolutely no PU CSIT. For these scenarios, we propose and evaluate multiple SU selection schemes that are applicable to both best-effort PU interference mitigation and hard interference temperature (IT) constraints. The computational complexity of the proposed schemes can be significantly smaller than that of an exhaustive search with negligible performance degradation. For the selection of C SUs out of K, whereas an exhaustive search is on the order of \mathcal{O}(\binom{K}{C}C^4r^3). When t$ and r$ are of the same order, the computational complexity of the proposed scheme can be \binom{K}{C}C^4/K times smaller. Mathematical complexity analysis and numerical simulations are provided to show the advantage of our schemes. [ABSTRACT FROM PUBLISHER]

Published
2016
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results