Jaekyun Moon

Jaekyun Moon

Auto-generated profile, based on publicly available information

Jaekyun Moon

Korea Advanced Institute of Science and Technology (KAIST)

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
7 June 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Minseok ChoiMinseok Choi
Minseok Choi
Joongheon KimJoongheon Kim
Joongheon Kim
JMJaekyun Moon
Jaekyun Moon
This paper considers one-hop device-to-device (D2D)-assisted wireless caching networks that cache video files of varying quality levels, with the assumption that the base station can control the video quality but cache-enabled devices cannot. Two problems arise in such a caching network: file placement problem and node association problem. This paper suggests a method to cache videos of different qualities, and thus of varying file sizes, by maximizing the sum of video quality measures that users can enjoy. There exists an interesting trade-off between video quality and video diversity, i.e., the ability to provision diverse video files. By caching high-quality files, the cache-enabled devices can provide high-quality video, but cannot cache a variety of files. Conversely, when the device caches various files, it cannot provide a good quality for file-requesting users. In addition, when multiple devices cache the same file but their qualities are different, advanced node association is required for file delivery. This paper proposes a node association algorithm that maximizes time-averaged video quality for multiple users under a playback delay constraint. In this algorithm, we also consider request collision, the situation where several users request files from the same device at the same time, and we propose two ways to cope with the collision: scheduling of one user and non-orthogonal multiple access. Simulation results verify that the proposed caching method and the node association algorithm work reliably.

6 October 2021 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
DHDong-Jun Han
Dong-Jun Han
Minseok ChoiMinseok Choi
Minseok Choi
JPJungwuk Park
Jungwuk Park
JMJaekyun Moon
Jaekyun Moon
We consider federated learning (FL) with multiple wireless edge servers having their own local coverage. We focus on speeding up training in this increasingly practical setup. Our key idea is to utilize the clients located in the overlapping coverage areas among adjacent edge servers (ESs); in the model-downloading stage, the clients in the overlapping areas receive multiple models from different ESs, take the average of the received models, and then update the averaged model with their local data. These clients send their updated model to multiple ESs by broadcasting, which acts as bridges for sharing the trained models between servers. Even when some ESs are given biased datasets within their coverage regions, their training processes can be assisted by adjacent servers through the clients in their overlapping regions. As a result, the proposed scheme does not require costly communications with the central cloud server (located at the higher tier of edge servers) for model synchronization, significantly reducing the overall training time compared to the conventional cloud-based FL systems. Extensive experimental results show remarkable performance gains of our scheme compared to existing methods. Our design targets latency-sensitive applications where edge-based FL is essential, e.g., when a number of connected cars/drones must cooperate (via FL) to quickly adapt to dynamically changing environments.

10 November 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
DHDong-Jun Han
Dong-Jun Han
DKDo-Yeon Kim
Do-Yeon Kim
Minseok ChoiMinseok Choi
Minseok Choi
DNDavid Nickel
David Nickel
JMJaekyun Moon
Jaekyun Moon
CBChristopher G. Brinton
Christopher G. Brinton
The demand for intelligent services at the network edge has introduced several research challenges. One is the need for a machine learning architecture that achieves personalization (to individual clients) and generalization (to unseen data) properties concurrently across different applications. Another is the need for an inference strategy that can satisfy network resource and latency constraints during testing-time. Existing techniques in federated learning have encountered a steep trade-off between personalization and generalization, and have not explicitly considered the resource requirements during the inference-stage. In this paper, we propose SplitGP, a joint edge-AI training and inference strategy that simultaneously captures generalization/personalization for efficient inference across resource-constrained clients. The training process of SplitGP is based on federated split learning, with the key idea of optimizing the client-side model to have personalization capability tailored to its main task, while training the server-side model to have generalization capability for handling out-of-distribution tasks. During testing-time, each client selectively offloads inference tasks to the server based on the uncertainty threshold tunable based on network resource availability. Through formal convergence analysis and inference time analysis, we provide guidelines on the selection of key meta-parameters in SplitGP. Experimental results confirm the advantage of SplitGP over existing baselines.

17 May 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JSJy-Yong Sohn
Jy-Yong Sohn
BCBeongjun Choi
Beongjun Choi
SYSung Whan Yoon
Sung Whan Yoon
JMJaekyun Moon
Jaekyun Moon
A new system model reflecting the clustered structure of distributed storage is suggested to investigate interplay between storage overhead and repair bandwidth as storage node failures occur. Large data centers with multiple racks/disks or local networks of storage devices (e.g. sensor network) are good applications of the suggested clustered model. In realistic scenarios involving clustered storage structures, repairing storage nodes using intact nodes residing in other clusters is more bandwidth-consuming than restoring nodes based on information from intra-cluster nodes. Therefore, it is important to differentiate between intra-cluster repair bandwidth and cross-cluster repair bandwidth in modeling distributed storage. Capacity of the suggested model is obtained as a function of fundamental resources of distributed storage systems, namely, node storage capacity, intra-cluster repair bandwidth and cross-cluster repair bandwidth. The capacity is shown to be asymptotically equivalent to a monotonic decreasing function of number of clusters, as the number of storage nodes increases without bound. Based on the capacity expression, feasible sets of required resources which enable reliable storage are obtained in a closed-form solution. Specifically, it is shown that the cross-cluster traffic can be minimized to zero (i.e., intra-cluster local repair becomes possible) by allowing extra resources on storage capacity and intra-cluster repair bandwidth, according to the law specified in the closed-form. The network coding schemes with zero crosscluster traffic are defined as intra-cluster repairable codes, which are shown to be a class of the previously developed locally repairable codes.

29 September 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JSJy-Yong Sohn
Jy-Yong Sohn
SYSung Whan Yoon
Sung Whan Yoon
JMJaekyun Moon
Jaekyun Moon
Pilot contamination, caused by the reuse of pilots among interfering cells, remains a significant obstacle that limits the performance of massive multi-input multi-output antenna systems. To handle this problem, less aggressive reuse of pilots involving allocation of additional pilots for interfering users is closely examined in this paper. Hierarchical pilot reuse methods are proposed, which effectively mitigate pilot contamination and increase the net throughput of the system. Among the suggested hierarchical pilot reuse schemes, the optimal way of assigning pilots to different users is obtained in a closed-form solution, which maximizes the net sum-rate in a given coherence time. Simulation results confirm that when the ratio of the channel coherence time to the number of users in each cell is sufficiently large, less aggressive reuse of pilots yields significant performance advantage relative to the case, where all cells reuse the same pilot set.

26 July 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
Minseok ChoiMinseok Choi
Minseok Choi
Joongheon KimJoongheon Kim
Joongheon Kim
JMJaekyun Moon
Jaekyun Moon
In this paper, we propose a joint dynamic power control and user pairing algorithm for power-efficient and delay-constrained hybrid multiple access systems. In a hybrid multiple access system, user pairing determines whether the transmitter serves a certain user by orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA). The proposed optimization framework minimizes the long-term time-average transmit power expenditure while reducing the queueing delay and guaranteeing the minimum time-average data rates. The proposed technique observes both channel and queue state information and adjusts queue backlogs to avoid an excessive queueing delay by appropriate user pairing and power allocation. Further, the flexible use of resources is captured in the proposed algorithm by employing NOMA. Data-intensive simulation results show that the proposed scheme for power allocation and user scheduling achieves a balance among multiple performance goals, i.e., power efficiency, queueing delay, and data rate.