• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1056-1059
• /
• 2003

Self-Oranizing Map(SOM) is an unsupervised neural network providing cluster analysis of high dimensional input data. The output from the SOM is represented in map that help us to explore data. The weak point of conventional SOM is when the map is large, it take a long time to train the data. The computing time is known to be O(MN) for trainning to find the winning node (M,N are the number of nodes in width and height of the map). This paper presents a new method to reduce the computing time by creating new map. Each node in a new map is the centroid of nodes' group that are in the original map. After create a new map, we find the winning node of this map, then find the winning node in original map only in nodes that are represented by the winning node from the new map. This new method is called "High Speed Self-Oranizing Map"(HS-SOM). Our experiment use HS-SOM to cluster documents and compare with SOM. The results from the experiment shows that HS-SOM can reduce computing time by 30%-50% over conventional SOM.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.10
• /
• pp.51-58
• /
• 2020

The DDS discovery is a behind-the-scenes way in which DDS objects on different nodes find out each other in a same domain. If the DDS discovery takes a long time, the preparation time for DDS communication is also delayed. And if the DDS discovery between several nodes fails, DDS communication between nodes related to them would be also failed. This problems can be a big cause of overall system performance degradation. Therefore, the improvement of performance for the DDS discovery gives the effect that improves the performance of the entire system. In this paper, I propose an efficient new method which improves the performance and reduces the time of DDS discovery. I simulate both the origin and the new proposed method for DDS discovery, and I compare the result of performance. This result will help for improving a DDS discovery in a large-scale system.

• Journal of the Korean Society of Industry Convergence
• /
• v.10 no.2
• /
• pp.105-113
• /
• 2007

Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of application. Sensor position is used for its data to be meaningful and for energy efficient data routing algorithm especially geographic routing. The previous works for sensor localization utilize global positioning system(GPS) or estimate unknown-location nodes position with help of some small reference nodes which know their position previously. However, the traditional localization techniques are not well suited in the senor network for the cost of sensors is too high. In this paper, we propose the sensor localization method with a mobile robot, which knows its position, moves through the sensing field along pre-scheduled path and gives position information to the unknown-location nodes through wireless channel to estimate their position. We suggest using the sensor position estimation method and an efficient mobility path model. To validate our method, we carried out a computer simulation, and observed that our technique achieved sensor localization more accurately and efficiently than the conventional one.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.373-376
• /
• 2008

Wireless sensor networks consist of thousands of sensor nodes that have low power, low footprint and low computational capacities. So the burning issues in the design and deployment of these sensor nodes in the practical application areas include the energy conservation and network lifetime. Efficient routing schemes can help reduce the energy consumption and thus increase the network lifetime. This paper deals with the comparative analysis of popular routing protocols such as LEACH, LEACH-C, MTE, and PEGASIS. The protocols are compared by using performance me tries such as system lifetime, the time for first node death, and total system energy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1481-1501
• /
• 2019

In opportunistic network, the behavior of a node is autonomous and has social attributes such as selfishness.If a node wants to forward information to another node, it is bound to be limited by the node's own resources such as cache, power, and energy.Therefore, in the process of communication, some nodes do not help to forward information of other nodes because of their selfish behavior. This will lead to the inability to complete cooperation, greatly reduce the success rate of message transmission, increase network delay, and affect the overall network performance. This article proposes a hybrid incentive mechanism (Mim) based on the Reputation mechanism and the Credit mechanism.The selfishness model, energy model (The energy in the article exists in the form of electricity) and transaction model constitute our Mim mechanism. The Mim classifies the selfishness of nodes and constantly pay attention to changes in node energy, and manage the wealth of both sides of the node by introducing the Central Money Management Center. By calculating the selfishness of the node, the currency trading model is used to differentiate pricing of the node's services. Simulation results show that by using the Mim, the information delivery rate in the network and the fairness of node transactions are improved. At the same time, it also greatly increases the average life of the network.

• International journal of advanced smart convergence
• /
• v.3 no.2
• /
• pp.1-5
• /
• 2014

Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

• Journal of Korean Society of Forest Science
• /
• v.96 no.5
• /
• pp.510-514
• /
• 2007

The main purpose of this study was to develop Mountain Search and Rescue System for enhancing search and rescue operations in the mountains. This study also focused on presenting an alternative to using a cellular phone for requesting rescue due to their unreliability in remote areas. This system is designed to help in the search and rescue of people in emergency situations in the mountains. It is composed of buzzer sensors, environmental information sensors, and a statistical analysis program. A key feature of this system is that it does not require an infrastructure of internet or CDMA networks for its operation in the mountains. The measure for the study was conducted by using a zigbee protocol analyzer, RF module and 433MHz Helical antenna to analyze the rate of data reception in relation to the distance between nodes. This system is applicable to mountains provided the distance between nodes is over 100 m and under 150 m.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.433-435
• /
• 2007

Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.55-62
• /
• 2017

In this paper, we proposes a multi-ring based mobile sink location scheme for solar-powered wireless sensor network (WSN). The proposed scheme maintains the multi-rings in which nodes keep the current location of sink node. With the help of nodes in multi-rings, each node can locate the sink node efficiently with low-overhead. Moreover, because our scheme utilizes only surplus energy of a node, it can maintain multiple rings without degrading any performance of each node. Experimental results show that the proposed scheme shows much better latency and scalability with lower energy-consumption than the existing single-ring based scheme.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.39-42
• /
• 2003

Due to the highly dynamic topology and absence of any fixed infrastructure, stability of selected path in Ad Hoc Networks is of prime importance. The frequent route failure and high control overhead in routing protocol consumes system resources and lead to degraded system performance. In this paper we present route stability metrics reflectting relative position and velocity of nodes, which help determine a stable route.