• Title/Summary/Keyword: Data aggregation

Search Result 548, Processing Time 0.025 seconds

A MPLS Group Restoration using an Aggregation Tree (집성 트리를 이용한 MPLS 그룹 복구)

  • Lee, Kil-Hung
    • 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.

  • PDF

The Effects of Congeners of Clofibrate on Inhibition of Rabbit Platelet Aggregation (Clofibrate의 유도체가 토끼의 혈소판 응집에 미치는 영향)

  • 홍충만;장동덕;신동환;조재천;조명행
    • Biomolecules & Therapeutics
    • /
    • v.3 no.2
    • /
    • pp.132-135
    • /
    • 1995
  • Several clofibrate congeners (bezafibrate, gemfibrozil and fenofibrate) were investigated the relationship between effects on the aggregation induced by aggregating agents (thrombin, arachidonic acid, ADP and collagen) and arachidonic acid metabolism in rabbit homogenized platelet. In platelet aggregation study, all drugs produced no significant inhibition (data not shown) in arachidonic acid and thrombin. Also platelet aggregation by ADP was not changed in bezafibrate and Inhibited dose dependently in fenofibrate and gemfibrozil. Platelet aggregation by collagen was inhibited dose dependently and significantly (from p<0.5 to p<0.001) by gemfibrozil and fenofibrate at concentrations between 20 and 400 $\mu$M. In arachidonic acid metabolism study, synthesis of thromboxane $B_2$ was not changed in rabbit platelet membranes and that of prostaglandin $E_2$ and $F_{2{\alpha}}$ was slightly increased by all drugs. It was concluded that clofibrate congeners inhibited ADP and collagen induced rabbit platelet aggregation and inhibition of collagen induced aggregation was probably mediated through some mechanism (pathway) other than arachidonic acid metabolism, judging from arachidonic acid metabolites (thromboxane $B_2$, prostaglandin $E_2$and $F_{ 2{\alpha}}$) synthesis in rabbit homogenized Platelet.

  • PDF

Effects of cyclopiazonic acid and aflatoxin B1 on rabbit platelet aggregation and ATP release (Cyclopiazonic acid 및 aflatoxin B1이 토끼의 혈소판 응집 및 ATP 방출에 미치는 영향)

  • Hong, Choong-man;Cho, Myung-haing
    • Korean Journal of Veterinary Research
    • /
    • v.36 no.4
    • /
    • pp.887-894
    • /
    • 1996
  • Cyclopiazonic acid(CPA) known as stimulating the release of intracellular calcium, aflatoxin $B_1(AFB_1)$ causing gastrointestinal hemorrhage frequently were used as model toxic mycotoxins in these studies. First of all, the effects of various mycotoxins on the platelet aggregation response were determined. The effects of mycotoxins on the ATP release from platelet by aggregating factors were investigated. The results and conclusions obtained from these studies are : 1) CPA promoted ADP, collagen, thrombin, A.A. and PAF-induced rabbit platelet aggregation. $AFB_1$ inhibited collagen, A.A. and PAF-induced rabbit platelet aggregation only. 2) CPA increased both aggregation and disaggregation time, whereas $AFB_1$ decreased in a dose dependent manner. 3) CPA increased ADP, thrombin, A.A. and PAF-induced ATP release. $AFB_1$ increased A.A.-induced ATP release and decreased PAF-induced release in a dose dependent manner. In conclusion, CPA promoted platelet aggregation by the increase of ATP. Antiaggregating effects of AFB1 may be due to decreases of ATP. These data provide the basis for the future study of roles of ATP release in platelet aggregation.

  • PDF

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

Spatiotemporal Aggregate Functions for Temporal GIS

  • Kim, Jin-Soo;Shin, Hyun-Ho;Chi, Jeong-Hee;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.721-723
    • /
    • 2003
  • Aggregation is an operation that returns a result value through a computational process on the data which satisfy a certain condition. Recently many applications use aggregation to analyze spatiotemporal data. Although spatiotemporal data change its states over time, previous aggregation works have only dealt with spatial or temporal aspect of object. In this paper we propose spatiotemporal aggregate functions that operate on spatiotemporal data. The proposed algorithms are evaluated through some implementation results. The experiment results show that the proposed aggregate functions are applicable to spatiotemporal data efficiently.

  • PDF

