Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 21, Issue 3, Pages 783-798Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2020.3019470
Keywords
Wireless sensor networks; Approximation algorithms; Monitoring; Batteries; Wireless communication; Prediction algorithms; Sensors; Battery-free; sensor network; coverage
Funding
- National Natural Science Foundation of China [61632010, 61832003, U1811461, 61732003]
Ask authors/readers for more resources
This paper introduces the features of battery-free wireless sensor network (BF-WSN), defines a new coverage problem in BF-WSN, and proposes several algorithms to solve it. Extensive simulations demonstrate the effectiveness and efficiency of these algorithms.
Battery-free wireless sensor network (BF-WSN) is a newly proposed network architecture to address the limitation of traditional wireless sensor networks (WSNs). The special features of BF-WSNs make the coverage problem quite different and even more challenging from and than that in traditional WSNs. This paper defines a new coverage problem in BF-WSNs which aims at maximizing coverage quality rather than prolonging network lifetime. The newly defined coverage problem is proved to be at least NP-Hard. Two sufficient conditions, under which the optimal solution of the problem can be derived in polynomial time, are given in this paper. Furthermore, three approximate algorithms are proposed to derive nearly optimal coverage when the sufficient conditions are unsatisfied. The time complexity and approximate ratio of the three algorithms are analyzed. Extensive simulations are carried out to examine the performance of the proposed algorithms. The simulation results show that these algorithms are efficient and effective.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available