.png){kind=icon}
.png){kind=icon}
Return
Broadcast Scheduling in Battery-Free Wireless Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.1145/3356472.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Battery-Free Wireless Sensor Networks (BF-WSNs) are newly emerging Wireless Sensor Networks (WSNs) to break through the energy limitations of traditional WSNs. In BF-WSNs, the broadcast scheduling problem is more challenging than that in traditional WSNs. This article investigates the broadcast scheduling problem in BF-WSNs with the purpose of minimizing broadcast latency. Me Minimum-Latency Broadcast Scheduling problem in BF-WSNs (MLBS-BF) is formally defined and its NP-hardness is proved. Three approximation algorithms for solving the MLBS-BF problem are proposed. The broadcast latency of the broadcast schedules produced by the proposed algorithms is analyzed. The correctness and approximation ratio of the proposed algorithms are also proved. Finally, extensive simulations are conducted to evaluate the performances of the proposed algorithms. The simulation results show that the proposed algorithms have high performance.
Keywords:
Battery-free wireless sensor networks
broadcast scheduling
minimum broadcast latency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.7
Papers:
995
Citations:
2.0K