CLCheol Lee

Cheol Lee

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

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


Cheol Lee has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Energy-Efficient Directional Charging Strategy for Wireless Rechargeable Sensor Networks

    by Donghyun Lee, Cheol Lee, Gunhee Jang, Woongsoo Na, Sungrae Cho

    Mobile chargers (MCs) equipped with radio-frequency (RF)-based wireless power transfer (WPT) modules have been suggested as a possible solution to battery constraints in wireless rechargeable sensor networks (WRSNs). In RF-based WPT, charging efficiency decreases significantly as the charging distance increases. Therefore, single charging consumes less energy than multicharging because it can generally charge a sensor node at a closer range. However, when the density of nodes is high, multicharging may achieve higher efficiency. We propose an energy-efficient adaptive directional charging (EEADC) algorithm that considers the density of sensor nodes to adaptively choose single charging or multicharging. The EEADC exploits directional antennas to concentrate the energy and improve energy efficiency and identifies the optimum charging points and beam directions to minimize energy consumption. In the EEADC, clustering is performed by considering the density of the sensor nodes. After clustering, the clusters are classified into single-charging/multicharging clusters according to the number of sensor nodes in each cluster. Next, the charging strategy is determined according to the type of cluster. In the case of a multicharging cluster, the problem is nonconvex. Therefore, a discretized charging strategy decision (DCSD) algorithm is proposed. The performance evaluation indicates that EEADC outperforms two existing methods in terms of power consumption and charging delay by 10% and 9%, respectively.


  • Open Access

    Competitive Game Theoretic Clustering-Based Multiple UAV-Assisted NB-IoT Systems

    by Chunghyun Lee, Gunhee Jang, Nhu-Ngoc Dao, Demeke Shumeye Lakew, Cheol Lee, Sungrae Cho

    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%.


  • Energy-Efficient and Delay-Minimizing Charging Method With a Multiple Directional Mobile Charger

    by Cheol Lee, Woongsoo Na, Gunhee Jang, Choonghyun Lee, Sungrae Cho

    To prolong the battery lifetime of Internet of things (IoT) devices, they can be charged by a mobile charger (MC) equipped with radio frequency (RF)-based wireless power transfer (WPT) capability. By concentrating power towards IoT devices, the energy efficiency of the MC increases when using a directional antenna instead of an omni-directional counterpart. However, directional antennas have a narrow beamwidth, and thus, several IoT devices cannot be charged simultaneously. In this paper, we propose a multiple directional MC (MDMC) scheme that exploits multiple directional beams to reduce the charging delay while maintaining the advantages of directional antenna with a higher charging efficiency. In our MDMC, an MC determines its charging points to visit and the directions of its beams at each charging point. The charging points can be determined in consideration of the distribution of the devices and the remaining energy. After selecting charging points, the travel paths are determined by considering the remaining energy of the IoT devices. In addition, to relax the problem complexity, we propose an efficient two-stage multiple directional beam selection (MDBS) algorithm. In the first stage, the directions of beams are determined. The second stage calculates charging time of each beam for minimizing delay. Simulation results show that the MDMC outperforms the existing a single directional antenna-based charging schemes in terms of the energy efficiency and charging delay approximately 15% and 25%, respectively.


  • Open Access

    Base Station Switching and Sleep Mode Optimization With LSTM-Based User Prediction

    by Gunhee Jang, Namkyu Kim, Taeyun Ha, Cheol Lee, Sungrae Cho

    The base station (BS) switching technique has recently attracted considerable attention for reducing power consumption in wireless networks. In this paper, we propose a novel BS switching and sleep mode optimization method to minimize the power consumption, while ensuring that the arriving user traffic is sufficiently covered. First, the user traffic in multiple time slots was predicted using the long-short term memory (LSTM) prediction model. Subsequently, we solved the Lyapunov optimization problem to obtain the optimal BS switching solution from the trade-off relationship between the reduced power consumption by BS switching and the user traffic handled in time series. Finally, we selected the sleep mode for the switched result by calculating the wake-up time and the power consumption ratio of each sleep mode. Simulation results confirm that the proposed algorithm successfully reduces the total power consumption by approximately 15% while preventing the user data queue from diverging in multiple time slots.


  • Open Access

    Two-Stage Computation Offloading Scheduling Algorithm for Energy-Harvesting Mobile Edge Computing

    by Laihyuk Park, Cheol Lee, Woongsoo Na, Sungyun Choi, Sungrae Cho

    Recently, mobile edge computing (MEC) technology was developed to mitigate the overload problem in networks and cloud systems. An MEC system computes the offloading computation tasks from resource-constrained Internet of Things (IoT) devices. In addition, several convergence technologies with renewable energy resources (RERs) such as photovoltaics have been proposed to improve the survivability of IoT systems. This paper proposes an MEC integrated with RER system, which is referred to as energy-harvesting (EH) MEC. Since the energy supply of RERs is unstable due to various reasons, EH MEC needs to consider the state-of-charge (SoC) of the battery to ensure system stability. Therefore, in this paper, we propose an offloading scheduling algorithm considering the battery of EH MEC as well as the service quality of experience (QoE). The proposed scheduling algorithm consists of a two-stage operation, where the first stage consists of admission control of the offloading requests and the second stage consists of computation frequency scheduling of the MEC server. For the first stage, a non-convex optimization problem is designed considering the computation capability, SoC, and request deadline. To solve the non-convex problem, a greedy algorithm is proposed to obtain approximate optimal solutions. In the second stage, based on Lyapunov optimization, a low-complexity algorithm is proposed, which considers both the workload queue and battery stability. In addition, performance evaluations of the proposed algorithm were conducted via simulation. However, this paper has a limitation in terms of verifying in a real-world scenario.