4.7 Article

Structure-Free General Data Aggregation Scheduling for Multihop Battery-Free Wireless Networks

期刊

IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 21, 期 9, 页码 3342-3359

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2021.3053557

关键词

Wireless sensor networks; Schedules; Heuristic algorithms; Scheduling algorithms; Scheduling; Data aggregation; Sensors; Data aggregation; multiple queries; low latency; battery-free; wireless sensor networks (WSNs)

资金

  1. R&D projects in the key areas of Guangdong Province [2020B010164001]
  2. Key Program of NSFC-Guangdong Joints Funds [U1701262, U1801263]
  3. Projects of Science and Technology Plan of Guangdong province [2018A030310541, 2020A1515011132, 2017A010101017]
  4. National Natural Science Foundation of China [61802071, 61632010, U2001201]
  5. Special Foundation of Department of Natural Resources of Guangdong Province [GDNRC[2020]024]
  6. Guangdong Provincial Key Laboratory of Cyber-Physical System [2016B030301008]

向作者/读者索取更多资源

With advancements in wireless power transfer techniques, battery-free wireless sensor networks (BF-WSNs) have gained increasing attention for supporting long-term applications. However, the minimum latency aggregation scheduling (MLAS) problem in BF-WSNs has not been well studied. This paper investigates the general MLAS problem in BF-WSNs, targeting any subset of nodes and arbitrary number of aggregation queries. The proposed algorithms demonstrate high performance in terms of latency and energy efficiency.
With advances in wireless power transfer techniques, battery-free wireless sensor networks (BF-WSNs) which can support long-term applications, has been attracting increasing interests in recent years. Unfortunately, the problem of minimum latency aggregation scheduling (MLAS) is not well studied in BF-WSNs. Existing works always have a rigid assumption that there is only one single query which is targeted at the whole network. Aiming at making the work more practical and general, we investigate the general MLAS problem in BF-WSNs, which is targeted at any subset of nodes in the network and aimed for an arbitrary number of aggregation queries. First, the general MLAS problem when there is one single query is studied. To control the number of nodes participating in the aggregation process, a node selection algorithm is proposed to cover and connect the whole target nodes. Then, a latency and energy aware scheduling algorithm is proposed to integrate the construction of aggregation tree with the chosen nodes, and the computation of a conflict-free schedule simultaneously, relying on non-predetermined structures. Second, the general MLAS problem when there is a group of aggregation queries is studied. Through designing some special structures to avoid collisions between both current and existing aggregation schedules, an algorithm without any waiting time is proposed. Additionally, the algorithm under physical interference model and dynamic energy arrival model are also presented. The theoretical analysis and simulation results verify that the proposed algorithms have high performance in terms of latency and energy efficiency.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据