Low-Complexity Scheduling Policies for Energy Harvesting Communication Networks

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.

Provided by: Imperial College London Topic: Mobility Date Added: Apr 2013 Format: PDF

Find By Topic