• 제목/요약/키워드: cost aggregation

검색결과 86건 처리시간 0.018초

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권2호
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

스테레오 비전에서 비용 축적 알고리즘의 비교 분석 (Comparative Analysis of Cost Aggregation Algorithms in Stereo Vision)

  • 이용환;김영섭
    • 반도체디스플레이기술학회지
    • /
    • 제15권1호
    • /
    • pp.47-51
    • /
    • 2016
  • Human visual system infers 3D vision through stereo disparity in the stereoscopic images, and stereo visioning are recently being used in consumer electronics which has resulted in much research in the application field. Basically, stereo vision system consists of four processes, which are cost computation, cost aggregation, disparity calculation, and disparity refinement. In this paper, we present and evaluate the existing various methods, focusing on cost aggregation for stereo vision system to comparatively analyze the performance of their algorithms for a given set of resources. Experiments show that Normalized Cross Correlation and Zero-Mean Normalized Cross Correlation provide higher accuracy, however they are computationally heavy for embedded system in the real time systems. Sum of Absolute Difference and Sum of Squared Difference are more suitable selection for embedded system, but they should be required on improvement to apply to the real world system.

Privacy-Preserving, Energy-Saving Data Aggregation Scheme in Wireless Sensor Networks

  • Zhou, Liming;Shan, Yingzi
    • Journal of Information Processing Systems
    • /
    • 제16권1호
    • /
    • pp.83-95
    • /
    • 2020
  • Because sensor nodes have limited resources in wireless sensor networks, data aggregation can efficiently reduce communication overhead and extend the network lifetime. Although many existing methods are particularly useful for data aggregation applications, they incur unbalanced communication cost and waste lots of sensors' energy. In this paper, we propose a privacy-preserving, energy-saving data aggregation scheme (EBPP). Our method can efficiently reduce the communication cost and provide privacy preservation to protect useful information. Meanwhile, the balanced energy of the nodes can extend the network lifetime in our scheme. Through many simulation experiments, we use several performance criteria to evaluate the method. According to the simulation and analysis results, this method can more effectively balance energy dissipation and provide privacy preservation compared to the existing schemes.

Transformation of Continuous Aggregation Join Queries over Data Streams

  • Tran, Tri Minh;Lee, Byung-Suk
    • Journal of Computing Science and Engineering
    • /
    • 제3권1호
    • /
    • pp.27-58
    • /
    • 2009
  • Aggregation join queries are an important class of queries over data streams. These queries involve both join and aggregation operations, with window-based joins followed by an aggregation on the join output. All existing research address join query optimization and aggregation query optimization as separate problems. We observe that, by putting them within the same scope of query optimization, more efficient query execution plans are possible through more versatile query transformations. The enabling idea is to perform aggregation before join so that the join execution time may be reduced. There has been some research done on such query transformations in relational databases, but none has been done in data streams. Doing it in data streams brings new challenges due to the incremental and continuous arrival of tuples. These challenges are addressed in this paper. Specifically, we first present a query processing model geared to facilitate query transformations and propose a query transformation rule specialized to work with streams. The rule is simple and yet covers all possible cases of transformation. Then we present a generic query processing algorithm that works with all alternative query execution plans possible with the transformation, and develop the cost formulas of the query execution plans. Based on the processing algorithm, we validate the rule theoretically by proving the equivalence of query execution plans. Finally, through extensive experiments, we validate the cost formulas and study the performances of alternative query execution plans.

활동기준원가시스템의 원가동인 선택 및 병합 (Cost Driver Selection and Aggregation for Activity-Based Costing)

  • 이한;이경근
    • 경영과학
    • /
    • 제17권2호
    • /
    • pp.115-124
    • /
    • 2000
  • Activity-Based Costing(ABC) is an accounting cost system which allocates the overhead cost to each cost object more accurately. ABC system achieves improved accuracy in estimating the cost of cost object by using multiple cost drivers to trace the cost of activities to the cost objects associated with the resources consumed by those activities. The selection and the aggregation of these cost driver candidates can pose difficult problems. This paper deals with these problems in mathematical programming approach. The first model is formulated as an integer programming model in cost driver selection and the second model is formulated as multi-objective goal programming model in reduction of cost drivers already selected.

  • PDF

영상의 깊이정보 추출을 위한 weighted cost aggregation 기반의 스테레오 정합 기법 (Weighted cost aggregation approach for depth extraction of stereo images)

  • 윤희주;차의영
    • 한국정보통신학회논문지
    • /
    • 제13권6호
    • /
    • pp.1194-1199
    • /
    • 2009
  • 스테레오 비전 시스템(stereo vision system)은 2차원 영상정보를 이용하여 3차원 깊이 정보를 획득하는 데 유용한 방법으로, 그동안 많은 연구가 진행되었다. 3차원 깊이 정보를 획득하기 위해서는 영상의 대응점을 찾아야 하는데, 속도와 정확성을 동시에 만족시키기가 어렵다. 이러한 문제를 해결하기 위해, 본 논문에서는 적응적 가중치(weight)를 적용한 cost aggregation 기반의 스테레오 정합 기법을 제안한다. 이 방법은 스테레오 영상의 특징을 이용하여 가중치를 획득하고, 색상정보, 밝기정보에 거리정보를 이용하여 가중치를 적용한 후, 이를 이용하여 대응점을 찾아 깊이 정보를 추출한다. 제안된 방법의 성능을 평가하기 위하여 ground truth가 존재하는 다양한 스테레오 영상을 이용하여 실험하였으며, 실험 결과 다양한 영상에서도 향상된 결과를 보였다.

