Distributed communication interference resource scheduling using the master-slave parallel scheduling genetic algorithm

被引:0
|
作者
Wei, Zhenhua [1 ]
Wu, Wenpeng [1 ]
Zhan, Jianwei [1 ]
Zhang, Zhaoguang [1 ]
机构
[1] Rocket Force Univ Engn, Xian 710025, Peoples R China
来源
SCIENTIFIC REPORTS | 2025年 / 15卷 / 01期
关键词
AI WEAPONS; ALLOCATION; DESIGN;
D O I
10.1038/s41598-025-86478-x
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
With the increasing intelligence and diversification of communication interference in recent years, communication interference resource scheduling has received more attention. However, the existing interference scenario models have been developed mostly for remote high-power interference with a fixed number of jamming devices without considering power constraints. In addition, there have been fewer scenario models for short-range distributed communication interference with a variable number of jamming devices and power constraints. To address these shortcomings, this study designs a distributed communication interference resource scheduling model based distributed communication interference deployment and system operational hours and introduces the stepped logarithmic jamming-to-signal ratio. The proposed model can improve the scheduling ability of the master-slave parallel scheduling genetic algorithm (MSPSGA) in terms of the number of interference devices and the system's operational time by using four scheduling strategies referring to the searching number, global number, master-slave population power, and fixed-position power. The experimental results show that the MSPSGA can improve the success rate of searching for the minimum number of jamming devices by 40% and prolong the system's operational time by 128%. In addition, it can reduce the algorithm running time in the scenario with a high-speed countermeasure, the generation time of the jamming scheme, and the average power consumption by 4%, 84%, and 57%, respectively. Further, the proposed resource scheduling model can reduce the search ranges for the number of jamming devices and the system's operational time by 93% and 79%, respectively.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] Parallel machine scheduling with dynamic resource allocation via a master-slave genetic algorithm
    Fu, Yaping
    Tian, Guangdong
    Li, Zhiwu
    Wang, Zhenling
    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2018, 13 (05) : 748 - 756
  • [2] Scheduling Master-Slave Wireless Networks in the Presence of Interference
    Short, Michael
    2016 IEEE 21ST INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2016,
  • [3] Scheduling tasks in master-slave parallel processing systems
    Blazewicz, J
    Dell'Olmo, P
    Drozdowski, M
    MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 255 - 260
  • [4] Master-Slave Synchronization of Heterogeneous Systems Under Scheduling Communication
    Wen, Guanghui
    Wan, Ying
    Cao, Jinde
    Huang, Tingwen
    Yu, Wenwu
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2018, 48 (03): : 473 - 484
  • [5] Scheduling problems in master-slave model
    Joseph Y.-T. Leung
    Hairong Zhao
    Annals of Operations Research, 2008, 159 : 215 - 231
  • [6] Scheduling problems in master-slave model
    Leung, Joseph Y. -T.
    Zhao, Hairong
    ANNALS OF OPERATIONS RESEARCH, 2008, 159 (01) : 215 - 231
  • [7] Scheduling master-slave multiprocessor systems
    Sahni, S
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (10) : 1195 - 1199
  • [8] The impact of heterogeneity on master-slave scheduling
    Pineau, Jean-Francois
    Robert, Yves
    Vivien, Frederic
    PARALLEL COMPUTING, 2008, 34 (03) : 158 - 176
  • [9] Analysis of scheduling algorithms for master-slave systems
    Vairaktarakis, GL
    IIE TRANSACTIONS, 1997, 29 (11) : 939 - 949
  • [10] Analysis of scheduling algorithms for master-slave systems
    Marquette Univ, Milwaukee, United States
    IIE Trans, 11 (939-949):