Abstract
This article considers deriving set covers or the set of active nodes that are responsible for monitoring all targets in an Internet of Things (IoT) network. A key distinction to prior works is that this article considers sensor nodes aided by backscatter communications, which allow them to communicate with negligible energy cost using ambient radio frequency (RF) signals. The article contains three main novelties. First, it presents a mixed integer linear program (MILP) that can be used to compute the global optimal solution. Second, it also outlines a centralized greedy scheduling (CGS) algorithm that selects nodes based on their energy and the number of covered targets. Third, it presents a distributed greedy scheduling (DGS) algorithm that selects nodes according to their energy level. The simulation results show that equipping nodes with ambient backscattering capability increases the ratio of complete targets coverage by more than 100% as compared to existing techniques.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call