Home > Seminars > Resource Allocation in Wireless Powered Cooperative Cognitive Radio Networks

Resource Allocation in Wireless Powered Cooperative Cognitive Radio Networks


12/4/2015 at 2:00PM


12/4/2015 at 3:00PM


258 Fitzpatrick Hall


College of Engineering close button

Thomas Fuja

Thomas Fuja

VIEW FULL PROFILE Email: tfuja@nd.edu
Phone: 574-631-7244
Office: 275 Fitzpatrick Hall


Wireless Institute Professor
Prof. Fuja research addresses reliable communication over inherently unreliable and/or constrained communication links. He has recently focused his research on the changing role that channel codes play in the context of wireless networks, i.e., to not only provide physical-layer robustness but ...
Click for more information about Thomas
Add to calendar:
iCal vCal

Wireless powered communication network (WPCN), enabled by the energy transfer through radio-frequency signals, can supply energy to devices wirelessly.  In this talk we integrate WPCN with a cooperative cognitive radio network, where multiple secondary users (SUs) wireless powered by a hybrid access point (HAP) help a primary user relay the data.  As a reward for this cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access.  To maximize the sum-throughput of SUs, we present a secondary sumthroughput optimal resource allocation (STORA) scheme.  Under the primary rate constraint, the STORA scheme optimally allocates the resources like SUs for relaying, their harvested energy, and time.  Specifically, by exploiting the structure of the optimal solution, we find the order in which SUs are prioritized to relay primary data.  Since the STORA scheme focuses on the sumthroughput, it becomes inconsiderate towards individual SU throughput, resulting in unfairness.  To induce fairness, we investigate three resource allocation schemes, which are (i) the equal time allocation, (ii) the minimum throughput maximization, and (iii) the proportional time allocation.  Simulation results highlight the tradeoff between the sum throughput and fairness.  Though the STORA scheme achieves the highest sum-throughput, it is the least fairness inducing scheme; while the minimum throughput maximization scheme is the fairest one as each SU gets the same throughput, but achieves the least sum-throughput (this is joint work with my students Mr. Sanket Kalamkar and Ms. Jeya Pradha).

Seminar Speaker:

Adrish Banerjee

Adrish Banerjee

Indian Institute of Technology Kanpur

Adrish received his Bachelor’s degree from Indian Institute of Technology, Kharagpur and Masters and Ph.D. degree from University of Notre Dame, Indiana.  He is currently an Associate Professor in the Department of Electrical Engineering at Indian Institute of Technology, Kanpur.  He is a recipient of Microsoft Research India young faculty award, Institute of Engineers India young engineer award, and P K Kelkar young faculty fellowship.  His research interests are in the broad area of wireless communications, particularly error control coding, cognitive radio and green communications.