http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
무배터리 무선 센서 네트워크에서의 데이터 집적 스케줄링에 관한 새로운 라우팅 구조 방법
( Van-vi Vo ),김문성 ( Moonseong Kim ),추현승 ( Hyunseung Choo ) 한국정보처리학회 2022 한국정보처리학회 학술대회논문집 Vol.29 No.1
The emerging energy harvesting technology, which has been successfully integrated into Wireless Sensor Networks, enables sensor batteries to be charged using renewable energy sources. In the meantime, the problem of Minimum Latency Aggregation Scheduling (MLAS) in battery-powered WSNs has been well studied. However, because sensors have limited energy harvesting capabilities, captured energy is limited and varies greatly between nodes. As a result, all previous MLAS algorithms are incompatible with Battery-Free Wireless Sensor Networks (BF-WSNs). We investigate the MLAS problem in BF-WSNs in this paper. To make the best use of the harvested energy, we build an aggregation tree that leverages the energy harvesting rates of the sensor nodes with an intuitive explanation. The aggregation tree, which determines sender-receiver pairs for data transmission, is one of the two important phases to obtain a low data aggregation latency in the BF-WSNs.
듀티 사이클 MWSN 에서 데이터 집계를위한 개선 지연 효율적인 스케줄링 체계
( Van-vi Vo ),김문성 ( Moonseong Kim ),추현승 ( Hyunseung Choo ) 한국정보처리학회 2020 한국정보처리학회 학술대회논문집 Vol.27 No.2
In multi-channel wireless sensor networks, optimizing data aggregation delay without any channels and timeslots conflicts has been concerned these days. The aggregation delay can be reduced by using different aggregation tree construction methods or scheduling in different methods in bottom-up or top-down manners. In this paper, we propose a new way of constructing aggregation tree purposing to decrease the total aggregation delay. The result shows that our proposed scheme can improve up to 64% comparing with state-of-the-art schemes.
MWSN에서 채널 및 타임 슬롯 공동 스케줄링 데이터 집계를 위한 제안 계획 : 알고리즘 설계
( Vi Van Vo ),김문성 ( Moonseong Kim ),추현승 ( Hyunseung Choo ) 한국정보처리학회 2020 한국정보처리학회 학술대회논문집 Vol.27 No.1
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.
( Vi Van Vo ),염상길 ( Sanggil Yeoum ),추현승 ( Huynseung Choo ) 한국정보처리학회 2019 한국정보처리학회 학술대회논문집 Vol.26 No.1
Sampling-based algorithms are one of the most commonly approaches which give good results in robot path planning with many degree of freedom. So that many proposed methods as well as their improvement based on these approaches have been proposed. The purpose of this paper is to survey some current algorithms using for path planning, the original proposed methods as well as their improvement. Some advantages and disadvantages of these algorithms will be also mentioned, how the improved version of the proposed methods overcome the original proposed methods’ drawback.
무선 센서 네트워크에서 장애 검출을 위한 결합 주성분분석과 적응형 임계값
( Thien-binh Dang ),( Vi Van Vo ),( Duc-tai Le ),( Moonseong Kim ),( Hyunseung Choo ) 한국정보처리학회 2020 한국정보처리학회 학술대회논문집 Vol.27 No.1
Principal Component Analysis (PCA) is an effective data analysis technique which is commonly used for fault detection on collected data of Wireless Sensor Networks (WSN). However, applying PCA on the whole data make the detection performance low. In this paper, we propose Joint PCA and Adaptive Threshold for Fault Detection (JPATAD). Experimental results on a real dataset show a remarkably higher performance of JPATAD comparing to conventional PCA model in detection of noise which is a popular fault in collected data of sensors.