Pith. sign in

REVIEW 3 major objections 6 minor 63 references

FreeBeacon: Efficient Communication and Data Aggregation in Battery-Free IoT

T0 review · 3 major / 6 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read FreeBeacon claims that a few battery-powered beacons with co-prime wake-up cycles make battery-free device discovery guaranteed, turning random intermittent encounters into scheduled, failure-resilient data aggregation.

desk verdict Worth engaging: FreeBeacon's co-prime beacon discovery and aggregation schedules are a real step past Pulsar, but the collision-resilience guarantee is unproven and the headline claims outrun the data. read the letter →

arxiv 2504.21571 v1 pith:IMRCEJHW submitted 2025-04-30 cs.NI

Gaosheng Liu , Kas{i}m Sinan Y{i}ld{i}r{i}m , Lin Wang This is my paper · ORCID
classification cs.NI
keywords battery-freeIoTintermittentlypowereddevicesbeacondiscoverydataaggregationco-primecyclesWeylsequenceslotsynchronizationenergyharvesting
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

FreeBeacon's central claim is that the crippling uncertainty of battery-free IoT communication can be removed by adding a small number of battery-powered beacons, and that once a beacon is reachable, device discovery and structured data aggregation become deterministic. The mathematical core is that if the beacon's fixed cycle length $T_b$ is co-prime with the devices' shared distribution cycle $T_{dist}$, then the sequence of beacon-active slots is a Weyl sequence and is equidistributed modulo $T_{dist}$, so every device eventually meets the beacon. After that first contact, the device aligns to a unique slot on the shared cycle, and communication reduces to a sender jumping to the receiver's slot, which lets FreeBeacon implement line, tree, and ring data aggregation with recovery after power failures. A sympathetic reader would care because, if true, the protocol replaces random-guess neighbor discovery with a small, cheap source of certainty and delivers data-aggregation completion-time reductions of up to tens of times over existing approaches.

What carries the argument

The central object is the pair of co-prime cycles: the beacon's fixed cycle $T_b$ and the shared distribution cycle $T_{dist}$ with length at least the number of devices. The beacon index is the remainder of multiples of $T_b$ modulo $T_{dist}$, which forms a Weyl sequence and therefore visits every slot of the distribution cycle with equal frequency when $T_b$ and $T_{dist}$ are co-prime. This property guarantees eventual device-beacon overlap, gives every device a unique slot on the shared cycle, and converts device-to-device communication into a simple slot jump with rollback.

What would settle it

Run the paper's own large-scale scenario at a 5% device failure rate, for example 100 battery-free devices performing line aggregation with charging times in [30,120] slots and 1800 data items; if FreeBeacon cannot finish within the 300,000 second limit that the paper uses, the claimed failure resilience under realistic conditions is falsified.

Watch

Extended reading notes

Core claim

FreeBeacon's central claim is that injecting a small amount of certainty, in the form of one always-on battery-powered beacon with a fixed duty cycle, transforms battery-free neighbor discovery from a random-guessing problem into a deterministic scheduling problem. The enabling result is Theorem 1: when the beacon cycle length $T_b$ and the distribution cycle length $T_{dist}$ are co-prime, the beacon index follows a Weyl sequence that is equidistributed modulo $T_{dist}$, so every battery-free device that wakes according to the distribution cycle is guaranteed to eventually coincide with the beacon. Once a device hears the beacon, it learns the beacon's current slot index and corrects its wake phase so that it occupies a unique pre-assigned slot on the shared distribution cycle; communication then becomes a sender jumping to the receiver's slot, exchanging data, and rolling back. FreeBeacon uses this slot machinery to implement line, tree, and ring data aggregation, and the evaluation reports that this removes rediscovery overhead after power failures, yielding up to 29.5x lower completion time than random-guess baselines.

Load-bearing premise

The design assumes every battery-free device can directly reach the beacon and its intended peer by radio, with no multi-hop or coverage model, so a device that cannot hear the beacon falls outside the discovery and slot-correction guarantees.

Editorial extensions

