Multi-dimensional en-route filtering method of wireless sensor network

Abstract

The invention relates to a multi-dimensional en-route filtering method of a wireless sensor network. A network key database is divided into a plurality of clusters, and each node can be joined in a group in each cluster. The rejection service attack and the false report attack in the wireless sensor network can be effectively dealt with, the problem of the traditional en-route filtering method that the coverage performance and the filtering performance cannot be simultaneously improved can be solved, and at the same time higher trapping resistance can be still maintained.

Description

technical field [0001] The invention relates to a filtering method in a wireless sensor network, in particular to a multi-dimensional en route filtering method of a wireless sensor network. Background technique [0002] Wireless sensor network is an emerging interdisciplinary technology that is expected to integrate the three core industrial technologies of wireless network, modern sensor and embedded system. It can be widely used in various military and civilian fields such as real-time autonomous monitoring and target remote tracking. Some of its application scenarios are dangerous to people (such as the chemical industry), and some are hostile (such as the battlefield between the two warring parties). Therefore, security is a critical and essential feature for autonomously operating wireless sensor networks. [0003] Since wireless sensor networks generally have the characteristics of remote deployment and autonomous operation, sensor nodes are easily captured by attack...

AI Technical Summary

Problems solved by technology

Among them, SEF is the earliest proposed filtering scheme on the way. In this scheme, each node randomly selects a small part of key storage in the key store, and each node uses its own key to encrypt and filter data packets, but the SEF scheme is anti-capture. Poor performance, the attacker captures about 2T nodes, and can forge events that occur in any area of ​​the network with a very high probability

In order to solve the problem of poor capture resistance of SEF, LBRS proposes a key distribution scheme based on geographical location information, that is, if an attacker captures a certain number of nodes, he can only forge the events that occurred in the corresponding areas of these nodes. At the same time, in order to improve The coverage performance of the scheme, LBRS divides the network keystore into L groups, where L is much larger than T, but because the nodes on the way may store a large number of keys for invalid groups, the filtering efficiency is reduced, although LBRS alleviates this problem through the beam model Problem, but the beam model requires that the sink node cannot be moved, and the system must adopt a specific routing mechanism based on geographic location information, resulting in insufficient versatility of the solution

The GBSEF solution only divides the network keystore into T groups, which can significantly improve the filtering efficiency without relying on static aggregation nodes and specific routing mechanisms. However, because the network keystore is only divided into T groups, it can be known by calculation , the probability that an event occurring in the network area will be detected by exactly T nodes from the T group will decrease, therefore, the coverage performance of this scheme is low

Through theoretical analysis and experimental verification, it can be concluded that the one-dimensional mid-way filtration scheme cannot guarantee the anti-capture property, or cannot improve the coverage performance and filtration efficiency at the same time under the premise of ensuring the anti-capture property

Images