CN102143495A

CN102143495A - Method for detecting node attack in wireless sensor network

Info

Publication number: CN102143495A
Application number: CN2011100654806A
Authority: CN
Inventors: 叶灿才; 卢林发; 黄家祺
Original assignee: ZHONGSHAN AIKE DIGITAL TECHNOLOGY Co Ltd
Current assignee: Guangdong Zen science and Technology Co., Ltd.
Priority date: 2011-03-16
Filing date: 2011-03-16
Publication date: 2011-08-03
Anticipated expiration: 2031-03-16
Also published as: CN102143495B

Abstract

The invention provides a method for detecting node attack in a wireless sensor network, belonging to the application field of wireless sensor network and information security cross technology. The invention is characterized in that the method comprises the following steps: the wireless sensor network is divided into four allocation area steps; nodes and allocation areas are numbered to a corresponding mapping relation table, and the nodes are allocated to the corresponding area steps; a node broadcast ID (identity) and area numbers are fed back by the broadcasted node, the received broadcasted node is taken as a neighbouring node, and the ID and the area number for the neighbouring node are recorded in a neighbouring list step; the nodes check the area numbers of all neighbouring nodes in the neighbouring list to form a border area or border area numbers; the border area and four initialized allocation areas form new allocation areas; when the node area numbers change, the neighbouring broadcast ID and the new area are numbered, and the received broadcasted nodes modify the area numbers of the corresponding neighbouring nodes in the neighbouring list to form the wireless sensor network steps with new cells; addition of new nodes is the secondary detection step for replication nodes. The method has the advantages that any auxiliary equipment is not required, the energy consumption is low, the efficiency is high, and the method is easy to realize.

Description

The detection method that a kind of wireless sensing net node is attacked

Technical field

The present invention is a kind of wireless sensor network security protection scheme, belongs to wireless sensor network and information security interleaving techniques application.

Background technology

Wireless sensor network is a kind of emerging network of comprehensive multi-door technology, is widely used in every field such as military and civilian.Because sensor node makes it be vulnerable to various attack.After the node replication attacks is meant that the assailant captures sensor node, obtain important informations such as key and node ID, forge the massive duplication node, and it is spread to the attack type that carries out destructive activity in the network by these information.This attack is from network internal, and replica node has is captured all legal informations of node. and therefore, they are difficult to be found, and are stronger to the destructive power of network.

The detection method of node replication attacks can be divided into three major types: center detection, local detection and broadcasting detect.It is that all nodes regularly upload to Centroid with neighbor list that the center is detected, and Centroid is found out replica node. this method power consumption is big, and especially will to become the focus energy consumption very fast for the node around the Centroid, and in a single day Centroid is captured method and was lost efficacy immediately.Local detection is that replica node is found out in ballot between the neighbor node, and shortcoming is can't find out distance replica node far away and be subject to blacklist to attack.It is node inundation broadcasting authorization information that broadcasting detects, and receives the nodes records authorization information of information, and this method consumes energy big and needs very big memory space.

Summary of the invention

The objective of the invention is to overcome the shortcoming of prior art, the knot detection method that a kind of wireless sensing net node is attacked is provided, it adopts the network design subregion means and the method for new cautious detection means innovation combination to realize effective detection of replica node.

Below the present invention program is described further:

The detection method that a kind of wireless sensing net node is attacked is characterized in that:

Comprise step,

1) wireless sensor network is divided into four deployment region steps;

2) be the relation table of hinting obliquely at of node and deployment region numbering and formation correspondence, node is deployed to corresponding regional step;

3) node broadcasts ID and zone number receive the feedback of the node be broadcasted, and can receive this broadcasting as neighbor node, and the ID and the zone number of neighbor node be recorded in the neighbor list step;

4) node is checked the zone number of all neighbor nodes of neighbor list, forms borderline region and borderline region numbering; Borderline region and four initialized deployment region form new deployment region and divide;

When 5) node region numbering changes, its neighbours are broadcasted ID and new zone number, the node of receiving that is broadcasted is revised the zone number formation of corresponding neighbors and is had the wireless sensor network step of new subregion in the middle of its neighbor list;

6) new node adds, and this new node is broadcasted its ID and zone number; Neighbor node is received this broadcast message and is judged whether to equal the one's respective area numbering, if then find replica node, otherwise scans its neighbor list, judges whether to exist the neighbours ID that equates with this new node, if then find replica node.

