Loading…
Utility-Optimal Resource Management and Allocation Algorithm for Energy Harvesting Cognitive Radio Sensor Networks
In this paper, we study resource management and allocation for energy harvesting cognitive radio sensor networks (EHCRSNs). In these networks, energy harvesting supplies the network with a continual source of energy to facilitate the self-sustainability of the power-limited sensors. Furthermore, cog...
Saved in:
Published in: | IEEE journal on selected areas in communications 2016-12, Vol.34 (12), p.3552-3565 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, we study resource management and allocation for energy harvesting cognitive radio sensor networks (EHCRSNs). In these networks, energy harvesting supplies the network with a continual source of energy to facilitate the self-sustainability of the power-limited sensors. Furthermore, cognitive radio enables access to the underutilized licensed spectrum to mitigate the spectrum-scarcity problem in the unlicensed band. We develop an aggregate network utility optimization framework for the design of an online energy management, spectrum management, and resource allocation algorithm based on Lyapunov optimization. The framework captures three stochastic processes: energy harvesting dynamics, inaccuracy of channel occupancy information, and channel fading. However, a priori knowledge of any of these processes statistics is not required. Based on the framework, we propose an online algorithm to achieve two major goals: first, balancing sensors' energy consumption and energy harvesting while stabilizing their data and energy queues; second, optimizing the utilization of the licensed spectrum while maintaining a tolerable collision rate between the licensed subscriber and unlicensed sensors. The performance analysis shows that the proposed algorithm achieves a close-to-optimal aggregate network utility while guaranteeing bounded data and energy queue occupancy. The extensive simulations are conducted to verify the effectiveness of the proposed algorithm and the impact of various network parameters on its performance. |
---|---|
ISSN: | 0733-8716 1558-0008 |
DOI: | 10.1109/JSAC.2016.2611960 |