• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.5
• /
• pp.75-82
• /
• 2021

The number of traffic accidents is about 230,000, and due to non-recurring congestion and high driving speed, the number of deaths per traffic accident on freeways is more than twice compared to other roads. Currently, traffic information is provided based on nodes and links using the centerline of the road, but it does not provide detailed speed information. Recently, installing sensors for vehicles to monitor obstacles and measure location is becoming common not only for autonomous vehicles but also for ordinary vehicles as well. The analysis using large-capacity location-based data from such sensors enables real time service according to processing speed. This study presents an mapping method for individual vehicle data analysis based on space. The processing speed of large-capacity data was increased by using method which applied a quaternary notation basis partition method that splits into two directions of longitude and latitude respectively. As the space partition was processed, the average speed was similar, but the speed standard deviation gradually decreased, and decrease range became smaller after 9th partition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1706-1712
• /
• 2022

Recently, the safety of chemical substances has gained attention due to incidents occurring in petrochemical industrial complexes, such as gas leaks and fires. In particular, industrial complexes in Ulsan and Yeosu (South Korea) are valuable as they significantly contribute to the petrochemical industry, but accidents may occur due to chemical leakage. Therefore, in this study, sensor nodes are configured at an interval of 20 [m] based on outdoor facilities standards to respond to chemical accidents, and exposure consideration of 8 h (TWA) and 15 min (STEL) are proposed in TLVs. The proposed system pre-processes data collected in multi-hop communication at a cycle of 0.6-0.75 [s] using Python and stores it in the MySQL database through SQL and a real-time remote monitoring system that updates the stored data once every 5 s is implemented by linking MySQL and Grafana.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1197-1206
• /
• 2023

To assess the risk level of a public restroom implemented in virtual reality, we sought to evaluate the spatial elements present in the restroom. To provide the theoretical foundation for the evaluation subjects and criteria, we introduced prior research that proposed a checklist to entance the safety of public restroom. To set up evaluation criteria, we analyzed and established based on the theories of Paul J. Brantingham and Patricia L. Brantingham, focusing on the interaction between space and criminals. Ronald V. Clarke's "Routine Activity Theory" was also introduced and incorporated into the evaluation approach. We analyzed based on the correlation between the criminal, user, and spatial elements of the public restroom in terms of the criminal's actions, the spatial relevance to crime, and user exposure during use. Using these criteria, we developed an algorithm to evaluate th spatial elements of public restroom. Based on this, we created an application, demonstrating the feasibility of developing on evaluation tool.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.2
• /
• pp.856-865
• /
• 2012

Maintenance systems are demanded to manage malodor-information and deal effectively with the odor-related civil complaints by constructing the database for sources of malodor compounds in real time. In this paper, to carry out these tasks, a real-time monitering system for malodor based on ubiquitous sensor networks(USN) is presented. The constructed monitering system stores the malodor data collected periodically from industrial complex into the database and shows in real time the circumstances of the odor sources being emitted around the industrial complex by indicating on the map where it is taking place. Besides, by clicking an icon indicating the sensor node on the map, we can figure out what firms are located near the malodor source and possible material related with those firms. The proposed system is considered to enhance the efficiency of management of malodor-emitting firms based on the malodor-related information.

• Journal of Korean Society of Transportation
• /
• v.28 no.6
• /
• pp.167-177
• /
• 2010

This study proposes a methodology for assessing the improvement of network connectivity of transport hubs. Extending a previously developed model that measures the connectivity of a node in transportation networks, we define two quantities called the supplied connectivity and the experienced connectivity. Using these quantities, we provide a systematic procedure for analyzing the network connectivity of a transport hub and also suggest criteria for determining whether a given project is effective in improving the network connectivity of the transport hub. The application of the methodology to a test site produces reasonable results, and as such it is expected that the methodology can be used for various transport hubs in the national road network. Once enough data from the application of the methodology are accumulated, a further study on the level of service in terms of network connectivity needs to be followed.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.143-152
• /
• 2009

IEEE 802.11 WLANs provide multiple transmission rates to improve the system throughput by adapting the transmission rate to the current wireless channel conditions. Many rate adaptation schemes have been proposed because IEEE 802.11 standard does not contain any specifications for the rate adaptation scheme. In this paper, in order to overcome limitations of the previous research, we propose a new rate adaptation scheme called SARA(Sender-oriented Automatic Rate Adaptation). The SARA scheme, a proposed rate adaptation scheme, appropriately adjusts the data transmission rate based on the estimated wireless channel conditions, specifically the measured RSSI at the sender-side. Moreover it continuously updates the thresholds for selecting the transmission rate and selectively enforces the RTS/CTS exchanges to adapt the changes in the wireless channel conditions. Through the performance evaluations, we prove that the SARA scheme overcomes the limitations of the previous research and improves the wireless link utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.78-85
• /
• 2004

Given a set S of n points in the plane, a minimum-diameter spanning tree(MDST) for the set might have a degree up to n-1. This might cause the degradation of the network performance because the node with high degree should handle much more requests than others relatively. Thus it is important to construct a spanning tree network with small degree and diameter. This paper presents an algorithm to construct a spanning tree for S satisfying the following four conditions: (1) the degree is controled as an input, (2) the tree diameter is no more than constant times the diameter of MDST, (3) the tree is monotone (even if arbitrary point is fixed as a root of the tree) in the sense that the Euclidean distance from the root to any node on the path to any leaf node is not decreasing, and (4) there are no crossings between edges of the tree. The monotone property will play a role as an aesthetic criterion in visualizing the tree in the plane.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.40-44
• /
• 2009

Data-centric storage schemes(DCS) are one of representative researches that efficiently store and manage sensor readings in sensor nodes in the sensor networks. In DCS, a sensor sends the sensed data to a specific node in order to store them. However, it has a problem that sensor nodes consume a lot of energy for transmitting their readings to remote sensor node. In this paper, we propose a novel sensor data compression algorithm to reduce communication costs. The proposed algorithm does not transmit all the sensed data and establishes a safe region. It transmits the sensed data only when current measurement is out of the safe region, As a result, the propposed algorithm extends network life time and reduces data transmission. It is shown through performance evaluation that our proposed algorithm reduces energy consumption by about 60% over the conventional algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1589-1598
• /
• 2014

To support the WBAN, IEEE 802.15 Task Group 6 announced standardized documents on technical requirements of the PHY and MAC. In the IEEE 802.15.6 MAC protocol, CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) algorithm is performed based on the eight-level priorities according to the type of traffics of the periodic data from medical sensor nodes. Several nodes, which detected the changed bio signals, transmit emergency data at the same time, so latency could be higher than emergency latency and energy consumption will increase. In this thesis, we proposed a CSMA/CA algorithm in WBAN to solve these problems. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2035-2046
• /
• 2015

Recently, researches on resource allocation algorithms operating in a distributed way are widely conducted because of the increasing number of network nodes and the rapidly changing the network environment. In this paper, we propose Multi-Hop DESYNC(MH DESYNC), that is bio-inspired TDMA-based resource allocation scheme operating in a distributed manner in multi-hop networks. In this paper, we define a frame structure for the proposed MH DESYNC algorithm and firing message structure which is a reference for resource allocation and propose the related operating procedures. We show that MH DSYNC can resolve the hidden-node problem effectively and verify that each node shares resources fairly among its neighboring nodes. Through simulation evaluations, it is shown that MH DESYNC algorithm works well in a multi-hop networks. Furthermore, results show that MH DESYNC algorithm achieves better performance than CSMA/CA algorithm in terms of throughput.