Multistage Dynamic Packet Access Mechanism of Internet of Things

In the scenario of mass control commands requesting for network access, confined by the best-effort network service mode, it is easy to bring about resource competition and thus a phenomenon of access failure on major and urgent service request at the data access center for the Internet of Things. In this event, the dynamic diversification of control command is unable to access the necessary resources on a comparatively fair basis, causing low efficiency in heterogeneous resource utilization at the access center. This paper defines the problem of group request dynamic resource allocation and further converts it into the problem of 0-1 integer and linear programming and proposes a multistage dynamic packet access strategy. This strategy works first on dynamic group division on the users’ mass control requests using the high ability of self-organizing feature maps and then searches for the optimized matching resources based on the frog-leaping algorithm which has a better capacity for global searching for the best resources. This paper analyzes the feasibility of this strategy and its astringency. The experimental results demonstrate that the strategy can effectively improve the success rate of access to the data center for the Internet of Things and reduce network blockage and response delay