Joohyun Oh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Joohyun Oh has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Ananya Sen
Heinz College, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
3 shared publications Jorge Guzman
3 shared publications- Jiseung Youn
Major in Bio-Artificial Intelligence, Department of Computer Science and Engineering, Hanyang University, Ansan 15588, Republic of Korea
2 shared publications - Joohan Park
Spatial Wireless Networking Research Section, Electronics and Telecommunications Research Institute (ETRI), 34129, South Korea
2 shared publications - Seyoung Ahn
Department of Computer Science and Engineering, Hanyang University, Ansan, Republic of Korea
2 shared publications - Soohyeong Kim
Major in Bio-Artificial Intelligence, Department of Computer Science and Engineering, Hanyang University, Ansan 15588, Republic of Korea
2 shared publications
Latest Publications
- 14 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (23) , 20442-20457
Random Access Protocol for Massive Internet of Things Connectivity in Space–Air–Ground-Integrated Networks
Space-air-ground integrated networks (SAGIN) are receiving a lot of attention as a candidate for an extension to non-terrestrial networks beyond the limit of terrestrial networks. SAGIN can be a means to satisfy various quality-of-service (QoS) by providing several communication links in different characteristics. To fully utilize the advantage of SAGIN, a protocol for informing user equipment (UE) of an appropriate base station layer of SAGIN is needed according to QoS requirements. In addition, the development of the protocol should consider the characteristics of the UE. In particular, when the UE is a machine-type communication device (MTCD) constituting a massive internet of things network, random access congestion issue should be considered. To solve the problems, we propose a random access protocol. We propose an indicator named virtual deadline indicator (VDI) to inform MTCD which layer to try for random access. MTCD attempts random access to one layer of SAGIN by comparing the remaining deadlines of traffic and the point of the VDI. To minimize the deadline expiration rate, we propose an algorithm to shift the VDI position. The base station estimates the number of the MTCDs and remaining deadline distribution by using the number of the idle preambles to find the VDI location. Finally, we compare the performance of the protocol through simulation with three benchmark schemes. We confirm that the proposed protocol reduces the deadline expiration rate without compromising the age of information and energy efficiency.
- 14 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (23) , 20442-20457
Random Access Protocol for Massive Internet of Things Connectivity in Space–Air–Ground-Integrated Networks
Space-air-ground integrated networks (SAGIN) are receiving a lot of attention as a candidate for an extension to non-terrestrial networks beyond the limit of terrestrial networks. SAGIN can be a means to satisfy various quality-of-service (QoS) by providing several communication links in different characteristics. To fully utilize the advantage of SAGIN, a protocol for informing user equipment (UE) of an appropriate base station layer of SAGIN is needed according to QoS requirements. In addition, the development of the protocol should consider the characteristics of the UE. In particular, when the UE is a machine-type communication device (MTCD) constituting a massive internet of things network, random access congestion issue should be considered. To solve the problems, we propose a random access protocol. We propose an indicator named virtual deadline indicator (VDI) to inform MTCD which layer to try for random access. MTCD attempts random access to one layer of SAGIN by comparing the remaining deadlines of traffic and the point of the VDI. To minimize the deadline expiration rate, we propose an algorithm to shift the VDI position. The base station estimates the number of the MTCDs and remaining deadline distribution by using the number of the idle preambles to find the VDI location. Finally, we compare the performance of the protocol through simulation with three benchmark schemes. We confirm that the proposed protocol reduces the deadline expiration rate without compromising the age of information and energy efficiency.
- Open Access
CeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
With the growing interest in the Internet of Things (IoT), research on massive machine-type communication (mMTC) services is being actively promoted. Because mMTC services are required to serve a large number of devices simultaneously, a lack of resources during initial access can be a significant problem when providing mMTC services in cellular networks. Various studies on efficient preamble transmission have been conducted to solve the random access problem of mMTC services. However, supporting a large number of devices simultaneously with limited resources is a challenging problem. In this study, we investigate code-expanded random access (CeRA), which extends the limited preamble resources to the code domain to decrease the high collision rate. To solve the existing CeRA phantom codeword and physical uplink shared channel (PUSCH) resource shortage problems, we propose an optimal preamble codeword set selection algorithm based on mathematical analysis. The simulation results indicate that the proposed code-expanded random access scheme to enhance success probability (CeRA-eSP) achieves a higher random access success rate with a lower access delay compared to the existing random access schemes.
Open AccessCeRA-eSP: Code-Expanded Random Access to Enhance Success Probability of Massive MTC
With the growing interest in the Internet of Things (IoT), research on massive machine-type communication (mMTC) services is being actively promoted. Because mMTC services are required to serve a large number of devices simultaneously, a lack of resources during initial access can be a significant problem when providing mMTC services in cellular networks. Various studies on efficient preamble transmission have been conducted to solve the random access problem of mMTC services. However, supporting a large number of devices simultaneously with limited resources is a challenging problem. In this study, we investigate code-expanded random access (CeRA), which extends the limited preamble resources to the code domain to decrease the high collision rate. To solve the existing CeRA phantom codeword and physical uplink shared channel (PUSCH) resource shortage problems, we propose an optimal preamble codeword set selection algorithm based on mathematical analysis. The simulation results indicate that the proposed code-expanded random access scheme to enhance success probability (CeRA-eSP) achieves a higher random access success rate with a lower access delay compared to the existing random access schemes.