If this is right

  • With one reachable beacon, every battery-free device is guaranteed to discover it eventually, and after a full reset the device recovers synchronization by rerunning the same discovery protocol.
  • Device-to-device communication becomes a slot jump: the sender extends its charging time until the receiver's slot, exchanges the message, and rolls back, so no random discovery delays are involved.
  • Line, tree, and ring data aggregation all run on the shared slot schedule, and collisions are avoided by construction because each device holds a unique slot in each round.
  • Failure resilience is automatic for senders, because the beacon sniffs the channel and broadcasts the current slot index whenever a sender transmits from a wrong slot, and receivers periodically query the beacon to correct their own slots.
  • Selecting the smallest integer coprime to $T_{dist}$ as the beacon cycle $T_b$ minimizes synchronization time, giving a concrete deployment rule.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper, the same coprime-period guarantee should apply to any pair of intermittently active components that share a periodic schedule, so the mechanism could be reused for coordinated sensing or actuation in batteryless systems, not only for communication.
  • The one-slot-per-device allocation implies that the distribution cycle must grow at least linearly with the number of devices, so large networks face an inherent trade-off between slot count and per-round aggregation latency; the paper's evaluations stop at 100 devices and do not quantify this scaling limit.
  • A testable extension would be an adaptive distribution cycle: when the beacon detects new or departed devices, it could broadcast a new $T_{dist}$ and have devices recompute their offsets, an operation the paper leaves for future work.
  • Because the beacon only needs to receive discovery messages and broadcast slot indices, FreeBeacon could be layered over existing low-power physical layers such as BLE or backscatter without changing the scheduling logic; the paper's testbeds only exercise BLE-style radios.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. This paper proposes FreeBeacon, a hybrid architecture for battery-free IoT in which a small number of battery-powered beacon devices provide a fixed duty-cycle beacon while battery-free devices align to a distribution cycle of length Tdist. The key theoretical claim (Theorem 1) is that if the beacon period Tb and Tdist are co-prime, every device is guaranteed to eventually meet the beacon, by an application of Weyl's equidistribution theorem. Once devices have discovered the beacon and corrected their slots, they can execute line-, tree-, and ring-based data aggregation using scheduled device-to-device communication, with recovery after device failures. The evaluation combines a five-node Riotee testbed, a controlled MOSFET-based testbed, Python simulations, and OMNeT++ simulations, comparing FreeBeacon against Find, Flync-Find, and Pulsar across several energy traces and failure rates.

Significance. If the discovery guarantee held for the full multi-device system, FreeBeacon would be a valuable and well-motivated design: it uses a tiny number of battery-powered coordinators to convert unpredictable intermittent communication into deterministic slot schedules, supports structured aggregation patterns, and handles device resets gracefully. The paper's strengths include a broad multi-platform evaluation, clear protocol pseudocode, and a formal single-device argument that correctly applies Weyl equidistribution when Tb and Tdist are co-prime. However, the flagship guarantee is not established for the multi-device case with collisions, and the abstract's 'consistently achieve an order of magnitude' claim for data aggregation is contradicted by the paper's own testbed numbers and by several near-parity results against Pulsar. The hybrid architecture and scheduling idea are promising, but the central claims need repair before the paper can be accepted.

major comments (3)
  1. [Section III-A, Algorithm 1 lines 12-13, Appendix B] Theorem 1 as stated ('If Tb and Tdist are co-prime, it is guaranteed that every device will eventually meet the beacon') is not proven for the multi-device case. The proof in Appendix B considers a single device with a fixed wake-up residue modulo Tdist and does not address collisions. Section III-A handles collisions with a backoff, but the pseudocode in Algorithm 1 line 13, 'delay <- delay + Tdist * RANDOM(0, 1)', is inconsistent with the prose 'an extra delay of Tdist slots randomly.' If RANDOM(0,1) returns 0 or 1, one natural reading, the colliding devices keep exactly the same residue modulo Tdist and collide again on every distribution cycle, so they may never discover the beacon. If RANDOM(0,1) returns a real in [0,1), the device wakes at non-integer offsets and no fixed residue modulo Tdist exists, so the Weyl equidistribution argument does not apply; if the delay is rounded to integer slots, the residue changes in an uncontrolled way. In neither reading does the paper establish 'guaranteed discovery regardless of possible collisions.' Because beacon discovery is the foundation for slot synchronization, device-to-device communication, aggregation, and failure recovery, this missing case is load-bearing. The authors should either modify the backoff to deterministically or almost surely separate collided devices into distinct residues and prove the corresponding guarantee, or explicitly restate the theorem as a single-device guarantee.
  2. [Abstract, Section IV-A (Fig. 8, Table I)] The abstract and conclusions claim that FreeBeacon can 'consistently achieve an order of magnitude data aggregation efficiency' compared with state-of-the-art approaches. The data in Section IV-A do not support 'consistently.' On the Riotee testbed the reductions over Find are 54.73%, 23.25%, and 58.82%, which are factors of roughly 2.2, 1.3, and 2.4, not an order of magnitude. Against Pulsar in the large-scale line-aggregation results of Table I, FreeBeacon is nearly identical in several cases (e.g., 5,230 vs. 5,175 s for 6 devices in range [30,120], and 1,884 vs. 1,830 s for 30 devices in the same range). Many Find entries in Table I are incomplete, so the speedup ratios cited for those scenarios are not defined. The 'up to 29.5x' statement in the contributions refers to pairwise communication, not data aggregation. The wording should be narrowed to 'up to an order of magnitude in specific scenarios' unless the evaluation is expanded to substantiate a consistent aggregation-speedup claim.
  3. [Section IV-C-2, IV-D-2, Section V] The default configuration Tdist = 51 is selected as the best of three manually chosen values (30, 51, 100) on the same energy traces that are later used for the failure-rate evaluation, and Section V states that distribution-cycle adaptation is not supported. The paper therefore does not demonstrate that the reported gains are achievable without dataset-specific tuning, and it gives no deployment-time guidance for setting Tdist from the number of devices and the charging-time statistics. A sensitivity analysis over a wider parameter grid and an out-of-sample validation (selecting Tdist on one trace and testing on another) would be needed to support the claimed consistency across scenarios.
