Since wireless sensors may be deployed in hard-to-reach or remote areas, managing their energy availability has become an important task. In order to prolong the network lifetime, several techniques have been adopted, and Wireless Sensor Networks (WSNs) with Energy Harvesting (EH) capabilities have been recently studied and deployed. We consider the case of an Energy Harvesting Device (EHD) with a packet data queue, with the main goal of maximizing the long-term average transmission rate. At each time instant, the device has different energy and data queue levels and can gather energy from the environment and receive or generate packets that are stored in the queue. We assume that the energy expenditure is mainly due to data transmission. We initially suppose to have a small battery and we study a particular subset of all policies, called almost geometric. Then, we analyze a system where the data buffer is finite and large with respect to the battery, computing the Optimal Policy (OP) and introducing a simple Low-Complexity almost geometric Policy (LCP). Finally, we numerically show that LCP can be considered as a good lower bound for OP.

Transmission policies for an energy harvesting device with a data queue

BIASON, ALESSANDRO;ZORZI, MICHELE
2015

Abstract

Since wireless sensors may be deployed in hard-to-reach or remote areas, managing their energy availability has become an important task. In order to prolong the network lifetime, several techniques have been adopted, and Wireless Sensor Networks (WSNs) with Energy Harvesting (EH) capabilities have been recently studied and deployed. We consider the case of an Energy Harvesting Device (EHD) with a packet data queue, with the main goal of maximizing the long-term average transmission rate. At each time instant, the device has different energy and data queue levels and can gather energy from the environment and receive or generate packets that are stored in the queue. We assume that the energy expenditure is mainly due to data transmission. We initially suppose to have a small battery and we study a particular subset of all policies, called almost geometric. Then, we analyze a system where the data buffer is finite and large with respect to the battery, computing the Optimal Policy (OP) and introducing a simple Low-Complexity almost geometric Policy (LCP). Finally, we numerically show that LCP can be considered as a good lower bound for OP.
Proceedings of 2015 International Conference on Computing, Networking and Communications, ICNC 2015
9781479969593
9781479969593
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3181942
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 14
social impact