A time-slotted multiple access wireless system with N transmitting nodes, each equipped with an energy harvesting (EH) device and a rechargeable battery of finite capacity, is studied. The energy arrival process at each node is modeled as an independent two-state Markov process, such that a node either harvests one unit of energy, or none, at each time slot (TS). The access point (AP) schedules a subset of K nodes to transmit over K orthogonal channels at each TS. The maximum total throughput is studied for a backlogged system without the knowledge of the EH processes and nodes' battery states at the AP. The problem is identified as a partially observable Markov decision process, and the optimal policy for the general model is studied numerically. Under certain assumptions regarding the EH processes and the battery sizes, the optimal scheduling policy is characterized explicitly, and is shown to be myopic. © 2013 IEEE.

Low-complexity scheduling policies for energy harvesting communication networks / Blasco, P.; Gunduz, D.; Dohler, M. - (2013), pp. 1601-1605. (Intervento presentato al convegno 2013 IEEE International Symposium on Information Theory, ISIT 2013 tenutosi a Istanbul, tur nel 2013) [10.1109/ISIT.2013.6620497].

Low-complexity scheduling policies for energy harvesting communication networks

Gunduz D.;
2013

Abstract

A time-slotted multiple access wireless system with N transmitting nodes, each equipped with an energy harvesting (EH) device and a rechargeable battery of finite capacity, is studied. The energy arrival process at each node is modeled as an independent two-state Markov process, such that a node either harvests one unit of energy, or none, at each time slot (TS). The access point (AP) schedules a subset of K nodes to transmit over K orthogonal channels at each TS. The maximum total throughput is studied for a backlogged system without the knowledge of the EH processes and nodes' battery states at the AP. The problem is identified as a partially observable Markov decision process, and the optimal policy for the general model is studied numerically. Under certain assumptions regarding the EH processes and the battery sizes, the optimal scheduling policy is characterized explicitly, and is shown to be myopic. © 2013 IEEE.
2013
2013 IEEE International Symposium on Information Theory, ISIT 2013
Istanbul, tur
2013
1601
1605
Blasco, P.; Gunduz, D.; Dohler, M
Low-complexity scheduling policies for energy harvesting communication networks / Blasco, P.; Gunduz, D.; Dohler, M. - (2013), pp. 1601-1605. (Intervento presentato al convegno 2013 IEEE International Symposium on Information Theory, ISIT 2013 tenutosi a Istanbul, tur nel 2013) [10.1109/ISIT.2013.6620497].
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

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