Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks - 2018

PROJECT TITLE :

Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks - 2018

ABSTRACT:

The dynamic frame sizing algorithm could be a throughput-optimal algorithm that can achieve maximum network throughput while not the information of arrival rates. Motivated by the need for energy-economical Communication in wireless networks, in this Project, we propose a replacement dynamic frame sizing algorithm, referred to as the Greenput algorithm, that takes power allocation into account. In our Greenput algorithm, time is partitioned into frames, and also the frame size of each frame is decided based mostly on the backlogs presented at the beginning of a frame. To get a good delay-energy potency tradeoff, the key insight of our Greenput algorithm is to cut back transmit power to save energy when the backlogs are low so as to not incur too much packet delay. For this, we tend to outline a threshold parameter Tmax (for the minimum time to empty the backlogs with maximum power allocation), and the Greenput algorithm enters the (mixed) power-saving mode when the backlogs are below the threshold. Employing a massive deviation certain, we prove that our Greenput algorithm is still throughput optimal. Plus the stability result, we additionally perform a fluid approximation analysis for energy potency and average packet delay when Tmax is very large. To show the delay-energy efficiency tradeoff, we conduct intensive laptop simulations by using the Shannon formula because the channel model during a wireless network. Our simulation results show that both energy potency and average packet delay are quite shut to their fluid approximations even when Tmax is moderately massive.

Did you like this research project?

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