A novel cognitive radio spectrum allocation scheme with chaotic gravitational search algorithm

2018 ◽  
Vol 10 (2) ◽  
pp. 161 ◽  
Author(s):  
Lin Guo ◽  
Zhigang Chen ◽  
Ling Huang
Author(s):  
Ling Li ◽  
Tien-Szu Pan ◽  
Xiao-Xue Sun ◽  
Shu-Chuan Chu ◽  
Jeng-Shyang Pan

AbstractSpectrum has now become a scarce resource due to the continuous development of wireless communication technology. Cognitive radio technology is considered to be a new method to solve the shortage of spectrum resources. The spectrum allocation model of cognitive radio can effectively avoid the waste of spectrum resources. A novel binary version of slime mould algorithm is proposed for the spectrum allocation model to solve the spectrum allocation scheme. In addition, adding unselected factors strategy can make the approach find a better solution. Compared with other algorithms, the novel binary slime mould algorithm and the strategy of adding unselected factors proposed in this paper have a good performance in spectrum allocation. The resulting spectrum allocation scheme can achieve efficient use of network resources.


Algorithms ◽  
2018 ◽  
Vol 11 (3) ◽  
pp. 27 ◽  
Author(s):  
Liping Liu ◽  
Ning Wang ◽  
Zhigang Chen ◽  
Lin Guo

2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  

Author(s):  
Umit Can ◽  
Bilal Alatas

The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.


Sign in / Sign up

Export Citation Format

Share Document