viewof defbArrivalRate = Inputs.range([1, 500], {value: 80, step: 1, label: "Conservative harvested energy (uJ/s)"})
viewof defbBaselineDrain = Inputs.range([0, 100], {value: 12, step: 1, label: "Sleep, sensing, and conversion drain (uJ/s)"})
viewof defbHarvestBattery = Inputs.range([10, 2000], {value: 250, step: 10, label: "Usable buffer capacity (mJ)"})
viewof defbReserve = Inputs.range([0, 80], {value: 30, step: 5, label: "Survival reserve (%)"})
viewof defbTxEnergy = Inputs.range([0.1, 20], {value: 2.4, step: 0.1, label: "Energy per attempted packet (mJ)"})
viewof defbContenders = Inputs.range([1, 30], {value: 6, step: 1, label: "Contending nodes"})
viewof defbAccessProbability = Inputs.range([0.01, 0.9], {value: 0.12, step: 0.01, label: "Per-slot transmit probability"})
viewof defbRequestedInterval = Inputs.range([5, 600], {value: 60, step: 5, label: "Requested report interval (s)"})Energy-Arrival And Random-Access Calculator
Energy-Arrival And Random-Access Calculator
animation
energy
harvesting
random-access
Try Change Contending nodes, then press Calculate.
Observe Press Calculate and compare Per-slot success probability and Shortest expected sustainable interval.
Explain Describe how contending nodes change expected attempts and report energy when you press Calculate.
Technical boundaries. The calculator uses expected values and assumes nodes transmit independently with probability p in a slot. Real protocols add carrier sensing, capture, acknowledgements, retry limits, and time-varying traffic.
Energy-Arrival And Random-Access Calculator
An energy-harvested radio cannot schedule from average power alone. Energy arrives unevenly, storage is finite, sleep electronics consume part of every arrival, and a random-access collision can force another expensive transmission. The operational question is therefore: given the current buffer and a conservative arrival rate, when may this node attempt a transmission without stealing energy from its survival reserve?
The calculator uses expected values to expose the policy. Its slotted random-access model assumes each of the contending nodes transmits independently with probability in a slot, giving this node a success probability of . Real protocols add carrier sensing, capture, acknowledgements, retry limits, and time-varying traffic; replace the teaching model with a measured trace before deployment.
Try three cases: one node with predictable harvest, many nodes with the same access probability, and a low-harvest interval with a nearly empty buffer. Observe why reducing traffic can improve both collision probability and energy survival. The optional graduate path is to replace the expected-value policy with a stochastic arrival trace and compare online policies; the practitioner path is to measure the source, charger quiescent current, buffer limits, packet energy, success rate, and missed-deadline behavior at the real site.