CN104270751B - Safety guarantee agreement based on received signal strength in wireless sensor network - Google Patents

Safety guarantee agreement based on received signal strength in wireless sensor network Download PDF

Info

Publication number
CN104270751B
CN104270751B CN201410160428.2A CN201410160428A CN104270751B CN 104270751 B CN104270751 B CN 104270751B CN 201410160428 A CN201410160428 A CN 201410160428A CN 104270751 B CN104270751 B CN 104270751B
Authority
CN
China
Prior art keywords
node
data
aggregation
key
zone
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.)
Expired - Fee Related
Application number
CN201410160428.2A
Other languages
Chinese (zh)
Other versions
CN104270751A (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.)
Xiangtan University
Original Assignee
Xiangtan University
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 Xiangtan University filed Critical Xiangtan University
Priority to CN201410160428.2A priority Critical patent/CN104270751B/en
Publication of CN104270751A publication Critical patent/CN104270751A/en
Application granted granted Critical
Publication of CN104270751B publication Critical patent/CN104270751B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H04L63/062—Network architectures or network communication protocols for network security for supporting key management in a packet data network for key distribution, e.g. centrally by trusted party
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Patent of the present invention is the safety guarantee agreement based on received signal strength in a kind of wireless sensor network, and in particular to Security routing and key management.According to neighbor node number, received signal strength and self-energy value, by aggregation node selection formula selection aggregation node.According to neighbor node number and the handling capacity of aggregation node, hot-zone is determined by hot-zone selection formula.By contrasting gathered data and the abnormal data characteristic similarity that prestores, realize to anomaly data detection.Session key between nodes are generated using dynamical fashion, according to whether being hot-zone, select different key-functions.To key and data encryption, by the way of public key cryptography mechanism and Symmetric Cryptography are combined.The present invention improves the flexibility of key, enhances the reasonability of selection aggregation node, ensure that the safe transmission of internodal data well.

Description

