• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.3
• /
• pp.332-337
• /
• 2016

The rapid reconstruction of a transfer path is caused by frequent secession of nodes in many applications using overlay multicast. For this, however, many studies have been proposed, but a study of fast path recovery is required. This paper proposes a new method for fast path recovery to improve the path reconstruction time and for stable path maintain caused by the sudden secession of the parent node on overlay multicast. The proposed method uses the virtual transfer path and the candidate parent node for the fast path recovery. All nodes exchange periodically the RTT (Round Trip Time) information between the other nodes of similar position itself and neighboring node. All nodes have a candidate parent node list, and each node stores the exchanged RTT information on the list. Each node constructs the virtual transfer path to reduce the recovery time after deciding a candidate parent node that is one of them by the RTT order. In this way, when the parent node is seceded, all nodes can recover the transfer path quickly using the virtual transfer path. The simulation result showed that the recovery time of the proposed method is an average 30% faster than the known method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.10
• /
• pp.5156-5161
• /
• 2013

In distributed spatial data stream processing, processed tuples of downstream nodes are replicated to the upstream node in order to increase the utilization of distributed nodes and to recover the whole system for the case of system failure. However, while the data input rate increases and multiple downstream nodes share the operation result of the upstream node, the data which stores to output queues as a backup can be lost since the deletion operation delay may be occurred by the delay of the tuple processing of upstream node. In this paper, the adaptive upstream backup scheme based on operation throughput in distributed spatial data stream system is proposed. This method can cut down the average load rate of nodes by efficient spatial operation migration as it processes spatial temporal data stream, and it can minimize the data loss by fluid change of backup mode. The experiments show the proposed approach can prevent data loss and can decrease, on average, 20% of CPU utilization by node monitoring.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.190-193
• /
• 2009

The most essential element in wireless sensor network is wireless sensor node which collects environmental information and transmits it to the user application systems. Recently, due to the technological advancement, wireless sensor nodes are become smaller, more intelligent and less power consuming. Especially, SoC(System-on-Chip) technology, which unifies the MCU, RF module, memory and other element inside one chip, plays an important part for miniaturization of sensor node, hence reduces the manufacturing expenses. In this paper, we have designed a miniaturized wireless sensor node for wireless sensor network using commercial SoC technology and discussed about some application scenario and additional considerations.

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

In this paper, we study the problem of designing the power and number of cooperative node (CN) in the cooperation phase to maximize the average throughput for secondary user (SU), under the constraint of the total cooperation and transmission power. We first investigate the scheme of cooperative spectrum sensing without a separated control channel. Then, we prove that there indeed exist an optimal CN power when the number of CNs is fixed and an optimal CN number when CN power is fixed. The case without the constraints of the power and number of CN is also studied. Finally, numerical results demonstrate the characteristics and existences of optimal CN power and number. Meanwhile, Monte Carlo simulation results match to the theoretical results well.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3472-3480
• /
• 2010

The Clustering technology of Energy efficiency wireless sensor network gets the energy efficiency by reducing the number of communication between sensor nodes and sink node. In this paper, First analyzed on the clustering technique of the distributed clustering protocol routing scheme LEACH (Low Energy Adaptive Clustering Hierarchy) and HEED (Hybrid, Energy-Efficient Distributed Clustering Approach), and based on this, new energy-efficient clustering technique is proposed for the cause the maximum delay of dead nodes and to increase the lifetime of the network. In the proposed method, the cluster head is elect the optimal efficiency node based on the residual energy information of each member node and located information between sink node and cluster node, and elected a node in the cluster head since the data transfer process from the data been sent to the sink node to form a network by sending the energy consumption of individual nodes evenly to increase the network's entire life is the purpose of this study. To verify the performance of the proposed method through simulation and compared with existing clustering techniques. As a result, compared to the existing method of the network life cycle is approximately 5-10% improvement could be confirmed.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.39-49
• /
• 1995

Stereo vision is useful to obtain three dimensional depth information from two images taken from different view points. In this paper, we reduce searching area for correspondence by using the intra-scanline constraint, and utilize the inter-scanline constraint and the property of disparity continuity among the neighboring pixels for relaxation. Nodes with 3-D stucture are located on the axes of two views, and have matching possibility of correspondent pixels of two images. A matching is accepted if a node at the intersection of the disparity axes has the greatest matching possibility. Otherwise, the matching possibility of the node is updated by relaxation with the cooperation of neighboring nodes. Further relaxation with competition of two views is applied to a matching possibility of randomly selected node. The consensus of two views increases the confidence of matching, and removes a blurring phenomenon on the discontinuity of object. This approach has been tested with various types of image such as random dot stereogram and aerial image, and the experimental results show good matching performance.

• Journal of Computing Science and Engineering
• /
• v.11 no.2
• /
• pp.49-57
• /
• 2017

This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.73-81
• /
• 2009

Wireless media communication has lower robustness and stability than wired communication because of narrow bandwidth and unstable channel state. To make up for the deficient points of wireless communication, we used the diversity effect of cooperation communication and the error correction effect of channel coding schemes. In this paper, the cooperative communication system with RCPC codes and Hybrid ARQ transmission scheme is proposed for improving reliability on wireless communication, and we executed these simulations. From the simulation results, proposed system is showed lower BER performance than legacy system. In addition, we confirm the fact that the channel state of Relay-node and source-node is more important than the channel state of Relay-node and destination-node.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1294-1300
• /
• 2010

In an environment where all nodes move, the sensor node receives anchor node's position information within communication radius and modifies the received anchor node's position information by one's traveled distance and direction in saving in one's memory, where if there at least 3, one's position is determined by performing localization through trilateration. The proposed localization mechanisms have been simulated in the Matlab. In an environment where certain distance is maintained and nodes move towards the same direction, the probability for the sensor node to meet at least 3 anchor nodes with absolute coordinates within 1 hub range is remote. Even if the sensor node has estimated its position with at least 3 beacon information, the angle ${\theta}$ error of accelerator and digital compass will continuously apply by the passage of time in enlarging the error tolerance and its estimated position not being relied. Dead reckoning technology is used as a supplementary position tracking navigation technology in places where GPS doesn't operate, where one's position can be estimated by knowing the distance and direction the node has traveled with acceleration sensor and digital compass. The localization algorithm to be explained is a localization technique that uses Dead reckoning where all nodes are loaded with omnidirectional antenna, and assumes that one's traveling distance and direction can be known with accelerator and digital compass. The simulation results show that our scheme performed better than other mechanisms (e.g. MCL, DV-distance).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.370-376
• /
• 2009

Recently, Study for routing protocol is gone vigorously in the Ubiquitous Sensor Network. A hierarchical routing protocol is being practical and received interest among them. Therefore we analyze a weak point of HEED. And I suggest the new protocol that solved a weak point of HEED. The new protocol that we propose puts weight in the energy remainder amount than HEED and elect CH. And elected CH is designed to change by new node when quantity of energy leftover becomes less than 50%. Therefore all nodes come to use energy fairly. The protocol that we proposed can prove the cluster survival rate about 30%. And CH is more effective because when elect CH replace, response time selects small node.