Joint bandwidth allocation and power control with interference constraints in multi-hop cognitive radio networks
Communications|Updated:2022-08-31
|
Joint bandwidth allocation and power control with interference constraints in multi-hop cognitive radio networks
Joint bandwidth allocation and power control with interference constraints in multi-hop cognitive radio networks
Frontiers of Information Technology & Electronic EngineeringVol. 11, Issue 2, Pages: 139-150(2010)
Affiliations:
Wuhan National Laboratory for Optoelectronics, Department of Electronics & Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
Guang-xi ZHU, Xue-bing PEI, Dai-ming QU, et al. Joint bandwidth allocation and power control with interference constraints in multi-hop cognitive radio networks[J]. Frontiers of Information Technology & Electronic Engineering, 2010, 11(2): 139-150.
DOI:
Guang-xi ZHU, Xue-bing PEI, Dai-ming QU, et al. Joint bandwidth allocation and power control with interference constraints in multi-hop cognitive radio networks[J]. Frontiers of Information Technology & Electronic Engineering, 2010, 11(2): 139-150. DOI: 10.1631/jzus.C0910070.
Joint bandwidth allocation and power control with interference constraints in multi-hop cognitive radio networks
We investigate the bandwidth allocation and power control schemes in orthogonal frequency division multiplexing (OFDM) based multi-hop cognitive radio networks
and the color-sensitive graph coloring (CSGC) model is viewed as an efficient solution to the spectrum assignment problem. We extend the model by taking into account the power control strategy to avoid interference among secondary users and adapt dynamic topology. We formulate the optimization problem encompassing the channel allocation
power control with the interference constrained below a tolerable limit. The optimization objective with two different optimization strategies focuses on the routes rather than the links as in traditional approaches. A heuristic solution to this nondeterministic polynomial (NP)-hard problem is presented
which performs iterative channel allocation according to the lowest transmission power that guarantees the link connection and makes channel reuse as much as possible
and then the transmission power of each link is maximized to improve the channel capacity by gradually adding power level from the lowest transmission power until all co-channel links cannot satisfy the interference constraints. Numerical results show that our proposed strategies outperform the existing spectrum assignment algorithms in the performance of both the total network bandwidth and minimum route bandwidth of all routes
meanwhile
saving the transmission power.
关键词
Keywords
references
The trial reading is over, you can activate your VIP account to continue reading.