An Effective Malicious Node Detection Scheme for Adaptive Data Fusion under Time-Varying Byzantine Attack

This paper provides details about practical idea for identification of Byzantine modernalization in communication area by involving distributed sequential network coding. The implementation complexity is minimum and the possibility of exact simulation is maximum also in the presence of huge fault nodes. Simulation results show clearly identify the faulty sensors nodes with high accuracy. In this by introducing the similarly sequential relationship in between the concept contents and the network size, we proposed a simple q-out-of-m concept which can effectively minimize the conceptual complexity, and at the instant time providing better result. We indicate that for a known package of effective sensors nodes, the identification result of the simple q-out-of-m concept enhances almost equally as the network size enhances.

We propose a simplified but efficient model to identify the effected sensors nodes before concluding the result. The result of the verified concept is evaluated under both static and dynamic attacking concepts. It is considered that with the pre-detection method, the result of the q-out- of-m concept can be enhanced significantly involved many attacked concepts. Simulation results are produce to demonstrate the effectiveness of the existing method.