Safety guarantee agreement based on received signal strength in wireless sensor network
Technical field
The present invention relates to the foundation of Security routing and the management of dynamic key, belong to wireless communication technology field.
Technical background
Wireless sensor network (Wireless Sensor Networks, WSN) is a large amount of by being deployed in monitored area Cheap micro wireless sensor node composition, perceived, gathered by cooperation mode, handled and transmission of monitoring data.WSN is usual It is operated in rugged environment, with the characteristic such as link fragility, topological structure dynamic change between node.Therefore, wireless senser Network is subject to various types of attacks, so establishing Security routing and data key management is imperative.
Public key cryptography mechanism principle is by encryption key and decryption cipher key separation.Key generates in pairs, and each pair key is by one Individual public key and a private key composition.Key is longer, and cipher round results are better, but the expense of encrypting and decrypting is bigger.Symmetric Cryptography It is then that decryption is encrypted using identical key, encryption/decryption speed is fast, and expense is small.It is how sharp for wireless sensor network Key and data, which are communicated securely to aggregation node, with public key cryptography mechanism and Symmetric Cryptography becomes data receipts in WSN The hot issue of collection.
Consider that node is generally deployed in danger zone, various complex situations will be faced, therefore abnormal inspection need to be set in node Survey mechanism, with attacking ability of improving the precaution, ensure data reliability.Because node energy is limited, the equilibrium assignment of energy, which turns into, to close Key problem, therefore the reasonability of aggregation node selection according to dump energy dynamic select aggregation node, need to be ensured.Sensor node exists In practice, because Node distribution is uneven, perception data amount is of different sizes, therefore needs dynamic to judge hot-zone.For being transmitted across Journey, by the way of public key cryptography mechanism and Symmetric Cryptography are combined, help to ensure that data and the safety of key.
For case above, patent of the present invention realizes aggregation node dynamic select, the dynamic select of hot-zone, data and close Safe transmission of key etc., devise the wireless sensor network protocols for having more security.
The content of the invention
To solve the above mentioned problem in wireless sensor network, foundation and dynamic key management of the present invention by Security routing Method combines, and forms highly effective and safe agreement.
1st, the foundation of Security routing, including following premise, definition and step.
Premise is as follows：
1) base-station node is safe to be counterfeited；
2) there is N number of sensing node { S in zone of ignorance1, S2..., SN, each sensor node has unique ID number, node Between it is orthogonal, i.e., node can be independently determined perception data；
3) the abnormal characteristic value of pre-stored data in each node, for detecting by suspection node.
It is defined as follows：
1) broadcast singal sends the form of message：
Source address Destination address Current time Communication flows Hop count
2) aggregation node is responsible for collecting the data of all the sensors node perceived, and is communicated with control centre；
3) node sets interval time t, for calculating the handling capacity of aggregation node in the t times；
4) threshold value that node pre-sets convergence selective factor B is FTh, hot-zone selective factor B threshold value be DTh, aggregation node remains Complementary energy EThThreshold value with data off-note similarity is YTh；
5) renewal time of setting network aggregation node is T.
Step includes three aspects of detection of the selection of aggregation node, the selection of hot-zone and data exception：
First, the selection step of aggregation node is as follows：
1) all nodes send to its neighbor node and broadcast the message；
2) neighbor node obtains the intensity of reception signal, the source of signal and direction according to the broadcast message received, and The particular location of itself is calculated according to beaconing nodes (base station) orientation；
3) all nodes are selected public according to neighbor node number, received signal strength and self-energy value using aggregation node Formula calculates aggregation node selective factor B θ, if θ is more than FTh, then switch to aggregation node from ordinary node, otherwise remain common section Point；Aggregation node selection formula is as follows：
Wherein, θ represents the convergence selective factor B of node；E represents the node energy value；N represents the nodes neighbors nodes；Represent the neighbor node received signal strength sum of the node；Weight coefficient is represented, size depends on practical application Emphasis,IfThen the neighbor node received signal strength sum using the node is as paying the utmost attention to ；
4) after aggregation node is chosen, its neighbor node determines the convergence section of subordinate according to the signal intensity of receive information Point, and complete to shake hands with aggregation node, establish network topology；Meanwhile aggregation node is by periodic test self-energy, if remaining Energy is less than threshold value ETh, then send and broadcast the message to neighbor node, according to the 3) step reselect aggregation node.
2nd, the selection step of hot-zone is as follows：
1) according to the aggregation node selected in step 1, by handling capacity and neighbours section of the aggregation node in certain time t Points, judge that formula calculates hot-zone selective factor B π using hot-zone, if π is more than DTh, then it is hot-zone, is otherwise general area；Sentence hot-zone It is as follows to determine formula：
Wherein, π represents the hot-zone selective factor B of aggregation node；N represents the neighbor node number of the aggregation node；Data is represented Handling capacity of the aggregation node in certain time t；Weight coefficient is represented, size depends on the emphasis of practical application,IfThen the neighbor node number using the aggregation node is as paying the utmost attention to item；
2) if it is determined that being hot-zone, reset renewal aggregation node cycle T ', wherein T ' ＜ T, accelerate aggregation node selection, Real-time update aggregation node.
3rd, the detecting step of data exception is as follows：
1) feature of the node gathered data feature abnormal with pre-stored data is contrasted, utilizes calculating formula of similarity Abnormal nodes selective factor B ξ is obtained, if ξ is more than threshold value YTh, then for by suspect node, and the node will notify its neighbour save Point, otherwise remains ordinary node；Calculating formula of similarity is as follows：
Wherein, ξ represents the abnormal selective factor B of node；m1Represent the substring number of node gathered data；m2Represent that node is pre- Deposit data unusual character string number；SubStriRepresent i-th of substring of node gathered data；StrjRepresent that node prestores abnormal number According to j-th of character string；
2) after being obtained the data exception testing result of its own by the neighbor node for suspecting node, if abnormal data, then The node feeds back to abnormality detection result by node is suspected, if the feedback result number that neighbor node is received by suspection node is big In the 1/2 of neighbor node sum, then it is infected node, otherwise remains ordinary node；
3) if it is determined that being infected node, then isolate the node, if the infected node is aggregation node, utilize convergence Node selection step reselects aggregation node.
2nd, the foundation of key management, including following premise and step.
Premise is as follows：
1) all node initializing keys are Kn, for broadcasting the message, choosing aggregation node and realize the dynamic of new node State is added；
2) all node initializing keys are KcAnd Kp, it is to represent public key and private key respectively, for public key cryptography mechanism.
Step is as follows：
1) sending node is with key KnEncrypt its temporal information T1Aggregation node with its subordinate is in certain time t Handling capacity Data, and encryption information is sent to receiving node；
2) receiving node is according to key KnThe information received is decrypted, while obtains its temporal information T2, according to convergence region Whether it is hot-zone, utilizes the different session key K of different F () function dynamic generationsd；If convergence region is hot-zone, F () Function is according to the temporal information (T of two nodes1, T2) and sending node subordinate handling capacity of the aggregation node in certain time t Data, session key Kd=F (F (T1, T2), Data)；If convergence region is general area, F () function is according to two nodes Temporal information (T1, T2), session key Kd=F (T1, T2)；
3) receiving node calculates session key KdAfterwards, using public key KcEncrypted session key Kd, and by the K after encryptiondHair Give sending node；
4) K after sending node is encryptedd, pass through private key KpDecrypt key Kd, then with KdUsed for key symmetrical Cipher mechanism coded communication packet, and it is sent to receiving node；
5) receiving node is according to key Kd, communication data packet is decrypted, obtains wherein information.
Advantage of the present invention：
1) in existing WSN, because N nodes need to pre-install N-1 key, and this agreement need not predict nodes, Ji Nengman The key pair process of sufficient conventional need, reduce the space of storage key；
2) this Protocol Through Network topological structure has an adaptivity, prestored secret key K in noden, new node can be realized Dynamic is added, and to the supplement of failure node, ensures the persistence to the area monitoring；
3) this agreement uses anomaly data detection mechanism, can be accurately finished the isolation to infected node, prevents malice Data attack；
4) use aggregation node selection algorithm and periodically update aggregation node, ensure that existing for aggregation node rationally Property；
5) by the way of public key cryptography mechanism and Symmetric Cryptography are combined, the transmission peace of key and data is ensured Entirely；
6) data for different stage and the data in different type convergence region, it is close to generate session using different functions Key, ensure the safety of inter-node communication.
Brief description of the drawings
Fig. 1：Aggregation node selects flow chart；
Fig. 2：Hot-zone Establishing process figure；
Fig. 3：Key management algorithm schematic diagram；
Fig. 4：Node abnormality detection mechanism flow chart.
Embodiment
In order to solve the safety problem in wireless sensor network, foundation and dynamic key pipe of the present invention by Security routing Reason method combines, and forms highly effective and safe agreement.In order to realize the above results, key step of the present invention is as follows：
With reference to shown in Fig. 1, it is known that aggregation node and hot-zone establishment step：
1) there is N number of node for zone of ignorance, utilize prestored secret key KnBroadcast encryption, data content have 5；
2) send data message format and example is as follows：
3) each node is with key KnThe message received is decrypted, further according to neighbor node number, received signal strength and itself energy Value, aggregation node selective factor B θ is calculated using aggregation node selection formula, if θ is more than FTh, then switch to converge from ordinary node Node, otherwise remain ordinary node；Aggregation node selection formula is as follows：
Wherein, θ represents the convergence selective factor B of node；E represents the node energy value；N represents the nodes neighbors nodes；Represent the neighbor node received signal strength sum of the node；Weight coefficient is represented, size depends on practical application Emphasis,IfThen the neighbor node received signal strength sum using the node is as paying the utmost attention to ；
4) after aggregation node is chosen, its neighbor node determines the convergence section of subordinate according to the signal intensity of receive information Point, and complete to shake hands with aggregation node, establish network topology；Meanwhile aggregation node is by periodic test self-energy, if remaining Energy is less than threshold value ETh, then send and broadcast the message to neighbor node, according to the 3) step reselect aggregation node.
With reference to shown in Fig. 2, it is known that the Establishing process step of hot-zone is as follows：
1) handling capacity and neighbor node number according to aggregation node in certain time t, judge that formula calculates using hot-zone Hot-zone selective factor B π, if π is more than DTh, then it is hot-zone, is otherwise general area；Hot-zone judges that formula is as follows：
Wherein, π represents the hot-zone selective factor B of aggregation node；N represents the neighbor node number of the aggregation node；Data is represented Handling capacity of the aggregation node in certain time t；Represent weight coefficient,Size depends on the side of practical application Emphasis, ifThen the neighbor node received signal strength sum using the node is as paying the utmost attention to item；
2) if it is determined that being hot-zone, reset renewal aggregation node cycle T ', wherein T ' ＜ T, accelerate aggregation node selection, Real-time update aggregation node.
With reference to shown in Fig. 3, it is known that dynamic key management process step：
1) sending node A is assumed to receiving node B transmission data are received, then sending node A is with key KnWhen encrypting itself Between information T1With the handling capacity Data of the aggregation node of its subordinate in certain time t, and encryption information is sent to reception section Point B；
2) receiving node B is according to key KnThe data received are parsed, while obtain its temporal information T2, saved for convergence Whether point region is hot-zone, will produce different session key K using different F () function dynamicsd；If region is converged as heat Area, then F () function is according to the temporal information (T of two nodes1, T2) and sending node subordinate aggregation node in certain time t Handling capacity Data, session key Kd=F (F (T1, T2), Data)；If convergence region is general area, F () function root According to the temporal information (T of two nodes1, T2), session key Kd=F (T1, T2)；
3) receiving node B calculates session key KdAfterwards, using public key KeEncrypted session key Kd, and by the K after encryptiond Sending node A is sent to, ensures the security that key transmits between node；
4) K after sending node A is encryptedd, pass through private key KpDecrypt key Kd, then with KdFor key use pair Claim cipher mechanism coded communication packet, and be sent to receiving node B, ensure the reliability that data are transmitted between node；
5) receiving node B is according to key Kd, communication data packet is decrypted, obtains wherein information.
With reference to shown in Fig. 4, it is known that node abnormality detection mechanism process step：
1) feature of the node gathered data feature abnormal with pre-stored data is contrasted, utilizes calculating formula of similarity Abnormal nodes selective factor B ξ is obtained, if ξ is more than threshold value YTh, then for by suspect node, and the node will notify its neighbour save Point, otherwise remains ordinary node；Calculating formula of similarity is as follows：
Wherein, ξ represents the abnormal selective factor B of node；m1Represent the substring number of node gathered data；m2Represent that node is pre- Deposit data unusual character string number；SubStriRepresent i-th of substring of node gathered data；StrjRepresent that node prestores abnormal number According to j-th of character string；
2) after being obtained the data exception testing result of its own by the neighbor node for suspecting node, if abnormal data, then The node feeds back to abnormality detection result by node is suspected, if the feedback result number that neighbor node is received by suspection node is big In the 1/2 of neighbor node sum, then it is infected node, otherwise remains ordinary node；
3) if it is determined that being infected node, then isolate the node, if the infected node is aggregation node, utilize convergence Node selection step reselects aggregation node.