minor comments (6)
  1. [Algorithm 2, line 11] The pseudocode has a typo: 'while ture do' should read 'while true do.'
  2. [Section IV-A] The text says 'line, right, and tree' where 'ring' is intended; Figure 8 shows line, ring, and tree patterns.
  3. [Figure 9 caption] The caption reads 'Riotee-base' and should be 'Riotee-based.'
  4. [Section III-A] The sentence 'all devices are guaranteed to be discovered within Tdist rounds' should define what a 'round' is; a full cycle of the beacon index sequence spans Tb * Tdist slots, not Tdist slots, and the distinction affects the expected discovery time.
  5. [Algorithm 1] The device logic uses Ti without making explicit that Ti is the current charging-cycle length; since the paper emphasizes that charging times vary per cycle, please state that line 11 is evaluated with the current cycle's charging time and explain how the device measures Ti in the absence of a synchronized clock before discovery.
  6. [Section IV-D-2] The paper reports the default Tdist = 51 but does not state the corresponding Tb used in that experiment; please report the exact beacon cycle so the experiments are reproducible.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the discovery guarantee follows from Weyl equidistribution, and the disclosed parameter choice and self-cited baseline are not load-bearing.

full rationale

FreeBeacon's central discovery guarantee rests on Weyl's equidistribution theorem (cited [22], an external mathematical result): when Tb and Tdist are co-prime, the beacon index tb = (n * Tb) % Tdist visits every residue modulo Tdist, so a device waking at a fixed residue eventually coincides with the beacon. This is not circular, because the co-primality condition is an engineered protocol precondition rather than the theorem's conclusion, and the theorem does not assume any FreeBeacon result. The device-to-device communication and aggregation protocols follow from the synchronized slot allocation after discovery, and no fitted parameter is renamed as a prediction. The evaluation does select the default Tdist = 51 based on performance on the same traces, and it uses Pulsar [25], prior work by two of the same authors, as a baseline; both choices are disclosed empirical decisions rather than load-bearing derivations. The proof of Theorem 1 is single-device and does not rigorously handle multi-device collisions under the backoff in Algorithm 1, but that is a correctness gap, not a circularity. No step of the derivation reduces to its own input or to a self-citation chain.

Assumptions & free parameters 3 free parameters · 5 assumptions · 0 invented entities

FreeBeacon introduces no new physical entities. Its free parameters are protocol cycle sizes and slot length; the default Tdist=51 is fitted to the evaluation traces. The central guarantee rests on standard number theory plus domain assumptions about single-hop range, controllable delays, a single non-failing beacon, and static membership. These assumptions are acknowledged in the limitations section, and they bound the generality of the claimed results.

free parameters (3)
  • Distribution cycle size Tdist = 51 (default), with 30 and 100 also evaluated
    Chosen manually from {30, 51, 100} based on best average communication performance on the evaluation traces (Section IV.D.2). This is a deployment-time tuning parameter, not derived from first principles.
  • Beacon cycle length Tb = A coprime of Tdist, e.g., 7 for Tdist=30
    Selected to satisfy the co-prime condition with Tdist; the paper recommends the smallest coprime in practice, but the choice affects discovery latency (Section IV.D.1).
  • Slot length = Minimum working time (e.g., 10 ms in Riotee testbed, 410 ms in controlled testbed)
    Set as the minimum working time among devices so that one round-trip communication fits in a slot; it is a hardware-derived system parameter, but its value changes with the deployment (Section III setup).
assumptions (5)
  • standard math Weyl equidistribution theorem for multiples of a coprime integer modulo m
    Used in the proof of Theorem 1 (Appendix B) to claim the beacon index visits every slot of the distribution cycle when Tb and Tdist are co-prime.
  • domain assumption All devices are within single-hop wireless range of the beacon and of each other for scheduled pairs
    The discovery and slot-correction protocols require direct device-to-beacon and device-to-device communication; the paper does not model multi-hop or coverage limits (Section III, Section V).
  • domain assumption Battery-free devices can extend charging time by integer slot counts to align to the distribution cycle
    The 'delay' and 'jump forward/rollback' operations in Algorithms 1 and 2 assume intentional charging-time extension is always feasible and bounded by the environment (Section III).
  • domain assumption A single always-on beacon with a fixed duty cycle is available and does not fail
    Failure resilience assumes the beacon continues to operate and can sniff broadcasts; multi-beacon support is left as future work (Section V).
  • domain assumption The network size N and the slot allocation are static and known to all devices before deployment
    The distribution cycle length Tdist >= N and unique slot assignment are pre-configured; dynamic join/leave requires cycle adaptation, which the paper lists as unsupported (Section V).

how reviews work

0 comments
Cite this review

Pith. "Pith review of FreeBeacon: Efficient Communication and Data Aggregation in Battery-Free IoT." pith.science (2026). https://pith.science/paper/IMRCEJHW

@misc{pith2026250421571,
  author       = {Pith},
  title        = {Pith review of: FreeBeacon: Efficient Communication and Data Aggregation in Battery-Free IoT},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IMRCEJHW}},
  note         = {Machine review of arXiv:2504.21571}
}
read the original abstract

