Distributed Energy-Spectrum Trading in Green Cognitive Radio Cellular Networks
Document Type
Article
Publication Date
9-1-2017
Abstract
Reducing the power consumption of base stations is crucial to enhancing the energy efficiency of cellular networks. As the number of mobile users increases exponentially, enhancing the spectrum efficiency is also critical in order to accommodate more users. In this paper, by exploiting the cooperation between secondary base stations (SBSs) and primary base stations (PBSs), we propose a new energy spectrum trading model to enhance the energy as well as spectrum efficiency of cellular networks. In our scheme, by leveraging cognitive radio, PBSs share some portion of their licensed spectrum with SBSs, and SBSs, in exchange, provide data service to the primary users under their coverage. We first prove that the power consumption minimization problem is NP-hard. Then, to decrease the computational complexity, we design an efficient distributed auction model including green energy aware bidding (GEAB) and adaptive bid selection (ABS) algorithms, to achieve a good approximation of the optimal solution in less time. Our simulation results show that the cooperation between PBS and SBSs via ABS and GEAB algorithms can significantly improve the energy and spectral efficiency of cellular networks by nearly doubling the number of offloaded users and reducing the PBS power consumption by up to 40% as compared to existing approaches. Furthermore, green energy utilization among SBSs is increased by nearly 25%.
Identifier
85051442504 (Scopus)
Publication Title
IEEE Transactions on Green Communications and Networking
External Full Text Location
https://doi.org/10.1109/TGCN.2017.2698260
e-ISSN
24732400
First Page
253
Last Page
263
Issue
3
Volume
1
Recommended Citation
Yousefvand, Mohammad; Han, Tao; Ansari, Nirwan; and Khreishah, Abdallah, "Distributed Energy-Spectrum Trading in Green Cognitive Radio Cellular Networks" (2017). Faculty Publications. 9343.
https://digitalcommons.njit.edu/fac_pubs/9343