영상의 깊이정보 추출을 위한 weighted cost aggregation 기반의 스테레오 정합 기법 (Weighted cost aggregation approach for depth extraction of stereo images)

  • 윤희주;차의영
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 춘계학술대회
    • /
    • pp.396-399
    • /
    • 2009
  • 스테레오 비전 시스템(stereo vision system)은 2차원 영상정보를 이용하여 3차원 깊이 정보를 획득하는 데 유용한 방법으로, 그동안 많은 연구가 진행되었다. 3차원 깊이 정보를 획득하기 위해서는 영상의 대응점을 찾아야 하는데, 속도와 정확성을 동시에 만족시키기가 어렵다. 이러한 문제를 해결하기 위해, 본 논문에서는 적응적 가중치(weight)를 적용한 cost aggregation 기반의 스테레오 정합 기법을 제안한다. 이 방법은 스테레오 영상의 특징을 이용하여 가중치를 획득하고, 색상정보, 밝기정보, 거리정보에 가중치를 적용한 후, 이를 이용하여 대응점을 찾아 깊이 정보를 추출한다. 제안된 방법의 성능을 평가하기 위하여 ground truth가 존재하는 다양한 스테레오 영상을 이용하여 실험하였으며, 실험 결과 다양한 영상에서도 향상된 결과를 보였다.

  • PDF

네트워크 보안 기능을 갖는 패킷처리 기반의 링크 통합 장비 설계 (The Design of a Link Aggregation Equipment Based on Packet Processing with Network Security Capability)

  • 신재흥;김홍렬;이상하;허용민;이상철
    • 전기학회논문지P
    • /
    • 제60권3호
    • /
    • pp.150-154
    • /
    • 2011
  • The technology to build high speed network using low cost DSL in the areas where the cost to build high speed network is high and the network environment is not very accommodating is important in providing the high speed network that meets the user demand and utilizing the network resources in an efficient way. This study presents development of the link aggregation equipment that performs the access control and firewall functions for packet processing based LAN users. The equipments developed support up to 5 line link aggregation as opposed to current 2 line link aggregation. The equipments also allow the use of high speed network in the areas where the network environment is not very accommodating. Also, the fail-over function is added to each line to provide reliability and the self-security function is enhanced to protect the network from unauthorized use and prevents waste of network resources by authorized users.

Local stereo matching using combined matching cost and adaptive cost aggregation

  • Zhu, Shiping;Li, Zheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.224-241
    • /
    • 2015
  • Multiview plus depth (MVD) videos are widely used in free-viewpoint TV systems. The best-known technique to determine depth information is based on stereo vision. In this paper, we propose a novel local stereo matching algorithm which is radiometric invariant. The key idea is to use a combined matching cost of intensity and gradient based similarity measure. In addition, we realize an adaptive cost aggregation scheme by constructing an adaptive support window for each pixel, which can solve the boundary and low texture problems. In the disparity refinement process, we propose a four-step post-processing technique to handle outliers and occlusions. Moreover, we conduct stereo reconstruction tests to verify the performance of the algorithm more intuitively. Experimental results show that the proposed method is effective and robust against local radiometric distortion. It has an average error of 5.93% on the Middlebury benchmark and is compatible to the state-of-art local methods.

무선 센서 네트워크에서 최소 통신비용 수행을 위한 허위 데이터 식별 프로토콜 (An Approach of False Data Identification Protocol for Minimum Communication Cost in Wireless Sensor Network)

  • ;박승규;신승훈
    • 한국컴퓨터정보학회논문지
    • /
    • 제16권10호
    • /
    • pp.121-129
    • /
    • 2011
  • 무선 센서 네트워크에서 compromised node는 데이터 병합과정에서 허위 데이터를 삽입할 수 있다. 데이터 병합의 보안성을 위한 기존 접근 방법들은 높은 연산 부하를 요구한다. 따라서 본 논문에서는 허위 데이터 삽입 공격 발생 지점을 식별하는데 소요되는 통신 부하를 최소화하는 모니터링 기반 시큐어 데이터 병합 프로토콜을 제안한다. 제안된 프로토콜은 허위 데이터 삽입이 탐지되면 모니터링을 수행하고 있던 노드들의 MAC(Message Authentication Code)을 하나의 메시지로 요약하고 이를 BS(Base Station)로 전송하는 방법을 사용하며, BS는 이를 통해 공격 노드를 식별한다. 실험 결과는 제안된 프로토콜이 MAC들의 짧은 연결과 보통 연결을 사용하는 경우, 기존 연구에 비해 각각 45% 및 36% 적은 에너지를 사용하는 것으로 나타났다.