ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Branch-Based Centralized Data Collection for Smart Grids Using Wireless Sensor Networks
Cited 13 time in scopus Download 49 time Share share facebook twitter linkedin kakaostory
저자
김광수, 진성일
발행일
201505
출처
Sensors, v.15 no.5, pp.11854-11872
ISSN
1424-8220
출판사
MDPI AG
DOI
https://dx.doi.org/10.3390/s150511854
협약과제
14IC2400, 개방형 시맨틱 USN 서비스 플랫폼 기술 개발, 방효찬
초록
A smart grid is one of the most important applications in smart cities. In a smart grid, a smart meter acts as a sensor node in a sensor network, and a central device collects power usage from every smart meter. This paper focuses on a centralized data collection problem of how to collect every power usage from every meter without collisions in an environment in which the time synchronization among smart meters is not guaranteed. To solve the problem, we divide a tree that a sensor network constructs into several branches. A conflict-free query schedule is generated based on the branches. Each power usage is collected according to the schedule. The proposed method has important features: shortening query processing time and avoiding collisions between a query and query responses. We evaluate this method using the ns-2 simulator. The experimental results show that this method can achieve both collision avoidance and fast query processing at the same time. The success rate of data collection at a sink node executing this method is 100%. Its running time is about 35 percent faster than that of the round-robin method, and its memory size is reduced to about 10% of that of the depth-first search method.
키워드
Collision avoidance, Data collection, Smart grid, Wireless sensor network
KSP 제안 키워드
Data Collection, Memory size, Network simulator-2(NS2), Power Usage, Query Processing, Running time, Sensor node, Sink node, Smart city, Smart grids, Success rate
본 저작물은 크리에이티브 커먼즈 저작자 표시 (CC BY) 조건에 따라 이용할 수 있습니다.
저작자 표시 (CC BY)