• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.441-444
• /
• 2011

In this study, we present a method for efficiently aggregating network state information. It is especially useful for aggregating links that have both delay and bandwidth in an asymmetric network. Proposed method reduces the information distortion of logical link by integration process after similar measure and grouping of logical links in multi-level topology transformation to reduce the space complexity. It is applied to transform the full mesh topology whose Service Boundary Line (SBL) serves as its logical link into a spanning tree topology. Simulation results show that aggregated information accuracy and query response accuracy are higher than that of other known method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1295-1304
• /
• 2010

This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1071-1075
• /
• 2010

Because a sensor node in wireless sensor networks(WSNs) has limited resources, such as battery capacity and memory, data aggregation techniques have been studied to manage the limited resources efficiently. Because sensor network uses wireless communication, a data can be disclosed by attacker. Thus, the study on data protection schemes for data aggregation is essential in WSNs. But the existing data aggregation methods require both a large number of computation and communication, in case of network construction and data aggregation processing. To solve the problem, we propose a data protection scheme based on Hilbert-curve for data aggregation. Our scheme can minimizes communications among neighboring sensor nodes by using tree-based routing. Moreover, it can protect the data from attacker by doing encryption through a Hilbert-curve technique based on a private seed, Finally, we show that our scheme outperforms the existing methods in terms of message transmission and average sensor node lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.451-463
• /
• 2003

Recently, there have been various research efforts to develop strategies for accelerating OLAP operations on huge amounts of spatio-temporal data. Most of the work is based on multi-tree structures which consist of a single R-tree variant for spatial dimension and numerous B-trees for temporal dimension. The multi~tree based frameworks, however, are hardly applicable to spatio-temporal OLAP in practice, due mainly to high management cost and low query efficiency. To overcome the limitations of such multi-tree based frameworks, we propose a new approach called Hilbert Cube(H-Cube), which employs fractals in order to impose a total-order on cells. In addition, the H-Cube takes advantage of the traditional Prefix-sum approach to improve Query efficiency significantly. The H-Cube partitions an embedding space into a set of cells which are clustered on disk by Hilbert ordering, and then composes a cube by arranging the grid cells in a chronological order. The H-Cube refines cells adaptively to handle regional data skew, which may change its locations over time. The H-Cube is an adaptive, total-ordered and prefix-summed cube for spatio-temporal data warehouses. Our approach focuses on indexing dynamic point objects in static spatial dimensions. Through the extensive performance studies, we observed that The H-Cube consumed at most 20% of the space required by multi-tree based frameworks, and achieved higher query performance compared with multi-tree structures.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.8
• /
• pp.138-143
• /
• 2005

A hierarchical tree structure of clusters has advantages for the network design due to its scalability and simple routing protocol. In this paper, the cluster tree routing protocol is studied for the wireless sensor network. From the numerical analysis results, the data aggregation in the intermediate nodes reduces the number of communication message and saves the energy of sensor nodes, but it may result in increased data traffic latency. And also the selection of cluster head can increase the relaying hops very high.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.133-141
• /
• 2010

Contents adaptation is a technology which converts one content to another content used in various devices. Specially, synchronization of inter-media which are included in a document is needed. There are various proposals and solutions for synchronization of inter-media. In the paper, I present "TATS : Temporal Aggregate Tree Strategy" model, which is used for specifying the temporal relationship among media in series of time. In the TATS model, aggregate tree, a sort of a binary tree, is generated from the execution time of those media. Using this aggregate tree, I implemented the inter-media synchronizations.

• Natural Product Sciences
• /
• v.26 no.4
• /
• pp.295-302
• /
• 2020

Cudrania tricuspidata (C. tricuspidata) is a deciduous tree found in Japan, China and Korea. The root, stems, bark and fruit of C. tricuspidata has been used as traditional herbal remedies such as eczema, mumps, acute arthritis and tuberculosis. In this study, we investigated the potential efficacies of this natural compound by focusing on the inhibitory effect of cudraxanthone L (CXL) isolated from the roots of C. tricuspidata on human platelet aggregation. Our study focused on the action of CXL on collagen-stimulated human platelet aggregation, inhibition of platelet signaling molecules such as fibrinogen binding, intracellular calcium mobilization, fibronectin adhesion, dense granule secretion, and thromboxane A2 secretion. In addition, we investigated the inhibitory effect of CXL on thrombin-induced clot retraction. Our results showed that CXL inhibited collagen-induced human platelet aggregation, intracellular calcium mobilization, fibrinogen binding, fibronectin adhesion and clot retraction without cytotoxicity. Therefore, we confirmed that CXL has inhibitory effects on human platelet activities and has potential value as a natural substance for preventing thrombosis.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.171-173
• /
• 2000

본 논문에서는 ATM PNNI(Private Network-Network Interface) 망에서 경로 배정을 위해 필요로 하는 링크 상태 정보(link state information)를 효율적으로 집단화(aggregation)하는 두 가지 방법을 제시한다. 이 방법들은 집단화할 동료 집단(peer group)의 경계노드(border node)들을 셔플넷(shufflenet)이나 de Bruijn 그래프의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법(full-mesh approach)의 N2에서 aN(a는 정수, N은 경계노드 수)으로 줄인다. 이는 공간 복잡도가 0(N)인 신장 트리(apanning tree) 방법에서 필요로 하는 링크의 수와 비슷하지만, 신장 트리 방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장점이다. 모의 실험 결과 셔플넷 방법은 aN개의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었고, de Bruijn 방법은 정보의 정확성에서는 셔플넷 방법에 못 미치지만 가장 널리 사용되고 있는 별모양 방법(star approach) 방법보다는 훨씬 정확하며, 계산 복잡도 면에서 셔플넷 방법보다 효율적이었다.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1438-1449
• /
• 2011

UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.