CN102223627A - Beacon node reputation-based wireless sensor network safety locating method - Google Patents

Beacon node reputation-based wireless sensor network safety locating method Download PDF

Info

Publication number
CN102223627A
CN102223627A CN2011101631820A CN201110163182A CN102223627A CN 102223627 A CN102223627 A CN 102223627A CN 2011101631820 A CN2011101631820 A CN 2011101631820A CN 201110163182 A CN201110163182 A CN 201110163182A CN 102223627 A CN102223627 A CN 102223627A
Authority
CN
China
Prior art keywords
beaconing nodes
node
identity
nodes
expression
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2011101631820A
Other languages
Chinese (zh)
Other versions
CN102223627B (en
Inventor
何泾沙
张婷
张旸
李晓会
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Technology
Original Assignee
Beijing University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology filed Critical Beijing University of Technology
Priority to CN201110163182.0A priority Critical patent/CN102223627B/en
Publication of CN102223627A publication Critical patent/CN102223627A/en
Application granted granted Critical
Publication of CN102223627B publication Critical patent/CN102223627B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to a beacon node reputation-based wireless sensor network safety locating method belonging to the technical field of computer network safety. Aiming at the problem of the reliability judgment of information provided by a beacon node in the locating method, a locating method for reputation evaluation of a beacon node is provided, the estimation can be carried out from two aspects of identity and behavior of the beacon node respectively, a trustworthy beacon node is screened out, and the location is carried out by utilizing the reliable information provided by the beacon node. The method comprises the following steps: the beacon node transmits self position information to peripheral nodes; adjacent beacon nodes carry out the reputation evaluation to the beacon node transmitting the information; the reputation evaluation of the beacon nodes, given by the adjacent beacon nodes, are synthesized, and the beacon nodes are ranked from top to bottom according to reputation values; and an unknown node selects the position information provided by the beacon nodes with the reputation value higher than a threshold value to carry out self-position estimation. In the invention, the reputation value of the beacon node can be effectively evaluated, so as to screen out more reliable position information for the location of the unknown node and improve the reliability of a location result.

Description

A kind of wireless sensor network security localization method based on beaconing nodes prestige
Technical field
The present invention relates to a kind of wireless sensor network security localization method based on beaconing nodes prestige, specifically be a kind ofly to estimate by prestige to beaconing nodes, filter out credible beaconing nodes, the securing position information that they are provided is used for the location of unknown node, can improve the fail safe of locating in the wireless sensor network, belong to filed of network information security.
Background technology
Wireless sensor network is widely used in fields such as military and national defense, environmental monitoring, rescue and relief work, in these applications, the positional information of sensor node is very important, need together return with other information that node collects, therefore, the self poisoning of node just becomes one of the basic functions of sensor network and service, also is simultaneously the numerous central key technologies that study a question at wireless sensor network.Yet because the wireless senser locating information is by radio propagation, and node exists open deployment, characteristics such as resource-constrained, causes position fixing process very easily to be attacked, and traditional safe practice is difficult to effectively solve these safety problems.
In the wireless sensor network node location, node with the known self-position of positioning function is called beaconing nodes, they can provide positional information to finish positioning action with reference to information with the node that helps to need to locate as the location to other nodes, and ordinary node to be positioned in the network is called unknown node.
In position fixing process, the node that needs the location is by with the position relation of node and the positional information of node issue around these are estimated the position of self on every side.Therefore, the fail safe of the positional information that these receive directly has influence on the reliability of positioning result, and the attack type that the wireless sensor network location mainly faces comprises external attack and internals attack.The assailant of external attack does not need to obtain the trust of network node, and they directly adopt any special measures locating information is disturbed or to be distorted; The assailant of internaling attack may have legal identity, but beaconing nodes still may provide dummy location information to unknown node after being captured.Because the reliability of the credit value of beaconing nodes and the positional information that they provide is difficult to judge, therefore internals attack for the wireless sensor node location and have more disguise and destructiveness.
Summary of the invention
The object of the present invention is to provide a kind of wireless sensor network security localization method based on beaconing nodes prestige.Use internaling attack that this method can effectively prevent to face in the wireless sensor network location, thereby reduce the position error of wireless sensor node under unsafe conditions.For achieving the above object, the present invention has comprised beaconing nodes prestige evaluation mechanism in position fixing process.
In position fixing process, for resisting internaling attack in the location, the positional information that need to guarantee to be used for location Calculation is that the beaconing nodes that sends these information is credible reliably, and the present invention introduces a kind of mechanism that the prestige of beaconing nodes that positional information is provided is assessed.In this mechanism, the positional information that the identity and the beaconing nodes of beaconing nodes sends is assessed respectively.In the process that the beaconing nodes identity is assessed, utilize the one-way of hash function to help beaconing nodes to authenticate mutually, simultaneously the positional information that sends is protected.In the process that behavior is assessed to beaconing nodes, beaconing nodes is estimated its neighbours' beaconing nodes, and also comprehensive simultaneously other neighbours' beaconing nodes make evaluation result more reliable to its evaluation.But this mechanism effective evaluation goes out the credit value of beaconing nodes, and carrying out position calculation for unknown node provides reliable information, thus reduce effectively that captive beaconing nodes initiates internal attack influence to positioning result.
Wireless sensor network security localization method based on beaconing nodes prestige evaluation mechanism has four-stage, is respectively: 1. beaconing nodes towards periphery node send self positional information; 2. neighbours' beaconing nodes carries out the prestige assessment to the beaconing nodes that sends information; 3. the credit rating that provides of each neighbours' beaconing nodes of the comprehensive beaconing nodes of unknown node; 4. unknown node is estimated self-position.
The concrete steps of this four-stage are described below:
Stage 1: the netinit stage is that each legal beaconing nodes distributes a shared key k, and beaconing nodes i is with message { ID i|| (x i, y i) || H (ID i|| (x i, y i) || H (ID i)) kBroadcasting is gone out, ID iID number of expression beaconing nodes i, (x i, y i) two-dimensional coordinate of expression beaconing nodes i, H () expression is carried out Hash operation, { } with the information in the bracket kExpression is encrypted the information in the bracket with key k.
Stage 2: neighbours' beaconing nodes is verified the identity of i, with they the information { ID of cipher key shared k to receiving after receiving the message that beaconing nodes i sends i|| (x i, y i) || H (ID i|| (x i, y i) || H (ID i)) kBe decrypted the ID that deciphering is obtained i, (x i, y i) and known H (ID i) carry out Hash operation, obtain H ' (ID i|| (x i, y i) || H (ID i)), with the H (ID that obtains of deciphering from receive information i|| (x i, y i) || H (ID i)) compare, if identical, the identity that this beaconing nodes is described is legal, then these neighbours are 1 to the identity assessed value of i, otherwise these neighbours are 0 to the identity assessed value of i, neighbours' beaconing nodes j uses the identity assessed value of beaconing nodes i Expression.
After beaconing nodes i is assessed as the legal node of identity, promptly
Figure BDA0000068983780000032
The time, the distance, delta d between the actual position of its neighbours' beaconing nodes j calculating i and the position that i oneself claims Ji, draw behavior assessed value to beaconing nodes i T s ji = ( R - Δ d ji ) / R Δ d ji ≤ R 0 Δ d ji > R And send,
Figure BDA0000068983780000034
Neighbours' beaconing nodes j self of expression beaconing nodes i is to the behavior assessed value of i, Δ d JiDistance between the actual position of the i that expression j calculates and the position that i oneself claims, R represents the communication radius of beaconing nodes.
Comprehensive other beaconing nodes of beaconing nodes j draw the behavior assessed value to the behavior evaluation of i T B ji = α · T s ji + ( 1 - α ) Σ o = 1 n T s oi n ,
Figure BDA0000068983780000036
Represent the behavior assessed value of j to i,
Figure BDA0000068983780000037
Other beaconing nodes that expression j can receive are to the behavior assessed value of i, and α is the weight that j self estimates in assessed value, 0.5＜α＜1, and n represents that j can receive the beaconing nodes number about the evaluation of i.
The assessment result of comprehensive identity of the neighbor node of i and behavior two aspects draws the credit value for i T ji = T I ji · T B ji = T I ji ( α · T s ji + ( 1 - α ) Σ o = 1 n T s oi n ) , T JiThe credit value that expression j estimates i,
Figure BDA0000068983780000039
Expression j is to the identity assessed value of i, and the identity assessed value equals 0 or 1, because i has passed through the identity assessment of j, therefore
Figure BDA00000689837800000310
Expression j is to the behavior assessed value of i.
Stage 3: unknown node u is according to formula The beaconing nodes that calculating u can receive is to the credit value evaluation of i, T ZiExpression beaconing nodes z is to the credit value evaluation of i, and what m represented that u can receive sends the number of the beaconing nodes of evaluation to i.
Unknown node u arranges beaconing nodes on every side from high to low according to the size of credit value.
Stage 4: unknown node utilizes the maximum likelihood estimation technique to calculate the coordinate of self, and unknown node need obtain the distance between the position of beaconing nodes and self and these beaconing nodes in calculating, and unknown node is chosen credit value greater than threshold value T tBeaconing nodes, adopt the positional information that they provide, and utilize based on signal strength signal intensity, arrive angle, the time of advent or the time of advent difference one of distance-finding method obtain and these beaconing nodes between distance, 0＜T wherein t＜1, T tValue high relatively more, the reliability of the beaconing nodes that obtains is also big more.
With existing node security localization method contrast, the present invention has following feature:
(1) the present invention is not the safe positioning method that proposes at a certain attack form, but consider from the reliability of beaconing nodes that locating information is provided, from identity and two aspects of behavior the prestige of beaconing nodes is estimated, thereby filtered out reliable beaconing nodes and the positional information that provides is used for the location.
(2) the present invention is applicable to multiple localization method.
(3) the present invention does not have specific (special) requirements for the hardware of sensor node.
Description of drawings
Fig. 1 is a flow chart of the present invention
Fig. 2 is for lacking the unknown node position error simulation result figure relatively of beaconing nodes prestige evaluation mechanism in the present invention and the location
Embodiment
In conjunction with above-mentioned explanation and accompanying drawing, describe embodiments of the present invention below in detail.Enforcement of the present invention is supposed based on following precondition and network:
A. each node all has and distinguishes identity unique ID number in the network; B. the legal beaconing nodes of each identity all has the shared key k of the overall situation; C. the cryptographic Hash H (ID) of each beaconing nodes ID correspondence is disclosed to the legal beaconing nodes in the network.
Beaconing nodes towards periphery node send the implementation in the positional information stage of self
The netinit stage is disposed 20 sensor nodes unknown node and 15 beaconing nodes as the needs location at random in the rectangular area of 650m*600m, for each legal beaconing nodes distributes a shared key k, the communication radius of beaconing nodes and unknown node is made as 200m, and the concrete steps in this stage are described below:
Beaconing nodes i is with message { ID i|| (x i, y i) || H (ID i|| (x i, y i) || H (ID i)) kBroadcasting is gone out, ID iID number of expression beaconing nodes i, (x i, y i) two-dimensional coordinate of expression beaconing nodes i, H () expression is carried out Hash operation, { } with the information in the bracket kExpression is encrypted the information in the bracket with key k.
2. neighbours' beaconing nodes carries out the prestige implementation of evaluation stage to the beaconing nodes that sends information
This stage is assessed from identity and two aspects of behavior for the prestige of beaconing nodes, and concrete steps are described below:
(1) after neighbours' beaconing nodes is received the message that beaconing nodes i sends, the identity of i is verified, with they the information { ID of cipher key shared k to receiving i|| (x i, y i) || H (ID i|| (x i, y i) || H (ID i)) kBe decrypted the ID that deciphering is obtained i, (x i, y i) and known H (ID i) carry out Hash operation, obtain H ' (ID i|| (x i, y i) || H (ID i)), with the H (ID that obtains of deciphering from receive information i|| (x i, y i) || H (ID i)) compare, if identical, the identity that this beaconing nodes is described is legal, then these neighbours are 1 to the identity assessed value of i, otherwise these neighbours are 0 to the identity assessed value of i, neighbours' beaconing nodes j uses the identity assessed value of beaconing nodes i Expression.
(2) after beaconing nodes i is assessed as the legal node of identity, promptly
Figure BDA0000068983780000052
The time, the distance, delta d between the actual position of its neighbours' beaconing nodes j calculating i and the position that i oneself claims Ji, draw behavior assessed value to beaconing nodes i T s ji = ( R - Δ d ji ) / R Δ d ji ≤ R 0 Δ d ji > R And send,
Figure BDA0000068983780000054
Neighbours' beaconing nodes j self of expression beaconing nodes i is to the behavior assessed value of i, Δ d JiDistance between the actual position of the i that expression j calculates and the position that i oneself claims, R represents the communication radius of beaconing nodes.J will draw and need consider that to the behavior assessed value of i self is to the evaluation to i of the evaluation of i and other beaconing nodes.
(3) comprehensive other beaconing nodes of beaconing nodes j draw the behavior assessed value to the behavior evaluation of i T B ji = α · T s ji + ( 1 - α ) Σ o = 1 n T s oi n ,
Figure BDA0000068983780000056
Represent the behavior assessed value of j to i,
Figure BDA0000068983780000057
Other beaconing nodes that expression j can receive are to the behavior assessed value of i, and α is the weight that j self estimates in assessed value, and α=0.8 is established in 0.5＜α＜1.
(4) assessment result of comprehensive identity of the neighbor node of i and behavior two aspects draws the credit value for i T ji = T I ji · T B ji = T I ji ( α · T s ji + ( 1 - α ) Σ o = 1 n T s oi n ) , T JiThe credit value that expression j estimates i,
Figure BDA0000068983780000062
Expression j is to the identity assessed value of i, and the identity assessed value equals 0 or 1, because i has passed through the identity assessment of j, therefore
Figure BDA0000068983780000064
Expression j is to the behavior assessed value of i.
3. the implementation in credit rating stage of providing of each neighbor node of the comprehensive beaconing nodes of unknown node
The concrete steps in this stage are described below:
(1) unknown node u is according to formula
Figure BDA0000068983780000065
The beaconing nodes that calculating u can receive is to the credit value evaluation of i, T ZiExpression beaconing nodes z is to the credit value evaluation of i, and what m represented that u can receive sends the number of the beaconing nodes of evaluation to i.
(2) unknown node u arranges beaconing nodes on every side from high to low according to the size of credit value.
4. unknown node is estimated the implementation in self-position stage
Unknown node utilizes the maximum likelihood estimation technique to calculate the coordinate of self, and unknown node need obtain the distance between the position of beaconing nodes and self and these beaconing nodes in calculating, and unknown node is chosen credit value greater than threshold value T tBeaconing nodes, adopt the positional information that they provide, and utilize based on signal strength signal intensity, arrive angle, the time of advent or the time of advent difference one of distance-finding method obtain and these beaconing nodes between distance.The credible threshold value of beaconing nodes credit value is made as T t=0.75, the final credit value that is about to obtain is considered as believable greater than 0.75 beaconing nodes, and the positional information that they are provided is applied in the position estimation of unknown node.
In order to verify that the present invention is used for the effect of wireless sensor node location under beaconing nodes is captured situation, need to calculate the position error of unknown node.The computational methods of position error such as formula (x wherein u, y u) expression unknown node u according to around the elements of a fix that estimate of the positional information that provides of beaconing nodes, (x ' u, y ' u) true coordinate of expression unknown node u, the communication radius of R ' expression unknown node.Can obtain the position error (as Fig. 2) of 20 unknown node according to the position error formula, by the invention enables the position error in most of unknown node position estimation to reduce among Fig. 2 as can be seen than having had significantly under the situation about beaconing nodes not being assessed.
In concrete exemplifying embodiment, safe position fixing process is by four-stage, effectively reduces positional information that insecure beaconing nodes provides to location influence.By The simulation experiment result as can be seen, because the present invention has added the prestige evaluation mechanism of beaconing nodes in position fixing process, make unknown node when the estimation self-position, can filter out credible positional information, the present invention can effectively reduce the average position error of wireless sensor network node under the captive situation of inner marker node, and the present invention has favorable applicability in wireless sensor network.

Claims (1)

1. wireless sensor network security localization method based on beaconing nodes prestige, the credit value by the assessment beaconing nodes filters out credible positional information, thereby improves the reliability of navigation system, it is characterized in that carrying out under following precondition:
A. each node all has and distinguishes identity unique ID number in the network;
B. the legal beaconing nodes of each identity all has the shared key k of the overall situation;
C. the cryptographic Hash H (ID) of each beaconing nodes ID correspondence is disclosed to the legal beaconing nodes in the network;
The step based on the safe positioning method of beaconing nodes prestige among the present invention is as follows:
Step 1: the positional information of beaconing nodes node transmission towards periphery self;
The netinit stage is that each legal beaconing nodes distributes a shared key k, and the concrete steps in this stage are described below:
Beaconing nodes i is with message { ID i|| (x i, y i) || H (ID i|| (x i, y i) || H (ID i)) kBroadcasting is gone out, ID iID number of expression beaconing nodes i, (x i, y i) two-dimensional coordinate of expression beaconing nodes i, H () expression is carried out Hash operation, { } with the information in the bracket kExpression is encrypted the information in the bracket with key k;
Step 2: neighbours' beaconing nodes carries out the prestige assessment to the beaconing nodes that sends information;
The concrete steps in this stage are described below:
Step 2.1: neighbours' beaconing nodes is verified the identity of i, with they the information { ID of cipher key shared k to receiving after receiving the message that beaconing nodes i sends i|| (x i, y i) || H (ID i|| (x i, y i) || H (ID i)) kBe decrypted the ID that deciphering is obtained i, (x i, y i) and known H (ID i) carry out Hash operation, obtain H ' (ID i|| (x i, y i) || H (ID i)), with the H (ID that obtains of deciphering from receive information i|| (x i, y i) || H (ID i)) compare, if identical, the identity that this beaconing nodes is described is legal, then these neighbours are 1 to the identity assessed value of i, otherwise these neighbours are 0 to the identity assessed value of i, neighbours' beaconing nodes j uses the identity assessed value of beaconing nodes i
Figure FDA0000068983770000011
Expression;
Step 2.2: when beaconing nodes i is evaluated as the legal node of identity by j after, promptly
Figure FDA0000068983770000012
The time, the distance, delta d between the actual position of its neighbours' beaconing nodes j calculating i and the position that i oneself claims Ji, draw behavior assessed value to beaconing nodes i T s ji = ( R - Δ d ji ) / R Δ d ji ≤ R 0 Δ d ji > R And send, Neighbours' beaconing nodes j self of expression beaconing nodes i is to the behavior assessed value of i, Δ d JiDistance between the actual position of the i that expression j calculates and the position that i oneself claims, R represents the communication radius of beaconing nodes;
Step 2.3: comprehensive other beaconing nodes of beaconing nodes j draw the behavior assessed value to the behavior evaluation of i T B ji = α · T s ji + ( 1 - α ) Σ o = 1 n T s oi n , Represent the behavior assessed value of j to i, Other beaconing nodes that expression j can receive are to the behavior assessed value of i, and α is the weight that j self estimates in assessed value, 0.5＜α＜1, and n represents that j can receive the beaconing nodes number about the evaluation of i;
The assessment result of comprehensive identity of the neighbor node of step 2.4:i and behavior two aspects draws the credit value for i T ji = T I ji · T B ji = T I ji ( α · T s ji + ( 1 - α ) Σ o = 1 n T s oi n ) , T JiThe credit value that expression j estimates i, Expression j is to the identity assessed value of i, and the identity assessed value equals 0 or 1, because i has passed through the identity assessment of j, therefore
Step 3: the credit rating that each neighbor node of the comprehensive beaconing nodes of unknown node provides; The concrete steps in this stage are described below:
Step 3.1: unknown node u is according to formula The beaconing nodes that calculating u can receive is to the credit value evaluation of i, T ZiExpression beaconing nodes z is to the credit value evaluation of i, and what m represented that u can receive sends the number of the beaconing nodes of evaluation to i;
Step 3.2: unknown node u arranges beaconing nodes on every side from high to low according to the size of credit value;
Step 4: unknown node utilizes the maximum likelihood estimation technique to calculate the coordinate of self, and unknown node need obtain the distance between the position of beaconing nodes and self and these beaconing nodes in calculating, and unknown node is chosen credit value greater than threshold value T tBeaconing nodes, adopt the positional information that they provide, and utilize based on signal strength signal intensity, arrive angle, the time of advent or the time of advent difference one of distance-finding method obtain and these beaconing nodes between distance, 0＜T wherein t＜1.
CN201110163182.0A 2011-06-17 2011-06-17 Beacon node reputation-based wireless sensor network safety locating method Expired - Fee Related CN102223627B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110163182.0A CN102223627B (en) 2011-06-17 2011-06-17 Beacon node reputation-based wireless sensor network safety locating method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110163182.0A CN102223627B (en) 2011-06-17 2011-06-17 Beacon node reputation-based wireless sensor network safety locating method

Publications (2)

Publication Number Publication Date
CN102223627A true CN102223627A (en) 2011-10-19
CN102223627B CN102223627B (en) 2013-10-23

Family

ID=44780026

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110163182.0A Expired - Fee Related CN102223627B (en) 2011-06-17 2011-06-17 Beacon node reputation-based wireless sensor network safety locating method

Country Status (1)

Country Link
CN (1) CN102223627B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102378217A (en) * 2011-11-01 2012-03-14 北京工业大学 Beacon node credit assessment method in localization in wireless sensor networks
CN102573055A (en) * 2011-12-02 2012-07-11 上海电机学院 Method for locating nodes in wireless sensor network
CN103812696A (en) * 2014-01-28 2014-05-21 河南科技大学 Shuffled frog leaping algorithm based internet of things node reputation evaluation method
CN104202295A (en) * 2014-07-25 2014-12-10 苏州寻息电子科技有限公司 Beacon node based safeguard system and implementation method thereof
CN105873065A (en) * 2016-03-28 2016-08-17 南京邮电大学 Safe positioning method of wireless sensor network based on trust level evaluation
CN109639582A (en) * 2018-12-07 2019-04-16 大科数据(深圳)有限公司 A kind of network node treatment method and device based on distributed hashtable

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159748A (en) * 2007-11-14 2008-04-09 北京科技大学 Entity authentication method in wireless sensor network
CN101801011A (en) * 2010-01-27 2010-08-11 哈尔滨工程大学 WSN (Wireless Sensor Network) safety routing method based on credit evaluating mechanism
CN102006663A (en) * 2010-12-03 2011-04-06 北京工业大学 Safe positioning method in wireless sensor network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101159748A (en) * 2007-11-14 2008-04-09 北京科技大学 Entity authentication method in wireless sensor network
CN101801011A (en) * 2010-01-27 2010-08-11 哈尔滨工程大学 WSN (Wireless Sensor Network) safety routing method based on credit evaluating mechanism
CN102006663A (en) * 2010-12-03 2011-04-06 北京工业大学 Safe positioning method in wireless sensor network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杨光等: "WSNs基于信誉机制的恶意节点识别模型", 《哈尔滨工业大学学报》 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102378217A (en) * 2011-11-01 2012-03-14 北京工业大学 Beacon node credit assessment method in localization in wireless sensor networks
CN102378217B (en) * 2011-11-01 2014-05-28 北京工业大学 Beacon node credit assessment method in localization in wireless sensor networks
CN102573055A (en) * 2011-12-02 2012-07-11 上海电机学院 Method for locating nodes in wireless sensor network
CN102573055B (en) * 2011-12-02 2014-04-09 上海电机学院 Method for locating nodes in wireless sensor network
CN103812696A (en) * 2014-01-28 2014-05-21 河南科技大学 Shuffled frog leaping algorithm based internet of things node reputation evaluation method
CN103812696B (en) * 2014-01-28 2017-07-28 河南科技大学 A kind of Internet of things node credit assessment method based on shuffled frog leaping algorithm
CN104202295A (en) * 2014-07-25 2014-12-10 苏州寻息电子科技有限公司 Beacon node based safeguard system and implementation method thereof
CN104202295B (en) * 2014-07-25 2018-05-01 苏州寻息电子科技有限公司 Security protection system and its implementation based on beaconing nodes
CN105873065A (en) * 2016-03-28 2016-08-17 南京邮电大学 Safe positioning method of wireless sensor network based on trust level evaluation
CN105873065B (en) * 2016-03-28 2019-02-19 南京邮电大学 Wireless sense network safe positioning method based on Trust Values Asses
CN109639582A (en) * 2018-12-07 2019-04-16 大科数据(深圳)有限公司 A kind of network node treatment method and device based on distributed hashtable

Also Published As

Publication number Publication date
CN102223627B (en) 2013-10-23

Similar Documents

Publication Publication Date Title
CN102223627B (en) Beacon node reputation-based wireless sensor network safety locating method
Strohmeier et al. On the security of the automatic dependent surveillance-broadcast protocol
AU2011329272B2 (en) Spot beam based authentication of a satellite receiver
US9515826B2 (en) Network topology aided by smart agent download
Larcom et al. Modeling and characterization of GPS spoofing
Grover et al. A novel defense mechanism against sybil attacks in VANET
Strohmeier et al. Security of ADS− B: State of the Art and Beyond
CN102123389B (en) Safe positioning method of wireless sensor network
Kushwaha et al. A survey on sybil attack in vehicular ad-hoc network
CN102186171A (en) Anti-attack reliable wireless sensor network node positioning method
Boeira et al. Vouch: A secure proof-of-location scheme for vanets
Hamdi et al. A review on various security attacks in vehicular ad hoc networks
Davydov et al. Accident detection in internet of vehicles using blockchain technology
Jin et al. A traffic flow theory aided physical measurement-based sybil nodes detection mechanism in vehicular ad-hoc networks
CN103227793A (en) RFID equipment layer information security transfer method and device based on random sequence
CN102378217B (en) Beacon node credit assessment method in localization in wireless sensor networks
Chhatwal et al. Detection of impersonation attack in VANETs using BUCK Filter and VANET Content Fragile Watermarking (VCFW)
US10389751B2 (en) Wireless data security between vehicle components
CN102983979B (en) Based on the Quick RFID authentication method of shared secret information between label
JP6556976B2 (en) Geocentration based on network ranging
Kamel et al. Feasibility study of misbehavior detection mechanisms in cooperative intelligent transport systems (C-ITS)
EP2573998B1 (en) Method and system for smart agent download
Tian et al. A novel sybil attack detection scheme for wireless sensor network
Zhang et al. Trust based secure localization in wireless sensor networks
Su et al. A privacy-preserving and vessel authentication scheme using automatic identification system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131023

Termination date: 20160617

CF01 Termination of patent right due to non-payment of annual fee