{"paper":{"title":"UROP: A Simple, Near-Optimal Scheduling Policy for Energy Harvesting Sensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elif Uysal-Biyikoglu, Omer Melih Gul","submitted_at":"2014-01-02T13:49:28Z","abstract_excerpt":"This paper considers a single-hop wireless network where a central node (or fusion center, FC) collects data from a set of m energy harvesting (EH) nodes (e.g. nodes of a wireless sensor network). In each time slot, k of m nodes can be scheduled by the FC for transmission over k orthogonal channels. FC has no knowledge about EH processes and current battery states of nodes; however, it knows outcomes of previous transmission attempts. The objective is to find a low complexity scheduling policy that maximizes total throughput of the data backlogged system using the harvested energy, for all typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0437","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}