Queue models for wireless sensor networks based on random early detection

Wireless sensor networks (WSNs) are widely used in many fields of industry, agriculture, national defense, and technology. Their performance has a profound impact on their application. The storage and forwarding of WSN network packets is a typical queuing system. Based on queuing theory, this paper studies the performance analysis models of the WSN node, constructs a WSN node queuing model based on M/M/1, a WSN node queuing model with priority, a WSN node M/M/1 queuing model based on random early detection (RED) and a WSN node M/M/1 queuing model with priority based on RED. The models are analyzed theoretically and the expressions of the average delay and queue length are mathematically derived. The experimental results are consistent with the theoretical analysis. Differentiating the packets into different priorities can improve the quality of service of the network. Introducing the RED congestion control and packet discarding policy can effectively solve the congestion problem.