Abstract

Based on the analysis of bacterial parasitic behavior and biological immune mechanism, this paper puts forward the basic idea and implementation method of an embedding adaptive dynamic probabilistic parasitic immune mechanism into a particle swarm optimization algorithm and constructs particle swarm optimization based on an adaptive dynamic probabilistic parasitic immune mechanism algorithm. The specific idea is to use the elite learning mechanism for the parasitic group with a strong parasitic ability to improve the ability of the algorithm to jump out of the local extreme value, and the host will generate acquired immunity against the parasitic behavior of the parasitic group to enhance the diversity of the host population’s particles. Parasitic behavior occurs when the number of times reaches a predetermined algebra. In this paper, an example simulation is carried out for the prescheduling and dynamic scheduling of immune inspection. The effectiveness of prescheduling for immune inspection is verified, and the rules constructed by the adaptive dynamic probability particle swarm algorithm and seven commonly used scheduling rules are tested on two common dynamic events of emergency task insertion and subdistributed immune inspection equipment failure. In contrast, the experimental data was analyzed. From the analysis of experimental results, under the indicator of minimum completion time, the overall performance of the adaptive dynamic probability particle swarm optimization algorithm in 20 emergency task insertion instances and 20 subdistributed immune inspection equipment failure instances is better than that of seven scheduling rules. Therefore, in the two dynamic events of emergency task insertion and subdistributed immune inspection equipment failure, the adaptive dynamic probabilistic particle swarm algorithm proposed in this paper can construct effective scheduling rules for the rescheduling of the system when dynamic events occur and the constructed scheduling. The performance of the rules is better than that of the commonly used scheduling rules. Among the commonly used scheduling rules, the performance of the FIFO scheduling rules is also better. In general, the immune inspection scheduling multiagent system in this paper can complete the prescheduling of immune inspection and process dynamic events of the inspection process and realize the prereactive scheduling of the immune inspection process.

Highlights

  • The development of smart sensors in recent years has laid the foundation for the advancement of wireless sensor networks (WSN) [1]

  • The experimental results show that the performance of the adaptive dynamic probability particle swarm algorithm is better than that of the other seven rules, which proves the effectiveness and practicability of the scheduling rules constructed by the adaptive dynamic probability particle swarm algorithm proposed in this paper

  • Researchers realize the automatic reconfiguration of wireless sensor networks through software-defined networks and propose a green routing algorithm based on the adaptive particle swarm optimization algorithm to maximize network life [20]

Read more

Summary

Introduction

The development of smart sensors in recent years has laid the foundation for the advancement of wireless sensor networks (WSN) [1]. Due to the limitations of distributed immune inspection equipment, these nodes in the network present several challenges, namely, limited computing power, energy, data storage, and communication bandwidth [3, 4]. Traditional routing protocols will periodically update the routing table (proactively) or request routing in other ways when the network changes This process is energy-intensive and not suitable for WSN networks. Traditional wireless sensor networks deployed for specific tasks have the problems of insufficient utilization of network resources and imbalanced energy consumption of nodes. Traditional wireless sensor networks rely too much on proprietary services, lack the flexibility to implement instant changes, and cannot respond in time and take effective measures in the face of dynamic changes in the network topology [10]. The experimental results show that the performance of the adaptive dynamic probability particle swarm algorithm is better than that of the other seven rules, which proves the effectiveness and practicability of the scheduling rules constructed by the adaptive dynamic probability particle swarm algorithm proposed in this paper

Related Work
Analysis and discussion of simulation results
Simulation Experiment and Analysis
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call