A Data Link Slot Allocation Algorithm Based on Improved Particle Swarm Optimization
Tactical data link systems commonly employ Time Division Multiple Access (TDMA) network access methods. Slot allocation technology plays a crucial role in TDMA system. Existing slot allocation algorithms often suffer from insufficient global search capabilities, high computational demands, and low efficiency. This paper proposes an improved particle swarm optimization algorithm based on an adaptive weight mechanism. By dynamically adjusting the inertia weight, the algorithm not only prevents premature convergence caused by improper weight settings but also ensures effective exploration of the solution space during iterations, accelerating convergence in the later stages and enhancing the algorithm's global search capability. Experimental results demonstrate that compared to traditional PSO slot allocation algorithms and other slot allocation methods, the proposed adaptive weight particle swarm optimization algorithm ensures high stability and can rapidly find the most uniform and optimal slot allocation scheme for nodes, thereby enhancing slot resource utilization and effectively reducing end-to-end transmission delay jitter.
Authors
- Zifan Wang (ORCID: https://orcid.org/0009-0005-5333-5175)
- Xiang Ji (ORCID: https://orcid.org/0009-0001-0349-2341)
- Hai Gong (ORCID: https://orcid.org/0009-0001-8023-4098)
Institutions
- Xijing University (CN)
Publication Details
- Published
- 2024-08-21
- DOI
- https://doi.org/10.1109/icicn62625.2024.10761682
- Primary Topic
- Distributed and Parallel Computing Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00