期刊论文详细信息
Sensors
Branch-Based Centralized Data Collection for Smart Grids Using Wireless Sensor Networks
Kwangsoo Kim1  Seong-il Jin2  Antonio Puliafito3  Symeon Papavassiliou3 
[1]UGS Convergence Research Department, ETRI, 208 Gajeong-ro Yuseong-gu, Daejeon 305-700, Korea
[2] E-Mail:
[3]Department of Computer Engineering, Chungnam National University, 99 Daehak-ro Yuseong-gu, Daejeon 305-764, Korea
[4]UGS Convergence Research Department, ETRI, 208 Gajeong-ro Yuseong-gu, Daejeon 305-700, Korea
[5] E-Mail
关键词: smart grid;    data collection;    wireless sensor network;    collision avoidance;   
DOI  :  10.3390/s150511854
来源: mdpi
PDF
【 摘 要 】

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.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.

【 预 览 】
附件列表
Files Size Format View
RO202003190012192ZK.pdf 1167KB PDF download
  文献评价指标  
  下载次数:8次 浏览次数:8次