Multi-Sensor Data Fusion Algorithm Based on Trust Degree and Improved Genetics

• Main Authors: Guiling Sun, Ziyang Zhang, Bowen Zheng, Yangyang Li
• Format: Article
• Language: English
• Published: MDPI AG 2019-05-01
• Series: Sensors
• Subjects: greenhouse; WSNs; data fusion; improved genetic algorithm; trust degree; cubic exponential smoothing
• Online Access: https://www.mdpi.com/1424-8220/19/9/2139

Aiming at the problems of low data fusion precision and poor stability in greenhouse wireless sensor networks (WSNs), a multi-sensor data fusion algorithm based on trust degree and improved genetics is proposed. The original data collected by the sensor nodes are sent to the gateway through the sink node, and data preprocessing based on cubic exponential smoothing is performed at the gateway to eliminate abnormal data and noise data. In fuzzy theory, the range of membership functions is determined, according to this feature, the data fusion algorithm based on exponential trust degree is used to fuse the smooth data to avoid the absolute degree of mutual trust between data. In this paper, we have improved the crossover and mutation operations in the standard genetic algorithm, the variation is separated from the intersection, the chaotic sequence is used to determine the intersection, and the weakest single-point intersection is implemented to improve the convergence accuracy of the algorithm, weaken and avoid jitter problems during optimization. The chaotic sequence is used to mutate multiple genes in the chromosome to avoid premature algorithm maturity. Finally, the improved genetic algorithm is used to optimize the fusion estimation value. The experimental results show that the cubic exponential smoothing can significantly reduce the data fluctuation and improve the stability of the system. Compared with the commonly used data fusion algorithms such as arithmetic average method and adaptive weighting method, the data fusion algorithm based on trust degree and improved genetics has higher fusion precision. At the same time, the execution time of the algorithm is greatly reduced.