Novel Algorithm for Identifying and Fusing Conflicting Data in Wireless Sensor Networks
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The idea of analyzing distance-based evidence conflicts, the concept of vector space is introduced, and a new cosine theorem-based method of identifying and expressing conflicting data is proposed, which achieves great improvements in both the accuracy and the efficiency of fusing conflicting data.
Abstract
There is continuously increasing interest in research on multi-sensor data fusion technology. Because Dempster's rule of combination can be problematic when dealing with conflicting data, there are numerous issues that make data fusion a challenging task, including the exponential explosion, Zadeh Paradox, and one-vote veto. These issues lead to a great difference between the fusion results and real results. This paper applies the idea of analyzing distance-based evidence conflicts, introduces the concept of vector space, and proposes a new cosine theorem-based method of identifying and expressing conflicting data. In addition, this paper proposes a new data fusion algorithm based on the degree of mutual support between beliefs, which is based on the Jousselme distance-based combination rule proposed by Deng et al. Simulation results demonstrate that the presented algorithm achieves great improvements in both the accuracy of identifying conflicting data and that of fusing conflicting data.
