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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Data Link Slot Allocation Algorithm Based on Improved Particle Swarm Optimization

Zifan Wang, Xiang Ji, Hai Gong
Distributed and Parallel Computing Systems
article

A Data Link Slot Allocation Algorithm Based on Improved Particle Swarm Optimization

Zifan Wang, Xiang Ji, Hai Gong
article en

Abstract

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.

Xijing University (CN)
Affordable and clean energy
Openalex Percentile: Top 75%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.