Data collection is an essential operation in smart grids using wireless sensor networks. In a smart grid, a smart meter generates power usage and a data collection unit periodically collects it from every smart meter. This paper focuses on a central data collection problem of how to quickly collect every power usage from every smart meter without collisions. To solve the problem, we divide a tree that a sensor network constructs into several branches. Each branch consists of all meters included in a path from a data collection unit to a leaf meter, and a conflict-free query schedule is generated based on branches. The novel method avoids collisions between a query and a query response as well as between query responses. The experimental results show that this method can achieve both collision avoidance and fast query processing at the same time.
[1]
Josh Long,et al.
Monitoring and Management
,
2011
.
[2]
Gerhard P. Hancke,et al.
Opportunities and Challenges of Wireless Sensor Networks in Smart Grid
,
2010,
IEEE Transactions on Industrial Electronics.
[3]
Ivan Stojmenovic,et al.
Depth first search and location based localized routing and QoS routing in wireless networks
,
2000,
Proceedings 2000 International Conference on Parallel Processing.
[4]
Janelle J. Harms,et al.
ENCAST: energy-critical node aware spanning tree for sensor networks
,
2005,
3rd Annual Communication Networks and Services Research Conference (CNSR'05).