• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.801-808
• /
• 2010

LEACH, one of hierarchical based routing protocols, was proposed for energy efficiency which is the most important requirement of Wireless Sensor Network(WSN). LEACH protocol is composed of a cluster of certain large number of clusters, which have a cluster head and member nodes. Member nodes send sensing data to their cluster heads, and the cluster heads aggregate the sensing data and transmit it to BS. The challenges of LEACH protocol are that cluster heads are not evenly distributed, and energy consumption to transmit aggregated data from Cluster heads directly to BS is excessive. This study, to improve LEACH protocol, suggests LECEEP that transmit data to contiguity cluster head that is the nearest and not far away BS forming chain between cluster head, and then the nearest cluster head from BS transmit aggregated data finally to BS. According to simulation, LECEEP consumes less energy and retains more number of survival node than LEACH protocol.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.110-116
• /
• 2014

Pattern matching algorithms are widely used in computer security systems such as computer networks, ubiquitous networks, sensor networks, and so on. However, the advances in information technology causes grow on the amount of data and increase on the computation complexity of pattern matching processes. Therefore, there is a strong demand for a novel high performance pattern matching algorithms. In light of this fact, this paper newly proposes a suffix tree based pattern matching algorithm. The suffix tree is constructed based on the suffix values of all patterns. Then, the shift nodes which informs how many characters can be skipped without matching operations are added to the suffix tree in order to boost matching performance. The proposed algorithm reduces memory usage on the suffix tree and the amount of matching operations by the shift nodes. From the performance evaluation, our algorithm achieved 24% performance gain compared with the traditional algorithm named as Wu-Manber.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.115-122
• /
• 2011

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.213-216
• /
• 2007

The paper deals with a approach to underwater acoustic based Ad-hoc communication, which allows major design strategies for Media Access Control (MAC) within a group of the autonomous underwater vehicles(AUV). The proposed MAC aims at deploying AUV-centric star topology, which minimizes overhead of sensor nodes and improves energy-efficiency. Furthermore, that is also well under long and unknown propagation delays of the underwater acoustic medium. The implemented MAC protocol makes it easier to achieve frame synchronization than TDMA due to deploying localized schedule time, in addition to saving energy consumption by letting nodes sleep. It is also superior to MACA and MACAW in terms of propagation delay. This scalable centralized protocol has the potential to serve as a primer for development of MAC protocol for future underwater acoustic based ad-hoc networks.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.153-158
• /
• 2008

The technology of Software Defined Radio (SDR) is a possible solution to interwork flexibly between various wireless transport protocols. Ubiquitous network, like u-health service network, includes sensor devices or nodes which do not facilitate all the same transport protocols to access network. As such this may be in such unreachable situations as poverty of all required AP (Access Point)’s, faults or contention in a path of particular protocol communication, etc. This paper presents research results of modeling and simulation to analyze transport performance of multi-protocol ubiquitous network which includes SDR-based interwork nodes and congestion-controlled AP’s. Focusing mainly on dynamics of overall transport performance rather than protocol execution procedures, this paper employs the Zeigler’s DEVS (Discrete Event Systems Specification) methodology and DEVSim++simulation environment to experiment.

• 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.

• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2014

Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.81-90
• /
• 2014

For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.66 no.5
• /
• pp.1-13
• /
• 2024

In this study, we applied an on-site diagnostic method for estimating the structural safety of a plastic greenhouse. A three-dimensional light detection and ranging (3D LiDAR) sensor was used to scan the greenhouse to extract point cloud data (PCD). Differential thresholds of the color index were applied to the partitions of raw PCD to separate steel frames from plastic films. Additionally, the K-means algorithm was used to convert the steel frame PCD into the nodes of unit members. These nodes were subsequently transformed into structural shape data. To verify greenhouse shape reproducibility, the member lengths of the scan and blueprint models were compared with the measurements along the X-, Y-, and Z-axes. The error of the scan model was accurate at 2%-3%, whereas the error of the blueprint model was 5.4%. At a maximum snow depth of 0.5 m, the scan model revealed asymmetric horizontal deflection and extreme bending stress, which indicated that even minor shape irregularities could result in critical failures in extreme weather. The safety factor for bending stress in the scan model was 18.7% lower than that in the blueprint model. This phenomenon indicated that precise shape estimation is crucial for safety diagnostic. Future studies should focus on the development of an automated process based on supervised learning to ensure the widespread adoption of greenhouse safety diagnostics.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.213-222
• /
• 2017

The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.