Common and Sum Rate Optimization for Multi-carrier Energy Harvesting Wireless Networks

  • Author / Creator
    Taei, Farid
  • Energy harvesting techniques, which exploit ambient energy to power communications devices, have gained increased attention in recent years. Such techniques have emerged as a promising solution for energy-constrained wireless networks, with possible applications in the future Internet of things. The focus of this thesis is on multi-carrier wireless energy harvesting networks (WEHNs) where users adopt a harvest-then-transmit protocol to communicate with an access point. For such networks, we study the subchannel assignment and powerallocation at the users to maximize the common rate and sum rate considering the effect of channel fading and path loss on the signals. Both common rate and sum rate optimization problems result in a non-convex mixed binary optimization formulation without a known systematic solution to the best of our knowledge. That being said, we propose multiple heuristic suboptimal solutions for the rate optimization problems providing different trade-offs between computational complexity and performance. The performance of the proposed solutions are evaluated under several WEHN setups through computer simulations.

  • Subjects / Keywords
  • Graduation date
    Spring 2018
  • Type of Item
  • Degree
    Master of Science
  • DOI
  • License
    Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.