Dynamic multi-resolution data dissemination in storage-centric wireless sensor networks

Recently, several storage-centric wireless sensor networks (WSNs) have been developed to store massive sensor data in the network. A crucial task of these networks is to disseminate useful information to the users at dynamic temporal resolutions. We formulate the problem of dynamic multi-resolution data dissemination in this paper. We propose a novel solution called the Minimum Incremental Dissemination Tree (MIDT) that includes an online tree construction algorithm with analytical performance bound and two lightweight tree adaptation heuristics for handling data requests with dynamic temporal resolutions. Our simulations show that MIDT outperforms several typical data dissemination schemes. The two tree adaptation heuristics can effectively maintain desirable energy efficiency of the dissemination tree while minimizing the tree adaption overhead under representative traffic patterns in WSNs.