z-logo
open-access-imgOpen Access
Energy Harvesting for Throughput Enhancement of Cooperative Wireless Sensor Networks
Author(s) -
VanDinh Nguyen,
Chuyen T. Nguyen,
OhSoon Shin
Publication year - 2016
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1177/155014771962397
Subject(s) - relay , computer science , mathematical optimization , wireless sensor network , node (physics) , energy harvesting , transmission (telecommunications) , optimization problem , iterative method , convex optimization , throughput , energy consumption , wireless , minimax , energy (signal processing) , power (physics) , computer network , algorithm , mathematics , regular polygon , telecommunications , engineering , electrical engineering , statistics , physics , geometry , structural engineering , quantum mechanics
We consider an energy harvesting for cooperative wireless sensor networks with a nonlinear power consumption model. The information transmission from the source node to the destination node is assumed to occur via several clusters of decode-and-forward relay nodes. We assume that all the source and relay nodes have the ability to harvest energy from the environment and use that harvested energy to transmit and forward the information to the next hop. Under such assumption, the objective of our design is to improve the total throughput of the end-to-end link over a number of transmission blocks subject to constraints on energy causality, battery overflow, and time duration for energy harvesting. The optimization problem is found to be a nonconvex maximin fractional program, which is difficult to solve in general. We present an efficient iterative algorithm to solve the optimization problem. Specifically, by introducing novel transformations, we apply an approximate convex technique to obtain a convex problem at each iteration. We then propose an iterative power allocation algorithm which converges to a locally optimal solution at a Karush-Kuhn-Tucker point. Numerical results are provided to evaluate the proposed scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom