CN103702325B - Lightweight wireless sensor network safety small data distribution method - Google Patents
Lightweight wireless sensor network safety small data distribution method Download PDFInfo
- Publication number
- CN103702325B CN103702325B CN201310705568.9A CN201310705568A CN103702325B CN 103702325 B CN103702325 B CN 103702325B CN 201310705568 A CN201310705568 A CN 201310705568A CN 103702325 B CN103702325 B CN 103702325B
- Authority
- CN
- China
- Prior art keywords
- packet
- key
- sensor node
- mystery
- base station
- 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.)
- Active
Links
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
The invention discloses a lightweight wireless sensor network safety small data distribution method. The method comprises the following stages that: at a first stage, namely, a system initializing stage, a base station generates a one-way key chain, and adds a key chain commitment value into each sensor node before deploying each sensor node; at a second stage, namely, a data packet preprocessing stage, the base station constructs a legal data packet of specific data items by using a Hash function; at a third stage, namely, a data packet verification stage, each sensor node verifies the received data packet, the data packet is received and the sensor node is updated if the received data packet is a legal data packet, otherwise, the data packet is abandoned directly. Under the consideration of limitation on common sensor node resources, the lightweight wireless sensor network safety small data distribution method has the advantages of resistance to sensor node compromise, high robustness on the aspects of packet loss and data packet transmission out-of-sequence, no need of time synchronism between the base station and each sensor node, and the like. Meanwhile, the lightweight wireless sensor network safety small data distribution method has the excellent characteristics of high efficiency, saving in energy, low storage overhead, resistance to malicious attacks, and the like.
Description
Technical field
The present invention relates to the technical field of radio communication, more particularly to a kind of wireless sensor network security of lightweight is little
Data distributing method.
Background technology
At present, wireless sensor network is widely distributed, and application is also varied, including environmental monitoring, battlefield prison
Depending on and data acquisition under harsh geographical environment.In wireless sensor network, can distribute small data in a network is
One very useful operating function.It allows base station to write some little programs toward sensor node, orders, and inquiry and configuration are joined
Number.It is emphasized that small data distribution protocol is different from the code distribution furtherd investigate（Also sometimes referred to as data
Distribution is reprogrammed）Agreement.Code distribution is that new binary file is distributed in network, so as to realize complete system weight
Programming.For example, the binary file for efficiently distributing tens of thousands of bytes needs code distribution agreement, and the several sizes of distribution are
The configuration parameter of two bytes, needs small data distribution protocol.
Recently, some small data distribution protocols have been suggested.Wherein, Drip, DIP and DHV represent current level.
In the environment of these agreements assume that wireless sensor network is operated in a trust, it is different from real practical situation.It is real
In the situation of border, there may be attacker to intend the wireless sensor network of destruction operation.For example, when a wireless sensor network exists
Remote districts work, to supervise unlawful activities, such as runs into gun unloading and illicit crop plantation, and attacker can be in the number of injection
Include " net dormancy a very long time according to item（network dormancy for a long period）" order, so as to
Close control function.
Therefore, the legitimacy of the data item of checking distribution is extremely important, and such sensor node can be verified from trusted
The data item in the source appointed, and ensure that data item is not modified in transmitting procedure.Therefore, sensor node is needed by certification machine
System, to guarantee that these are had not changed as from the data of the project of trusted sources in transportation.
Under normal circumstances, certification broadcast depends on digital signature（For example, the Rivest, Shamir, and
Adleman (RSA) signs and Elliptic Curve Cryptography (ECC) signs）With their reinforcement variant version
（For example, group ranking, ring signatures, Proxy Signature）, mixed method and symmetric key encryption.Unfortunately, they are serving really
When protecting small data distribution, also there are some security breaches and efficiency.For example, digital signature verification technology can cause very high meter
Calculate and storage overhead, therefore, the method is not suitable for the sensor node of resource-constrained.
The content of the invention
It is an object of the invention to overcome the shortcoming and deficiency of prior art, there is provided a kind of wireless sensor network of lightweight
The safe small data distribution method of network, it is ensured that the efficiency of small data distribution procedure and safety.
In order to achieve the above object, the present invention is employed the following technical solutions：
The wireless sensor network security small data distribution method of lightweight, including following three stage：
First stage：System initialisation phase, base station generate one-way key chain, and will before each sensor node deployment
Key chain commitment value (key chain commitment) is added in each sensor node；
Second stage：Processing stage the early stage of packet, need to send the base station of data or sensor node utilizes Hash
Function H (.), builds the legal data packet of specific data item；
Phase III：The packet authentication stage：Sensor node is verified to the packet for receiving, if received
Packet be legal packet, then receive the packet and sensor node be updated, otherwise directly abandon the number
According to bag.
The first stage comprises the following steps：
A, base station select a random number Kb；
B, according to KbAn one-way key chain is generated, by K0,K1,…KbComposition, wherein Kj=H (Kj+1) (j=b-1, b-
2,…,0)；
C, base station predistribution key chain, it is ensured that key chain commitment value K0Filled before sensor node network deployment
It is downloaded in each sensor node.
In step B, described one-way key chain generation method is, using base station selected random number as one-way key chain
Head node, the mystery key on each key chain node thereafter cross hash function by the mystery push-to on previous key chain node
Carry out Hash and obtain, the length of one-way key chain can be it is arbitrary, but no less than in network lifecycle base station will point
The data item number sent out.
The second stage is comprised the following steps：
I, for each wheel data distribution, it is assumed that for jth wheel, base station uses mystery key（puzzle key）Kj；
II, by data item djIt is on duty by turns（round）It is set to j；
III, data item djAnd mystery key（puzzle key）KjConstitute a mystery with particular message（puzzle）.
IIII, the above-mentioned mystery with particular message（puzzle）L is answered effectively with onejAlong with packet header（packet
header）Constitute a legal packet（packet）.One of them effectively answers LjSuch a number is referred to, it causes
The front l positions of the Hash result of payload are all 0.Here payload refers to by mystery（puzzle）With answer LjThe item of composition, l
Referred to as intensive parameter, its value are determined by base station.
Data item four-tuple in IIIII, step II（Round, key, version, data）It is to represent, on duty by turns here
（round）Represent the distribution newness degree of data item（Round values are bigger, and the distribution of data item is newer）, marking variable（key）Only
One mark variable to be updated, version number（version）Represent the newness degree of data item（Version values are bigger, data item
It is newer）, data（data）Represent data to be distributed.
The phase III comprises the following steps：
A, sensor node receive a packet P from any one adjacent jump set sensor node or base stationi；
B, checking receive packet it is on duty by turns（round）, so that it is determined that the distribution of the packet is new and old（It is possible to as new
One wheel distribution, same wheel distribution or old wheel distribution）；
If c, packet are the packets of new round distribution, verification step is as follows：
1）Checking bag PjIn mystery key（puzzle key）KjIt is using effective hash function H (.) and key chain commitment value
K0The result that obtains and verify that the mystery key was not used by any one valid data item before, if by checking,
2 are performed then）, otherwise perform 5）.
2）Check H (Pj) front l positions whether be 0, if front l positions be 0, perform 3）, otherwise perform 5）.
3）Check PjMiddle version number（version）And marking variable（key）Effectiveness, that is, confirm as redaction, such as
Fruit confirms as redaction, then perform 4）, otherwise perform 5）.
4）According to the marking variable of packet（key）To update the data, while using PjIt is corresponding on duty by turns in bag（round）With
Mystery key（puzzle key）It is on duty by turns come update that it is stored（round）With mystery key（puzzle key）.
5）Abandon the packet.
If on duty by turns in d, packet（round）Currently stored with node is on duty by turns（round）Equal, i.e., node is current
The packet that receives belongs to same wheel distribution with the last packet for receiving, then by Trickle algorithms increasing distribution
Time interval；
If e, packet are the packets of old wheel distribution, the data stored by sensor node distribution its own
Bag.
We provide the wireless sensor network security small data distribution method of lightweight（It is referred to as LightDrip, under
Together）, this method ensure that efficiency and the safety of small data distribution procedure.
Different from DIP and DHV, Drip is distributed each data item as an independent entity, thus logarithm
There is preferably control according to the distribution time and speed of item.Here, energy is mainly concentrated on safe Drip agreements by us.
In LightDrip, we are by the tlv triple of Drip（Key, version, data）It is extended to four-tuple（Round, key,
Version, data）To represent a data item, round here represents the distribution newness degree of data item（Round values are got over
Greatly, the distribution of data item is newer）, and other three elements there is identical implication, i.e. key unique marks to want with existing protocol
The variable being updated, version represent the newness degree of data item（Version values are bigger, and data item is newer）, data is represented will
The data of distribution.Especially, we illustrate how using its efficient basis distribution policy to develop a safety of Drip
Extension（That is, Trickle）.Obviously, same method can also be used for providing safety protection, example for other small data distribution protocols
Such as DIP and DHV, between them, only difference is that how to search for different data item to realize efficiently between sensor node
Message is transmitted.
We concentrate the security mechanism of research lightweight, design our agreement to share process as much as possible for base station
Work.This agreement was made up of three stages：System initialization, the early stage of packet are processed, packet authentication.Hold before on-premise network
Row system initialisation phase.In this stage, one-way key chain is set up in base station, and ensures for key chain commitment value to be loaded into each biography
Sensor node.Then, before data distribution, base station is by answering mystery（puzzle）Information, obtains one and effectively answers, so
Packet is constructed for data item afterwards, processing stage performing the early stage of packet.In the last stage, packet authentication rank
Section, each sensor node individual authentication each packet for receiving.If the verification passes, then according to the data for receiving
Updated data package.
In terms of safety and efficiency, security system of the LightDrip ratios based on PKC, mixed method, and based on symmetrical
The Security solution of Key Encryption Technology is more particularly suitable.
The present invention is had the following advantages relative to prior art and effect：
（1）The compromise of opposing sensor node：No matter how many sensor node is destroyed, as long as not impaired biography
The subset of sensor node remains to form a connected graph with base station, then agreement just has opposing bullet to the compromise of sensor node
Property；
（2）There is high robust on packet loss and packet transmission are out-of-sequence：It is relatively large number of in wireless sensor network
The arrival of data-bag lost event and out of order packet needs to tolerate what high rate of data loss and out of order packet were transmitted
Design；
（3）Do not need between base station and sensor node temporal synchronous：Do not require between base station and sensor node
It is synchronous.Therefore, without assume packet reach time interval, once packet is sent to sensor node, it can at once by
Checking.
（4）Other advantages：It is energy-efficient（For communication and calculating）, relatively low storage overhead can resist malicious attack etc..
Description of the drawings
Fig. 1 is the flow chart of the present invention.
Fig. 2 is the formation schematic diagram of one-way key chain.
Fig. 3 is the pie graph of the encrypted packet with particular message.
Specific embodiment
With reference to embodiment and accompanying drawing, the present invention is described in further detail, but embodiments of the present invention are not limited
In this.
Embodiment
As shown in figure 1, this agreement is divided into system initialization, the early stage of packet is processed and packet authentication three phases,
It is specific as follows：
First stage：System initialisation phase, base station generate one-way key chain, and will before each sensor node deployment
Key chain commitment value is added in sensor node；
Second stage：Processing stage the early stage of packet, base station utilizes hash function, builds the legal number of specific data item
According to bag；
Phase III：Packet authentication stage, sensor node are verified to the packet for receiving, if received
Packet be legal packet, then receive the packet and sensor node be updated, otherwise directly abandon the number
According to bag.
In system initialisation phase, as shown in Fig. 2 a random number K is selected in base stationb, then generate an one-pass key
Chain, by K0,K1,…KbComposition, wherein Kj=H (Kj+1) (j=b-1, b-2 ..., 0).Then, base station predistribution key chain, it is ensured that
Key chain commitment value K0It was added in each sensor node before sensor node network deployment.Key K0,K1,…KbClaim
For mystery key（puzzle key）, mystery key（puzzle key）KjDistribute for jth wheel, wherein j ＞ 0.Here length b of every chain
It can be arbitrary, but the data item number that base station will be distributed no less than in network lifecycle.
In LightDrip, we are by the tlv triple of Drip（Key, version, data）It is extended to four-tuple（Round,
Key, version, data）To represent a data item, round here represents the distribution newness degree of data item（Round values
Bigger, the distribution of data item is newer）, and other three elements have identical implication, i.e. key unique marks with existing protocol
Variable to be updated, version represent the newness degree of data item（Version values are bigger, and data item is newer）, data represents
Data to be distributed.As the realization of Drip, marking variable（key）And version number（version）Length be respectively 2 bytes
With 4 bytes.Their byte length can be arranged long enough, for example, 4 bytes, to avoid in wireless sensing by each wheel
In device Network morals, they are looped around certain real number space always.However, in order to reduce expense, if surround（wrap
around）If permission, it is possible to use the length of each byte 4.As expected distribution rate is not very high, it is allowed to ring
Around（wrap around）The ambiguity on any sensor node should be unable to be caused.
After completion system initial phase, into packet early stage processing stage.If distribution such is thought in base station
Individual data item：D={ round, key, version, data }, it can perform following steps to build the packet of d.Hereinafter,
H (M) represents the cryptographic Hash of message M.
For each wheel, it is assumed that for jth wheel, base station uses mystery key（puzzle key）Kj, then by data item dj's
Round values are set to j.Data item djAnd mystery key（puzzle key）KjConstitute a mystery with particular message（puzzle）.
As shown in figure 3, one is effectively answered LjFor to (dj‖Kj‖Lj) when applying hash function H (.), as a result front l positions of mirror image
It is all 0.Parameter l determines mystery（puzzle）Intensity.Base station determines the value of l, and all of biography is loaded into before deployment
In sensor node.Before packet is sent, base station is attempted by finding mystery（puzzle）Answer LjTo solve the mystery
（puzzle）.Subsequently, final packet P can be distributed in base stationj, it is by packet header and payload (dj‖Kj‖Lj) composition.
Three phases are the packet authentication stages.When sensor node receives a packet（The packet from
Any one adjacent jump set sensor node or base station receive）, each sensor node, it is assumed that for Si, perform following behaviour
Make：
（1）If this is new round distribution（That is, it is on duty by turns in the packet for receiving（round）More than what is stored
（Round, puzzle key）In it is on duty by turns（round））, sensor node SiThere is following checking order：
a）Checking bag PjIn mystery key（puzzle key）KjIt is using effective hash function H (.) and key chain commitment value
K0The result that obtains and verify that the mystery key was not used by any one valid data item before, if by checking,
B is performed then）, otherwise perform e）.
b）Check H (Pj) front l positions whether be 0, if front l positions be 0, perform c）, otherwise perform e）.
c）Check PjMiddle version number（version）And marking variable（key）Effectiveness, that is, confirm as redaction, such as
Fruit confirms as redaction, then perform d）, otherwise perform e）.
d）According to the marking variable of packet（key）To update the data, while using PjIt is corresponding on duty by turns in bag（round）With
Mystery key（puzzle key）It is on duty by turns come update that it is stored（round）With mystery key（puzzle key）.
e）Abandon the packet.
（2）If sensor node SiOnce one was received recently distributed new and old identical packet with which（That is, receive
Packet in it is on duty by turns（round）It is on duty by turns equal to what is stored（round））, it can increase distribution by Trickle algorithms
Time interval.So when network is consistent, the energy expenditure of sensor node can be reduced by this method.
（3）If having currently encountered old wheel distribution（That is, it is on duty by turns in the packet for receiving（round）Less than depositing
That what is stored up is on duty by turns（round）With mystery key（puzzle key）In it is on duty by turns（round））, that is to say, that its adjacent jump set sensor
The packet distributed by node is old, then sensor node SiDistribute the packet stored by it.
The implication that technical term relevant in the present invention is represented is as follows：
KjRepresent the mystery key of jth wheel distribution（puzzle key）；
djRepresent the content of j-th data item；
PjRepresent j-th packet；
H(Pj) represent packet PjCryptographic Hash；
LjRepresent that one, jth wheel is effectively answered.
Above-described embodiment is the present invention preferably embodiment, but embodiments of the present invention not by above-described embodiment
Limit, other any spirit without departing from the present invention and the change, modification, replacement made under principle, combine, simplification,
Equivalent substitute mode is should be, is included within protection scope of the present invention.
Claims (7)
1. the wireless sensor network security small data distribution method of lightweight, it is characterised in that include such as the next stage：
First stage：System initialisation phase, in this stage, one number of base station random choose, generates one unidirectionally according to the number
Key chain, and key chain commitment value is added in each sensor node before each sensor node deployment；
Second stage：Processing stage the early stage of packet, hash function is utilized in this stage base station, that what is distributed as needed is specific
Small data item, construct a legal data packet for belonging to the data item；
Phase III：Packet authentication stage, sensor node are verified to the packet for receiving, if the number for receiving
It is legal packet according to bag, then receives the packet and sensor node is updated, otherwise directly abandon the packet；
The phase III comprises the following steps：
A, sensor node receive a packet from any one adjacent jump set sensor node or base station；
The packet that b, sensor node checking are received it is on duty by turns, so that it is determined that the distribution of the packet is new and old, if newly
One wheel distribution, then execution step c, if same wheel distribution, then execution step d, if old wheel distribution, then execution step
e；
If c, the packet for receiving are the packets of new round distribution, sensor node performs the checking step of packet
Suddenly；The concrete grammar of the verification step that sensor node is performed is as follows：
1) verify that the mystery key in packet is that the result and checking being worth to is promised to undertake using effective hash function and key chain
The mystery key was not used by any one valid data item before, if by checking, performing 2), otherwise performing 5)；
2) value of the intensive parameter determined according to base station, before checking the packet cryptographic Hash some positions be zero digit whether with this
Intensive parameter is equal, if equal, performs 3), otherwise performs 5)；
3) effectiveness of version number and marking variable in the packet is checked, that is, confirms as redaction, if it is confirmed which is new
4) version, then perform, otherwise perform 5)；
4) according to the marking variable of the packet updating the data, while with corresponding on duty by turns and mystery key in packet come more new biography
The on duty by turns and mystery key stored by sensor node；
5) abandon the packet for receiving；
If d, the packet for receiving and current data packet belong to same wheel distribution, increase the number by Trickle algorithms
According to the time interval of bag distribution；
If e, the packet for receiving are the packets of old wheel distribution, the number stored by sensor node distribution its own
According to bag.
2. the wireless sensor network security small data distribution method of lightweight according to claim 1, it is characterised in that institute
Stating the first stage comprises the steps：
A, base station select a random number；
B, base station generate an one-way key chain according to the random number using hash function, and the key on key chain is referred to as mystery
Key；
C, base station are loaded into key chain commitment value in each sensor node, and last mystery key of wherein one-way key chain claims
For key chain commitment value.
3. the wireless sensor network security small data distribution method of lightweight according to claim 2, it is characterised in that step
In rapid B, described one-way key chain generation method is, using base station selected random number as the head node of one-way key chain, its
The mystery key on each key chain node afterwards crosses hash function by the mystery push-to on previous key chain node carries out Hash
And obtain, the length of one-way key chain can be arbitrary, but data that base station will be distributed no less than in network lifecycle
Item number.
4. the wireless sensor network security small data distribution method of lightweight according to claim 1, it is characterised in that institute
State second stage to comprise the following steps：
I, for each wheel data distribution, base station is using mystery key corresponding with the wheel distribution；
II, by the round for being set to the wheel on duty by turns of the data item wheel to be distributed；
III, wheel data item to be distributed and mystery key constitute a mystery with particular message；
Effectively answer adds packet header one legal packet of composition for IIII, the above-mentioned mystery with particular message and one；
One of them is effectively answered and refers to such a number, and it causes payload after Hash, some before Hash result
Position is zero, and zero digit is referred to as intensive parameter here.
5. the wireless sensor network security small data distribution method of lightweight according to claim 4, it is characterised in that
In step I, from the beginning of the key chain commitment value of one-way key chain, we start from scratch to the mystery key on one-way key chain is carried out
Numbering, when data distribution is carried out, according to current distribution round, we are using the mystery key that numbering is the round.
6. the wireless sensor network security small data distribution method of lightweight according to claim 4, it is characterised in that step
In rapid II, described data item includes on duty by turns, marking variable, version number and data；Wherein, duty roster shows that the distribution of data item is new
Old degree, marking variable unique mark variable to be updated, version number represent the newness degree of data item, and data are represented will divide
The data sent out.
7. the wireless sensor network security small data distribution method of lightweight according to claim 4, it is characterised in that step
Rapid payload described in IIII refers to the item being made up of mystery and the answer, and the value of intensive parameter is determined by base station.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310705568.9A CN103702325B (en) | 2013-12-19 | 2013-12-19 | Lightweight wireless sensor network safety small data distribution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310705568.9A CN103702325B (en) | 2013-12-19 | 2013-12-19 | Lightweight wireless sensor network safety small data distribution method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103702325A CN103702325A (en) | 2014-04-02 |
| CN103702325B true CN103702325B (en) | 2017-04-19 |
Family
ID=50363699
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310705568.9A Active CN103702325B (en) | 2013-12-19 | 2013-12-19 | Lightweight wireless sensor network safety small data distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103702325B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105141620A (en) * | 2015-09-16 | 2015-12-09 | 华东师范大学 | Small data distribution method enabling wireless sensor network security and denial of service attack defense |
| CN107294932B (en) * | 2016-04-12 | 2019-11-15 | 中国电信股份有限公司 | Method and server for centralized control type key management |
| CN105848150B (en) * | 2016-05-19 | 2019-07-26 | 华东师范大学 | A kind of wireless sensor network grouping small data safety distributing method |
| CN106792665A (en) * | 2016-12-19 | 2017-05-31 | 华东师范大学 | Wireless sensor network security small data distribution method based on short and small public-key cryptosystem |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101005459A (en) * | 2007-01-18 | 2007-07-25 | 西安电子科技大学 | Radio sensor access control method based on key chain |
| CN101044754A (en) * | 2004-11-12 | 2007-09-26 | 三星电子株式会社 | Method of managing user key for broadcast encryption |
| CN101742490A (en) * | 2009-12-02 | 2010-06-16 | 浙江大学 | Safe and effective method for dynamically updating wireless sensor network program |
| CN103368731A (en) * | 2013-07-23 | 2013-10-23 | 华南理工大学 | Wireless sensor network security data discovery and dissemination method based on Hash tree |
-
2013
- 2013-12-19 CN CN201310705568.9A patent/CN103702325B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101044754A (en) * | 2004-11-12 | 2007-09-26 | 三星电子株式会社 | Method of managing user key for broadcast encryption |
| CN101005459A (en) * | 2007-01-18 | 2007-07-25 | 西安电子科技大学 | Radio sensor access control method based on key chain |
| CN101742490A (en) * | 2009-12-02 | 2010-06-16 | 浙江大学 | Safe and effective method for dynamically updating wireless sensor network program |
| CN103368731A (en) * | 2013-07-23 | 2013-10-23 | 华南理工大学 | Wireless sensor network security data discovery and dissemination method based on Hash tree |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103702325A (en) | 2014-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Alladi et al. | SecAuthUAV: A novel authentication scheme for UAV-ground station and UAV-UAV communication | |
| CN105228157B (en) | A kind of wireless sensor network security light weight reprogramming method | |
| CN108075890A (en) | Data sending terminal, data receiver, data transmission method and system | |
| CN103702325B (en) | Lightweight wireless sensor network safety small data distribution method | |
| CN103079198B (en) | The key updating method and system of sensor node | |
| He et al. | Secure and distributed data discovery and dissemination in wireless sensor networks | |
| CN114157415A (en) | Data processing method, computing node, system, computer device and storage medium | |
| Lee et al. | Flexicast: Energy-efficient software integrity checks to build secure industrial wireless active sensor networks | |
| Mtetwa et al. | Secure firmware updates in the internet of things: A survey | |
| CN103368731B (en) | Wireless sensor network security data based on Hash tree find and transmission method | |
| CN101789939B (en) | Effective realization method for credible OpenSSH | |
| CN115001723B (en) | Group communication method and system based on tree structure and asymmetric key pool | |
| CN109474438A (en) | It is a kind of based on the intelligent terminal access authentication method selectively revealed | |
| CN105848150B (en) | A kind of wireless sensor network grouping small data safety distributing method | |
| CN101834852B (en) | Realization method of credible OpenSSH for protecting platform information | |
| CN106792665A (en) | Wireless sensor network security small data distribution method based on short and small public-key cryptosystem | |
| Ghormare et al. | Implementation of data confidentiality for providing high security in wireless sensor network | |
| Mtetwa et al. | OTA firmware updates for LoRaWAN using blockchain | |
| Sivaraman et al. | Broadcast secrecy via key-chain-based encryption in single-hop wireless sensor networks | |
| Bagheri et al. | Defending industry 4.0: an enhanced authentication scheme for IoT devices | |
| CN103686715B (en) | Lightweight secrete discovery and dissemination method for wireless body area network safety data | |
| Hu et al. | A Random Label and Lightweight Hash‐Based Security Authentication Mechanism for a UAV Swarm | |
| CN103823691B (en) | The online reprogramming method of wireless sensor network security based on network code | |
| CN105141620A (en) | Small data distribution method enabling wireless sensor network security and denial of service attack defense | |
| Liu et al. | A lightweight code-based authentication protocol for RFID systems |
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 |