Claims (2)

1. the method for protecting based on received signal strength in wireless sensor network, it is characterised in that Security routing is built Cube method includes following premise, definition and step：
Premise is as follows：
1) base-station node is safe；
2) there is N number of sensing node { S in zone of ignorance1, S2..., SN, each sensor node has a unique ID number, between node mutually Uncorrelated, i.e., node can be independently determined perception data；
3) the abnormal characteristic value of pre-stored data in each node；
It is defined as follows：
1) broadcast singal sends the form of message：
2) aggregation node is responsible for collecting the data of all the sensors node perceived, and is communicated with control centre；
3) node sets interval time t, for calculating the handling capacity of aggregation node in the t times；
4) threshold value that node pre-sets convergence selective factor B is FTh, hot-zone selective factor B threshold value be DTh, aggregation node residual energy EThThreshold value with data off-note similarity is YTh；
5) renewal time of setting network aggregation node is T；
Step includes three aspects of detection of the selection of aggregation node, the selection of hot-zone and data exception：
First, the selection step of aggregation node is as follows：
1) all nodes send to its neighbor node and broadcast the message；
2) neighbor node is according to the broadcast message received, obtains the intensity of reception signal, the source of signal and direction, and according to Beaconing nodes (base station) orientation calculates the particular location of itself；
3) all nodes select formula meter according to neighbor node number, received signal strength and self-energy value using aggregation node Aggregation node selective factor B θ is calculated, if θ is more than FTh, then switch to aggregation node from ordinary node, otherwise remain ordinary node；Converge Poly- node selection formula is as follows：
Wherein, θ represents the convergence selective factor B of node；E represents the node energy value；N represents the nodes neighbors nodes；Represent the neighbor node received signal strength sum of the node；Represent weight coefficient,
4) after aggregation node is chosen, its neighbor node determines the aggregation node of subordinate according to the signal intensity of receive information, and Completion is shaken hands with aggregation node, establishes network topology；Meanwhile aggregation node is by periodic test self-energy, if dump energy Less than threshold value ETh, then send and broadcast the message to neighbor node, according to the 3) step reselect aggregation node；
2nd, the selection step of hot-zone is as follows：
1) according to the aggregation node selected in step 1, by handling capacity and neighbor node number of the aggregation node in certain time t, Judge that formula calculates hot-zone selective factor B π using hot-zone, if π is more than DTh, then it is hot-zone, is otherwise general area；Hot-zone judges public Formula is as follows：
<mrow> <mi>&amp;pi;</mi> <mo>=</mo> <mo>&amp;part;</mo> <mi>n</mi> <mo>+</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mo>&amp;part;</mo> <mo>)</mo> </mrow> <mi>D</mi> <mi>a</mi> <mi>t</mi> <mi>a</mi> </mrow> 1
Wherein, π represents the hot-zone selective factor B of aggregation node；N represents the neighbor node number of the aggregation node；Data represents the remittance Handling capacity of the poly- node in certain time t；Represent weight coefficient,
2) if it is determined that being hot-zone, reset renewal aggregation node cycle T ', wherein T ' ＜ T, accelerate aggregation node selection, in real time Update aggregation node；
3rd, the detecting step of data exception is as follows：
1) feature of the node gathered data feature abnormal with pre-stored data is contrasted, obtained using calculating formula of similarity Abnormal nodes selective factor B ξ, if ξ is more than threshold value YTh, then for by node is suspected, and the node will notify its neighbor node, no Then remain ordinary node；Calculating formula of similarity is as follows：
<mrow> <mi>&amp;xi;</mi> <mo>=</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>m</mi> <mn>1</mn> </msub> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <msub> <mi>m</mi> <mn>2</mn> </msub> </munderover> <mrow> <mo>(</mo> <msub> <mi>SubStr</mi> <mi>i</mi> </msub> <mo>&amp;CirclePlus;</mo> <msub> <mi>Str</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> </mrow>
Wherein, ξ represents the abnormal selective factor B of node；m1Represent the substring number of node gathered data；m2Represent that node prestores number According to unusual character string number；SubStriRepresent i-th of substring of node gathered data；StrjRepresent that node prestores abnormal data J-th of character string；
2) after being obtained the data exception testing result of its own by the neighbor node for suspecting node, if abnormal data, then the section Point feeds back to abnormality detection result by node is suspected, if the feedback result number that neighbor node is received by suspection node is more than neighbour The 1/2 of node total number is occupied, then is infected node, otherwise remains ordinary node；
3) if it is determined that being infected node, then isolate the node, if the infected node is aggregation node, utilize aggregation node Selection step reselects aggregation node.
2. the method for protecting based on received signal strength in wireless sensor network, it is characterised in that key management is built It is vertical, including following premise and step：
Premise is as follows：
1) all node initializing keys are Kn；
2) all node initializing keys are KcAnd Kp, it is to represent public key and private key respectively；
Step is as follows：
1) sending node is with key KnEncrypt its temporal information T1With aggregation node the handling up in certain time t of its subordinate Data is measured, and encryption information is sent to receiving node；
2) receiving node is according to key KnThe information received is decrypted, while obtains its temporal information T2, for step in right 1 Two determine whether that it is hot-zone to converge region, using the different session key K of different F () function dynamic generationsd；If assembling area Domain is hot-zone, then F () function is according to the temporal information (T of two nodes1, T2) and sending node subordinate aggregation node one timing Between handling capacity Data, session key K in td=F (F (T1, T2), Data)；If convergence region is general area, F () letter Several temporal information (T according to two nodes1, T2), session key Kd=F (T1, T2)；
3) receiving node calculates session key KdAfterwards, using public key KcEncrypted session key Kd, and by the K after encryptiondIt is sent to Sending node；
4) K after sending node is encryptedd, pass through private key KpDecrypt key Kd, then with KdSymmetric cryptography is used for key Encryption mechanism communication data packet, is sent to receiving node；
5) receiving node is according to key Kd, communication data packet is decrypted, obtains wherein information.
CN201410160428.2A 2014-04-19 2014-04-19 Safety guarantee agreement based on received signal strength in wireless sensor network Expired - Fee Related CN104270751B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410160428.2A CN104270751B (en) 2014-04-19 2014-04-19 Safety guarantee agreement based on received signal strength in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410160428.2A CN104270751B (en) 2014-04-19 2014-04-19 Safety guarantee agreement based on received signal strength in wireless sensor network

