Heejung Byun

Prof. Heejung Byun

University of Suwon
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 January 2013 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
HBHeejung Byun
Heejung Byun
SSSoogook Son
Soogook Son
Jungmin SoJungmin So
Jungmin So

16 December 2020 in Sensors
Verified
Journal Article
Open access
PDF file
Yamin HanYamin Han
Yamin Han
HBHeejung Byun
Heejung Byun
LZLiangliang Zhang
Liangliang Zhang
Prolonging the network lifetime is one of the fundamental requirements in wireless sensor networks (WSNs). Sensor node clustering is a very popular energy conservation strategy in WSNs, allowing to achieve energy efficiency, low latency, and scalability. According to this strategy, sensor nodes are grouped into several clusters, and one sensor node in each cluster is assigned to be a cluster head (CH). The responsibility of each CH is to aggregate data from the other sensor nodes within its cluster and send these data to the sink. However, the distribution of sensor nodes in the sensing region is often non-uniform, which may lead to an unbalanced number of sensor nodes between clusters and thus unbalanced energy consumption between CHs. This, in turn, may result in a reduced network lifetime. Furthermore, a different number of clusters lead to a different quality of service of a WSN system. To address the problems of unbalanced number of sensor nodes between clusters and selecting an optimal number of clusters, this study proposes an energy-balanced cluster-routing protocol (EBCRP) based on particle swarm optimization (PSO) with five mutation operators for WSNs. The five mutation operators are specially proposed to improve the performance of PSO in optimizing sensor node clustering. A rotation CH selection scheme based on the highest residual energy is used to dynamically select a CH for each cluster in each round. Simulation results show that the proposed EBCRP method performs well in balancing energy consumption and prolonging the network lifetime.


25 December 2019 in IEEE Sensors Journal
Verified
Journal Article
Closed access
HBHeejung Byun
Heejung Byun
The sink hole problem is a critical issue for data collection in wireless sensor networks. Recent research has indicated that the mobility of actuators in wireless sensor actuator networks (WSANs) alleviates the sink hole problem. However, mobile actuator-based data collection may result in unsatisfactory data gathering delay, which is not acceptable for delay-sensitive real time applications. Thus, planning the optimal path for mobile collector is a critical challenge in WSANs to balance between the prolongation of network lifetime and the reduction of the data gathering delay. To address this issue, we propose a mobile collector-based cost balancing algorithm to achieve uniform data gathering delay and energy consumption based on the adaptive region partitioning and dynamic polling point selection. The proposed algorithm uses multiple mobile collectors and partitions the sensing area into several regions that are monitored by the mobile collectors according to the distribution of cost in the area. It also dynamically determines moving trajectory of each mobile collector by selecting the polling points to visit considering the distance to travel and the nodes’ energy consumption. The superiority of the proposed algorithm is validated by theoretical analysis and simulation results.

3 January 2025 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
XZXuan Zhang
Xuan Zhang
YWYong-Long Wang
Yong-Long Wang
HBHeejung Byun
Heejung Byun
In response to the harsh and limited conditions prevalent in remote areas, wireless sensor and actuator networks (WSANs) play an essential role in Internet-of-Things systems by monitoring and interacting with unattended environments. However, the sensors employed by the majority of WSANs are powered by batteries, ensuring the efficient use and conservation of energy is vital for guaranteeing network connectivity and efficiency. To address this challenge, we proposed a divisive hierarchical clustering method based on K-means++ to organize the sensors. The intra-class distance of the cluster is fully taken into account to achieve the balance and full utilization of node energy. Furthermore, we utilize unmanned aerial vehicles (UAVs) for simultaneous data collection and develop a modified improved partheno genetic algorithm incorporating the Davies–Bouldin index for UAV scheduling. This approach effectively reduces network delay and balances network load. Numerical simulations demonstrate that our proposed method not only extends network lifetime but also balances energy savings and data collection latency.

29 February 2016 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JPJaesung Park
Jaesung Park
HBHeejung Byun
Heejung Byun
JLJung-Ryun Lee
Jung-Ryun Lee
Balancing load among servers is an important research challenge for a large-scale loosely coupled heterogeneous server system (LCHSS), to improve both the total throughput of the system and the quality of service experienced by clients. In practical terms, a load-balancing method for an LCHSS have to drive servers to underloaded states without unnecessary load migrations among servers. To tackle this problem, we propose a load-balancing framework inspired by biological systems that have developed adaptive, robust, and flexible behaviors through the local interactions of individual nodes with limited information. In our framework, we integrate two different biological models systematically and develop new mathematical formulas. With the developed formulas, we introduce two key rules to balance the load levels among servers in a fully distributed manner through the employment of the inter-cell signaling model and the Kuramoto synchronization model. Using a mathematical stability analysis, we provide a guide for the configuration of model parameters and prove that a system stabilizes at a steady state. Using task event logs measured at a Google cluster, we conducted a variety of case studies for the evaluation of the framework. The evaluation results verify that our framework balances the load levels among servers in spite of the variability in a system.