Jung-Ryun Lee

Dr. Jung-Ryun Lee

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 January 2014 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
SPSang-Hyun Park
Sang-Hyun Park
SCSeungryong Cho
Seungryong Cho
JLJung-Ryun Lee
Jung-Ryun Lee
In the future network with Internet of Things (IoT), each of the things communicates with the others and acquires information by itself. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose energy-efficient probabilistic routing (EEPR) algorithm, which controls the transmission of the routing request packets stochastically in order to increase the network lifetime and decrease the packet loss under the flooding algorithm. The proposed EEPR algorithm adopts energy-efficient probabilistic control by simultaneously using the residual energy of each node and ETX metric in the context of the typical AODV protocol. In the simulations, we verify that the proposed algorithm has longer network lifetime and consumes the residual energy of each node more evenly when compared with the typical AODV protocol.

15 May 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
DRDara Ron
Dara Ron
CLChan-Jae Lee
Chan-Jae Lee
KLKisong Lee
Kisong Lee
Hyun-Ho ChoiHyun-Ho Choi
Hyun-Ho Choi
JLJung-Ryun Lee
Jung-Ryun Lee
Low Power Wide Area (LPWA) networks has been proposed to satisfy the features of massive machine-type communication (mMTC) of Internet of Things (IoT) networks with large number of end-devices, such as low data rates, high network scalability, wide area coverage, and delay tolerance with very low energy cost. The LoRa wide area network (LoRaWAN) is one of the leading technologies among LPWA networks and supports three types of medium access control (MAC) options: class A, class B, and class C, each of which are used to address different needs of various applications. Specifically, Class B is designed to reduce downlink frame transmission delay while the end-device maintains a relatively low energy consumption. In this paper, we propose an analytical model of LoRaWAN class B mode, focusing on the delay, the data throughput, and the energy consumption for downlink frame transmission using M/G/1 queueing model. Based on the analytical model, a cost function considering both the average waiting time of the frame in the gateway and the average energy consumption of an end-device is proposed. Using the cost function, we derive the optimal number of ping-slots which maximizes the value of the cost function. Results show the trade-off relation between the waiting time of the frame in the gateway and the energy consumption of an end-device, and it is verified that the optimal number of ping-slots increases as the traffic density increases.

3 November 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
JPJaesung Park
Jaesung Park
YKYoungjae Kim
Youngjae Kim
JLJung-Ryun Lee
Jung-Ryun Lee
Mobility load balancing (MLB) aims to resolve the mismatch between the distribution of network resources and the traffic demands. In this paper, we identify two key policies that characterize jointly an MLB method and propose algorithms for them to stabilize a network and increase the resource efficiency of a network. We adopt the synchronization model observed in nature to devise the first policy called a load assignment policy which determines the amount of loads tradable among cells. We design the second policy called a target selection policy by using the matching theory with preferences to determine the optimal pairs of user equipments (UEs) and their new serving cells when the UEs in an overloaded cell need to be handed over to its neighboring cells. Through mathematical analysis, we show the stability and the optimality of the proposed MLB method. We also show through simulation studies that the proposed method can distribute loads among cells more evenly than the conventional methods, which increases the total network throughput and the quality of service (QoS) provided to UEs.

10 February 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
KLKisong Lee
Kisong Lee
JLJung-Ryun Lee
Jung-Ryun Lee
Hyun-Ho ChoiHyun-Ho Choi
Hyun-Ho Choi
In this paper, we consider a wireless-powered network with co-channel interference where the transmitters control their transmit power and receivers harvest wireless energy using a time switching policy. Considering the interference channels among multiple nodes, we jointly optimize the transmit power and energy harvesting time to maximize the energy efficiency of the network. To solve this non-convex optimization problem, we first design an iterative algorithm based on a typical optimization technique, and then, propose a learning algorithm based on a neural network with a proper loss function. Simulation results show that the proposed learning algorithm can achieve a near-optimal energy efficiency with reducing the computational complexity, compared to an iterative algorithm with a suboptimal performance.

4 January 2018 in Sensors
Verified
Journal Article
Open access
PDF file
JJJi-Young Jung
Ji-Young Jung
DSDong-Yoon Seo
Dong-Yoon Seo
JLJung-Ryun Lee
Jung-Ryun Lee
A wireless sensor network (WSN) is emerging as an innovative method for gathering information that will significantly improve the reliability and efficiency of infrastructure systems. Broadcast is a common method to disseminate information in WSNs. A variety of counter-based broadcast schemes have been proposed to mitigate the broadcast-storm problems, using the count threshold value and a random access delay. However, because of the limited propagation of the broadcast-message, there exists a trade-off in a sense that redundant retransmissions of the broadcast-message become low and energy efficiency of a node is enhanced, but reachability become low. Therefore, it is necessary to study an efficient counter-based broadcast scheme that can dynamically adjust the random access delay and count threshold value to ensure high reachability, low redundant of broadcast-messages, and low energy consumption of nodes. Thus, in this paper, we first measure the additional coverage provided by a node that receives the same broadcast-message from two neighbor nodes, in order to achieve high reachability with low redundant retransmissions of broadcast-messages. Second, we propose a new counter-based broadcast scheme considering the size of the additional coverage area, distance between the node and the broadcasting node, remaining battery of the node, and variations of the node density. Finally, we evaluate performance of the proposed scheme compared with the existing counter-based broadcast schemes. Simulation results show that the proposed scheme outperforms the existing schemes in terms of saved rebroadcasts, reachability, and total energy consumption.

20 August 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
DRDara Ron
Dara Ron
JLJung-Ryun Lee
Jung-Ryun Lee
Device-to-device (D2D) communication affords the benefits of improved network spectral efficiency, throughput, energy efficiency, and delay performance. However, D2D communication underlaid cellular uplinks are degraded by interference between D2D user equipment (DUE) and cellular user equipment (CUE) that use the same frequency band. In this context, researchers have proposed the optimization of the transmit power of the devices to mitigate interference. This power allocation problem is generally modeled as a NP-hard combinatorial optimization problem with linear constraints; therefore, traditional optimization methods are ineffective in addressing the problem. In this paper, we apply a deep reinforcement learning (DRL) algorithm to optimize the transmit power for both DUEs and CUEs in the context of D2D communication underlaid uplink cellular networks, which can solve the optimization problem via optimal decision-making together with efficient deep network training. Our simulation results show that the proposed algorithm affords a near-global-optimum solution with lower computation complexity than exhaustive search, and outperforms the fixed-power, weighted minimum mean square error (WMMSE), gradient descent method, and Newton-Raphson approaches.