Further optimize, when new node adds, also have step

7) new node selects the neighbouring region of a non-NULL to send authorization information at random, and specifies one of them joint of this neighbouring region to transmit authorization information; Receive of the ID contrast of the node of authorization information, if the ID for equating judges that then this new node is the secondary detection step of replica node by scanning neighbor list and interim tabulation.

Description of drawings

Fig. 1 is the initial deployment area schematic;

Fig. 2 is the new schematic diagram of the deployment region of borderline region;

Fig. 3 is the figure of testing process first of new node;

Fig. 4 is the secondary detection flow chart of new node.

Embodiment

Embodiment one

Referring to figs. 1 to 2, wireless sensor network is divided into four deployment region (being called main region again),

i.e. zone

1,2,3 and 4; Then successively:

Be the relation table of hinting obliquely at of node and deployment region numbering and formation correspondence, node is deployed to corresponding zone;

Node broadcasts ID and zone number receive the feedback of the node be broadcasted, and can receive this broadcasting as neighbor node, and the ID and the zone number of neighbor node be recorded in neighbor list;

Node is checked the zone number of all neighbor nodes of neighbor list, forms borderline region and borderline region numbering (as Fig. 2, borderline region is respectively zone 5,6,7,8 and 9); Borderline region and four initialized deployment region form new deployment region;

When node region numbering changes, its neighbours are broadcasted ID and new zone number, the node of receiving that is broadcasted is revised the wireless sensor network that the zone number formation of corresponding neighbors has new subregion in the middle of its neighbor list.

Wherein, will be example with node A below, the rule of modifier area numbering is described:

Variable num _xZone number is neighbours' quantity of x in the expression neighbor list, and corresponding code is as follows:

Here threshold value NUM is in order to prevent that node was captured and the division of destroyed area before area dividing.Therefore, the NUM value generally gets 2. if in the neighbor list of node A num is arranged _x＜NUM, then A selects 3 neighborss at random, sends this node ID; If neighbor node returns same information, judge that then this ID is a

replica node.Zone

2,3 and 4 interior nodes situations roughly the same, the node division in the final deployment region is as shown in Figure 2.

Initiate node has three kinds of possible positions: away from the intersection of the intersection of the main region inside of borderline region, corresponding main region and borderline region, non-corresponding main region and borderline region, at first set up coordinate at these three kinds of situations.

First kind: node region numbering is constant, and the horizontal ordinate of each neighbor node relatively gets wherein that minimum value adds 1, as its coordinate.

Second kind: the ratio that borderline region node and main region node respectively account in elder generation's calculating neighbors, which ratio is greater than 50%, and its zone number just is defined as the numbering in which zone.If the node ratio in zone 9 surpasses 25% in the neighbors, then the zone number of newly added node is that 9. regional 9 interior nodes coordinates are (0,0), other borderline region interior nodes are defined as 0 according to zone number with one of them, and other situation lower node coordinates are with first kind of situation.

The third: node failure.

As shown in Figure 3, new node adds fashionable, and this new node is broadcasted its ID and zone number; Neighbor node is received this broadcast message and is judged whether to equal the one's respective area numbering, if then find replica node, otherwise then scans its neighbor list, judges whether to exist the neighbours ID that equates with this new node, if then find replica node.

As shown in Figure 4, after finishing testing process shown in Figure 3, new node selects the neighbouring region of a non-NULL to send authorization information at random, and specifies one of them joint of this neighbouring region to transmit authorization information; Receive of the ID contrast of the node of authorization information by scanning neighbor list and interim tabulation, if be the ID that equates, judge that then this new node is a replica node, otherwise the node of receiving authorization information selects at random the neighbouring region of a non-NULL to send authorization information to finish secondary detection.

In sum, method contrast prior art of the present invention, it is finished by normal sensor node fully not by any auxiliary equipment, realizes that transmitting-receiving bag number significantly reduces in the attack detecting process, and can directly find out remote replica node; To replica node at the same area, because close together, so need not to launch a large amount of checking lines, thus energy saved, in contrast to conventional method consumed energy is significantly reduced.

Claims

1. the wireless sensing net node detection method of attacking is characterized in that:

Comprise step,

1) wireless sensor network is divided into four deployment region steps;

2. detection method as claimed in claim 1 is characterized in that, also has step