← Back to the chapter · Previous detail · Next detail →

Technical detail · Energy Harvesting: Source Reality and Field Proof

Finite-store clipping and capacity limits

The finite-store ledger makes that clipping mechanism inspectable slot by slot. Begin with the 10 mJ store, then change only Harvest scale from 1.00 to 1.50: the arrival total grows, but the extra burst spills before later service can use it.

Simulation · interactive

Energy Harvesting Calculator

Step through arrival-before-service and change only Harvest scale from 1.00 to 1.50 to explain the useful-work and served-power plateau.

Finite storage changes the problem. A single arrival is admitted as

Etaccepted=min⁡(Et,Bmax−Bt+Pt),E_t^{accepted}=\min(E_t,B_{max}-B_t+P_t),

so the usable mean can fall below the harvested mean. A rough empty-buffer clipping approximation replaces arrivals by min⁡(Et,Bmax)\min(E_t,B_{max}), but

Wlog⁡2 ⁣(1+E[min⁡(Et,Bmax)]/TsN0W)W\log_2\!\left(1+\frac{\mathbb{E}[\min(E_t,B_{max})]/T_s}{N_0W}\right)

is not a general finite-battery capacity formula. Actual overflow depends on the current buffer and power-control policy, and the logarithm is concave, so bursty power allocation does not behave like constant average power. Capacity is obtained by optimizing an energy-causal policy over the buffer state and arrival statistics, commonly through dynamic programming or Markov decision methods after discretization.

This produces three engineering regimes:

The design sequence is therefore: characterize the arrival distribution and correlation; measure conversion and leakage losses; choose a candidate BmaxB_{max}; simulate the state recursion with real traces; optimize or compare causal policies; then report throughput, outage, overflow, and missed-deadline rates together.

← Back to the chapter · Previous detail · Next detail →