Seong-Lyun Kim

Seong-Lyun Kim

Auto-generated profile, based on publicly available information

Seong-Lyun Kim

School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
10 June 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
HKHyesung Kim
Hyesung Kim
JPJihong Park
Jihong Park
MBMehdi Bennis
Mehdi Bennis
SKSeong-Lyun Kim
Seong-Lyun Kim
By leveraging blockchain, this letter proposes a blockchained federated learning (BlockFL) architecture where local learning model updates are exchanged and verified. This enables on-device machine learning without any centralized training data or coordination by utilizing a consensus mechanism in blockchain. Moreover, we analyze an end-to-end latency model of BlockFL and characterize the optimal block generation rate by considering communication, computation, and consensus delays.

18 February 2021 in Proceedings of the IEEE
Verified
Journal Article
Closed access
JPJihong Park
Jihong Park
SSSumudu Samarakoon
Sumudu Samarakoon
AEAnis Elgabli
Anis Elgabli
Joongheon KimJoongheon Kim
Joongheon Kim
MBMehdi Bennis
Mehdi Bennis
MDMerouane Debbah
Merouane Debbah
Machine learning (ML) is a promising enabler for the fifth-generation (5G) communication systems and beyond. By imbuing intelligence into the network edge, edge nodes can proactively carry out decision-making and, thereby, react to local environmental changes and disturbances while experiencing zero communication latency. To achieve this goal, it is essential to cater for high ML inference accuracy at scale under the time-varying channel and network dynamics, by continuously exchanging fresh data and ML model updates in a distributed way. Taming this new kind of data traffic boils down to improving the communication efficiency of distributed learning by optimizing communication payload types, transmission techniques, and scheduling, as well as ML architectures, algorithms, and data processing methods. To this end, this article aims to provide a holistic overview of relevant communication and ML principles and, thereby, present communication-efficient and distributed learning frameworks with selected use cases.

17 March 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
SKSeung-Woo Ko
Seung-Woo Ko
KHKaibin Huang
Kaibin Huang
SKSeong-Lyun Kim
Seong-Lyun Kim
HCHyukjin Chae
Hyukjin Chae
Mobile computation offloading refers to techniques for offloading computation intensive tasks from mobile devices to the cloud so as to lengthen the formers' battery lives and enrich their features. The conventional designs fetch (transfer) user-specific data from mobiles to the cloud prior to computing, called offline prefetching. However, this approach can potentially result in excessive fetching of large volumes of data and cause heavy loads on radio-access networks. To solve this problem, the novel technique of live prefetching, which seamlessly integrates the task-level computation prediction and prefetching within the cloud-computing process of a large program with numerous tasks, is proposed in this paper. The technique avoids excessive fetching but retains the feature of leveraging prediction to reduce the program runtime and mobile transmission energy. By modeling the tasks in an offloaded program as a stochastic sequence, stochastic optimization is applied to design fetching policies to minimize mobile energy consumption under a deadline constraint. The policies enable real-time control of the prefetched-data sizes of candidates for future tasks. For slow fading, the optimal policy is derived and shown to have a threshold-based structure, selecting candidate tasks for prefetching and controlling their prefetched data based on their likelihoods. The result is extended to design close-to-optimal prefetching policies to fast fading channels. Compared with fetching without prediction, live prefetching is shown theoretically to always achieve reduction on mobile energy consumption.

19 June 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
SOSeungeun Oh
Seungeun Oh
JPJihong Park
Jihong Park
EJEunjeong Jeong
Eunjeong Jeong
HKHyesung Kim
Hyesung Kim
MBMehdi Bennis
Mehdi Bennis
SKSeong-Lyun Kim
Seong-Lyun Kim
This letter proposes a novel communication-efficient and privacy-preserving distributed machine learning framework, coined Mix2FLD. To address uplink-downlink capacity asymmetry, local model outputs are uploaded to a server in the uplink as in federated distillation (FD), whereas global model parameters are downloaded in the downlink as in federated learning (FL). This requires a model output-to-parameter conversion at the server, after collecting additional data samples from devices. To preserve privacy while not compromising accuracy, linearly mixed-up local samples are uploaded, and inversely mixed up across different devices at the server. Numerical evaluations show that Mix2FLD achieves up to 16.7% higher test accuracy while reducing convergence time by up to 18.8% under asymmetric uplink-downlink channels compared to FL.

21 June 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
SSSejin Seo
Sejin Seo
JPJihong Park
Jihong Park
SKSeung-Woo Ko
Seung-Woo Ko
Jinho ChoiJinho Choi
Jinho Choi
MBMehdi Bennis
Mehdi Bennis
SKSeong-Lyun Kim
Seong-Lyun Kim
Classical medium access control (MAC) protocols are interpretable, yet their task-agnostic control signaling messages (CMs) are ill-suited for emerging mission-critical applications. By contrast, neural network (NN) based protocol models (NPMs) learn to generate task-specific CMs, but their rationale and impact lack interpretability. To fill this void, in this article we propose, for the first time, a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog). This transformation is viable by extracting and merging common CMs and their connections, while treating the NPM as a CM generator. By extensive simulations, we corroborate that the SPM tightly approximates its original NPM while occupying only 0.02% memory. By leveraging its interpretability and memory-efficiency, we demonstrate several SPM-enabled applications such as SPM reconfiguration for collision-avoidance, as well as comparing different SPMs via semantic entropy calculation and storing multiple SPMs to cope with non-stationary environments.

1 April 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
KHKyuwon Han
Kyuwon Han
SYSeung Min Yu
Seung Min Yu
SKSeong-Lyun Kim
Seong-Lyun Kim
SKSeung-Woo Ko
Seung-Woo Ko
Recently, round-trip time (RTT) measured by a fine-timing measurement protocol has received great attention in the area of WiFi positioning. It provides an acceptable ranging accuracy in favorable environments when a line-of-sight (LOS) path exists. Otherwise, a signal is detoured along with non-LOS (NLOS) paths, making the resultant ranging results different from the ground truth, called an RTT bias, which is the main reason for poor positioning performance. To address it, we aim at leveraging the user mobility trajectory detected by a smartphone’s inertial measurement units, called pedestrian dead reckoning (PDR). Specifically, PDR provides the geographic relation among adjacent locations, guiding the resultant positioning estimates’ sequence not to deviate from the user trajectory. To this end, we describe their relations as multiple geometric equations, enabling us to render a novel positioning algorithm with acceptable accuracy. Depending on the mobility pattern being linear or arbitrary, we develop different algorithms divided into two phases. First, we can jointly estimate an RTT bias of each access point (AP) and the user’s step length by leveraging the geometric relation mentioned above. It enables us to construct a user’s relative trajectory defined on the concerned AP’s local coordinate system. Second, we align every AP’s relative trajectory into a single one, called trajectory alignment , equivalent to transformation to the global coordinate system. As a result, we can estimate the sequence of the user’s absolute locations from the aligned trajectory. Various field experiments extensively verify the proposed algorithm’s effectiveness that the average positioning error is approximately 0.369 (m) and 1.705 (m) in LOS and NLOS environments, respectively.