Junhee 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
Research Interests
Junhee Lee has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Anam Nawaz Khan
Department of Industrial and Systems Engineering, University of Tennessee, Knoxville, TN, 37996, USA.
1 shared publication Byeong-Cheol Choi
Electronics and Telecommunications Research Institute, Daejeon, Korea
1 shared publicationDae Ho Kim
Electronics and Telecommunications Research Institute (ETRI), Daejeon, Republic of Korea
1 shared publication- DoHyeun Kim
Department of Computer Engineering, Jeju National University, Jeju, Republic of Korea
1 shared publication - Hyun Woo Oh
Ubiquitous Home Platform Research Team, Digital Home Research Division, ETRI
1 shared publication Jung-Sik Sung
Electronics and Telecommunications Research Institute (ETRI), Daejeon, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 25 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 154365-154380
Dynamic Temporal Analysis and Modeling of Residential Lighting Consumption for Energy Efficiency and Sustainability
Buildings constitute a significant portion of global energy demand, accounting for approximately 30% of final energy consumption and over 50% of global electricity usage. This sector is responsible for 26% of energy-related emissions, with demand projected to increase by 4% in 2024 as per International Energy Agency. A critical component of this consumption is lighting, which continues to be a major contributor to electricity use. In South Korea, a marked increase in residential electricity consumption underscores these global trends. Traditional building energy models inadequately address the complexity of human behavior, often relying on static schedules. This study leverages statistical and machine learning techniques to analyze lighting energy consumption across varying temporal scales, using real empirical data from South Korean residential buildings. The analysis reveals insights into behavior-driven energy consumption, highlighting the necessity for dynamic energy modeling that integrates human behavioral variability, their intrinsic routines and temporal patterns. The findings have profound implications for enhancing energy efficiency and optimizing conservation strategies in an era of escalating global energy demands.
- 25 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 154365-154380
Open AccessDynamic Temporal Analysis and Modeling of Residential Lighting Consumption for Energy Efficiency and Sustainability
Buildings constitute a significant portion of global energy demand, accounting for approximately 30% of final energy consumption and over 50% of global electricity usage. This sector is responsible for 26% of energy-related emissions, with demand projected to increase by 4% in 2024 as per International Energy Agency. A critical component of this consumption is lighting, which continues to be a major contributor to electricity use. In South Korea, a marked increase in residential electricity consumption underscores these global trends. Traditional building energy models inadequately address the complexity of human behavior, often relying on static schedules. This study leverages statistical and machine learning techniques to analyze lighting energy consumption across varying temporal scales, using real empirical data from South Korean residential buildings. The analysis reveals insights into behavior-driven energy consumption, highlighting the necessity for dynamic energy modeling that integrates human behavioral variability, their intrinsic routines and temporal patterns. The findings have profound implications for enhancing energy efficiency and optimizing conservation strategies in an era of escalating global energy demands.
- Open Access
DG-LoRa: Deterministic Group Acknowledgment Transmissions in LoRa Networks for Industrial IoT Applications
In this paper, we propose a novel MAC protocol, called DG-LoRa, for improving scalability in low power wide area networks. DG-LoRa is backward compatible with legacy LoRaWAN and adds new features, such as group acknowledgment transmissions in the time-synchronized frame structure that supports determinism on channel access. In DG-LoRa, the number of responses to data frames that are transmitted from end devices is maximized by allocating the spreading factor and timeslot in the frame structure. We evaluate the performance of DG-LoRa using the Monte-Carlo simulation and then compare it with the performance of legacy LoRaWAN in terms of data drop rate and the number of retransmissions. Our numerical results show that DG-LoRa supports approximately five times more connections to the LoRa network satisfying a 5% data drop rate. Also, it is observed that DG-LoRa enables low overhead by reducing the number of data frame retransmissions.
Open AccessDG-LoRa: Deterministic Group Acknowledgment Transmissions in LoRa Networks for Industrial IoT Applications
In this paper, we propose a novel MAC protocol, called DG-LoRa, for improving scalability in low power wide area networks. DG-LoRa is backward compatible with legacy LoRaWAN and adds new features, such as group acknowledgment transmissions in the time-synchronized frame structure that supports determinism on channel access. In DG-LoRa, the number of responses to data frames that are transmitted from end devices is maximized by allocating the spreading factor and timeslot in the frame structure. We evaluate the performance of DG-LoRa using the Monte-Carlo simulation and then compare it with the performance of legacy LoRaWAN in terms of data drop rate and the number of retransmissions. Our numerical results show that DG-LoRa supports approximately five times more connections to the LoRa network satisfying a 5% data drop rate. Also, it is observed that DG-LoRa enables low overhead by reducing the number of data frame retransmissions.
- Open Access
- 21 August 2017
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 13 (8)
Multi-channel time division multiple access timeslot scheduling with link recovery for multi-hop wireless sensor networks
In this article, we propose a time division multiple access scheduling algorithm for end-to-end on-time packet delivery in multi-hop wireless sensor networks. Our proposed algorithm establishes a new communication path to substitute the old path including the link failed and schedules communication links on the new path by allocating timeslots satisfying end-to-end delay bound. Max–min optimization is employed to maximize the number of dedicated timeslots to establish the substitute path in the event of the next link failure. We evaluate the performance of the proposed algorithm using QualNet network simulator and compare it with the performance of the algorithm that minimizes the end-to-end delay. Our numerical results show that the path survival ratio of the proposed algorithm is approximately two times higher when large number of communication links fails. In addition, we apply the global recovery and local recovery schemes to observe the increase in the overhead message exchanges. Compared to the global recovery scheme, local recovery scheme requires six times less control messages to establish the substitute path when a small number of link failures occur, whereas more than 90% communication paths survive.
- 21 August 2017
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 13 (8)
Open AccessMulti-channel time division multiple access timeslot scheduling with link recovery for multi-hop wireless sensor networks
In this article, we propose a time division multiple access scheduling algorithm for end-to-end on-time packet delivery in multi-hop wireless sensor networks. Our proposed algorithm establishes a new communication path to substitute the old path including the link failed and schedules communication links on the new path by allocating timeslots satisfying end-to-end delay bound. Max–min optimization is employed to maximize the number of dedicated timeslots to establish the substitute path in the event of the next link failure. We evaluate the performance of the proposed algorithm using QualNet network simulator and compare it with the performance of the algorithm that minimizes the end-to-end delay. Our numerical results show that the path survival ratio of the proposed algorithm is approximately two times higher when large number of communication links fails. In addition, we apply the global recovery and local recovery schemes to observe the increase in the overhead message exchanges. Compared to the global recovery scheme, local recovery scheme requires six times less control messages to establish the substitute path when a small number of link failures occur, whereas more than 90% communication paths survive.