Abstract
A wireless rechargeable sensor network (WRSN) consists of sensor nodes that can harvest energy emitted from wireless chargers for refilling their batteries so that the WRSN can operate sustainably. This paper assumes wireless chargers are equipped with directional antennas, and are deployed on grid points of a fixed height to propose two heuristic algorithms solving the following wireless charger deployment optimization (WCDO) problem: how to deploy as few as possible chargers to make the WRSN sustainable. Both algorithms model the charging space of chargers as a cone and calculate charging efficiency according power regression expressions complying with the Friis transmission equation. The two algorithms are the greedy cone covering (GCC) algorithm and the adaptive cone covering (ACC) algorithm. The GCC (respectively, ACC) algorithm greedily (respectively, adaptively) generates candidate cones to cover as many as possible sensor nodes. Both algorithms then greedily select the fewest number of candidate cones, each of which corresponds to the deployment of a charger, to have approximate solutions to the WCDO problem. We perform experiments, conduct simulations and do analyses for the algorithms to compare them in terms of the time complexity, the number of chargers deployed, and the execution time.
Highlights
A wireless rechargeable sensor network (WRSN) [1] consists of many rechargeable sensor nodes and one or more sink nodes
Some other studies [14,15,16,17,18,19,20] investigate battery-less or battery-free wireless sensor networks (WSNs) in which sensor nodes are powered by capacitors storing energy harvested through wireless power transmission (WPT), especially microwave power transmission (MPT)
Reference the outperforms adaptive cone covering (ACC) in terms of the number of chargers required. This is because greedy cone covering (GCC) greedily[28], adjusts sensor can directions use the energy efficiently when ratiosmore for the processor sleep chargernode antenna to themost extreme for some casesthe to cover sensor nodesprocessing, by one candidate mode, transmission mode, and reception mode are
Summary
A wireless rechargeable sensor network (WRSN) [1] consists of many rechargeable sensor nodes and one or more sink nodes. Given a set of WRSN sensor nodes equipped with and the Powercast P2110-EVAL-02 harvester (Powercast Corp.) [22] It is a cost-consuming task, harvesters, the WCDO addresses how to deploy as few as possible chargers to cover all sensor nodes as wireless chargers aretheir expensive. Given a set of WRSN sensor nodes equipped with chargers are equipped with directional antennas whose charging space is modeled as a cone and harvesters, the WCDO addresses few as possible chargers cover all sensor nodes charging efficiency complieshow with to thedeploy. It to is assumed that chargers are deployed on grid points at a specific height and the sensor nodes equipped for satisfying their energy requirements to make the WRSN sustainable. GCC (respectively, ACC) algorithm greedilythat wireless generates candidate coneswhose that can charging cover as many as possible sensor nodes.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
