A Density Routing Algorithm in Wireless Sensor Networks for Dangerous Chemicals Monitoring

Wireless sensor networks have been widely used in large petrochemical production parks, especially in the safety monitoring of dangerous chemicals. Due to the on-site environment factors, the performance of the wireless sensor monitoring networks is usually attenuated. First, the performance evaluation parameters for WSNs density routing were identified, and the relationships between node energy, hop count and routing were described. Meanwhile, aimed at solving the routing problem of wireless sensor networks (WSNs), a density routing algorithm is established based on dynamic reservation and optimized based on anti-collision principles. Finally, key factors in the DRADR algorithm are intensively investigated by simulations. The experimental results indicate DRADR algorithm have great advantages over conventional algorithms in data transmission rate, node life cycle, residual energy and other metrics. Therefore, the DRADR scheme can be applied in large petrochemical park to improve the quality of dangerous chemicals monitoring. The issue of the existing routing methods in dangerous chemical monitoring is that data transmission rate is low. The DRADR algorithm shows advantages in data transmission rate over the DBR algorithm and the Epidemic algorithm. The energy consumption in the DRADR algorithm can be reduced below that in the DBR algorithm by adjusting the node distribution. The DRADR algorithm shows great advantages in extension of network life and reduction of energy consumption. The DRADR algorithm and the DBR algorithm can effectively reduce resource waste while maintaining constant increasing rate of transmission rates. However, transmissions in the DBR algorithm rely on relay nodes. The DRADR algorithm is superior to the DBR algorithm in data transmission rate. The opportunistic network routing algorithm (Epidemic) is that the number of nodes increases more; the flooding strategy of Epidemic will cause serious network congestion, resulting in a decrease in the transmission success rate. Compared to the DBR algorithm, the DRADR algorithm is characterized by data forwarding strategy with dynamic selection and data transcriptions can be transmitted to nodes with higher activity to enhance the data transmission rate. The energy consumption in the DRADR algorithm can be reduced below that in the DBR algorithm by adjusting the node distribution. The network residual energy in the DRADR algorithm is higher than that in the DBR algorithm, as well as the network life cycle.