# On Maximizing Sampling Time of RF-Harvesting Sensor Nodes Over Random   Channel Gains

**Authors:** Changlin Yang, Kwan-Wu Chin, Ying Liu

arXiv: 1803.08104 · 2018-03-23

## TL;DR

This paper develops a stochastic programming approach to optimize the charging and sampling times of RF-powered sensor nodes under random channel conditions, minimizing energy shortfalls in IoT environments.

## Contribution

It introduces a novel stochastic model for maximizing sampling time of RF-harvesting sensor nodes considering random channel gains, with solutions for single and multiple time slots.

## Key findings

- The proposed model effectively minimizes expected energy shortfall penalties.
- Numerical experiments validate the approach across Gaussian, Rayleigh, and Rician channel distributions.
- The method provides near-optimal charging and sampling times in simulated environments.

## Abstract

In the future, sensor nodes or Internet of Things (IoTs) will be tasked with sampling the environment. These nodes/devices are likely to be powered by a Hybrid Access Point (HAP) wirelessly, and may be programmed by the HAP with a {\em sampling time} to collect sensory data, carry out computation, and transmit sensed data to the HAP. A key challenge, however, is random channel gains, which cause sensor nodes to receive varying amounts of Radio Frequency (RF) energy. To this end, we formulate a stochastic program to determine the charging time of the HAP and sampling time of sensor nodes. Our objective is to minimize the {\em expected} penalty incurred when sensor nodes experience an energy shortfall. We consider two cases: {\em single} and {\em multi} time slots. In the former, we determine a suitable HAP charging time and nodes sampling time on a slot-by-slot basis whilst the latter considers the best charging and sampling time for use in the next $T$ slots. We conduct experiments over channel gains drawn from the Gaussian, Rayleigh or Rician distribution. Numerical results confirm our stochastic program can be used to compute good charging and sampling times that incur the minimum penalty over the said distributions.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1803.08104/full.md

## Figures

13 figures with captions in the complete paper: https://tomesphere.com/paper/1803.08104/full.md

## References

18 references — full list in the complete paper: https://tomesphere.com/paper/1803.08104/full.md

---
Source: https://tomesphere.com/paper/1803.08104