Dynamic Analysis of Alternative Elements in an Automated Packaging System Based on 5G Internet of Things

Abstract

The arrival of 5G will usher in an era of “Internet of Everything.” Massive Internet of Things data contains great value in the dynamic analysis of alternative elements of automated packaging systems. From the perspective of the realization of personalized customization functions, this article solves the problem of dynamic analysis of alternative elements in the automated packaging system. We analyze the connection mechanism and interaction method between the cloud service system layer and the mobile terminal service layer, and carry out the corresponding software design. From the perspective of the realization of the intelligent production of the system in this paper, this topic mainly studies the information interaction mechanism and production control mechanism of the cloud service system and the manufacturing system. Based on the hardware of the manufacturing system layer, a flexible production implementation mechanism is formulated to make it the basis for the implementation of intelligent production of the system. Based on the massive data processing capabilities of the cloud service system, the information processing mechanism and the production planning decision-making mechanism are formulated for it, so as to realize the intelligent adjustment of the manufacturing system layer in the production process. For the connection scenario of IoT group paging, based on the application of NB-IoT technology in the next-generation mobile communication network, the focus of network optimization is to ensure the random access performance of IoT devices as much as possible. To this end, this paper proposes a random access optimization strategy for IoT group paging based on time slot scattering. We establish a mathematical model based on queuing theory for the connection scenario of the Io T group paging, then use the mathematical formula to derive the number of IoT devices scattered to each time slot in the initial state, thereby deriving the specific time slot scattering algorithm. This paper establishes a list of credit nodes, changes the participation mode of consensus nodes from static to dynamic, and supports voting to select trusted nodes. We designed a credit evaluation mechanism as a basis for consensus node elections to improve system’s fault tolerance rate. The algorithm process was simplified, and the PBFT algorithm process was simplified from a 3-phase protocol to a 2-phase protocol to further reduce communication bandwidth overhead and algorithm time. Simulation analysis shows that, compared with the PBFT algorithm, the proposed algorithm improves node flexibility and fault tolerance while reducing communication bandwidth overhead by about 45%, packaging throughput by about 4%, and latency by about 3%.