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

200
views

217
downloads

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

Suggestions

OpenMETU
Core

Asymptotically Optimal Scheduling for Energy Harvesting Wireless Sensor Networks Gül, Ömer Melih (2017-10-13) This paper considers a single-hop wireless sensor network where a fusion center (FC) collects data from M energy harvesting (EH) wireless sensor nodes. The harvested energy is stored losslessly in an infinite-capacity battery at each node. In each time slot, K nodes can be scheduled by the FC to send data over K orthogonal channels. The FC has no direct knowledge on the battery states of nodes, or the statistics of EH processes; it only has information of the outcomes of previous transmission attempts. The ...
Average Throughput Performance of Myopic Policy in Energy Harvesting Wireless Sensor Networks Gül, Ömer Melih; Demirekler, Mübeccel (MDPI AG, 2017-9-26) This paper considers a single-hop wireless sensor network where a fusion center collects data from M energy harvesting wireless sensors. The harvested energy is stored losslessly in an infinite-capacity battery at each sensor. In each time slot, the fusion center schedules K sensors for data transmission over K orthogonal channels. The fusion center does not have direct knowledge on the battery states of sensors, or the statistics of their energy harvesting processes. The fusion center only has information ...
Wearable battery-less wireless sensor network with electromagnetic energy harvesting system Chamanian, Salar; Ulusan, Hasan; Zorlu, Ozge; Baghaee, Sajjad; Uysal, Elif; Külah, Haluk (2016-10-01) This paper presents a battery-less wireless sensor network (WSN) equipped with electromagnetic (EM) energy harvesters and sensor nodes with adjustable time-interval based on stored the energy. A wearable EM energy harvesting system is developed and optimized to power-up a typical wireless sensor mote from body motion. This is realized through characterization of the body motion and design of a compact EM energy harvester according to vibration frequencies generated during human running and walking. The harv...
Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming İncebacak, Davut; Baykal, Nazife; Bıçakcı, Kemal; Department of Information Systems (2013) Wireless Sensor Networks (WSNs) are composed of battery powered small sensor nodes with limited processing, memory and energy resources. Self organization property together with infrastructureless characteristics of WSNs make them favorable solutions for many applications. Algorithms and protocols developed for WSNs must consider the characteristics and constraints of WSNs but since battery replenishment is not possible or highly challenging for sensor nodes, one of the major concerns in designing network p...
A Depth-optimal Low-complexity Distributed Wireless Multicast Algorithm Akyurek, A. Sinan; Uysal, Elif (Oxford University Press (OUP), 2011-06-01) This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). It is proved that SWIM is fully distributed, with a worst case complexity upper-bounded by O(N-3), and an empirically found average complexity of only O(N-2). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a by-product, it creates a...

Citation Formats

O. M. Gul and M. Demirekler, “Asymptotically Throughput Optimal Scheduling for Energy Harvesting Wireless Sensor Networks,” IEEE Access, pp. 45004–45020, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/51948.