• Title/Summary/Keyword: Demand-Based Tree

Search Result 73, Processing Time 0.028 seconds

An Efficient Routing Scheme based on Link Quality and Load Balancing for Wireless Sensor Networks (무선 센서 네트워크에서 링크 상태 및 트래픽 분산 정보를 이용한 효과적인 라우팅 방법)

  • Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.11-19
    • /
    • 2010
  • ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

An Efficient Spatial Index Technique based on Flash-Memory (플래시 메모리 기반의 효율적인 공간 인덱스 기법)

  • Kim, Joung-Joon;Sim, Hee-Joung;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.133-142
    • /
    • 2009
  • Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

  • PDF

An Analysis of Choice Behavior for Tour Type of Commercial Vehicle using Decision Tree (의사결정나무를 이용한 화물자동차 투어유형 선택행태 분석)

  • Kim, Han-Su;Park, Dong-Ju;Kim, Chan-Seong;Choe, Chang-Ho;Kim, Gyeong-Su
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.6
    • /
    • pp.43-54
    • /
    • 2010
  • In recent years there have been studies on tour based approaches for freight travel demand modelling. The purpose of this paper is to analyze tour type choice behavior of commercial vehicles which are divided into round trips and chained tours. The methods of the study are based on the decision tree and the logit model. The results indicates that the explanation variables for classifying tour types of commercial vehicles are loading factor, average goods quantity, and total goods quantity. The results of the decision tree method are similar to those of logit model. In addition, the explanation variables for tour type classification of small trucks are not different from those for medium trucks', implying that the most important factor on the vehicle tour planning is how to load goods such as shipment size and total quantity.

Structural Reliability Analysis of Subsea Tree Tubing Hanger (Sub-sea 트리 튜빙 행어(tubing hanger)의 구조 신뢰성 해석)

  • Kim, Hyunjin;Yang, Youngsoon;Kim, Sunghee
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.51 no.3
    • /
    • pp.212-219
    • /
    • 2014
  • As subsea production has been revived up, the demand of subsea equipment has also been increased. Among the equipment, subsea tree plays a major role in safety. The tubing hanger is one of the most important components in subsea tree. In this study structural reliability analysis on dual bore tubing hanger of subsea tree is performed. The target reliability which is introduced in ISO regulation is used for judging whether tubing hanger is safe or not. The considered loads are working pressure, working temperature and suspended tubing weight. Thermal-stress analysis on tubing hanger is performed and kriging model is created based on the results of FEM analysis. According to von Mises criterion, limit state equation can be estimated. Reliability analysis is performed by using level 2 method and the result is verified by that of Monte Carlo Simulation. For finding most probable failure point, enhanced HL-RF method is adopted. Because the reliability of model doesn't reach target reliability, an improvement measure should be considered. Thus, it is suggested to change the material of tubing hanger main body to AISI 4140.

An Optimal Installation Strategy for Allocating Energy Storage Systems and Probabilistic-Based Distributed Generation in Active Distribution Networks

  • Sattarpour, Tohid;Tousi, Behrouz
    • Transactions on Electrical and Electronic Materials
    • /
    • v.18 no.6
    • /
    • pp.350-358
    • /
    • 2017
  • Recently, owing to increased interest in low-carbon energy supplies, renewable energy sources such as photovoltaics and wind turbines in distribution networks have received considerable attention for generating clean and unlimited energy. The presence of energy storage systems (ESSs) in the promising field of active distribution networks (ADNs) would have direct impact on power system problems such as encountered in probabilistic distributed generation (DG) model studies. Hence, the optimal procedure is offered herein, in which the simultaneous placement of an ESS, photovoltaic-based DG, and wind turbine-based DG in an ADN is taken into account. The main goal of this paper is to maximize the net present value of the loss reduction benefit by considering the price of electricity for each load state. The proposed framework consists of a scenario tree method for covering the existing uncertainties in the distribution network's load demand as well as DG. The collected results verify the considerable effect of concurrent installation of probabilistic DG models and an ESS in defining the optimum site of DG and the ESS and they demonstrate that the optimum operation of an ESS in the ADN is consequently related to the highest value of the loss reduction benefit in long-term planning as well. The results obtained are encouraging.

High Performance Pattern Matching algorithm with Suffix Tree Structure for Network Security (네트워크 보안을 위한 서픽스 트리 기반 고속 패턴 매칭 알고리즘)

  • Oh, Doohwan;Ro, Won Woo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.110-116
    • /
    • 2014
  • Pattern matching algorithms are widely used in computer security systems such as computer networks, ubiquitous networks, sensor networks, and so on. However, the advances in information technology causes grow on the amount of data and increase on the computation complexity of pattern matching processes. Therefore, there is a strong demand for a novel high performance pattern matching algorithms. In light of this fact, this paper newly proposes a suffix tree based pattern matching algorithm. The suffix tree is constructed based on the suffix values of all patterns. Then, the shift nodes which informs how many characters can be skipped without matching operations are added to the suffix tree in order to boost matching performance. The proposed algorithm reduces memory usage on the suffix tree and the amount of matching operations by the shift nodes. From the performance evaluation, our algorithm achieved 24% performance gain compared with the traditional algorithm named as Wu-Manber.

