SKSeong Jin Kim

Seong Jin Kim

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Seong Jin Kim has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Computation Offloading and Service Caching for Mobile Edge Computing Under Personalized Service Preference

    by Seung-Woo Ko, Seong Jin Kim, Haejoon Jung, Sang Won Choi

    Mobile edge computing (MEC) has emerged as an attractive solution by executing computation-intensive services at a powerful edge server instead of mobiles. Two types of data are necessary to this end. One is user-specific data acquired from mobiles, called computation offloading (CO). The other is service-specific data downloaded from a central cloud, called service caching (SC). It is noteworthy that CO and SC decisions are coupled when each user’s service preference (SP) is personalized. Specifically, noting that the optimal SC is to cache services likely to be requested more frequently, the resultant SC tends to be biased to the SP of the user whose offloading rate is high. On the other hand, such an SC decision causes longer computing latency of users with a relatively low offloading rate, which ultimately limits a CO decision for agile MEC services. This work tackles this issue from a sum-utility maximization perspective under radio-resource and computation-latency constraints. The average computation latency is first derived in closed-form by modeling a computation as a stochastic process following a hyper-exponential distribution. Based on it, we first consider the case for homogeneous SP where CO and SC decisions are decoupled. Thus, SC can be deterministically controlled using the homogeneous SP, while CO decision is independently determined, lying between water-filling and channel-inversion allocations. Next, we design a joint CO-and-SC policy for heterogeneous SP. CO and SC decisions are iteratively optimized with the other fixed by leveraging the homogeneous SP’s result. The optimal stopping rules are derived, guaranteeing the sum-utility enhancement. The proposed algorithm’s effectiveness is verified by simulations that the proposed CO-and-SC design for heterogenous SP always outperforms that for homogeneous SP.


  • Antenna for IoT-Based Future Advanced (5G) Railway Communication With End-Fire Radiation

    by Ashwini K. Arya, Seongjin Kim, Kyeongjun Ko, Sanghoek Kim

    This work presents a design study of an antenna for future railway communications in the context of Internet of Things (IoT). 28-GHz resonance frequency has been considered for the 5G communication systems with end-fire radiations. The size of the proposed antenna array element is 100 mm $\times20$ mm. The shark-fin cover is used to cover the antenna to protect it from the external environmental effects. The proposed antenna along with the 1.3-GHz bandwidth centered at 28 GHz results an expected end-fire radiation ( $\theta =83^{\circ }$ ), with a gain of >10 dBi and its suitability to be installed on the roof of the train for communications to the front and back directions along with the track has been studied and discussed in detail.


  • Open Access

    On the Design of Tailored Neural Networks for Energy Harvesting Broadcast Channels: A Reinforcement Learning Approach

    by Heasung Kim, Jungtai Kim, Wonjae Shin, Heecheol Yang, Nayoung Lee, Seong Jin Kim, Jungwoo Lee

    In this paper, we consider a power allocation optimization technique for a time-varying fading broadcast channel in energy harvesting communication systems, in which a transmitter with a rechargeable battery transmits messages to receivers using the harvested energy. We first prove that the optimal online power allocation policy for the sum-rate maximization of the transmitter is a monotonically increasing function of harvested energy, remaining battery, and the channel gain of each user. We then construct a lightweight neural network architecture to take advantage of the monotonicity of the optimal policy. This two-step approach, which relies on effective function approximation to provide a mathematical guideline for neural network design, can prevent us from wasting the representational capacity of neural networks. The tailored neural network architectures enable stable learning and eliminate the heuristic network design. For performance assessment, the proposed approach is compared with the closed-form optimal policy for a partially observable Markov problem. Through additional experiments, it is observed that our online solution achieves a performance close to the theoretical upper bound of the performance in a time-varying fading broadcast channel.