4.5 Article

Energy-collision-aware Minimum Latency Aggregation Scheduling for Energy-harvesting Sensor Networks

期刊

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3461013

关键词

Aggregation scheduling; low latency; energy harvesting; wireless sensor networks

资金

  1. National Natural Science Foundation of China [61632010, 61802071, U1701262, 62002071, U2001201, U1801263]
  2. Guangdong Provincial Key Laboratory of Cyber-Physical System [2020B1212060069]
  3. Projects of Science and Technology Plan of Guangdong province [2018A030310541, 2020B010164001, 2020A1515011132]
  4. Special Foundation of Department of Natural Resources of Guangdong Province [GDNRC[2020]024]
  5. Hong Kong Scholars Program

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

This article investigates the Minimum Latency Aggregation Scheduling (MLAS) problem in EH-WSNs and identifies a new type of collision called energy-collision. Several special structures are designed to avoid it during data aggregation. Three scheduling algorithms are proposed under the protocol interference model, and several approximate algorithms are designed under the physical interference model to improve performance.
The emerging energy-harvesting technology enables charging sensor batteries with renewable energy sources, which has been effectively integrated into Wireless Sensor Networks (EH-WSNs). Due to the limited energy-harvesting capacities of tiny sensors, the captured energy remains scarce and differs greatly among nodes, which makes the data aggregation scheduling problem more challenging than that in energy-abundant WSNs. In this article, we investigate the Minimum Latency Aggregation Scheduling (MLAS) problem in EH-WSNs. First, we identify a new kind of collision in EH-WSNs, named as energy-collision, and design several special structures to avoid it during data aggregation. To reduce the latency, we try to choose the parent adaptively according to nodes' transmission tasks and energy-harvesting ability, under the consideration of collisions avoidance. By considering transmitting time, residual energy, and energy-collision, three scheduling algorithms are proposed under protocol interference model. Under physical interference model, several approximate algorithms are also designed by taking account of the interference from the nodes several hops away. Finally, the theoretical analysis and simulation results verify that the proposed algorithms have high performance in terms of latency.

作者

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

评论

主要评分

4.5
评分不足

次要评分

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

推荐

暂无数据
暂无数据