Research on Anti-collision Scheduling Method for Multimedia Data

When the current multimedia data is subjected to anti-collision scheduling, there is a problem that the global search capability is poor, the validity is low, and the data reading efficiency is low. A multimedia data anti-collision scheduling method is proposed, which divides the multimedia data blocks so that the lower layers of multimedia data blocks are preferentially requested to ensure the continuity of the multimedia data blocks and improve the global search capability. The BM management method is used to transmit the multimedia data to the neighboring nodes on a regular basis, and the neighbor nodes are selected according to the received information to improve the data reading efficiency. The Bayesian cost function is used to calculate the optimal frame length of the multimedia data, and the anti-collision scheduling of the multimedia data is effectively performed. The experimental results show that the method has high global search ability, high efficiency and high data reading efficiency.