Sensor Network Routing using Data Aggregation (데이터 병합을 이용한 센서 네트워크 라우팅)

  • Kim, Young-Kyun
    • Journal of the Korea Computer Industry Society
    • /
    • v.8 no.4
    • /
    • pp.237-244
    • /
    • 2007
  • In this paper we investigate the benefits of a data aggregation to prolong the lifetime of wireless sensor networks. To reduce the overload of messages from source node to sink node, data aggregation technique is generally used at intermediate node in path. The DD-G(Directed Diffusion-Greedy) can diminish the consumption of node energy by establishing energy effective single path from source to destination. In this case, the nodes near sink node have some problems, i) overly concentration of energy consumption, ii) increase of message delay time. To solve these problems, we propose a new data aggregation method which consider distribution of network overload, especially at the nodes close to sink node. The result shows that it can save energy and network delay time.

  • PDF

An Optimal Routing Algorithm for Large Data Networks (대규모 데이타 네트워크를 위한 최적 경로 설정 알고리즘)

  • 박성우;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.2
    • /
    • pp.254-265
    • /
    • 1994
  • For solving the optimal routing problem (ORP) in large data networks, and algorithm called the hierarchical aggregation/disaggregation and decomposition/composition gradient project (HAD-GP) algorithm os proposed. As a preliminary work, we improve the performance of the original iterative aggregation/disaggregation GP (IAD-GP) algorithm introduced in [7]. THe A/D concept used in the original IAD-GP algorithm and its modified version naturally fits the hierarchical structure of large data networks and we would expect speed-up in convengence. The proposed HAD-GP algorithm adds a D/C step into the modified IAD-GP algorithm. The HAD-GP algorithm also makes use of the hierarchical-structure topology of large data networks and achieves significant improvement in convergence speed, especially under a distributed environment. The speed-up effects are demonstrated by the numerical implementations comparing the HAD-GP algorithm with the (original and modified) IAD-GP and the ordinary GP (ORD-GP) algorithm.

  • PDF

A Delta-based Data Aggregation Scheme for Enhancing the Correctness of Data Aggregation in Wireless Sensor Networks (무선 센서 네트워크에서 데이터 수집의 정확성 향상을 위한 Delta 기반의 데이터 병합기법)

  • Kim, Byun-Gon;Yu, Tae-Young;Ra, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.840-845
    • /
    • 2007
  • In a wireless sensor network, a middleware used to support efficient processing and fast delivering of sensing data should handle the data loss problem at an intermediate sensor node caused by unexpected sudden data burst. In his paper, it proposes a Delta-Average method for enhancing the efficiency of data aggregation and correctness where the sensed data should be delivered only with the limited computing power and energy resource. With the proposed method, unnecessary data transfer of the duplicate data is eliminated and data correctness is enhanced by using the proposed averaging and data differentiating scheme when an instantaneous data burst is occurred. Finally, with the TOSSTM simulation results on TinyDB, we verify that the correctness of the transferred data is enhanced.

A Proposed Scheme for Channel and Timeslot Co-Scheduling Data Aggregation in MWSNs: An Algorithm Design (MWSN에서 채널 및 타임 슬롯 공동 스케줄링 데이터 집계를 위한 제안 계획 : 알고리즘 설계)

  • Vo, Vi Van;Kim, Moonseong;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.05a
    • /
    • pp.44-46
    • /
    • 2020
  • Aggregating data with an optimal delay, which is a critical problem in Wireless Sensor Networks applications, is proven as NP-hard. In this paper, we focus on optimizing the aggregation delay by presenting an idea for channel and timeslot co-scheduling data aggregation in MWSNs. The proposed scheme, which names Break and Join, maximizes the number of sensor nodes to be scheduled in a working period, so that the overall number of working periods and data collection delay are reduced.

Dynamic Timeout Scheduling for Energy-Efficient Data Aggregation in Wireless Sensor Networks based on IEEE 802.15.4 (IEEE 802.15.4기반 무선센서네트워크에서 에너지 효율적인 데이터 병합을 위한 동적 타임아웃 스케줄링)

  • Baek, Jang-Woon;Nam, Young-Jin;Seo, Dae-Wha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.933-937
    • /
    • 2009
  • This paper proposes a dynamic timeout scheduling for energy efficient and accurate aggregation by analyzing the single hop delay in wireless sensor networks based on IEEE 802.15.4. The proposed scheme dynamically configures the timeout value depending on both the number of nodes sharing a channel and the type of wireless media, with considering the results of delay analysis of the single hop delay. The timeout of proposed scheme is much smaller than the maximum single hop delay which is used as the timeout of traditional data aggregation schemes. Therefore the proposed scheme considerably reduces the energy consumption of idle monitoring for waiting messages. Also, the proposed scheme maintains the data accuracy by guaranteeing the reception ratio required by the sensor network applications. Extensive simulation has revealed that proposed scheme enhances energy consumption by 30% with maintaining data accuracy, as compared with the TAG data aggregation.