PROJECT TITLE :

Stochastic Routing and Scheduling Policies for Energy Harvesting Communication Networks - 2018

ABSTRACT:

During this Project, we have a tendency to study the joint routing-scheduling downside in energy harvesting communication networks. Our policies, that are based mostly on stochastic subgradient strategies on the dual domain, act as an energy harvesting variant of the stochastic family of backpressure algorithms. Specifically, we have a tendency to propose two policies: first, the stochastic backpressure with energy harvesting, in which a node's routing-scheduling decisions are determined by the difference between the Lagrange multipliers associated to their queue stability constraints and their neighbors'; and second, the stochastic soft backpressure with energy harvesting, an improved algorithm where the routing-scheduling decision is of a probabilistic nature. For each policies, we show that given sustainable information and energy arrival rates, the steadiness of the information queues over all network nodes is guaranteed. Numerical results corroborate the steadiness guarantees and illustrate the minimal gap in performance that our policies offer with respect to classical ones that job with an infinite energy supply.