Distributed Energy-Adaptive Aggregation Scheduling with Coverage Guarantee For Battery-Free Wireless Sensor Networks

Thanks to the recent advances in energy-harvesting devices, nodes equipped with such devices arc produced and enable Wireless Sensor Networks (WSNs) to be energy self sustainable. Such networks are named as Battery-Free WSNs (BF-WSNs). Data aggregation is an essential operation in WSNs, and the Minimum Latency Aggregation Scheduling (MLAS) problem which seeks a collision-free aggregation scheduling with the minimum latency has been well studied in Battery-Powered WSNs (BP-WSN). In BP-WSNs, latency is mainly caused by the time overhead in collision-avoiding. However, the time consumption for node recharging is the main cause of latency in BF-WSNs. Moreover, the collisions are time-independent while the recharge rate is time-varying. Therefore, the previous algorithms are not suitable 14 BF-WSNs. In addition, if aggregating data from all nodes, the latency would he determined by the node with the lowest recharge rate. Thus, we propose to aggregate a subset of nodes which can meet the given coverage quality requirement. Meanwhile, the aggregation tree and scheduling strategy should be adaptive to the current energy condition. We formulate this problem and propose a distributed algorithm which can select nodes adaptively according to their energy condition and schedule these nodes to achieve the minimum latency, simultaneously. To the best of our knowledge, it is the first distributed algorithm to solve the MLAS problem with coverage guarantee in BF-WSNs. The simulation results verify that our algorithm can reduce aggregation latency effectively, especially in bad energy condition.