• 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.

• 제어로봇시스템학회논문지
• /
• 제22권11호
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.

• 한국통신학회논문지
• /
• 제33권12B호
• /
• pp.1097-1102
• /
• 2008

An effective method for calculating delay bounds of flows through flow aggregations and deaggregations is given. Based on this calculation, it is suggested a simple criteria for flow aggregation whether the aggregation will induce an increased delay bound. The criteria is evaluated in a few realistic scenarios.

• 대한산업공학회지
• /
• 제40권5호
• /
• pp.520-525
• /
• 2014

When the PCF (Point Coordinated Function) MAC protocol is combined with the frame aggregation method to enhance the MAC performance in IEEE 802.11 wireless LANs, the formulae for the optimal frame aggregation level for best PCF MAC performance were derived in our previous study. We extend the formulae for the PCF protocol to derive the optimal frame aggregation level for the connectivity-based multipolling MAC protocol in IEEE 802.11 wireless LANs. By simulations, we compare the performances of IEEE 802.11 wireless LANs with the optimal and random frame aggregation levels. Compared with the random frame aggregation level, the optimal frame aggregation level significantly improves the performance of IEEE 802.11 wireless LANs.

• 한국정보과학회논문지:데이타베이스
• /
• 제33권5호
• /
• pp.463-475
• /
• 2006

교통 관리 시스템과 같은 응용에서는 공간 데이타 웨어하우스의 공간 계층을 이용한 분석을 수행하는데, 이러한 분석에서는 주로 단순한 집계정보만을 요구한다. 공간 계층 기반의 집계정보 제공을 위하여 기존의 연구들은 공간 인덱스를 사용한 해결방법을 제시하였는데, 대부분의 연구들은 공간 인덱스 중 가장 널리 이용되는 R-tree를 확장한 방법을 이용하였다. 그러나 단순히 현재 집계 정보만을 제공하여 수년에 걸친 분석을 요구하는 교통 정책에 대하여 의사결정을 지원할 수 없었다. 본 논문에서는 과거의 집계정보까지 관리할 수 있는 aR-tree(Aggregation R-tree)기반의 하이브리드 인덱스를 제안한다. 제안 기법은 aR-tree를 이용하여 공간 계층과 현재시점의 집계정보를 제공하며, 시간 구조체를 이용한 정렬 해쉬 테이블로 시간 계층과 과거의 집계정보를 제공한다. 따라서 제안기법은 시공간 분석을 통한 효율적인 의사결정을 지원하며, 이는 현재의 교통 분석 및 과거를 통한 교통 정책 결정을 가능하게 한다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.331-334
• /
• 2005

This paper suggests the Ethernet aggregation to XGMII framing procedure (EAXFP) mechanism to economically combine the traffic adaptation technology with the link aggregation method in designing 10 Gigabit Ethernet (10 GbE) interfaces. This design sidesteps the data-loss issues that can result from designing an interface with only one link. The most critical issue in relation to the link aggregation interface is the algorithm used to control frame distribution between the ten ports. The proposed EAXFP mechanism offers an efficient link aggregation method as well as an efficient frame distribution algorithm, which maximize the throughout of the 10 GbE interface. In the experiment and analysis of the proposed mechanism, it was also discovered that the 10 GbE interface that uses the proposed EAXFP mechanism significantly reduced the packet loss rate. When there will be heavy traffic loads come about in the future, the proposed EAXFP mechanism assures an efficient and economical transmission performance on the router system.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 춘계학술발표대회
• /
• pp.212-213
• /
• 2015

Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. On constructing a robust algorithm for minimizing data aggregation delay in wireless sensor networks, we consider limited transmission range sensors and approximate the minimum-delay data aggregation tree which can only be built in networks of unlimited transmission range sensors. The paper proposes an adaptive method that can be applied to maintain the network structure in case of a sensor node fails. The data aggregation tree built by the proposed scheme is therefore self-healing and robust. Intensive simulations are carried out and the results show that the scheme could adapt well to network topology changes compared with other approaches.

• 한국콘텐츠학회논문지
• /
• 제8권7호
• /
• pp.35-42
• /
• 2008

본 논문에서 제안된 스패닝 트리 토폴로지 요약기법은 모든 경로를 찾는 대신 홉 카운트 기반의 깊이 우선 방식을 사용하여 효율적으로 다중 경로를 탐색할 수 있도록 하였다. 이를 위해 토폴로지 요약 정보를 줄이고 다중링크 요약에 유연성을 부여하기 위하여 대역폭과 지연의 한 쌍으로 구성된 두 개의 라인 세그먼트를 이용하는 수정된 라인 세그먼트 기법을 제안하였다. 그리고, 이를 기존의 스패닝 트리 토폴로지 요약에 적용한 효율적인 토폴로지 요약기법을 제안하였다. 제안된 기법의 성능을 평가하기 위해 기존의 스패닝 트리 기법과 호 성공율, 접근시간 및 크랭크 백 율에 대하여 컴퓨터 시뮬레이션을 통해 비교 분석하였다. 시뮬레이션 분석결과 제안된 스패닝 트리 토폴로지 요약 기법이 기존의 기법보다 성능이 향상됨을 알 수 있었다.

• 융합보안논문지
• /
• 제8권2호
• /
• pp.95-102
• /
• 2008

본 논문에서는 simple node 토폴로지의 망 정보를 효율적으로 요약함으로써 망에서의 호 성공률, 액세스 타임을 향상시켜 망의 전체적인 QoS를 향상시키기 위한 토폴로지 요약 기법을 제안하였다. 제안된 기법에서는 대역폭과 지연 파라미터를 중심으로 라인 세그먼트를 이용하여 경계노드 사이의 다중 경로 정보를 요약함으로써 토폴로지 요약 정보를 줄이고 다중링크 요약에 유연성을 부여하여 망의 성능을 향상시킬 수 있었다. 제안된 기법의 성능을 평가하기 위해 기존의 simple node 토폴로지 요약 기법과 호 성공률, 접근시간에 대하여 컴퓨터 시뮬레이션을 통해 비교 분석하였다.

• Structural Engineering and Mechanics
• /
• 제30권4호
• /
• pp.467-480
• /
• 2008

An aggregation multigrid method (AMM) is a leading iterative solver in solid mechanics. Recently, AMM is applied for solving Schur Complement system in the FE analysis of shell structures. In this work, an extended application of AMM for solving Schur Complement system in the FE analysis of continuum elements is presented. Further, the performance of the proposed AMM in multiple load cases, which is a challenging problem for an iterative solver, is studied. The proposed method is developed by combining the substructuring and the multigrid methods. The substructuring method avoids factorizing the full-size matrix of an original system and the multigrid method gives near-optimal convergence. This method is demonstrated for the FE analysis of several elastostatic problems. The numerical results show better performance by the proposed method as compared to the preconditioned conjugate gradient method. The smaller computational cost for the iterative procedure of the proposed method gives a good alternative to a direct solver in large systems with multiple load cases.