• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.233-234
• /
• 2007

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1661-1670
• /
• 2016

In this paper, we present a risk prediction system and customized evacuation pathfinding algorithm in fire scenarios. For the risk prediction, we apply a multi-level clustering mechanism using collected temperature at sensor nodes throughout the network in order to predict the temperature at the time that users actually evacuate. Based on the predicted temperature and its reliability, we suggest an evacuation pathfinding algorithm that finds a suitable evacuation path from a user's current location to the safest exit. Simulation results based on FDS(Fire Dynamics Simulator) of NIST for a wireless sensor network consisting of 47 stationary nodes for 1436.41 seconds show that our proposed prediction system achieves a higher accuracy by a factor of 1.48. Particularly for nodes in the most reliable group, it improves the accuracy by a factor of up to 4.21. Also, the customized evacuation pathfinding based on our prediction algorithm performs closely with that of the ground-truth temperature in terms of the ratio of safe nodes on the selected path, while outperforming the shortest-path evacuation with a factor of up to 12% in terms of a safety measure.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.37-46
• /
• 2007

In wireless sensor networks, one of the most important goals of designing protocols is to extend the network lifetime. A node has lots of duplication in sensing and communication range with surrounding nodes after many of nodes are randomly scattered. Such a heavy duplication overhead affects on the network lifetime seriously so usually all nodes need not activated constantly to carry out sensing and communication operation. One of the optimal methods of prolonging the network lifetime is finding the number of surrounding nodes necessary to maintain the network coverage and connectivity. It has been studied till the current date in wireless networks. If the neighbor necessary can be acquired to satisfy the probability using the ideal number of neighbors necessary and the acquired number of neighbors m to guarantee network coverage and connectivity. We use the result that F. Xue et al and S. Song et al derive previously in finding the neighbor necessary to guarantee the network connectivity and cany out the computer simulation to verify the necessary number. We present that our scheme satisfy the network coverage and connectivity. We present the simulation results compared with constant probability scheme through computer simulation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.76-88
• /
• 2016

Machine to Machine (M2M) is a technology that presents communication between two or more devices with or without human intervention. M2M communications can be applied for various use cases such as environmental monitoring, health care, smart metering and etc. In most use cases, M2M utilizes sensor nodes to collect data from the intended environment and the data is transmitted back to M2M application through other devices (gateways, sink nodes). In some use cases, M2M devices are being designed to store and process sensor data for improving the reliability of the service; Gateways and sink nodes are also intended to store and process the gathered data from sensor nodes. This kind of approach is very challenging for both academy and industry. In order to enhance the performance of this approach, in this paper, we propose our Common Service Security Platform (CSSP) for M2M devices and gateways. CSSP platform presents solutions for the devices and gateways by making them operate more accurately and efficiently. Besides, we present a comparative analysis of communication protocols and present their performance in accordance with selected metrics.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.353-356
• /
• 2007

With advances in sensor technology, current researches on the pertinent techniques are actively directed toward the way which enables the USN computing service. For many applications using sensor networks, the incoming data are by nature characterized as high-speed, continuous, real-time and infinite. Due to such uniqueness of sensor data characteristics, for some instances a finite-sized buffer may not accommodate the entire incoming data, which leads to inevitable loss of data, and requirement for fast processing makes it impossible to conduct a thorough investigation of data. In addition to the potential problem of loss of data, incoming data in its raw form may exhibit high degree of complexity which evades simple query or alerting services for capturing and extracting useful information. Furthermore, as traditional mining techniques are developed to handle fixed, static historical data, they are not useful and directly applicable for analyzing the sensor data. In this paper, (1) describe how three mining techniques (sensor data outlier analysis, sensor pattern analysis, and sensor data prediction analysis) are appropriate for the USN middleware structure, with their application to the stream data in ocean environment. (2) Another proposal is a middleware structure based on USN environment adaptive to above mining techniques. This middleware structure includes sensor nodes, sensor network common interface, sensor data processor, sensor query processor, database, sensor data mining engine, user interface and so on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1735-1755
• /
• 2012

Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.253-270
• /
• 2013

To achieve accurate localization information, complex algorithms that have high computational complexity are usually implemented. In addition, many of these algorithms have been developed to overcome several limitations, e.g., obstruction interference in multi-path and non-line-of-sight (NLOS) environments. However, localization systems those have complex design experience latency when operating multiple mobile nodes occupying various channels and try to compensate for inaccurate distance values. To operate multiple mobile nodes concurrently, we propose a localization system with both low complexity and high accuracy and that is based on a chirp spread spectrum (CSS) radio. The proposed localization system is composed of accurate ranging values that are analyzed by simple linear regression that utilizes a Big-$O(n^2)$ of only a few data points and an algorithm with a self-calibration feature. The performance of the proposed localization system is verified by means of actual experiments. The results show a mean error of about 1 m and multiple mobile node operation in a $100{\times}35m^2$ environment under NLOS condition.

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.795-800
• /
• 2011

In this paper, to promote the production of agricultural products, it is goal to design and implement the growth environmental management monitoring system. Based on the IT convergence technology, it consists of four components such as sensor nodes to sense environmental factors, sink nodes to communicate with sensors, gateway to link sinknodes to monitoring system, and monitoring software. With monitoring process for temperature and humidity, we can obtain the bast growth environment to be maintained deviation value 10% for temperature and humidity.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.5
• /
• pp.538-547
• /
• 2015

The goal of this study is to develop an algorithm to propose optimal deployment of detection sensor nodes in the target area, based on a performance surface, which represents detection performance of active and passive acoustic sonar systems. The performance surface of the active detection system is calculated from the azimuthal average of maximum detection ranges, which is estimated with a transmission loss and a reverberation level predicted using ray-based theories. The performance surface of the passive system is calculated using the transmission loss model based on a parabolic equation. The optimization of deployment configurations is then performed by a hybrid method of a virtual force algorithm and a particle swarm optimization. Finally, the effectiveness of deployment configurations is analyzed and discussed with the simulation results obtained using the algorithm proposed in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1715-1722
• /
• 2010

In this paper we consider methods for selecting the next tracing node that take advantage of the history of traced positions during the packet-tracing. In the meantime, the proposed routing strategy that counters the tracing is to design the routing path is such a way that nodes on it are not close to the nodes whose location privacy is needed and zigzag or back-and-forth movements hardly take place. In simulations, the ratios of successful tracing were largely improved. It was shown that our routing scheme allows more data packets to be delivered to the destination while, enticing the tracer to move more long distances in the presence of multiple assets.