Publications (2)

Publication Number Publication Date
CN104270751A CN104270751A (en) 2015-01-07
CN104270751B true CN104270751B (en) 2017-12-08

Family

ID=52162222

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410160428.2A Expired - Fee Related CN104270751B (en) 2014-04-19 2014-04-19 Safety guarantee agreement based on received signal strength in wireless sensor network

Country Status (1)

Country Link
CN (1) CN104270751B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105184187A (en) * 2015-08-18 2015-12-23 重庆大学 Encrypting method and decrypting method of computer memorizer
CN105959281B (en) * 2016-04-29 2020-12-22 腾讯科技（深圳）有限公司 File encryption transmission method and device
CN110035008B (en) * 2018-01-11 2020-08-18 中国科学院声学研究所 Content distribution method based on coverage rate dynamic adjustment in node ad hoc network
CN108173641B (en) * 2018-02-11 2021-12-21 福州大学 Zigbee safety communication method based on RSA
CN109495304B (en) * 2018-11-19 2020-10-16 中国科学院信息工程研究所 Convergence node deployment method and device
CN109802974B (en) * 2018-12-21 2021-01-01 北京理工大学 One-way safe data transmission method based on public key cryptography
CN112804118B (en) * 2020-12-31 2023-01-31 广州技象科技有限公司 Data transmission method and device based on intelligent ammeter data jump transmission link

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101478751A (en) * 2009-01-16 2009-07-08 南京邮电大学 Energy optimized safe routing method
CN102036308A (en) * 2010-12-09 2011-04-27 江南大学 Energy balancing wireless sensor network clustering method
CN102665251A (en) * 2012-05-25 2012-09-12 重庆大学 WSN (Wireless Sensor Network) distributed-type non-uniform clustering method
CN103298054A (en) * 2013-06-04 2013-09-11 四川大学 Wireless sensor network cluster routing protocol based on node depth

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101478751A (en) * 2009-01-16 2009-07-08 南京邮电大学 Energy optimized safe routing method
CN102036308A (en) * 2010-12-09 2011-04-27 江南大学 Energy balancing wireless sensor network clustering method
CN102665251A (en) * 2012-05-25 2012-09-12 重庆大学 WSN (Wireless Sensor Network) distributed-type non-uniform clustering method
CN103298054A (en) * 2013-06-04 2013-09-11 四川大学 Wireless sensor network cluster routing protocol based on node depth

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于节点位置和能量的无线传感器网络分簇路由协议研究;肖刘军;《中国优秀硕士学位论文全文数据库信息科技辑》;20101115;全文 *
无线传感器网络安全路由协议研究;杨光;《中国优秀博士学位论文全文数据库信息科技辑》;10110215;第2章 *

