• Title/Summary/Keyword: Source Tree

Search Result 330, Processing Time 0.023 seconds

Dominant Source Based Tree for Dynamic Multicasting (동적 멀티캐스트를 위한 주 송신원 기탄 트리)

  • 남홍순;김대영;이규욱
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.633-642
    • /
    • 2000
  • This paper proposes a dominant source-based tree (DSBT) that constructs a localized multicast routing tree for dynamic multicasting without rerouting. To constrain end-to-end delays a multicast tree needs to be reconstructed when a new node joins the group due to additive tree constraint. In DSBT, a multicast group G is expressed by a (DS, NCM) pair, where DS is a dominant source address and NCM is a normalized cost margin. A node wishing to participate in a group selects a path that complies with NCM toward DS such that the end-to-end cost is constrained without any rerouting. Simulation results show that the proposed method performed better in terms of the overall tree cost compared with the Nave algorithm and in terms of the end-to-end delays between any two members compared with the Greedy algorithm.

  • PDF

Mobility-Sensitive Multicast Protocol in NEMO

  • Li, Long-Sheng;Chi, Hung-I;Xie, Kai-Chung;Chan, Din-Yuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.1994-2017
    • /
    • 2022
  • In view of the past, the mobility of the multicast source in the mobility networks is seldom discussed in the traditional multicast protocols. It is a heavy cost for the traditional multicast protocols to reconstruct the multicast tree in the Network Mobility (NEMO) environment. This article proposes an alternative multicast protocol, referred to as Mobility-Sensitive Multicast protocol (MSM), for the NEMO environment. The MSM can be considered as an alternative version of the Multicast Listener Discovery (MLD) protocol to maintain the multicast tree in the NEMO. There are two obvious contributions for the MSM. Reconstruct mechanism could rebuild the multicast tree for the mobility of the multicast source. Multi-group suppression mechanism reduce the multicast tree maintaining cost for the mobility of the multicast members. Through the performance evaluations and analyses, the MSM has less cost to maintain the multicast tree than the traditional multicast protocols, especially for a large numbers of multicast groups. Moreover, the MSM allows the mobility of the multicast source to reconstruct the multicast tree easily.

Minimizing Cost and Delay in Shared Multicast Trees

  • Koh, Seok-Joo;Yi, Jong-Hwa;Hahm, Jin-Ho;Chin, Byoung-Moon;Park, Chee-Hang
    • ETRI Journal
    • /
    • v.22 no.1
    • /
    • pp.30-37
    • /
    • 2000
  • Existing tree construction mechanisms are classified into source-based trees and center-based trees. The source-based trees produce a source-rooted tree with a low delay. However, for the applications with multiple senders, the management overheads for routing tables and resource reservations are too high. The center-based trees are easy to implement and manage, but a priori configuration of candidate center nodes is required, and the optimization mature such as tree cost and delay is not considered. In this paper, we propose a new multicast tree building algorithm. The proposal algorithm basically builds a non-center based shared tree. In particular, any center node is not pre-configured. In the purposed algorithm, a multicast node among current tree nodes is suitably assigned to each incoming user: Such a node is selected in a fashion that tree cost and the maximum end-to-end delay on the tree are jointly minimized. The existing and proposed algorithms are compared by experiments. In the simulation results, it is shown that the proposed algorithm approximately provides the cost saving of 30% and the delay saving of 10%, compared to the existing approaches. In conclusion, we see that the cost and delay aspects for multicast trees can be improved at the cost of additional computations.

  • PDF

Adaptive Reversal Tree Protocol with Optimal Path for Dynamic Sensor Networks

  • Hwang, Kwang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.1004-1014
    • /
    • 2007
  • In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

A Novel Redundant Data Storage Algorithm Based on Minimum Spanning Tree and Quasi-randomized Matrix

  • Wang, Jun;Yi, Qiong;Chen, Yunfei;Wang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.227-247
    • /
    • 2018
  • For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

Generating Pylogenetic Tree of Homogeneous Source Code in a Plagiarism Detection System

  • Ji, Jeong-Hoon;Park, Su-Hyun;Woo, Gyun;Cho, Hwan-Gue
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.6
    • /
    • pp.809-817
    • /
    • 2008
  • Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

