• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.209-214
• /
• 2007

In this paper, we proposed a new MANET (Mobile Ad hoc Networks) technology of routing protocol. The MANET has a mobility formation of mobile nodes in the wireless networks. Wireless network have two types architecture: the Tree based multicast and shared tree based. The two kind's architecture of general wireless networks have difficult to solve the problems existing in the network, such as connectivity, safety, and reliability. For this purpose, as using that ADDMRP (Ad hoc network Doppler effect-based for Dynamic Multicast Routing Protocol), this study gives the following suggestion for new topology through network durability and Omni-directional information. The proposed architectures have considered the mobility location, mobility time, density, velocity and simultaneous using node by Doppler effects and improved the performance.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.373-373
• /
• 2012

위험도(risk)는 복잡성(complexity)과 불확실성(uncertainty)라는 2가지 주요 특징으로 인해 위험도를 정확하게 예측하는 것은 불가능하다. 대표적인 수공구조물인 댐이 각종 모니터링을 통해서 안전하다고 판단된다 하더라도 하류지역에 도시가 존재한다면 여전히 잔존위험도(residual risk)는 존재한다. 댐의 파괴가 일반적으로 발생하는 사상은 아니지만 대규모 인명피해, 재산 및 환경피해로 이어지기 때문에 작은 위험도라 할지라도 이에 대한 감시 및 관리가 필수적이다. 댐 위험도 분석을 위해서 Event Tree 또는 Fault Tree가 일반적인 해석 방법으로 이용되고 있으나 잠재적인 파괴모드에 대한 복잡성과 불확실성을 고려하는데 한계가 존재한다. 본 연구에서는 이러한 문제점을 개선하기 위해서 Bayesian Network 기반의 위험도 해석기법을 제안하고자 한다. 특히 수문학적 위험도와 관련된 분석을 위해서 Bayesian Network의 구성 방안, 매개변수 추정, 위험도 해석 등 기존 해석 방법을 개선한 댐 위험도 해석 기법을 개발하고자 하며 개발된 방법론을 국내 실제댐에 적용하여 적합성을 평가하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.6
• /
• pp.1-8
• /
• 1982

In this paper a new analytic method for Ladder networks by weighted tree is proposed. In contrast to conventional tree concept that represents only information structure, in this paper, a tree with hierarchical structure is established by giving wei체t of impedance Z and admittance Y to branch and representing each node of its branch as a pair of voltage and current. Then, by defining generation level from tree structure and by parsing between standand level and arbitrary level, driving point impedance, transfer function and transfer impedance are simultaneously obtained instead of complex calculation method by inspection. The validity of this method is proved by the reciprocal theorem and this method is applied to four-terminal constants and the feedback network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.466-473
• /
• 2010

Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.15-28
• /
• 2008

In ubiquitous sensor networks(USN) environment, it is essential to process region query for user-demand services. Using R-tree is a preferred technique to process region query for in-network query environment. In USN environment, USN middleware must select sensors that transfers region query with accuracy because the lifetime of sensors is that of whole sensor networks. When R-tree is used, however, it blindly passes the region query including non-existent sensors where MBR(Minimum Boundary Rectangle) of R-tree is Intersected by region of query. To solve in this problem, we propose a reconstruction of region query method which is a trie-structured Quad tree in the base station that includes sensors in region of query select with accuracy. We observed that the proposed method delays response time than R-tree, but is useful for reducing communication cost and energy consumption.

• Journal of Information Processing Systems
• /
• v.18 no.5
• /
• pp.677-687
• /
• 2022

We propose a detection algorithm based on tree-structured convolutional neural networks (TsCNNs) that finds pornography, propaganda, or other inappropriate content on a social media network. The algorithm sequentially applies the typical convolutional neural network (CNN) algorithm in a tree-like structure to minimize classification errors in similar classes, and thus improves accuracy. We implemented the detection system and conducted experiments on a data set comprised of 6 ordinary classes and 11 inappropriate classes collected from the Korean military social network. Each model of the proposed algorithm was trained, and the performance was then evaluated according to the images and videos identified. Experimental results with 20,005 new images showed that the overall accuracy in image identification achieved a high-performance level of 99.51%, and the effectiveness of the algorithm reduced identification errors by the typical CNN algorithm by 64.87 %. By reducing false alarms in video identification from the domain, the TsCNNs achieved optimal performance of 98.11% when using 10 minutes frame-sampling intervals. This indicates that classification through proper sampling contributes to the reduction of computational burden and false alarms.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.156-165
• /
• 2023

IEEE 802.15.4e-TSCH is recognized as a wireless industrial sensor network standard used in IoT systems. To ensure both power savings and reliable communications, the TSCH standard uses techniques including channel hopping and bandwidth reserve. In TSCH mode, scheduling is crucial because it allows sensor nodes to select when data should be delivered or received. Because a wide range of applications may necessitate energy economy and transmission dependability, we present a distributed approach that uses a cluster tree topology to forecast scheduling requirements for the following slotframe, concentrating on the Poisson model. The proposed Optimized Minimal Scheduling Function (OMSF) is interested in the details of the scheduling time intervals, something that was not supported by the Minimal Scheduling Function (MSF) proposed by the 6TSCH group. Our contribution helps to deduce the number of cells needed in the following slotframe by reducing the number of negotiation operations between the pairs of nodes in each cluster to settle on a schedule. As a result, the cluster tree network's error rate, traffic load, latency, and queue size have all decreased.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.401-406
• /
• 2000

Fault tree analysis (FTA) is a widely used methodology for reliability analysis. The method is useful in that it suggests a very comprehensive way of describing the hierarchical relations of causes of faults and the corresponding results. However it is difficult to get appropriate fault trees for given products or systems without very profound knowledge and experience. This work aims to develop a methodology of fault tree construction using the results of function deployment for machine parts, which provides an objective way of preparing fault trees. The failure modes are defined to each function network generated by the function deployment method and the fault tree with respect to each viewpoint is constructed by arranging the failure modes. The fault tree is finally obtained by synthesizing the fault trees with respect to each viewpoint. The example of fault tree construction is also shown.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.358-364
• /
• 2007

This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.

• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.247-257
• /
• 2005

Generally, the network topology design problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size. In this paper, we propose the efficient approach with two phase that is comprised of evolutionary computation approach based on Prufer number(PN), which can efficiently represent the spanning tree, and a heuristic method considering 2-connectivity, to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability: firstly, to find the spanning tree, genetic algorithm that is the most widely known type of evolutionary computation approach, is used; secondly, a heuristic method is employed, in order to search the optimal network topology based on the spanning tree obtained in the first Phase, considering 2-connectivity. Lastly, the performance of our approach is provided from the results of numerical examples.