To improve sustainability, Internet-of-Things (IoT) is increasingly adopting battery-free devices powered by ambient energy scavenged from the environment. The unpredictable availability of ambient energy leads to device intermittency, bringing critical challenges to device communication and related fundamental operations like data aggregation. We propose FreeBeacon, a novel scheme for efficient communication and data aggregation in battery-free IoT. We argue that the communication challenge between battery-free devices originates from the complete uncertainty of the environment. FreeBeacon is built on the insight that by introducing just a small degree of certainty into the system, the communication problem can be largely simplified. To this end, FreeBeacon first introduces a small number of battery-powered devices as beacons for battery-free devices. Then, FreeBeacon features protocols for battery-free devices to achieve interaction with the beacon and to perform communication efficiently following customized schedules that implement different data aggregation schemes while achieving resilience. We evaluate FreeBeacon with extensive prototype-based experiments and simulation studies. Results show that FreeBeacon can consistently achieve an order of magnitude data aggregation efficiency when compared with the state-of-the-art approaches.

Figures

Figures reproduced from arXiv: 2504.21571 by the authors.

Figure 1
Figure 1. Intermittency of battery-free devices with varying charging time. Devices D1 and D2 can communicate only when they both work simultaneously. Intermittency also presents significant challenges for wire￾less communication among battery-free IoT devices, rendering it unreliable with very low and highly unpredictable success rates [11], [10], [12], [20]. Specifically, charging time is uncontrollable, making essential ne… view at source ↗
Figure 3
Figure 3. a demonstrates the big gap in discovery time between the two cases, highlighting the generalizability issue of the random-guess-based approach. Challenge of structured communication. IoT communica￾tion typically goes way beyond discovering devices randomly and require to follow structured communication patterns where device pairs must communicate in a pre-specified manner. For example, data aggregation requires a se… view at source ↗
Figure 4
Figure 4. Example showing how a battery-powered device serves as a beacon to facilitate structured communication (D1→D2→D3) among battery-free devices. The beacon instructs battery-free devices to stay on their allocated slots upon discovery and then a battery-free device can jump to the slot of another device for efficient communication. devices could be chosen deliberately to ease maintenance. We believe that this hybrid de… view at source ↗
Figures from the paper (1 more)
Figure 11
Figure 11. Figure 11: Pairwise comm. performance on controlled testbed [PITH_FULL_IMAGE:figures/full_fig_p009_11.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

63 extracted references · 33 canonical work pages

  1. [1]

    Next century challenges: Mobile networking for

    J. M. Kahn, R. H. Katz, and K. S. J. Pister, “Next century challenges: Mobile networking for ”smart dust”,” in MOBICOM ’99, The Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, Seattle, Washington, USA, August 15-19, 1999, H. Kodesh, V. Bahl, T. Imielinski, and M. Steenstrup, Eds. ACM, 1999, pp. 271–

    work page 1999

  2. [2]

    Farmbeats: An iot platform for data-driven agriculture,

    D. Vasisht, Z. Kapetanovic, J. Won, X. Jin, R. Chandra, S. N. Sinha, A. Kapoor, M. Sudarshan, and S. Stratman, “Farmbeats: An iot platform for data-driven agriculture,” in 14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017, Boston, MA, USA, March 27 -29, 2017 , A. Akella and J. Howell, Eds. USENIX Association, 2017, pp. 515 –5...

    work page 2017

  3. [3]

    Energy-harvesting wireless sensor networks (eh -wsns): A review,

    K. S. Adu -Manu, N. H. Adam, C. Tapparello, H. Ayatollahi, and W. B. Heinzelman, “Energy-harvesting wireless sensor networks (eh -wsns): A review,” ACM Trans. Sens. Networks , vol. 14, no. 2, pp. 10:1 –10:50,

    work page

  4. [4]

    Densor: An intraoral battery-free sensing platform,

    V. Dsouza, J. Pronk, C. Peppelman, V. I. Madariaga, T. Pereira- Cenci, B. Loomans, and P. Pawełczak, “Densor: An intraoral battery-free sensing platform,” Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. , vol. 8, no. 4, Nov. 2024. [Online]. Available: https://doi.org/10.1145/3699746

    work page doi:10.1145/3699746 2024

  5. [5]

    Self -sustainable cyber -physical systems with collaborative intermittent computing,

    G. Liu and L. Wang, “Self -sustainable cyber -physical systems with collaborative intermittent computing,” in e-Energy ’21: The Twelfth ACM International Conference on Future Energy Systems, Virtual Event, Torino, Italy, 28 June - 2 July, 2021, H. de Meer and M. Meo, Eds. ACM, 2021, pp. 316 –321. [Online]. Available: https://doi.org/10.1145/3447555.3465324

    work page arXiv 2021

  6. [6]

    The internet of batteryless things,

    S. Ahmed, B. Islam, K. S. Yildirim, M. Zimmerling, P. Pawelczak, M. H. Alizai, B. Lucia, L. Mottola, J. Sorber, and J. D. Hester, “The internet of batteryless things,” Commun. ACM, vol. 67, no. 3, pp. 64– 73, 2024. [Online]. Available: https://doi.org/10.1145/3624718 12

    doi:10.1145/3624718 2024

  7. [7]

    Every smart phone is a backscatter reader: Modulated backscatter compatibility with bluetooth 4.0 low energy (BLE) devices,

    J. F. Ensworth and M. S. Reynolds, “Every smart phone is a backscatter reader: Modulated backscatter compatibility with bluetooth 4.0 low energy (BLE) devices,” in 2015 IEEE International Conference on RFID, RFID 2015, San Diego, CA, USA, April 15-17, 2015. IEEE, 2015, pp. 78–85. [Online]. Available: https: //doi.org/10.1109/RFID.2015.7113076

    work page arXiv 2015

  8. [8]

    Battery-free game boy: Sustainable interactive devices,

    J. de Winkel, V. Kortbeek, J. D. Hester, and P. Pawelczak, “Battery-free game boy: Sustainable interactive devices,” GetMobile Mob. Comput. Commun., vol. 25, no. 2, pp. 22 –26, 2021. [Online]. Available: https://doi.org/10.1145/3486880.3486888

    work page arXiv 2021

Show all 63 references
  1. [10]

    Intermittently -powered bluetooth that works,

    J. de Winkel, H. Tang, and P. Pawelczak, “Intermittently -powered bluetooth that works,” in MobiSys, 2022

    2022

  2. [11]

    Bootstrapping battery -free wireless networks: Efficient neighbor discovery and synchronization in the face of intermittency,

    K. Geissdoerfer and M. Zimmerling, “Bootstrapping battery -free wireless networks: Efficient neighbor discovery and synchronization in the face of intermittency,” in 18th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2021, April 12-14, 2021, J. Mickens ...

    2021

  3. [12]

    Learning to communicate effectively between battery -free devices,

    ——, “Learning to communicate effectively between battery -free devices,” in 19th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2022, Renton, WA, USA, April 4-6, 2022, A. Phanishayee and V. Sekar, Eds. USENIX Association, 2022, pp. 419 –435. [Online]. Av...

    2022

  4. [13]

    A simpler, safer programming and execution model for intermittent systems,

    B. Lucia and B. Ransford, “A simpler, safer programming and execution model for intermittent systems,” in Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, June 15-17, 2015, D. Grove and S. M. Blackburn, Eds. A...

    2015

  5. [14]

    Chain: tasks and channels for reliable intermittent programs,

    A. Colin and B. Lucia, “Chain: tasks and channels for reliable intermittent programs,” in Proceedings of the 2016 ACM SIGPLAN International Conference on Object -Oriented Programming, Systems, Languages, and Applications, OOPSLA 2016, part of SPLASH 2016, Amsterdam, The Nether...

    2016

  6. [15]

    Adaptive dynamic checkpointing for safe efficient intermittent computing,

    K. Maeng and B. Lucia, “Adaptive dynamic checkpointing for safe efficient intermittent computing,” in 13th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2018, Carlsbad, CA, USA, October 8 -10, 2018 , A. C. Arpaci -Dusseau and G. Voelker, Eds. USENIX Ass...

    2018

  7. [16]

    Ink: Reactive kernel for tiny batteryless sensors,

    K. S. Yildirim, A. Y. Majid, D. Patoukas, K. Schaper, P. Pawelczak, and J. D. Hester, “Ink: Reactive kernel for tiny batteryless sensors,” in Proceedings of the 16th ACM Conference on Embedded Networked Sensor Systems, SenSys 2018, Shenzhen, China, November 4-7, 2018, G. S. Ra...

    2018

  8. [17]

    Termination checking and task decomposition for task -based intermittent programs,

    A. Colin and B. Lucia, “Termination checking and task decomposition for task -based intermittent programs,” in Proceedings of the 27th International Conference on Compiler Construction, CC 2018, February 24 -25, 2018, Vienna, Austria , C. Dubach and J. Xue, Eds. ACM, 2018, pp....

    2018

  9. [19]

    Wario: efficient code generation for intermittent computing,

    V. Kortbeek, S. Ghosh, J. D. Hester, S. Campanoni, and P. Pawelczak, “Wario: efficient code generation for intermittent computing,” in PLDI ’22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13 - 17, 2022 ...

    2022

  10. [20]

    Data on the go: Seamless data routing for intermittently-powered battery-free sensing,

    G. Liu and L. Wang, “Data on the go: Seamless data routing for intermittently-powered battery-free sensing,” TMC, vol. abs/2402.00872,

    arXiv

  11. [22]

    U¨ ber die gleichverteilung von zahlen mod. eins,

    H. V. Weyl, “U¨ ber die gleichverteilung von zahlen mod. eins,” Mathematische Annalen, vol. 77, pp. 313–352, 1916. [Online]. Available: https://api.semanticscholar.org/CorpusID:123470919

    1916

  12. [23]

    Geissdoerfer, Kai; Zimmerling

    M. Geissdoerfer, Kai; Zimmerling. (2022) Time -synchronized energy harvesting traces. [Online]. Available: https://doi.org/10.5281/zenodo. 6383042

    2022 doi

  13. [24]

    Routing for intermittently -powered sensing systems,

    G. Liu and L. Wang, “Routing for intermittently -powered sensing systems,” CoRR, vol. abs/2305.12550, 2023. [Online]. Available: https://doi.org/10.48550/arXiv.2305.12550

    2023 doi arXiv

  14. [25]

    A little certainty is all we need: Discovery and synchronization acceleration in battery -free iot,

    G. Liu, V. Nigade, H. E. Bal, and L. Wang, “A little certainty is all we need: Discovery and synchronization acceleration in battery -free iot,” in Proceedings of the 8th Asia-Pacific Workshop on Networking, APNet 2024, Sydney, Australia, August 3 -4, 2024 . ACM, 2024, pp. 38 ...

    2024

  15. [26]

    Demo abstract: Building battery -free devices with riotee,

    K. Geissdoerfer, I. Splitt, and M. Zimmerling, “Demo abstract: Building battery -free devices with riotee,” in The 22nd International Conference on Information Processing in Sensor Networks, IPSN 2023, San Antonio, TX, USA, May 9-12, 2023. ACM, 2023, pp. 354–355. [Online]. Ava...

    2023

  16. [27]

    Opportunistic routing protocol with grid-based relay slot selection in energy harvesting wsns,

    R. Negishi, K. Toyoda, and I. Sasase, “Opportunistic routing protocol with grid-based relay slot selection in energy harvesting wsns,” in The 20th Asia-Pacific Conference on Communication (APCC2014), 2014, pp. 412–416

    2014

  17. [28]

    Opportunistic communication with latency guarantees for intermittently -powered devices,

    K. Wardega, W. Li, H. Kim, Y. Wu, Z. Jia, and J. Hu, “Opportunistic communication with latency guarantees for intermittently -powered devices,” in 2022 Design, Automation & Test in Europe Conference & Exhibition, DATE 2022, Antwerp, Belgium, March 14-23, 2022, C. Bolchini, I. ...

    2022

  18. [29]

    ESC: energy synchronized communication in sustainable sensor networks,

    Y. Gu, T. Zhu, and T. He, “ESC: energy synchronized communication in sustainable sensor networks,” in Proceedings of the 17th annual IEEE International Conference on Network Protocols, 2009. ICNP 2009, Princeton, NJ, USA, 13-16 October 2009, H. Schulzrinne, K. K. Ramakrishnan,...

    2009

  19. [30]

    Cyber -physical verification of intermittently powered embedded systems,

    R. Bohrer and B. Islam, “Cyber -physical verification of intermittently powered embedded systems,” IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., vol. 41, no. 11, pp. 4361–4372, 2022. [Online]. Available: https://doi.org/10.1109/TCAD.2022.3197541

    2022

  20. [31]

    Intermittent asynchronous peripheral operations,

    A. Branco, L. Mottola, M. H. Alizai, and J. H. Siddiqui, “Intermittent asynchronous peripheral operations,” in Proceedings of the 17th Conference on Embedded Networked Sensor Systems, SenSys 2019, New York, NY, USA, November 10-13, 2019, R. K. Ganti, X. F. Jiang, G. P. Picco, ...

    2019

  21. [32]

    A reconfigurable energy storage architecture for energy -harvesting devices,

    A. Colin, E. Ruppel, and B. Lucia, “A reconfigurable energy storage architecture for energy -harvesting devices,” in Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2018, Williamsburg, VA...

    2018

  22. [33]

    Facebit: Smart face masks platform,

    A. Curtiss, B. Rothrock, A. Bakar, N. Arora, J. Huang, Z. Englhardt, A. Empedrado, C. Wang, S. Ahmed, Y. Zhang, N. Alshurafa, and J. D. Hester, “ Facebit: Smart face masks platform,” Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. , vol. 5, no. 4, pp. 151:1 –151:44,

  23. [34]

    Reliable timekeeping for intermittent computing,

    J. de Winkel, C. D. Donne, K. S. Yildirim, P. Pawelczak, and J. D. Hester, “Reliable timekeeping for intermittent computing,” in ASPLOS ’20: Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland, March 16-20, 2020, J. R. Larus, L. Ceze, a...

    2020

  24. [35]

    Riptide: A programmable, energy -minimal dataflow compiler and architecture,

    G. Gobieski, S. Ghosh, M. Heule, T. Mowry, T. Nowatzki, N. Beckmann, and B. Lucia, “Riptide: A programmable, energy -minimal dataflow compiler and architecture,” in 2022 55th IEEE/ACM International Sym - posium on Microarchitecture (MICRO). IEEE, 2022, pp. 546–564

    2022

  25. [36]

    Intelligence beyond the edge: Inference on intermittent embedded systems,

    G. Gobieski, B. Lucia, and N. Beckmann, “Intelligence beyond the edge: Inference on intermittent embedded systems,” in Proceedings of the Twenty -Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2019, 13 Providenc...

    2019

  26. [37]

    Tragedy of the coulombs: Federating energy storage for tiny, intermittently-powered sensors,

    J. D. Hester, L. Sitanayah, and J. Sorber, “Tragedy of the coulombs: Federating energy storage for tiny, intermittently-powered sensors,” in Proceedings of the 13th ACM Conference on Embedded Networked Sensor Systems, SenSys 2015, Seoul, South Korea, November 1-4, 2015, J. Son...

    2015

  27. [38]

    Bfree: Enabling battery-free sensor prototyping with python,

    V. Kortbeek, A. Bakar, S. Cruz, K. S. Yildirim, P. Pawelczak, and J. D. Hester, “Bfree: Enabling battery-free sensor prototyping with python,” Proc. ACM Interact. Mob. Wearable Ubiquitous Technol., vol. 4, no. 4, pp. 135:1 –135:39, 2020. [Online]. Available: https://doi.org/10...

    2020 doi

  28. [39]

    MOUSE: inference in non -volatile memory for energy harvesting applications,

    S. Resch, S. K. Khatamifard, Z. I. Chowdhury, M. Zabihi, Z. Zhao, M. H. Cilasun, J. Wang, S. S. Sapatnekar, and U. R. Karpuzcu, “MOUSE: inference in non -volatile memory for energy harvesting applications,” in 53rd Annual IEEE/ACM International Symposium on Microarchitecture, ...

    2020

  29. [40]

    Towards a formal foundation of intermittent computing,

    M. Surbatovich, B. Lucia, and L. Jia, “Towards a formal foundation of intermittent computing,” Proc. ACM Program. Lang., vol. 4, no. OOPSLA, pp. 163:1–163:31, 2020. [Online]. Available: https: //doi.org/10.1145/3428231

    2020 doi

  30. [41]

    Automatically enforcing fresh and consistent inputs in intermittent systems,

    M. Surbatovich, L. Jia, and B. Lucia, “Automatically enforcing fresh and consistent inputs in intermittent systems,” in PLDI ’21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, June 20-25, 2021, S. N. Freund ...

    2021

  31. [42]

    Intermittent computation without hardware support or programmer intervention,

    J. van der Woude and M. Hicks, “Intermittent computation without hardware support or programmer intervention,” in 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2016, Savannah, GA, USA, November 2-4, 2016, K. Keeton and T. Roscoe, Eds. USENIX Associ...

    2016

  32. [43]

    Failure sentinels: Ubiquitous just-in-time intermittent computation via low -cost hardware support for voltage monitoring,

    H. Williams, M. Moukarzel, and M. Hicks, “Failure sentinels: Ubiquitous just-in-time intermittent computation via low -cost hardware support for voltage monitoring,” in 48th ACM/IEEE Annual International Symposium on Computer Architecture, ISCA 2021, Virtual Event / Valencia, ...

    2021

  33. [44]

    Battery -free makecode: Accessible programming for intermittent computing,

    C. Kraemer, A. Guo, S. Ahmed, and J. D. Hester, “Battery -free makecode: Accessible programming for intermittent computing,” Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. , vol. 6, no. 1, pp. 18:1–18:35, 2022. [Online]. Available: https://doi.org/10.1145/3517236

    2022 doi

  34. [45]

    Architecture exploration for ambient energy harvesting nonvolatile processors,

    K. Ma, Y. Zheng, S. Li, K. Swaminathan, X. Li, Y. Liu, J. Sampson, Y. Xie, and V. Narayanan, “Architecture exploration for ambient energy harvesting nonvolatile processors,” in 21st IEEE International Symposium on High Performance Computer Architecture, HPCA 2015, Burlingame, ...

    2015

  35. [46]

    Hibernus: Sustaining computation during intermittent supply for energy-harvesting systems,

    D. Balsamo, A. S. Weddell, G. V. Merrett, B. M. Al-Hashimi, D. Brunelli, and L. Benini, “Hibernus: Sustaining computation during intermittent supply for energy-harvesting systems,” IEEE Embed. Syst. Lett. , vol. 7, no. 1, pp. 15 –18, 2015. [Online]. Available: https://doi.org/...

    2015

  36. [47]

    On securing persistent state in intermittent computing,

    H. A. Asad, E. H. Wouters, N. A. Bhatti, L. Mottola, and T. Voigt, “On securing persistent state in intermittent computing,” in Proceedings of the 8th International Workshop on Energy Harvesting & Energy - Neutral Sensing Systems, ENSsys@SenSys 2020, Virtual Event, Japan, Nove...

    2020

  37. [48]

    Simba: A unified framework to explore and facilitate the design of battery-free systems,

    H. Brunner, J. de Winkel, C. A. Boano, P. Pawelczak, and K. Ro¨mer, “Simba: A unified framework to explore and facilitate the design of battery-free systems,” in 23rd ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2024, Hong Kong, May 13 -...

    2024

  38. [49]

    Memory -efficient energy -adaptive inference of pre-trained models on batteryless embedded systems,

    P. Farina, S. Biswas, E. Yildiz, K. Akhunov, S. Ahmed, B. Islam, and K. S. Yildirim, “Memory -efficient energy -adaptive inference of pre-trained models on batteryless embedded systems,” CoRR, vol. abs/2405.10426, 2024. [Online]. Available: https://doi.org/10.48550/ arXiv.2405.10426

    2024 doi arXiv

  39. [50]

    Energy attacks in the battery-less internet of things: Directions for the future,

    L. Mottola, A. Hameed, and T. Voigt, “Energy attacks in the battery-less internet of things: Directions for the future,” in Proceedings of the 17th European Workshop on Systems Security, EuroSec 2024, Athens, Greece, 22 April 2024 . ACM, 2024, pp. 29 –36. [Online]. Available: ...

    2024

  40. [51]

    Bootstrapping health wearables powered by intra -body power transfer,

    J. Hester, S. Ahmed, E. Yildiz, S. Holla, N. Mohammed, B. Islam, J. G. Kasim Sinan Yildirim and, and S. I. Lee, “Bootstrapping health wearables powered by intra -body power transfer,” in IEEE-EMBS In - ternational Conference on Body Sensor Networks (IEEE BSN 2024) . ACM, 2024

    2024

  41. [52]

    Discovering the hidden anomalies of intermittent computing,

    A. Maioli, L. Mottola, M. H. Alizai, and J. H. Siddiqui, “Discovering the hidden anomalies of intermittent computing,” in EWSN ’21: Proceedings of the 2021 International Conference on Embedded Wireless Systems and Networks, Delft, The Netherlands, 17-19 February 2021, P. Huang...

    2021

  42. [53]

    Available: https://doi.org/10.1145/3274783.3274837

    [Online]. Available: https://doi.org/10.1145/3274783.3274837

  43. [54]

    Fast and energy -efficient state checkpointing for intermittent computing,

    S. Ahmed, N. A. Bhatti, M. H. Alizai, J. H. Siddiqui, and L. Mottola, “Fast and energy -efficient state checkpointing for intermittent computing,” ACM Trans. Embed. Comput. Syst. , vol. 19, no. 6, pp. 45:1 –45:27, 2020. [Online]. Available: https://doi.org/10. 1145/3391903

    2020

  44. [55]

    Alpaca: Intermittent execution without checkpoints,

    K. Maeng, A. Colin, and B. Lucia, “Alpaca: Intermittent execution without checkpoints,” CoRR, vol. abs/1909.06951, 2019. [Online]. Available: http://arxiv.org/abs/1909.06951

    1909 arXiv

  45. [56]

    Large -scale wireless - powered networks with backscatter communications - A comprehensive survey,

    F. Rezaei, C. Tellambura, and S. P. Herath, “Large -scale wireless - powered networks with backscatter communications - A comprehensive survey,” IEEE Open J. Commun. Soc. , vol. 1, pp. 1100 –1130, 2020. [Online]. Available: https://doi.org/10.1109/OJCOMS.2020.3012466

    2020

  46. [57]

    Noma-enabled backscatter communications for green transportation in automotive-industry 5.0,

    W. U. Khan, A. Ihsan, T. N. Nguyen, Z. Ali, and M. A. Javed, “Noma-enabled backscatter communications for green transportation in automotive-industry 5.0,” IEEE Trans. Ind. Informatics, vol. 18, no. 11, pp. 7862–7874, 2022. [Online]. Available: https://doi.org/10.1109/TII. 202...

    2022

  47. [58]

    A hybrid communication scheme for throughput maximization in backscatter - aided energy harvesting cognitive radio networks,

    K. Zheng, J. Wang, X. Liu, X. -W. Yao, Y. Xu, and J. Liu, “A hybrid communication scheme for throughput maximization in backscatter - aided energy harvesting cognitive radio networks,” IEEE Internet of Things Journal, vol. 0, no. 0, pp. 1–1, 2023

    2023

  48. [59]

    Supporting peripherals in intermittent systems with just -in-time checkpoints,

    K. Maeng and B. Lucia, “Supporting peripherals in intermittent systems with just -in-time checkpoints,” in Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22-26, 2019, K. S. McKinley and K. Fis...

    2019

  49. [60]

    Continuous sensing on intermittent power,

    A. Y. Majid, P. Schilder, and K. Langendoen, “Continuous sensing on intermittent power,” in 19th ACM/IEEE International Conference on Information Processing in Sensor Networks, IPSN 2020, Sydney, Australia, April 21 -24, 2020 . IEEE, 2020, pp. 181 –192. [Online]. Available: ht...

    2020

  50. [65]

    Protocol transformation for transiently powered wireless sensor networks,

    D. Richardson, A. Jhumka, and L. Mottola, “Protocol transformation for transiently powered wireless sensor networks,” in SAC ’21: The 36th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, Republic of Korea, March 22 -26, 2021, C. Hung, J. Hong, A. Bechini, and E. Song...

    2021

  51. [278]

    Available: https://doi.org/10.1145/313451.313558

    [Online]. Available: https://doi.org/10.1145/313451.313558

  52. [781]

    Available: https://doi.org/10.1145/3173162.3173210

    [Online]. Available: https://doi.org/10.1145/3173162.3173210

  53. [2018]

    Available: https://doi.org/10.1145/3183338

    [Online]. Available: https://doi.org/10.1145/3183338

    doi

  54. [2021]

    Available: https://doi.org/10.1145/3494991

    [Online]. Available: https://doi.org/10.1145/3494991

    doi

  55. [2024]

    Available: https://doi.org/10.48550/arXiv.2402.00872

    [Online]. Available: https://doi.org/10.48550/arXiv.2402.00872

    doi arXiv

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.