• Title/Summary/Keyword: Node Split

Search Result 93, Processing Time 0.019 seconds

Energy Efficient Clustering Scheme for Mobile Wireless Sensor Network (이동 무선 센서 네트워크에서의 에너지 효율적인 클러스터링 기법)

  • Lee, Eun-Hee;Kim, Hyun-Duk;Choi, Won-Ik;Chae, Jin-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.388-398
    • /
    • 2011
  • In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

A Space Partitioning Based Indexing Scheme Considering, the Mobility of Moving Objects (이동 객체의 이동성을 고려한 공간 분할 색인 기법)

  • Bok, Kyoung-Soo;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.33 no.5
    • /
    • pp.495-512
    • /
    • 2006
  • Recently, researches on a future position prediction of moving objects have been progressed as the importance of the future position retrieval increases. New index structures are required to efficiently retrieve the consecutive positions of moving objects. Existing index structures significantly degrade the search performance of the moving objects because the search operation makes the unnecessary extension of the node in the index structure. To solve this problem, we propose a space partition based index structure considering the mobility of moving objects. To deal with the overflow of a node, our index structure first merges it and the sibling node. If it is impossible to merge them, our method splits the overflow node in which moving properties of objects are considered. Our index structure is always partitioned into overlap free subregions when a node is split. Our split strategy chooses the split position by considering the parameters such as velocities, the escape time of the objects, and the update time of a node. In the internal node, the split position Is determined from preventing the cascading split of the child node. We perform various experiments to show that our index structure outperforms the existing index structures in terms of retrieval performance. Our experimental results show that our proposed index structure achieves about $17%{\sim}264%$ performance gains on current position retrieval and about $107%{\sim}19l%$ on future position retrieval over the existing methods.

A Split Criterion for Binary Decision Trees

  • Choi, Hyun Jip;Oh, Myong Rok
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.2
    • /
    • pp.411-423
    • /
    • 2002
  • In this paper, we propose a split criterion for binary decision trees. The proposed criterion selects the optimal split by measuring the prediction success of the candidate splits at a given node. The criterion is shown to have the property of exclusive preference. Examples are given to demonstrate the properties of the criterion.

An Efficient Concurrency Control Algorithm for Multi-dimensional Index Structures (다차원 색인구조를 위한 효율적인 동시성 제어기법)

  • 김영호;송석일;유재수
    • Journal of KIISE:Databases
    • /
    • v.30 no.1
    • /
    • pp.80-94
    • /
    • 2003
  • In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

Automatic Mesh Generation with Quadrilateral Finite Elements (사각형 유한요소망의 자동생성)

  • 채수원;신보성;민중기
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.12
    • /
    • pp.2995-3006
    • /
    • 1993
  • An automatic mesh generation scheme has been developed for finite element analysis with two-dimensional, quadrilateral elements. The basic strategies of the method are to transform the analysis domain into loops with key nodes and the loops are recursively subdivided into subloops with the use of best split lines. Finally by using the basic loop operators, the meshes are completed. In this algorithm an eight-node loop operator is proposed, which is useful in the area where the change of element size is large and the splitting criteria for subdividing the loops have also been modified to the existing algorithms. Lines, arcs, and cubic spline curves are used to define the boundaries of analysis domain. Sample meshes for several geometries are presented to demonstrate the robustness of the algorithm.

SQR-Tree : A Hybrid Index Structure for Efficient Spatial Query Processing (SQR-Tree : 효율적인 공간 질의 처리를 위한 하이브리드 인덱스 구조)

  • Kang, Hong-Koo;Shin, In-Su;Kim, Joung-Joon;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.47-56
    • /
    • 2011
  • Typical tree-based spatial index structures are divided into a data-partitioning index structure such as R-Tree and a space-partitioning index structure such as KD-Tree. In recent years, researches on hybrid index structures combining advantages of these index structures have been performed extensively. However, because the split boundary extension of the node to which a new spatial object is inserted may extend split boundaries of other neighbor nodes in existing researches, overlaps between nodes are increased and the query processing cost is raised. In this paper, we propose a hybrid index structure, called SQR-Tree that can support efficient processing of spatial queries to solve these problems. SQR-Tree is a combination of SQ-Tree(Spatial Quad- Tree) which is an extended Quad-Tree to process non-size spatial objects and R-Tree which actually stores spatial objects associated with each leaf node of SQ-Tree. Because each SQR-Tree node has an MBR containing sub-nodes, the split boundary of a node will be extended independently and overlaps between nodes can be reduced. In addition, a spatial object is inserted into R-Tree in each split data space and SQ-Tree is used to identify each split data space. Since only R-Trees of SQR-Tree in the query area are accessed to process a spatial query, query processing cost can be reduced. Finally, we proved superiority of SQR-Tree through experiments.

