Cooperative Jamming Resource Allocation Based on Integer-Encoded Directed Mutation Artificial Bee Colony Algorithm

Author(s):  
Jiechen Xia ◽  
Jing Ma ◽  
Yibing Li ◽  
Mingzhao Song
2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Fang Ye ◽  
Fei Che ◽  
Lipeng Gao

For the future information confrontation, a single jamming mode is not effective due to the complex electromagnetic environment. Selecting the appropriate jamming decision to coordinately allocate the jamming resources is the development direction of the electronic countermeasures. Most of the existing studies about jamming decision only pay attention to the jamming benefits, while ignoring the jamming cost. In addition, the conventional artificial bee colony algorithm takes too many iterations, and the improved ant colony (IAC) algorithm is easy to fall into the local optimal solution. Against the issue, this paper introduces the concept of jamming cost in the cognitive collaborative jamming decision model and refines it as a multiobjective one. Furthermore, this paper proposes a tabu search-artificial bee colony (TSABC) algorithm to cognitive cooperative-jamming decision. It introduces the tabu list into the artificial bee colony (ABC) algorithm and stores the solution that has not been updated after a certain number of searches into the tabu list to avoid meeting them when generating a new solution, so that this algorithm reduces the unnecessary iterative process, and it is not easy to fall into a local optimum. Simulation results show that the search ability and probability of finding the optimal solution of the new algorithm are better than the other two. It has better robustness, which is better in the “one-to-many” jamming mode.


2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Ming Sun ◽  
Yujing Huang ◽  
Shumei Wang ◽  
Yaoqun Xu

In recent years, large usage of wireless networks puts forward challenge to the utilization of spectrum resources, and it is significant to improve the spectrum utilization and the system sum data rates in the premise of fairness. However, the existing algorithms have drawbacks in efficiency to maximize the sum data rates of orthogonal frequency division multiple access (OFDMA) systems in the premise of fairness threshold. To address the issue, a novel artificial bee colony algorithm with update quantities of nectar sources is proposed for OFDMA resource allocation in this paper. Firstly, the population of nectar sources is divided into several groups, and a different update quantity of nectar sources is set for each group. Secondly, based on the update quantities of nectar sources set for these groups, nectar sources are initialized by a greedy subcarrier allocation method. Thirdly, neighborhood searches and updates are performed on dimensions of nectar sources corresponding to the preset update quantities. The proposed algorithm can not only make the initialized nectar sources maintain high levels of fairness through the greedy subcarrier allocation but also use the preset update quantities to reduce dimensions of the nectar sources to be optimized by the artificial bee colony algorithm, thereby making full use of both the local optimization of the greedy method and the global optimization of the artificial bee colony algorithm. The simulation results show that, just in the equal-power subcarrier allocation stage, the proposed algorithm can achieve the required fairness threshold and effectively improve the system sum data rates.


Sign in / Sign up

Export Citation Format

Share Document