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.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE : Link Prediction Based on Stochastic Information Diffusion ABSTRACT: Link prediction (LP) in networks aims to determine future interactions among elements; it is an essential piece of machine learning software in
PROJECT TITLE : Dynamic Scheduling for Stochastic Edge-Cloud Computing Environments using A3C learning and Residual Recurrent Neural Networks ABSTRACT: The widespread adoption of applications that are based on the Internet
PROJECT TITLE : An Analysis of a Stochastic ON-OFF Queueing Mobility Model for Software-Defined Vehicle Networks ABSTRACT: Recently, we have been exposed to a number of newly developed software-defined paradigms of VANET in
PROJECT TITLE : A Stochastic Approach to Finding Densest Temporal Subgraphs in Dynamic Graphs ABSTRACT: Finding the densest lasting -subgraphs in large dynamic graphs, which takes into consideration the time duration of the
PROJECT TITLE : BayesFlow Learning Complex Stochastic Models With Invertible Neural Networks ABSTRACT: Estimating the parameters of mathematical models is a problem that arises frequently in virtually all subfields of the scientific

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry