Latency-and-Coverage Aware Data Aggregation Scheduling for Multihop Battery-Free Wireless Networks
Latency-and-Coverage Aware Data Aggregation Scheduling for Multihop Battery-Free Wireless Networks
复制标题
DOI：
10.1109/twc.2020.3036408
复制
发表时间：
2021-03-01
影响因子：
10.4
通讯作者：
Chen, Quan
中科院分区：
文献类型：
--
作者：
Cai, Zhipeng;Chen, Quan
近年来，无电池无线传感器网络（BF - WSNs）受到了越来越多的关注。为了降低BF - WSNs中的延迟，最近提出了具有覆盖要求q的最小延迟聚合调度（MLAS）问题，该问题试图选择q%的节点进行通信和聚合。在现有的方法中，作者试图根据节点的能量状态自适应地选择节点，并对这些节点进行调度以实现最小延迟。不幸的是，它无法保证聚合节点的分布，可能导致这些节点挤在一个小区域内，聚合质量较差。因此，我们在本文中重新研究q - 覆盖的MLAS问题，它可以保证聚合节点均匀分布。首先，研究了1 - 覆盖的MLAS问题，即每个节点至少能被一个聚合节点覆盖。为了降低延迟，我们同时将聚合节点的选择和无冲突通信调度的计算交织在一起。分别通过自下而上和自上而下的方式调度通信任务，提出了两种算法。其次，为了满足任意覆盖要求q，提出了三种算法以保证聚合节点在网络中低延迟均匀分布。此外，还研究了将所提算法扩展到具有多个信道的BF - WSNs的方法。理论分析和仿真结果验证了所提算法在延迟方面具有高性能。
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.