Acoustic Damping Swirl Injector for Reduction of Combustion Instability (연소불안정 저감을 위한 음향학적 감쇠기능성 스월 인젝터)

  • Kim, Hyun-Sung;Kim, Byung-Sun;Kim, Dong-Jun;Yoon, Young-Bin
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2007.04a
    • /
    • pp.7-12
    • /
    • 2007
  • Swirl injector with multi-stage tangential entry was analyzed to suppress high-frequency combustion instability in Liquid Rocket Engines. In order to analyze the effect of swirl injector as an acoustic absorber, swirl injector was regarded as a quarter-wave resonator and it's damping capacity is verified in atmospheric temperature. It has a finite mode of vibration and natural frequencies which can be tuned to the natural frequencies of a model combustion chamber. When the targeted injector for each modes is located at anti-node point, the amplitude of modes was decreased. And when the injector of large diameter is mounted, the split of mode which accompanies the decrease of amplitude appeared. From the experimental data, it is proved that if the location of injector mounted is located at an anti-node position of the targeted modes with proper volume, the amplitude of modes is decreased and the split of modes occurs at anti-node point.

  • PDF

Concurrency Control and Recovery Methods for Multi-Dimensional Index Structures (다차원 색인구조를 위한 동시성제어 기법 및 회복기법)

  • Song, Seok-Il;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.195-210
    • /
    • 2003
  • In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multi-dimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. The proposed concurrency control algorithm introduces PLC(Partial Lock Coupling) technique to avoid lock coupling during MBR updates. Also, a new MBR update method that allows searchers to access nodes where MBR updates are being performed is proposed. To reduce the performance degradation by node splits the proposed algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-3 that is a storage system of a BADA-4 DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.

Performance control analysis of concrete-filled steel tube sepa-rated spherical joint wind power tower

  • Yang Wen;Guangmao Xu;Xiazhi Wu;Zhaojian Li
    • Structural Engineering and Mechanics
    • /
    • v.87 no.2
    • /
    • pp.137-149
    • /
    • 2023
  • In this study, to explore the working performance of the CFST split spherical node wind power tower, two groups of CFST split spherical joint plane towers with different web wall thicknesses and a set of space systems were analyzed. The tower was subjected to a low-cycle repeated load test, and the hysteresis and skeleton curves were analyzed. ABAQUS finite element simulation was used for verification and comparison, and on this basis parameter expansion analysis was carried out. The results show that the failure mode of the wind power tower was divided into weld tear damage between belly bar, high strength bolt thread damage and belly rod flexion damage. In addition, increasing the wall thickness of the web member could render the hysteresis curve fuller. Finally, the bearing capacity of the separated spherical node wind power tower was high, but its plastic deformation ability was poor. The ultimate bearing capacity and ductility coefficient of the simulated specimens are positively correlated with web diameter ratio and web column stiffness ratio. When the diameter ratio of the web member was greater than 0.13, or the stiffness ratio γ of the web member to the column was greater than 0.022, the increase of the ultimate bearing capacity and ductility coefficient decreased significantly. In order to maximize the overall mechanical performance of the tower and improve its economy, it was suggested that the diameter ratio of the ventral rod be 0.11-0.13, while the stiffness ratio γ should be 0.02-0.022.

A Non-Uniform Network Split Method for Energy Efficiency in a Data Centric Sensor Network (데이타 중심 센서 네트워크에서 에너지 효율성을 고려한 비균등 네트워크 분할 기법)

  • Kang, Hong-Koo;Kim, Joung-Joon;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.35-50
    • /
    • 2007
  • In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

  • PDF