2022
DOI: 10.1155/2022/1857304
|View full text |Cite|
|
Sign up to set email alerts
|

Multiconstraint-Oriented Tactical Communication Network Planning Problem

Abstract: Based on the complex network theory, this paper comprehensively studies the equipment and its interrelationship in the tactical communication system and constructs a system networking model. Based on the analysis of the structure and organizational application of the tactical communication system, this paper provides an appropriate mathematical description of its net-electric attack strategy and evaluation. A network simulation test model of tactical communication system was established, and then, by changing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 21 publications
(23 reference statements)
0
2
0
Order By: Relevance
“…Update Slot ( 5) ELSE ( 6) Frame_number←get_Frame_number(S); // Determine the number of frames to be scheduled according to the number of waiting frames in S (7) (8) FOR (i = 1; i++; i < Frame_number) (9) Calculate the Slot set that can transmit the all frame; (10) END FOR (11) FOR (i = 1; i++; i < Frame_number) (12) Slot M ← get_feasible_slot(Slot) //Select the largest data frame to be scheduled, and select the transmissible slot with the most matching length (13) Update Slot (14) According Slot M to get W.start // W.start of each frame can be calculated (15) END FOR // The above is to select the timeslot and get W.start. Next, determine the incoming queue Qm (16) FOR (i = 1; i++; i <Q_number) // The secondary queue contains four queues.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Update Slot ( 5) ELSE ( 6) Frame_number←get_Frame_number(S); // Determine the number of frames to be scheduled according to the number of waiting frames in S (7) (8) FOR (i = 1; i++; i < Frame_number) (9) Calculate the Slot set that can transmit the all frame; (10) END FOR (11) FOR (i = 1; i++; i < Frame_number) (12) Slot M ← get_feasible_slot(Slot) //Select the largest data frame to be scheduled, and select the transmissible slot with the most matching length (13) Update Slot (14) According Slot M to get W.start // W.start of each frame can be calculated (15) END FOR // The above is to select the timeslot and get W.start. Next, determine the incoming queue Qm (16) FOR (i = 1; i++; i <Q_number) // The secondary queue contains four queues.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…The TSN scheduling mechanisms are roughly divided into two categories, namely, synchronous traffic scheduling and asynchronous traffic scheduling [6][7][8][9][10][11][12][13][14][15][16]. At present, synchronous traffic scheduling mainly focuses on gate control lists (GCLs) and TAS-based joint routing.…”
Section: Related Workmentioning
confidence: 99%
“…This article has been retracted by Hindawi following an investigation undertaken by the publisher [1]. This investigation has uncovered evidence of one or more of the following indicators of systematic manipulation of the publication process:…”
mentioning
confidence: 99%