• Biomedical Science Letters
• /
• v.28 no.4
• /
• pp.317-321
• /
• 2022

Due to COVID-19 pandemic, wearing face masks is obligatory to prevent respiratory virus transmissions in the community. However, there are few studies of the desirable number of wearing a face mask, and how to store them for reuse. Therefore, in this study, a survey was conducted among 208 healthy adults, and 27 kf-94 masks worn for 1, 2, and 3 days were collected. To estimate the risk of bacterial contamination, we analyzed the extent of bacterial contamination of the BHI medium and 16S rRNA gene sequencing. With an increase in the number of days of using the mask, the degree of bacterial contamination of the used mask gradually increased. As a result of 16S rRNA PCR performed for strain identification, Staphylococcus, known as a pathogenic bacterium, was identified the most. In conclusion, we found that wearing a cotton KF mask provides an optimal environment for microbes, which are related to the skin and respiratory system, to thrive. Therefore, it is also important to reduce the risk of bacterial infection of the face mask with appropriate sterilization methods.

• Journal of Biosystems Engineering
• /
• v.43 no.4
• /
• pp.320-330
• /
• 2018

Purpose: The aim of this study was to investigate the harvesting performance of a prototype small combine for buckwheat and adlay. Methods: The prototype small combine was designed and constructed. Its ratio of grain loss, ratio of output components in the grain outlet, and field capacity for harvesting buckwheat and adlay were analyzed through field tests. Results: The prototype small combine required a working width of about 0.6 to 0.7 m to harvest buckwheat. The maximum travel speed was about 0.36 m/. The total ratio of grain loss was about 21.6%, which consisted of 8.8% at the header and 12.8% at the dust outlet. The grain and the material other than grain (MOG) ratios at the grain outlet were 94.1% and 5.9% respectively. In the case of adlay harvest, the maximum working width was about 1.2 m, that is, two rows. The range of maximum travel speed was about 0.45 to 0.46 m/s. When adlay was harvested in one row, the total ratio of grain loss ranged from 36.3 to 42.8% according to the cutting height. The cutting height of 30 cm resulted in a higher total ratio of grain loss than 60 cm and 90 cm. When the cutting height was 60 cm, there was no significant change in the total ratio of grain loss according to the number of working rows and the stage of the primary transmission shift. The total ratio of grain loss ranged from 35.2 to 37.7%. The grain and the MOG ratios at the grain outlet ranged from 93.1 to 95.8% and from 4.2 to 6.9%, respectively. No significant difference was observed in relation to cutting height, number of working rows, and the stage of the primary transmission shift. Conclusions: The prototype small combine for harvesting miscellaneous cereal crops showed good potential for the efficient harvesting of buckwheat and adlay. However, to improve the harvesting performance, there seems to be a need to develop new crop varieties suitable for machine-based harvesting and improve the transmissions, reels, separation/cleaning systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1086-1094
• /
• 2020

AThis paper measured real sea area for performance analysis according to distance from west sea and south sea of Korea. The performance of the underwater OFDM system was analyzed by comparing the performance of the West and South Seas by adjusting the number of data repetitive transmissions and the pilot symbol placement interval parameters based on the real-sea data measured from the distance and Data rate of the West and South Sea vessels. In conclusion, when comparing the performance of the South Sea at the Data rate and distance, the BER performance of the South Sea was similar at the 5 km South Sea and 1 km West Sea under the same conditions. Placement interval of pilot symbol at 10 km of South Sea and 3 km of West Sea is (𝚫f, 𝚫t) = (6, 3) and the number of times the PRB is (R_f, R_t) = (2, 1) repeated. We confirmed that we can send high data over long distances in the South Sea.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.830-835
• /
• 2006

Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1001-1009
• /
• 2016

