<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>Repository Collection: null</title>
  <link rel="alternate" href="https://scholar.dgist.ac.kr/handle/20.500.11750/867" />
  <subtitle />
  <id>https://scholar.dgist.ac.kr/handle/20.500.11750/867</id>
  <updated>2026-04-04T19:03:59Z</updated>
  <dc:date>2026-04-04T19:03:59Z</dc:date>
  <entry>
    <title>Computing at the Edge for 5G and IoT</title>
    <link rel="alternate" href="https://scholar.dgist.ac.kr/handle/20.500.11750/47114" />
    <author>
      <name>Lee, Jemin</name>
    </author>
    <id>https://scholar.dgist.ac.kr/handle/20.500.11750/47114</id>
    <updated>2025-07-25T04:09:34Z</updated>
    <published>2017-10-23T15:00:00Z</published>
    <summary type="text">Title: Computing at the Edge for 5G and IoT
Author(s): Lee, Jemin</summary>
    <dc:date>2017-10-23T15:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Sensing and Transmission Design for AoI-Sensitive Wireless Sensor Networks</title>
    <link rel="alternate" href="https://scholar.dgist.ac.kr/handle/20.500.11750/46956" />
    <author>
      <name>Kim, Jinwoong</name>
    </author>
    <author>
      <name>Kim, Minsu</name>
    </author>
    <author>
      <name>Lee, Jemin</name>
    </author>
    <id>https://scholar.dgist.ac.kr/handle/20.500.11750/46956</id>
    <updated>2025-07-25T03:26:58Z</updated>
    <published>2020-12-06T15:00:00Z</published>
    <summary type="text">Title: Sensing and Transmission Design for AoI-Sensitive Wireless Sensor Networks
Author(s): Kim, Jinwoong; Kim, Minsu; Lee, Jemin
Abstract: In this paper, we analyze the average energy consumption in the wireless sensor network (WSN). We first characterize the age of information (AoI) considering the retransmission and define an error-tolerable sensing coverage which shrinks as the AoI increases using the spatial-temporal correlation of the sensed data. We then provide the ?-coverage probability for guaranteeing the ? portion of the sensing coverage. To analyze the ?-coverage probability, we derive the closed-form expression of the AoI violation probability depending on the violation threshold. We also present the optimal transmission power of the sensor that minimizes the average energy consumption satisfying the target error-tolerable coverage according to the maximum number of the retransmission. © 2020 IEEE.</summary>
    <dc:date>2020-12-06T15:00:00Z</dc:date>
  </entry>
  <entry>
    <title>MU-MIMO Precoding Design in the Presence of Delay-Constrained Users</title>
    <link rel="alternate" href="https://scholar.dgist.ac.kr/handle/20.500.11750/46925" />
    <author>
      <name>Kim, Minsu</name>
    </author>
    <author>
      <name>Park, Jeonghun</name>
    </author>
    <author>
      <name>Lee, Jemin</name>
    </author>
    <id>https://scholar.dgist.ac.kr/handle/20.500.11750/46925</id>
    <updated>2025-07-25T02:39:40Z</updated>
    <published>2021-06-16T15:00:00Z</published>
    <summary type="text">Title: MU-MIMO Precoding Design in the Presence of Delay-Constrained Users
Author(s): Kim, Minsu; Park, Jeonghun; Lee, Jemin
Abstract: In both academia and industry, the multiple-input multiple-output (MIMO) techniques have shown enormous gains in spectral efficiency by exploiting the spatial degrees of freedom. So far, an underlying assumption in most of existing multi-user multiple-input multiple-output (MU-MIMO) design has been that all the users in the system use infinite blocklength, so that they can achieve the Shannon capacity. This setup, however, is not suitable considering the presence of delay-constrained users whose the blocklength tends to be finite. In this paper, we consider a heterogeneous setting in a MU-MEMO system where delay tolerant users and delay constrained users coexist. To maximize the sum spectral efficiency in this system, we first present the spectral efficiencies for delay-tolerant user and delay-constrained user as the Rayleigh quotient. We then derive a first-order optimality condition of the optimization problem that maximizes the sum spectral efficiency of total users and satisfies the latency requirement of delay-constrained users, and propose the generalized power iteration preceding algorithm. In the simulation results, we prove that the proposed method outperforms baseline schemes. © 2021 IEEE.</summary>
    <dc:date>2021-06-16T15:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Age of Information Analysis in Hyperledger Fabric Blockchain-enabled Monitoring Networks</title>
    <link rel="alternate" href="https://scholar.dgist.ac.kr/handle/20.500.11750/46924" />
    <author>
      <name>Kim, Minsu</name>
    </author>
    <author>
      <name>Lee, Sung Ho</name>
    </author>
    <author>
      <name>Park, Chanwon</name>
    </author>
    <author>
      <name>Lee, Jemin</name>
    </author>
    <id>https://scholar.dgist.ac.kr/handle/20.500.11750/46924</id>
    <updated>2025-07-25T03:29:27Z</updated>
    <published>2021-06-16T15:00:00Z</published>
    <summary type="text">Title: Age of Information Analysis in Hyperledger Fabric Blockchain-enabled Monitoring Networks
Author(s): Kim, Minsu; Lee, Sung Ho; Park, Chanwon; Lee, Jemin
Abstract: Age of information (AoI) is a recently proposed metric for quantifying data freshness in real-time status monitoring systems where timeliness is of importance. In this paper, we explore the data freshness in the Hyperledger Fabric Blockchain-enabled monitoring network (HeMN) by leveraging the AoI metric. In HeMN, status updates from sources are transmitted through an uplink and recorded in a Hyperledger Fabric (HLF) network. To provide a stochastic guarantee of data freshness, we derive a closed-form of AoI violation probability by considering the transmission latency and the consensus latency. Then, we validate our analytic results through the implemented HLF platform. We also investigate the effect of the target successful transmission probability (STP) on the AoI violation probability. © 2021 IEEE.</summary>
    <dc:date>2021-06-16T15:00:00Z</dc:date>
  </entry>
</feed>

