Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Asymptotically Throughput Optimal Scheduling for Energy Harvesting Wireless Sensor Networks
Download
10.1109ACCESS.2018.2865451.pdf
Date
2018
Author
Gul, Omer Melih
Demirekler, Mubeccel
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
7
views
9
downloads
Cite This
In this paper, we investigate a single-hop wireless sensor network in which a fusion center (FC) collects data packets from M energy harvesting (EH) sensor nodes. Energy harvested by each node is stored without battery overflow and leakage at that node. The FC schedules K nodes over its mutually orthogonal channels to receive data from them in each time slot. The FC knows neither the statistics of EH processes nor the battery states of nodes. The FC solely has information on consequences of previous transmission attempts. We aim for obtaining an efficient and simple policy achieving maximum throughput in this network. The nodes are data backlogged and the data transmission only depends on the harvested energy of the scheduled nodes. A node can transmit data whenever it is scheduled, provided that it has sufficient energy. We propose a simple policy, uniforming random ordered policy (UROP), for the problem. We exhibit that the UROP is nearly throughput-optimal over finite time horizons for a broad class of EH processes. We also prove that for general EH processes, UROP achieves asymptotically optimal throughput over the infinite time horizon under infinite capacity battery assumption. Numerical results indicate that even with finite-capacity batteries, UROP achieves near-optimal throughput over finite time horizons. We believe that UROP is applicable to much wider area than EH wireless sensor networks.
Subject Keywords
General Engineering
,
General Materials Science
,
General Computer Science
,
Energy harvesting (EH)
,
Scheduling algorithms
,
Resource allocation
,
Decision making
,
Wireless sensor network
URI
https://hdl.handle.net/11511/51948
Journal
IEEE Access
DOI
https://doi.org/10.1109/access.2018.2865451
Collections
Department of Electrical and Electronics Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. M. Gul and M. Demirekler, “Asymptotically Throughput Optimal Scheduling for Energy Harvesting Wireless Sensor Networks,”
IEEE Access
, vol. 6, pp. 45004–45020, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/51948.