Also Published As

Publication number Publication date
CN104270751A (en) 2015-01-07

Similar Documents

Publication Publication Date Title
CN104270751B (en) Safety guarantee agreement based on received signal strength in wireless sensor network
Salehi et al. Detection of sinkhole attack in wireless sensor networks
CN102244658B (en) Partitioned type dynamic safety routing method for wireless sensor network on basis of hash chains
Raja Basha Energy efficient aggregation technique‐based realisable secure aware routing protocol for wireless sensor network
Mishra et al. Security against black hole attack in wireless sensor network-a review
Thamizhmaran et al. Performance analysis of on-demand routing protocol for MANET using EA3ACK algorithm
Kaushik et al. Intrusion detection and security system for blackhole attack
Hoang et al. A lightweight mixed secure scheme based on the watermarking technique for hierarchy wireless sensor networks
SriVenkateswaran et al. Secure cluster-based data aggregation in wireless sensor networks with aid of ECC
Juliana et al. Seladg: Secure energy efficient location aware data gathering approach for wireless sensor networks
Luqman et al. Security in wireless sensor network: a current look
El Mougy et al. Preserving privacy in wireless sensor networks using onion routing
Prathap et al. CPMTS: Catching packet modifiers with trust support in wireless sensor networks
Singh et al. Prevention of Blackhole Attack in Wireless Sensor Network using IPSec Protocol.
Sirajuddin et al. Intelligent Secure and Malicious-Free Route Management Strategy for IoT-based Wireless Sensor Networks
Yi En-route message authentication scheme for filtering false data in WSNs
Patil et al. Improved acknowledgement intrusion detection system in MANETs using hybrid cryptographic technique
Mobinunnisa et al. Detection of Multiple Malicious Nodes in MANETS in a Single Query
Kamalesh et al. Fuzzy based secure intrusion detection system for authentication in wireless sensor networks
Al-taha Symmetric key management scheme for hierarchical wireless sensor networks
Guo A modified scheme for privacy-preserving data aggregation in WSNs
Kumaratharan et al. A survey on improved PSO routing and clustering in WSN
Bathla et al. Adversarial Modeling in WSN and its Application in Key Distribution
Paruvathavardhini et al. A Review on Energy Efficient Routing Protocols and Security Techniques for Wireless Sensor Networks
Pomal et al. A survey on various detection techniques of sinkhole attacks in WSN

Legal Events

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

Granted publication date: 20171208

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