A Prime Number Labeling Based on Tree Decomposition for Dynamic XML Data Management (동적 XML 데이터 관리를 위한 트리 분해 기반의 소수 레이블링 기법)

  • Byun, Chang-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.4
    • /
    • pp.169-177
    • /
    • 2011
  • As demand for efficiency in handling dynamic XML data grows, new dynamic XML labeling schemes have been researched. The key idea of the dynamic XML labeling scheme is to find ancestor-descendent-sibling relationships and to minimize memory space to store total label, response time and range of relabeling incurred by update operations. The prime number labeling scheme is a representative scheme which supports dynamic XML documents. It determines the ancestor-descendant relationships between two elements by a simple divisibility test of labels. When a new element is inserted into the XML data using this scheme, it does not change the label values of existing nodes. However, since each prime number must be used exclusively, labels can become significantly large. Therefore, in this paper, we introduce a novel technique to effectively reduce the problem of label overflow. The suggested idea is based on tree decomposition. When label overflow occurs, the full tree is divided into several sub-trees, and nodes in each sub-tree are separately labeled. Through experiments, we show the effectiveness of our scheme.

A Two-Dimensional Binary Prefix Tree for Packet Classification (패킷 분류를 위한 이차원 이진 프리픽스 트리)

  • Jung, Yeo-Jin;Kim, Hye-Ran;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.4
    • /
    • pp.543-550
    • /
    • 2005
  • Demand for better services in the Internet has been increasing due to the rapid growth of the Internet, and hence next generation routers are required to perform intelligent packet classification. For a given classifier defining packet attributes or contents, packet classification is the process of identifying the highest priority rule to which a packet conforms. A notable characteristic of real classifiers is that a packet matches only a small number of distinct source-destination prefix pairs. Therefore, a lot of schemes have been proposed to filter rules based on source and destination prefix pairs. However, most of the schemes are based on sequential one-dimensional searches using trio which requires huge memory. In this paper, we proposea memory-efficient two-dimensional search scheme using source and destination prefix pairs. By constructing binary prefix tree, source prefix search and destination prefix search are simultaneously performed in a binary tree. Moreover, the proposed two-dimensional binary prefix tree does not include any empty internal nodes, and hence memory waste of previous trio-based structures is completely eliminated.

Application plan for radiological exposure model using virtual reality-based radiological exercise system

  • Lee, Dewhey;Lee, Byung Il;Park, Younwon;Kim, Dohyung
    • Nuclear Engineering and Technology
    • /
    • v.50 no.5
    • /
    • pp.745-750
    • /
    • 2018
  • New exercise technology such as the virtual reality (VR)-based exercise system is required to meet soaring demand for target participants in exercises and to alleviate the difficulties in personnel mobilization through an alternative approach to the exercise system. In a previous study, event tree methodologies were introduced in setting up an exercise scenario of a VR-based radiological exercise system. In the scenario, the locations at which major events occur are rephrased as nodes, routes as paths, and public response actions as protective actions or contents of an exercise at individual locations. In the study, a model for estimating effective doses to the participants is proposed to evaluate the exercise system, using the effective dose rates at particular times and locations derived from a computer program. The effective dose received by a student when she/he follows a successful route is about a half of the dose received when she/he does not follow the exercise guide directions. In addition, elapsed time to finish an exercise when following a successful route is less than one-third of the time spent to finish an exercise when following the guide's directions.

Relations between Information Items of Job Posting and Vacancy Duration in Mid-level Labour Market - by GLM, Decision Tree

  • Kim, Hyoungrae;Jeon, Dohong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.4
    • /
    • pp.89-96
    • /
    • 2016
  • In this paper, we study the relationship between vacancy duration and information items of a job posting by using generalized linear models and a decision tree analysis w.r.t. the three factors such as company characteristics, employment conditions, and constraints. The results indicate that the employment conditions rather than company characteristics are more influential to the vacancy duration. These effects are presumed to be based on the complex relations between the decisions of the employers and the job seekers. And in this paper we suggest the need to provide personalized and profiled labor market information tailored for a quick decision to job seekers and employers. Policy implication is that since employer's decision affects the vacation duration, employers may had better to provide a comprehensive labour market information including supply and demand of the required skills in order to reduce the time for judgment on the cost-effectiveness.