Verification of a tree canopy model and an example of its application in wind environment optimization

  • Yang, Yi;Xie, Zhuangning;Tse, Tim K.T.;Jin, Xinyang;Gu, Ming
    • Wind and Structures
    • /
    • v.15 no.5
    • /
    • pp.409-421
    • /
    • 2012
  • In this paper, the method of introducing additional source/sink terms in the turbulence and momentum transport equations was applied to appropriately model the effect of the tree canopy. At first, the new additional source term for the turbulence frequency ${\omega}$ equation in the SST k-${\omega}$ model was proposed through theoretical analogy. Then the new source/sink term model for the SST k-${\omega}$ model was numerically verified. At last, the proposed source term model was adopted in the wind environment optimal design of the twin high-rise buildings of CABR (China Academy of Building Research). Based on the numerical simulations, the technical measure to ameliorate the wind environment was proposed. Using the new inflow boundary conditions developed in the previous studies, it was concluded that the theoretically reasonable source term model of the SST k-${\omega}$ model was applicable for modeling the tree canopy flow and accurate numerical results are obtained.

An Algorithm of Constructing Multiple Tree for Group Multicast with Bandwidth Constraint (대역폭 제약 그룹 멀티캐스트를 위한 다중 트리 구성 알고리즘)

  • 구봉규;박태근;김치하
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.305-313
    • /
    • 2004
  • Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

Efficient Backbone Core Tree Generation Algorithm (효과적인 Backbone Core Tree(BCT)생성 알고리즘)

  • 서현곤;김기형
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.214-216
    • /
    • 2002
  • 본 논문에서는 many-to-many IP 멀티캐스팅을 위한 효율적인 Backbone Core Tree(BCT)생성 알고리즘에 대하여 제안한다. 본 논문의 제안기법은 Core Based Tree(CBT)에 기반을 두고 있다. CBT는 공유 트리를 이용하여 멀티캐스트 자료를 전달하기 때문에 Source Based Tree에 비하여 각 라우터가 유지해야 하는 상태 정보의 양에 적고 적용하기 간단하지만, Core 라우터 선택의 어려움과 트래픽이 Core로 집중되는 문제점을 가지고 있다. 이에 대한 보완책으로 Backbone Core Tree기법이 제안되었는데, 본 논문에서는 주어진 네트워크 위상 그래프에서 최소신장 트리를 만들고, 센트로이드를 이용하여 효율적인 BCT를 생성하는 알고리즘을 제안한다.

  • PDF

The Effect of Noise Diminution by Euonymus japonica Wall (사철나무 수벽(樹壁)에 의한 소음(騷音) 감쇄효과(減殺效果))

  • Hong, Jong Soo;Son, Yeong Mo;Chung, Young Gwan
    • Journal of Korean Society of Forest Science
    • /
    • v.84 no.4
    • /
    • pp.409-414
    • /
    • 1995
  • This study was carried out for the analysis and comparison about the noise diminution effects by the height, width and density of Euonymus japonica wall, the distance of sound source, the distance of sound receiver, the height of sound source, and the height of sound receiver. The results obtained were summarized as follows; 1. After the establishment of tree wall, the volume of noise diminution measured 6.8dB and the effects of noise diminution measured heigher than before by 10.6% and t-value was significant at the 1% level 2. In simple correlation between the effects of noise diminution and variables, the density of tree wall was found as the most significant factor, and the last were found in the order of the distance of sound receiver, the width of tree wall, and the distance of sound source. 3. In partial correlation coefficients the effects of noise diminution and variables, the density of tree wall (r=-0.959) was found as the most significant factor, and the last were found in order of the distance of sound receiver (r=-0.906) and the width of tree wall (r=-0.753). 4. The estimated equation to measure the effects of noise diminution according to variables (the height of tree wall, the width of tree wall, the density of tree wall, the distance of sound source, the distance of sound receiver, the height of sound source, and the height of sound receiver) was $Y=69.520-1.672X_1-1.656X_2-0.066X_3-0.248X_4-3.134X_5-0.222X_6-0.343X_7$, and the coefficient of determination of this estimated equation was highly found as 0.950. 5. In semi-partial correlation coefficient the effects of noise diminution were found in the order of the density of tree wall, the distance of sound receiver, the width of tree wall, and the height of tree wall from the highest to the lowest. Therefore, it was considered that the density of tree wall, the distance of sound receiver, the width of tree wall and the distance of sound source should be controlled effectively to increase the effects of noise diminution by Euonymus japonica wall.

  • PDF