Abstract: Aiming at the problem of limited energy of wireless sensor network nodes, a parallel scheduling limited (K=1) polling control system for distinguishing queue busy state is proposed. The system only sends the dynamic busy queue with information data packets according to the different busy state of the queue. The Markov chain and probabilistic parent function are used to establish the mathematical model of the system. The system parameters such as query period, throughput, average length and average delay are analyzed. The simulation results are approximately equal to the theoretical calculation results, indicating that the theoretical analysis method is correct and effective. The system uses the limited service policy to ensure the fairness of the system, and the busy and idle state of the queue avoids the query of the idle queue without the data information grouping, so the average delay of the system can be greatly reduced, and the polling control efficiency of the system is improved. Compared with the existing limited (K=1) service strategy, the average length and average delay of the system are significantly reduced under the same parameter setting.