Chunghyun Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Chunghyun Lee has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Sungrae Cho
School of Computer Science and Engineering, Chung-Ang University, Seoul, South Korea
5 shared publications - Nhu-Ngoc Dao
Department of Computer Science and Engineering, Sejong University, Seoul, South Korea
2 shared publications - Anh-Tien Tran
School of Computer Science and Engineering, Chung-Ang University, Seoul, South Korea
1 shared publication - Arooj Masood
School of Computer Science and Engineering, Chung-Ang University, Seoul, South Korea
1 shared publication Aziz Mohaisen
Department of Computer Science, University of Central Florida, Orlando, FL, USA
1 shared publication- Cheol Lee
NAVER Corporation, Seongnam 13561, South Korea
1 shared publication
Latest Publications
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 1689-1704
Multiagent Collaboration for Maximizing Channel Awareness in Mobile Directional CRNs
In spectrum sensing, secondary users (SUs) often face limitations in their sensing capabilities, making cooperation among SUs crucial. By leveraging collaboration, we aim to maximize comprehensive awareness of primary channel states while minimizing sensing overhead. To achieve this, we develop an adaptive algorithm that utilizes SU mobility and directional antennas, enabling operation in dynamic environments where prior network knowledge is unavailable. This study proposes a two-stage learning approach. In the first stage, a PU location estimation (PLE) algorithm assists SUs in identifying relevant sensing targets. In the second stage, a multiagent reinforcement learning-based algorithm is introduced to mitigate sensing collisions, thereby enhancing channel state awareness. Simulation results demonstrate that the proposed scheme outperforms baseline algorithms in convergence speed, sensing collision rate, and channel state awareness, offering an efficient solution for cognitive radio networks. Specifically, the proposed approach achieves up to an 81% and 24% increase in comprehensive channel awareness, and a 53% and 13% reduction in sensing overhead compared to the random scheme without and with PLE, respectively.
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 1689-1704
Multiagent Collaboration for Maximizing Channel Awareness in Mobile Directional CRNs
In spectrum sensing, secondary users (SUs) often face limitations in their sensing capabilities, making cooperation among SUs crucial. By leveraging collaboration, we aim to maximize comprehensive awareness of primary channel states while minimizing sensing overhead. To achieve this, we develop an adaptive algorithm that utilizes SU mobility and directional antennas, enabling operation in dynamic environments where prior network knowledge is unavailable. This study proposes a two-stage learning approach. In the first stage, a PU location estimation (PLE) algorithm assists SUs in identifying relevant sensing targets. In the second stage, a multiagent reinforcement learning-based algorithm is introduced to mitigate sensing collisions, thereby enhancing channel state awareness. Simulation results demonstrate that the proposed scheme outperforms baseline algorithms in convergence speed, sensing collision rate, and channel state awareness, offering an efficient solution for cognitive radio networks. Specifically, the proposed approach achieves up to an 81% and 24% increase in comprehensive channel awareness, and a 53% and 13% reduction in sensing overhead compared to the random scheme without and with PLE, respectively.
- 17 December 2024
- Published by Springer Nature
- p. 354-362
Intelligent Semantic Communication Networks Empowered by Non-orthogonal Multiple Access
- 17 December 2024
- Published by Springer Nature
- p. 354-362
Intelligent Semantic Communication Networks Empowered by Non-orthogonal Multiple Access
- Open Access
- 2 February 2021
- Published by MDPI AG in Electronics
- Vol. 10 (3) , 356
Competitive Game Theoretic Clustering-Based Multiple UAV-Assisted NB-IoT Systems
Unmanned aerial vehicle (UAV) communication is regarded as a promising technology for lightweight Internet of Things (IoT) communications in narrowband-IoT (NB-IoT) systems deployed in rugged terrain. In such UAV-assisted NB-IoT systems, the optimal UAV placement and resource allocation play a critical role. Consequently, the joint optimization of the UAV placement and resource allocation is considered in this study to improve the system capacity. Because the considered optimization problem is an NP-hard problem and owing to its non-convex property, it is difficult to optimize both the UAV placement and resource allocation simultaneously. Therefore, a competitive clustering algorithm has been developed by exchanging strategies between the UAV and the adjacent IoT devices to optimize the UAV placement. With multiple iterations, the UAV and the IoT devices within the coverage area of the UAV, converge their clustering strategies, which are suboptimal, to satisfy both sides. The bordering IoT devices of the adjacent clusters are then migrated heuristically toward each other to obtain the optimal system capacity maximization. Finally, the transmission throughput is optimized using the Nash equilibrium. The simulation results demonstrate that the algorithms proposed in this study exhibit rapid convergence, within 10 iterations, even in a large environment. The performance evaluation demonstrates that the proposed scheme improves the system capacity of the existing schemes by approximately 28%.
- 2 February 2021
- Published by MDPI AG in Electronics
- Vol. 10 (3) , 356
Open AccessCompetitive Game Theoretic Clustering-Based Multiple UAV-Assisted NB-IoT Systems
Unmanned aerial vehicle (UAV) communication is regarded as a promising technology for lightweight Internet of Things (IoT) communications in narrowband-IoT (NB-IoT) systems deployed in rugged terrain. In such UAV-assisted NB-IoT systems, the optimal UAV placement and resource allocation play a critical role. Consequently, the joint optimization of the UAV placement and resource allocation is considered in this study to improve the system capacity. Because the considered optimization problem is an NP-hard problem and owing to its non-convex property, it is difficult to optimize both the UAV placement and resource allocation simultaneously. Therefore, a competitive clustering algorithm has been developed by exchanging strategies between the UAV and the adjacent IoT devices to optimize the UAV placement. With multiple iterations, the UAV and the IoT devices within the coverage area of the UAV, converge their clustering strategies, which are suboptimal, to satisfy both sides. The bordering IoT devices of the adjacent clusters are then migrated heuristically toward each other to obtain the optimal system capacity maximization. Finally, the transmission throughput is optimized using the Nash equilibrium. The simulation results demonstrate that the algorithms proposed in this study exhibit rapid convergence, within 10 iterations, even in a large environment. The performance evaluation demonstrates that the proposed scheme improves the system capacity of the existing schemes by approximately 28%.
- 13 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 18, 853-857
Night-Time Vehicle Distance Estimation Using Camera Geometry and Deep Learning
Vehicle distance estimation has been considered as one of the important topics in traffic video processing. There have been many algorithms proposed to deal with this problem. However, these algorithms all have their own drawbacks such as long processing duration, huge data requirements, extremely computational consumption, and low accuracy response. In this circumstance, in this paper, a novel algorithm based on a combination of deep learning and camera geometry is proposed for vehicle distance estimation. The proposed algorithm demonstrates fast processing duration which is contributed by the deep learning base technique. Moreover, thanks to the simplicity of camera geometry, the proposed algorithm requires minimal data to perform the estimation. By combining deep learning and camera geometry, the proposed algorithm can provide high estimation accuracy while keeping the model simple and fast. The performance of the proposed algorithm is verified through experiments results.
- 13 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 18, 853-857
Night-Time Vehicle Distance Estimation Using Camera Geometry and Deep Learning
Vehicle distance estimation has been considered as one of the important topics in traffic video processing. There have been many algorithms proposed to deal with this problem. However, these algorithms all have their own drawbacks such as long processing duration, huge data requirements, extremely computational consumption, and low accuracy response. In this circumstance, in this paper, a novel algorithm based on a combination of deep learning and camera geometry is proposed for vehicle distance estimation. The proposed algorithm demonstrates fast processing duration which is contributed by the deep learning base technique. Moreover, thanks to the simplicity of camera geometry, the proposed algorithm requires minimal data to perform the estimation. By combining deep learning and camera geometry, the proposed algorithm can provide high estimation accuracy while keeping the model simple and fast. The performance of the proposed algorithm is verified through experiments results.
- 18 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 6 (5) , 8782-8791
Two-Stage IoT Device Scheduling With Dynamic Programming for Energy Internet Systems
With the rapid evolution of electric systems, there has been a significant demand for energy Internet (EI) systems that allow sustainable and environmentally friendly energy management. Several research efforts regarding EI systems have been aimed at providing reliable, efficient, and cost-effective techniques. In this paper, we propose a novel algorithm and system for real-time electricity pricing and scheduling. Our algorithm consists of a two-stage operation. The first stage performs real-time pricing to determine the maximum electricity consumption while the second stage performs Internet of Things (IoT) device scheduling. In the second stage, the optimization framework for scheduling is modeled as a 0–1 Knapsack problem; therefore, the solutions to the optimization problem are computed using a dynamic programming framework. Through intensive simulations with well-defined parameters, it is verified that the proposed scheme provides several features, especially reductions in electricity bills with the appropriate parameter settings.
- 18 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 6 (5) , 8782-8791
Two-Stage IoT Device Scheduling With Dynamic Programming for Energy Internet Systems
With the rapid evolution of electric systems, there has been a significant demand for energy Internet (EI) systems that allow sustainable and environmentally friendly energy management. Several research efforts regarding EI systems have been aimed at providing reliable, efficient, and cost-effective techniques. In this paper, we propose a novel algorithm and system for real-time electricity pricing and scheduling. Our algorithm consists of a two-stage operation. The first stage performs real-time pricing to determine the maximum electricity consumption while the second stage performs Internet of Things (IoT) device scheduling. In the second stage, the optimization framework for scheduling is modeled as a 0–1 Knapsack problem; therefore, the solutions to the optimization problem are computed using a dynamic programming framework. Through intensive simulations with well-defined parameters, it is verified that the proposed scheme provides several features, especially reductions in electricity bills with the appropriate parameter settings.
- 1 September 2018
- Published by American Scientific Publishers in Journal of Nanoscience and Nanotechnology
- Vol. 18 (9) , 6339-6342
A Label-Free Detection of NdeI Endonuclease Activity by Using DNA-Templated Silver Nanoclusters
Restriction endonucleases play an important role in genetic recombination, molecular cloning, clinical diagnosis, and pharmacological application in drug studies. In the present study, DNA-templated Ag+ nanoclusters (DNA-AgNCs) were used to detect NdeI endonuclease activity due to their facile synthesis, outstanding optical properties, and good biocompatibility. This study monitored fluorescence intensity of DNA-AgNCs to detect NdeI endonuclease activity and its inhibition in the presence of 5-fluorouracil under optimal conditions.
- 1 September 2018
- Published by American Scientific Publishers in Journal of Nanoscience and Nanotechnology
- Vol. 18 (9) , 6339-6342
A Label-Free Detection of NdeI Endonuclease Activity by Using DNA-Templated Silver Nanoclusters
Restriction endonucleases play an important role in genetic recombination, molecular cloning, clinical diagnosis, and pharmacological application in drug studies. In the present study, DNA-templated Ag+ nanoclusters (DNA-AgNCs) were used to detect NdeI endonuclease activity due to their facile synthesis, outstanding optical properties, and good biocompatibility. This study monitored fluorescence intensity of DNA-AgNCs to detect NdeI endonuclease activity and its inhibition in the presence of 5-fluorouracil under optimal conditions.