This project examines wireless communication networks whose nodes have batteries that recharge by harvesting energy from the environment. Energy harvesting can yield a network that lasts as long as the network's hardware and intended purpose remain viable; this may be arbitrarily longer than the lifetime of any suitable single-charge battery. While average-power minimization is adequate to describe the lifetime of a device with a single-charge battery, a complete characterization of a network of rechargeable devices will depend on how the batteries are replenished. Given the broad variety of energy recharging systems, including solar cells, vibration absorption devices, wind and water mills, and thermoelectric generators, battery recharging is modeled as an environmental stochastic process. This project applies analytical models for battery recharging to evaluate fundamental multiple access, broadcast and relay network models composed of rechargeable nodes. The project objective is an enhanced understanding of the analytic fundamentals of rechargeable networks in order to contribute to the development and ultimate deployment of ecologically-friendly rechargeable networks.

Project Report

This project has studied wireless networks where individual nodes harvest energy from nature into their rechargeable batteries to operate in an energy self-sufficient, energy self-sustaining manner. Such networks will contribute to the development of future green wireless communication systems. The major technical outcome of this proposal is the development of resource allocation algorithms that adaptively optimize the transmission schemes of the nodes based on their energy intake from the environment. Such algorithms implement energy causality, i.e., energy used at any given time must be less than the energy harvested so far, and no-energy-overflow, i.e., no energy harvesting opportunity must be missed due to a full battery. The first principle dictates a slow enough expenditure of energy so that the network never attempts to use more energy than it has harvested, while the second principle dictates a fast enough expenditure of energy so that sufficient space opens up in the battery to accommodate all incoming energy. The developed algorithms aim to strike a balance between these constraints with the goal of maximizing the data rate sustained in the network. Towards this goal, this research produced several practical algorithms: a one-shot geometric algorithm as well as a constructive iterative algorithm. This research produced a practical resource allocation algorithm which is now known as directional water-filling algorithm, which determines the power allocation of an energy harvesting node over time based on the channel quality and available energy. This research developed optimum algorithms for point-to-point communication systems as well as systems involving multiple transmitters and receivers. This research also developed optimum algorithms for systems with hybrid energy storage units with different energy storage and retrieval efficiencies. Educational outcomes of this research include the development of a seminar course at the University of Maryland with the title Energy-Harvesting Rechargeable Networks, as well as incorporation of the produced research results into an existing graduate-level course Wireless Communication Theory to enrich and modernize its curriculum. Human development and training outcomes of this research include training of several PhD students here at Maryland, and also at Rutgers and Penn State (our collaborative partners on this project) on energy harvesting communications and gave them opportunities to conduct research on modern issues in wireless communications and networking. These PhD students have had the opportunity to collaborate closely with their peers as well as professors at different institutions, giving them richer learning experiences, and opportunities to participate in joint collaborative research.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Network Systems (CNS)
Application #
0964632
Program Officer
Thyagarajan Nandagopal
Project Start
Project End
Budget Start
2010-03-15
Budget End
2014-02-28
Support Year
Fiscal Year
2009
Total Cost
$300,000
Indirect Cost
Name
University of Maryland College Park
Department
Type
DUNS #
City
College Park
State
MD
Country
United States
Zip Code
20742