Energy-Efficient Resource Allocation for Heterogeneous Cognitive Radio Network based on Two-Tier Crossover Genetic Algorithm
- Authors
- Jiao, Yan; Joe, Inwhee
- Issue Date
- Feb-2016
- Publisher
- 한국통신학회
- Keywords
- Cognitive radio network; energy-efficient resource allocation; multi-RAT; radio environment map; two-tier crossover genetic algorithm
- Citation
- Journal of Communications and Networks, v.18, no.1, pp 112 - 122
- Pages
- 11
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- Journal of Communications and Networks
- Volume
- 18
- Number
- 1
- Start Page
- 112
- End Page
- 122
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/155210
- DOI
- 10.1109/JCN.2016.000014
- ISSN
- 1229-2370
1976-5541
- Abstract
- Cognitive radio (CR) is considered an attractive technology to deal with the spectrum scarcity problem. Multi-radio access technology (multi-RAT) can improve network capacity because data are transmitted by multiple RANs (radio access networks) concurrently. Thus, multi-RAT embedded in a cognitive radio network (CRN) is a promising paradigm for developing spectrum efficiency and network capacity in future wireless networks. In this study, we consider a new CRN model in which the primary user networks consist of heterogeneous primary users (PUs). Specifically, we focus on the energy-efficient resource allocation (EERA) problem for CR users with a special location coverage overlapping region in which heterogeneous PUs operate simultaneously via multi-RAT. We propose a two-tier crossover genetic algorithm-based search scheme to obtain an optimal solution in terms of the power and bandwidth. In addition, we introduce a radio environment map to manage the resource allocation and network synchronization. The simulation results show the proposed algorithm is stable and has faster convergence. Our proposal can significantly increase the energy efficiency.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.