DAG based in-network aggregation for sensor network monitoring

Wireless sensor network monitoring is important for network maintenance, since it keeps the observer aware of node failures, resource depletion etc. Since communication overheads increase if the sink collects data individually from all sensor nodes, in-network data aggregation methods have been proposed which reduce the overheads. They form a routing tree and data follows up from the edge of the tree to the sink. However, in the event of heavy packet loss, the error margin of the collected data received by the sink grows. Furthermore, when the assumed hop count of the edge of the tree is smaller than the actual count, data can not be followed up from the edge. For the reasons mentioned above, observers find it problematic to assess the state of the network, since the error margin increases as the accuracy of the collected data falls. In this paper, we propose a new in-network aggregation method for sensor network monitoring. The method provides fault tolerance for packet loss by forming a directed acyclic graph (DAG), which allows a node to have multiple parent nodes. In addition, the method can ensure correct data transmission timing, according to the actual hop count of the edge of the DAG. Furthermore, we evaluated the proposed method in comparison with the existing methods, from the perspective of the error margin of the collected data