1553B bus message transmission optimization method based on hybrid genetic algorithm

Abstract

The invention relates to a 1553B bus message transmission optimization method based on a hybrid genetic algorithm, and belongs to the technical field of bus message transmission. According to the method, firstly, a 1553B bus message scheduling mathematical model is established through a queuing theory; secondly, a genetic algorithm is introduced to quickly find out a 1553B bus message scheduling feasible solution; thirdly, the feasible solution found through the genetic algorithm is converted to an initial pheromone of an ant colony optimization algorithm; finally, a 1553B bus message scheduling optimal solution is obtained through local optimization and a positive feedback mechanism of the ant colony algorithm. Simulation test results show that when the improved genetic algorithm is used to optimize 1553B bus message transmission, the bus utilization rate is increased under the condition that a maximum delay time requirement and a communication real-time performance requirement of each message are met, bus message congestion and saturation phenomena are effectively relieved, the difficult problem in bus load balancing is solved, and the capability of handling the asynchronous message is relatively good.

Description

technical field [0001] The invention relates to the technical field of bus message transmission, in particular to a 1553B bus message transmission optimization method based on a hybrid genetic algorithm. Background technique [0002] The 1553B bus is a centralized control standard for the networking of electronic systems inside the aircraft. Its high reliability, real-time performance and flexibility make it widely used in aviation, aerospace and other fields. [0003] Since the existing electronic system has high requirements on real-time and reliability, it is necessary to ensure the real-time performance of message transmission on the 1553B bus. When multiple messages of different lengths and periods need to be processed on the 1553B bus, and there are asynchronous messages to be processed, it is generally difficult to guarantee the real-time performance of the system. At present, the more common 1553B bus message optimization algorithms include calculation-based vector ...

AI Technical Summary

Problems solved by technology

In the above methods, both the calculation-based vector algorithm and the RMS scheduling algorithm are based on static load balancing, which does not solve the problem of dynamic load balancing of messages. When there are many aperiodic messages on the bus, it is easy to cause bus congestion or saturation; The release time interval priority algorithm cannot guarantee that messages with a small release interval or burst messages can be scheduled before the deadline; the HTSF algorithm does not consider the situation that multiple messages may arrive at the same time at the same time, and the algorithm execution efficiency is low

Images