In LTE networks, the base station transmits control information over the physical downlink control channel (PDCCH) including scheduling grants, which are used to indicate the resources that the user equipment uses to send data to the base station. Because the size of the PDCCH message and the number of the PDCCH transmissions increase in proportion to the number of user equipments, the overhead of the PDCCH may cause serious network congestion problems in the narrowband LTE (NB-LTE) system. This paper proposes the compact PDCCH information bit allocation to reduce the size of the PDCCH message and evaluates the performance of the semi-persistent scheduling (SPS) in the NB-LTE system. The simulation results show that the SPS can significantly reduce the signaling overhead of the PDCCH and therefore increase the system utilization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.721-727
• /
• 2016

In this paper, in order to resolve the problem of reduction for D2D (device to device) advertisement dissemination efficiency of conventional dissemination algorithms, we here propose several clustering algorithms (modified single linkage algorithm (MSL), K-means algorithm, and expectation maximization algorithm with Gaussian mixture model (EM)) based advertisement dissemination algorithms to improve advertisement dissemination efficiency in D2D communication networks. Target areas are clustered in several target groups by the proposed clustering algorithms. Then, D2D advertisements are consecutively distributed by using a routing algorithm based on the geographical distribution of the target areas and a relay selection algorithm based on the distance between D2D sender and D2D receiver. Via intensive MATLAB simulations, we analyze the performance excellency of the proposed algorithms with respect to maximum number of relay transmissions and D2D user density ratio in a target area and a non-target area.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.15-25
• /
• 2003

Wireless ad-hoc networks are only composed with mobile devices. Unlike the traditional wired networks, those devices are mostly operated with battery power. Since the battery-operated power is limited, the efficient energy resource managements becomes an important issue in wireless ad-hoc networks and various studies that considered these characteristics are progressed. One of those studies is an energy efficient routing using coordinators. In this method. only devices elected as coordinator participate in data transmissions in ad-hoc networks, while other devices remain in sleep node. The overall energy consumption of a system can be reduced. In order to minimize energy consumption of a total network, previous results try to maximize the number of nodes in sleep mode. However, minimizing the number of coordinators does not ensure to increase the system lifetime. In this thesis, we propose an algorithm that can elect coordinators with considering the amount of necessary energy to transmit assigned data and a connectivity of nodes in the networks. The result of proposed coordinator election algorithm can increase the system lifetime of an Ad-hoc network from the results of existing coordinator election algorithms.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.2
• /
• pp.1-13
• /
• 2014

In IEEE 802.11p/1609-based vehicular networks, vehicles are allowed to exchange safety and control messages only within time periods, called control channel (CCH) interval, which are scheduled periodically. Currently, the length of the CCH interval is set to the fixed value (i.e. 50ms). However, the fixed-length intervals cannot be effective for dynamically changing traffic load. Hence, some protocols have been recently proposed to support variable-length CCH intervals in order to improve channel utilization. In existing protocols, the CCH interval is subdivided into safety and non-safety intervals, and the length of each interval is dynamically adjusted to accommodate the estimated traffic load. However, they do not consider the presence of hidden nodes. Consequently, messages transmitted in each interval are likely to overlap with simultaneous transmissions (i.e. interference) from hidden nodes. Particularly, life-critical safety messages which are exchanged within the safety interval can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning. In this paper, we therefore propose a new interference-aware Dynamic Safety Interval (DSI) protocol. DSI calculates the number of vehicles sharing the channel with the consideration of hidden nodes. The safety interval is derived based on the measured number of vehicles. From simulation study using the ns-2, we verified that DSI outperforms the existing protocols in terms of various metrics such as broadcast delivery ration, collision probability and safety message delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10A
• /
• pp.727-735
• /
• 2009

To alleviate positioning error using wireless ultra-wideband (UWB) is primary concern, and it has been studied how to reduce the positioning error effectively. Thanks to many repeated transmissions of UWB signals, we can have a variety of selections to point out the most precise positioning result. Towards this, scanning method has been preferred to be used due to its simplicity. This exhaustive method firstly fixes the candidate position, and calculates the sum of distances from observed positions. However, it has tremendous number of computations, and the complexity is more serious if the size of two-dimensional range is the larger. To mitigate the large number of computations, this paper proposes the technique employing genetic algorithm and block windowing. To exploit its superiority, simulations will be conducted to show the reduction of complexity, and the efficiency on positioning capability.