Title
Latency-and-Coverage Aware Data Aggregation Scheduling for Multihop Battery-Free Wireless Networks
Abstract
Battery-Free Wireless Sensor Networks (BF-WSNs) have been attracting increasing interests in the recent years. To reduce the latency in BF-WSNs, the Minimum Latency Aggregation Scheduling (MLAS) problem with coverage requirement q is proposed recently, which tries to choose q percent of nodes for communication and aggregation. In the existing method, the authors try to select nodes adaptively according to their energy status and schedule these nodes to achieve the minimum latency. Unfortunately, it cannot guarantee the distribution of the aggregated nodes and may result in these nodes being squeezed in a small area and a poor aggregation quality. Thus, we re-investigate the q-coverage MLAS problem in this article, which can guarantee that the aggregated nodes are distributed evenly. Firstly, the 1-coverage MLAS problem, in which each node can be covered by at least one aggregated node, is studied. To reduce the latency, we intertwine the selection of aggregated nodes and the computation of a collision-free communication schedule simultaneously. Two algorithms are proposed by scheduling the communication tasks in the bottom-up and top-down manner respectively. Secondly, to satisfy the arbitrary coverage requirement q, three algorithms are proposed to guarantee the aggregated nodes are evenly distributed in the network with a low latency. Additionally, the method to extend the proposed algorithms for the BF-WSNs with multiple channels is also studied. The theoretical analysis and simulation results verify that the proposed algorithms have high performance in terms of latency.
Year
DOI
Venue
2021
10.1109/TWC.2020.3036408
IEEE Transactions on Wireless Communications
Keywords
DocType
Volume
Data aggregation,latency-and-coverage aware,battery-free,multiple channels,wireless networks
Journal
20
Issue
ISSN
Citations 
3
1536-1276
4
PageRank 
References 
Authors
0.38
0
2
Name
Order
Citations
PageRank
Zhipeng Cai11928132.81
Quan Chen2517.05