CN106714088B - Continuous data aggregation method facing privacy protection in sensor network - Google Patents

Continuous data aggregation method facing privacy protection in sensor network Download PDF

Info

Publication number
CN106714088B
CN106714088B CN201710026199.9A CN201710026199A CN106714088B CN 106714088 B CN106714088 B CN 106714088B CN 201710026199 A CN201710026199 A CN 201710026199A CN 106714088 B CN106714088 B CN 106714088B
Authority
CN
China
Prior art keywords
node
data
aggregation
nodes
slice
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
Application number
CN201710026199.9A
Other languages
Chinese (zh)
Other versions
CN106714088A (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.)
Anhui Normal University
Original Assignee
Anhui Normal 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 Anhui Normal University filed Critical Anhui Normal University
Priority to CN201710026199.9A priority Critical patent/CN106714088B/en
Publication of CN106714088A publication Critical patent/CN106714088A/en
Application granted granted Critical
Publication of CN106714088B publication Critical patent/CN106714088B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/02—Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
    • 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • 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 Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

本发明公开了一种无线传感器网络中面向隐私保护的连续数据聚集方法。现有的隐私保护的数据聚集算法主要聚焦于快照聚集，而快照聚集算法的通信量和能耗不适合直接应用于连续的数据聚集。本发明利用感知数据的时间相关性，通过设置阈值来确定节点是否传输当前感知数据，从而有效地减少数据通信量。针对过多加解密计算造成节点计算能耗较大的问题，该发明通过在传输的感知数据上添加随机数来保证数据的隐私性，避免节点之间在数据传输过程中需要对感知数据进行加解密操，节约了节点的计算能耗，很好地延长了网络寿命.本发明在保证感知数据隐私性的情况下，有效地降低了通信和计算能耗，并具有良好的网络扩展性。

Figure 201710026199

The invention discloses a privacy protection-oriented continuous data aggregation method in a wireless sensor network. Existing privacy-preserving data aggregation algorithms mainly focus on snapshot aggregation, and the traffic and energy consumption of snapshot aggregation algorithms are not suitable for direct application to continuous data aggregation. The present invention utilizes the time correlation of the sensing data, and determines whether the node transmits the current sensing data by setting a threshold, thereby effectively reducing the data traffic. Aiming at the problem of large computing energy consumption of nodes caused by too many encryption and decryption calculations, the invention ensures the privacy of the data by adding random numbers to the transmitted sensing data, and avoids the need to encrypt and decrypt the sensing data between nodes during the data transmission process. The operation saves the computing energy consumption of the node and prolongs the network life well. The present invention effectively reduces the communication and computing energy consumption under the condition of ensuring the privacy of the perceived data, and has good network expansibility.

Figure 201710026199

Description

Continuous data aggregation method facing privacy protection in sensor network
Technical Field
The invention relates to the technical field of wireless sensor network security, in particular to a privacy protection oriented continuous data aggregation method in a sensor network.
Background
Since the sensor nodes are very limited in energy, calculation and storage capacity, especially are powered by batteries, and are difficult to replace, saving energy consumption and prolonging the service life of the network are important challenges for wireless sensor network research. Because the energy consumption for transmitting 1bit data is far higher than that of 1 instruction, the key point is to reduce the communication traffic to save the energy consumption, and the data aggregation technology is one of the main technologies for reducing the communication traffic of the wireless sensor network. Meanwhile, the wireless sensor network is generally deployed in the field and transmits data in a multi-hop and wireless manner, so that the network faces serious security problems, and the privacy of sensing data cannot be sacrificed while the communication traffic is reduced by a data aggregation technology.
At present, a data aggregation method based on privacy protection in an existing wireless sensor network mainly focuses on snapshot data aggregation, and in a real application scenario, a user may need to obtain a series of continuous data aggregation results for analysis and application. The existing snapshot data aggregation method is continuously executed to obtain continuous data aggregation results, which is inefficient in terms of data privacy and energy consumption, and a targeted research on an application scenario of continuous data aggregation based on privacy protection in a wireless sensor network is needed.
In addition, the existing privacy-preserving data aggregation method generally guarantees the privacy of data through an encryption technology, so that a large number of encryption and decryption operations are required in the data aggregation process, thereby causing serious delay and operation energy consumption. One solution proposed at present is to share a random number between a Sink node and all sensor nodes, and avoid encryption and decryption operations in an aggregation process by adding the random number to sensing data, because in a data aggregation process, there may be some nodes that do not complete data transmission, and the Sink node is difficult to track to these nodes, a final aggregation result may generate a large deviation due to subtraction of an additional random number, and the method is a snapshot data aggregation.
Disclosure of Invention
In order to overcome the defects of the existing method, the invention provides a privacy protection-oriented continuous data aggregation method in a sensor network, and the method can continuously obtain an accurate data aggregation result on the basis of ensuring the privacy of node sensing data. Meanwhile, the method can effectively reduce the data transmission amount by using the time correlation of the sensing data, and avoids the encryption and decryption operation required in the data gathering process by constructing the shared secret random number between the neighbor nodes and carrying out the fragment recombination operation on the leaf node data, so that the communication energy consumption and the operation energy consumption are lower, the life cycle of the network is prolonged, and the method has better network expansibility.
In order to solve the technical problems, the invention adopts the technical scheme that: a continuous data gathering method facing privacy protection in a wireless sensor network reduces data transmission quantity by using time correlation of sensing data, and reduces encryption and decryption operations in a data gathering process by constructing shared secret random numbers between neighbor nodes and carrying out fragment recombination operation on leaf node data. The method comprises the following steps: an initialization stage: carrying out key pre-distribution on each sensor node, constructing a shared secret random number between adjacent nodes, and establishing a safe link node list; a network topology structure construction stage: the wireless sensor network is constructed into a tree-shaped topological structure, the tree-shaped topological structure is that a focusing tree comprises a Sink node, a middle node and leaf nodes, wherein the Sink node is a root node, and a father node and a son node have shared secret random numbers. Perception data slicing and recombining stage: determining whether the current sensing data is subjected to slicing operation and transmission by setting a threshold delta, when the variation of the sensing data value exceeds the threshold delta, the leaf nodes need to slice and transmit the sensing data, otherwise, the sensing data is not processed; and the node recombines the received fragment data and transmits the recombined result to the father node. Successive data aggregation stages: after receiving the child node recombination value/aggregation value, the intermediate node performs aggregation operation on the perception data including the intermediate node, transmits the operation result to the father node until the Sink node obtains a final aggregation result, completes data aggregation once at each time step, and continuously executes the data aggregation, so that the Sink node continuously obtains the final aggregation result.
Further, in the initialization phase, the method for constructing the shared secret random number between the neighbor nodes comprises the following steps:
step 1.1, two neighbor nodes ni and nj determine whether at least one shared secret key exists through mutual information, if so, the following steps are executed; step 1.2 node niGenerating a random number rijBy means of a shared key pair rijEncrypted and transmitted to node nj(ii) a Step 1.3 node njDecrypting the ciphertext by using the shared secret key to obtain the random number rij，rijI.e. a secret random number shared by two neighboring nodes.
Further, the network topology construction phase comprises the following steps:
step 2.1, the Sink node sends a broadcast message 'Child' and a hop count hop value 0 to a neighbor node; step 2.2 node niReceiving node njSent message 'Child' and hop value hjThen, if node niWithout a parent node and with a shared secret random number between the two nodes, node niNode njSet as the parent node, set hi＝hj+1, and to node njSending a 'Parent' message; step 2.3 determining node n of the parent nodeiAnd continuing to send 'Child' messages outwards until the nodes in the whole network have father nodes, and finishing the construction of the aggregation tree.
Further, the perceptual data slicing and recombining stage comprises the following steps: step 3.1 leaf node niAt time step tkObtaining perception data, performing difference operation on the perception data and a base number value, and executing a step 3.2 when an absolute value of a difference value is within a threshold value delta range, or executing a step 3.4; step 3.2, the leaf node does not process the sensing data and broadcasts a mark signal to the neighbor node; step 3.3 neighbor node receives leaf node niBroadcast the flag signal, then consider node niAt time step tkSensing the data within the threshold range, and receiving the node n most recentlyiThe slice value is taken as the current slice value and then is recombined, and the step 3.6 is executed; 3.4, the leaf node slices the sensing data and transmits the sliced data to a neighbor node with a secret random number; step 3.5, the node receives the slice data and carries out recombination operation on the received slice data and the reserved slice data; and 3.6, uploading the recombination result to the father node by the node.
Further, the step 3.4 and the step 3.5 are realized by the following steps: step a, randomly cutting data into J pieces of data, adding secret random number and transmitting to neighbor nodes of a secure link, wherein leaf nodes niTransmitting slice data to neighbor node njI.e. by
Figure GDA0002276331750000031
Wherein r isijSharing a secret random number for two nodes, R ═ RdN is the aggregation result range, RdFor the perceptual data range, N is the number of nodes,
Figure GDA0002276331750000032
slicing data for nodes at a first time stepj(ii) a Step b, waiting for delta t time to ensure that the slice data is received by the neighbor node; step c, each node niIf a leaf node n is receivedjThe slice data is recombined and node n is setjSlice base number of
Figure GDA00022763317500000311
Further, at a first time step t1Leaf node niPerceiving data
Figure GDA0002276331750000033
Setting a base value
Figure GDA0002276331750000034
At time step tkEach leaf node niPerceiving data
Figure GDA0002276331750000035
If it is not
Figure GDA0002276331750000036
Then set the base value
Figure GDA0002276331750000037
Further, the continuous data aggregation phase comprises the steps of: step 4.1, the leaf node transmits the recombination value to the father node;
step 4.2, after receiving all the data/aggregation results of the child nodes, the intermediate node performs aggregation operation on the data and transmits the aggregation results to the father node; 4.3, the intermediate nodes transmit the aggregation results upwards layer by layer along the aggregation tree, and finally reach the Sink node, and the Sink node obtains the final aggregation result of the current time step; and 4.4, after completing one round of data aggregation, if an aggregation result needs to be continuously obtained, performing the next round of data aggregation, otherwise, ending the method.
The method has the advantages that 1) the method utilizes the characteristic that the sensing data has time correlation to filter the sensing data, effectively reduces data communication traffic and saves communication energy consumption under the condition of ensuring the accuracy of an aggregation result, N is set as the total number of nodes, the proportion occupied by leaf nodes is α, only when the difference value of the sensing data and the base number exceeds a threshold value delta, the nodes slice and transmit the sensing data, otherwise, a non-transmission data flag signal (1bit) is broadcasted to a neighbor node, the probability that the sensing number changes within the range of the threshold value delta is set as β, the digits of the transmission data are all bits of the transmission data
Figure GDA0002276331750000038
The traffic for continuously performing the gamma data aggregation is
Figure GDA0002276331750000039
The energy consumption of the node for transmitting and receiving the 1bit is e respectivelyTAnd eRThe method in generalEnergy consumption of communication is
Figure GDA00022763317500000310
2) By setting the shared secret random number, the neighbor node does not need to encrypt and decrypt data in the data transmission process under the condition of ensuring the privacy of the perception data, so that the calculation energy consumption is saved;
3) the leaf nodes slice the sensing data, so that the sensing data can be prevented from eavesdropping attack and internal attack, and the method has higher data privacy;
4) the invention has better network expansibility because the common information is deployed in advance among the sensor nodes.
Drawings
The contents of the drawings and the reference numerals in the drawings are briefly described as follows:
FIG. 1 is a schematic diagram of a sensor network according to the present invention;
FIG. 2 is a schematic diagram of a continuous data aggregation process for privacy protection in a sensor network according to the present invention;
FIG. 3 is a schematic diagram of a process for executing the data slicing and reassembling stages according to the present invention;
FIG. 4 is a diagram of an example of data fragmentation and reassembly in accordance with the present invention;
FIG. 5 is a diagram of an example of data aggregation in the present invention.
Detailed Description
The following description of the embodiments with reference to the drawings is provided to describe the embodiments of the present invention, and the embodiments of the present invention, such as the shapes and configurations of the components, the mutual positions and connection relationships of the components, the functions and working principles of the components, the manufacturing processes and the operation and use methods, etc., will be further described in detail to help those skilled in the art to more completely, accurately and deeply understand the inventive concept and technical solutions of the present invention.
The method and the device realize the filtration of the perception data based on the time correlation of the perception data, and effectively reduce the data transmission amount under the condition of ensuring the accuracy of the gathering result; by using the shared secret random number and the slicing technology, the eavesdropping attack prevention is realized by adding the secret random number into the data, and the internal attack can be prevented by the slicing technology. As shown in fig. 2, the continuous data aggregation method includes an initialization phase, a network topology construction phase, a slicing and restructuring phase, and continuous data aggregation.
An initialization stage: the method comprises the following steps of pre-distributing keys to sensor nodes, constructing shared secret random numbers between neighbor nodes with the same key, generating a safe link node list by each node, and maintaining information such as physical positions of the nodes in the list, wherein the method mainly comprises the following steps:
step 1.1, the management system generates a large key pool with K keys;
step 1.2 Each sensor node niRandomly extracting k keys from a large key pool;
step 1.3 Each node niWith its neighbor node njMutual information determination whether to have at least one identical key kijIf yes, executing step 1.4, otherwise, not executing;
step 1.4 node niGenerating a random number rijBy means of a secret key kijFor random number rijEncrypted and transmitted to a neighbor node nj；
Step 1.5 node njBy means of a secret key kijDecrypting the ciphertext to obtain the random number rijAnd r isij＝rji；
Step 1.6 node niNode njAdd to secure Link node List SiIn the same way, node njNode niAdd to secure Link node List SjPerforming the following steps;
a network topology structure construction stage: the wireless sensor network constructs an aggregation tree, wherein a Sink node is a root node, and the construction process comprises the following steps:
step 2.1, the Sink node sends a broadcast message 'Child' and a hop count hop value 0 to a neighbor node;
step 2.2 sectionPoint niReceiving node njSent message 'Child' and hop value hjThen, if node niWithout a parent node and with a shared secret random number between the two nodes, node niNode njSet as the parent node, set hi＝hj+1, and to node njSending a 'Parent' message;
step 2.3 determining node h of the parent nodeiAnd continuing to send 'Child' messages outwards until the nodes in the whole network have father nodes, and finishing the construction of the aggregation tree.
Slicing and recombining: the method comprises the steps of filtering transmitted data by utilizing the time correlation of sensing data to reduce the data transmission quantity, ensuring the security of the sensing data by sharing a secret random number and a slicing technology, setting a threshold delta according to the time correlation of the data, namely the characteristic that the variation of the sensing data is small in the similar time, and slicing and transmitting the sensing data only when the difference value between the sensing data and a base value exceeds the threshold delta, so that the transmission quantity can be effectively reduced.
As shown in fig. 3, the main implementation processes of this stage are:
step 3.1, setting a threshold value delta to determine whether the sensing data needs to be transmitted in a slicing mode, and setting a waiting time delta t to ensure that all slicing data are received;
step 3.2 at the 1 st time step t1Each node niThe following work is completed:
(a) leaf node niPerceiving data
Figure GDA0002276331750000051
Setting a base value
Figure GDA0002276331750000052
(b) For data diAnd randomly cutting the data into J pieces of data, adding a secret random number and transmitting the secret random number to the neighbor node of the secure link. Example (b)E.g. leaf node niTransmitting slice data to neighbor node njI.e. by
Figure GDA0002276331750000053
rijSharing a secret random number for two nodes, R ═ RdN is the aggregation result range, where RdFor the perceptual data range, N is the number of nodes;
(c) waiting for delta t time to ensure that the slice data is received by the neighbor node;
(d) each node niIf a leaf node n is receivedjThe slice data is recombined and node n is setjSlice base number of
Figure GDA0002276331750000054
Step 3.3 complete a cycle at each time step, at time step tkNode niThe following work is completed:
(a) each leaf node niPerceiving data
Figure GDA0002276331750000055
If it is not
Figure GDA0002276331750000056
Then set the base value
Figure GDA0002276331750000057
And performing slicing operation and transmission, otherwise, node niBroadcasting flag information (sensing data within a threshold value delta) to neighbor nodes;
(b) wait for delta t time
(c) Each node niIf a leaf node n is receivedjPerforming the step (d) if the number of slices is less than the number of slices, and performing the step (e) if the flag information is received;
(d) node niFor slice data
Figure GDA0002276331750000058
Performing a reconfiguration operation and reconfiguring the node njSlice base number of
Figure GDA0002276331750000059
(e) The marking information indicates the leaf node njThe difference value of the sensing data and the base number is within a threshold value range, and the node niFor slice data
Figure GDA00022763317500000510
Carrying out a recombination operation in which
Figure GDA00022763317500000511
Is a node njThe slice number base value of (a);
step 3.4 node niObtaining a recombination result, if data aggregation is continuously executed, the time step is tk+1And returns to perform step 3.3, otherwise the operation ends.
Continuous data aggregation: the nodes continuously transmit data upwards along the aggregation number, the Sink node continuously obtains a final aggregation result, data aggregation is completed once in each time step, and each data aggregation mainly comprises the following execution processes:
step 4.1 leaf node niThe recombination value viTo the parent node njI.e. ni→nj:vi+rijMOD r；
Step 4.2 intermediate node niAfter all the child node recombined data are received, the data are aggregated, and the aggregation result is transmitted to the father node njFIG. 5 shows a schematic diagram of the node n in FIG. 12Instances of data aggregation are performed;
and 4.3, transmitting the aggregation result upwards by the intermediate nodes layer by layer along the aggregation tree, and finally reaching the Sink node, wherein the Sink node obtains the final aggregation result of the current time step.
The invention has been described above with reference to the accompanying drawings, it is obvious that the invention is not limited to the specific implementation in the above-described manner, and it is within the scope of the invention to apply the inventive concept and solution to other applications without substantial modification. The protection scope of the present invention shall be subject to the protection scope defined by the claims.

Claims (7)

1.一种无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于,该方法利用感知数据的时间相关性减少数据传输量，通过在邻居节点之间构建共享秘密随机数以及对叶子节点数据进行分片重组操作，减少数据聚集过程中的加解密操作；1. a privacy-oriented continuous data aggregation method in a wireless sensor network, is characterized in that, the method utilizes the time correlation of perception data to reduce the amount of data transmission, by constructing shared secret random numbers between neighbor nodes and to leaf nodes. The data is sharded and reorganized to reduce the encryption and decryption operations in the process of data aggregation; 该方法包括：The method includes: 初始化阶段：对每个传感器节点进行密钥预分配，邻居节点之间构建共享秘密随机数，同时建立安全链路节点列表；Initialization stage: pre-distribute the key to each sensor node, build a shared secret random number between neighbor nodes, and establish a list of secure link nodes; 网络拓扑结构构建阶段：将无线传感器网络构建成树形拓扑结构，树形拓扑结构为聚焦树包括Sink节点、中间节点和叶子节点，其中Sink节点为根节点，父节点和子节点有共享秘密随机数；Network topology construction stage: the wireless sensor network is constructed into a tree topology. The tree topology is a focused tree including sink nodes, intermediate nodes and leaf nodes. The sink node is the root node, and the parent node and child node have shared secret random numbers. ; 感知数据切片及重组阶段：通过设置阈值δ确定当前感知数据是否进行切片操作并传输，当感知数据值变化超过阈值δ时，叶子结点需要对感知数据进行切片和传输，否则不处理；节点将接收到的分片数据进行重组，再将重组的结果传输给父节点；Sensing data slicing and reorganization stage: Determine whether the current sensing data is sliced and transmitted by setting the threshold δ. When the sensing data value changes beyond the threshold δ, the leaf node needs to slice and transmit the sensing data, otherwise it will not be processed; the node will The received fragmented data is reorganized, and the result of the reorganization is transmitted to the parent node; 连续的数据聚集阶段：中间节点在接收子节点重组值/聚集值后，对包括自身的感知数据进行聚集操作，并将操作结果传输给父节点，直至Sink节点得到最终的聚集结果，每个时间步完成一次数据聚集，连续执行，从而Sink节点连续得到最终的聚集结果。Continuous data aggregation stage: After receiving the reorganization value/aggregation value of the child node, the intermediate node performs the aggregation operation on the perception data including itself, and transmits the operation result to the parent node until the sink node obtains the final aggregation result. Complete a data aggregation step by step and execute it continuously, so that the sink node continuously obtains the final aggregation result. 2.根据权利要求1所述的无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于，初始化阶段，邻居节点之间构建共享秘密随机数的包括以下步骤：2. The continuous data aggregation method for privacy protection in the wireless sensor network according to claim 1, is characterized in that, in the initialization stage, constructing the shared secret random number between neighbor nodes comprises the following steps: 步骤1.1两邻居节点ni和nj通过互发信息确定是否至少有一个共享的密钥，如果有则执行以下步骤；Step 1.1 Two neighbor nodes n i and n j determine whether there is at least one shared key by sending information to each other, and if so, perform the following steps; 步骤1.2节点ni产生一个随机数rij，通过共享的密钥对rij加密，并传输给节点nj；Step 1.2 Node n i generates a random number r ij , encrypts r ij with the shared key, and transmits it to node n j ; 步骤1.3节点nj利用共享的密钥对密文解密，得到随机数rij，rij即为两邻居节点共享的秘密随机数。Step 1.3 Node n j uses the shared key to decrypt the ciphertext to obtain a random number r ij , where r ij is the secret random number shared by the two neighbor nodes. 3.根据权利要求1所述的无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于，所述网络拓扑结构构建阶段包括以下步骤：3. The privacy protection-oriented continuous data aggregation method in the wireless sensor network according to claim 1, wherein the network topology construction stage comprises the following steps: 步骤2.1Sink节点向其邻居节点发送广播消息“Child”以及跳数hop值0；Step 2.1 The sink node sends a broadcast message "Child" and a hop value of 0 to its neighbor nodes; 步骤2.2节点ni收到节点nj发送的消息“Child”和hop值hj后，如果节点ni没有父节点，且两节点之间有共享的秘密随机数，则节点ni将节点nj设为父节点，设置hi＝hj+1，并向节点nj发送“Parent”消息；Step 2.2 After node n i receives the message "Child" and hop value h j sent by node n j , if node n i has no parent node and there is a shared secret random number between the two nodes, then node n i will send node n j is set as the parent node, set h i =h j +1, and send a "Parent" message to node n j ; 步骤2.3确定父节点的节点ni继续向外发送“Child”消息，直到整个网络内节点都有父节点，聚集树构造完成。In step 2.3, the node n i that determines the parent node continues to send the "Child" message to the outside, until the entire network has a parent node, and the aggregation tree construction is completed. 4.根据权利要求1所述的无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于，感知数据切片及重组阶段包括以下步骤：4. The continuous data aggregation method for privacy protection in the wireless sensor network according to claim 1, is characterized in that, sensing data slice and reorganization stage comprises the following steps: 步骤3.1叶子节点ni在时间步tk得到感知数据，并对感知数据与基数值进行差运算，当差值绝对值在阈值δ范围内，则执行步骤3.2，否则执行步骤3.4；Step 3.1 The leaf node n i obtains the sensing data at time step t k , and performs a difference operation between the sensing data and the base value. When the absolute value of the difference is within the threshold value δ, step 3.2 is performed, otherwise, step 3.4 is performed; 步骤3.2叶子节点对该感知数据不进行任何处理，并向邻居节点广播标志信号；Step 3.2 The leaf node does not perform any processing on the sensing data, and broadcasts the flag signal to the neighbor nodes; 步骤3.3邻居节点收到叶子结点ni广播标志信号，则认为节点ni在时间步tk感知到的数据在阈值范围内，将最近收到的节点ni切片值作为当前切片值再进行重组处理，执行步骤3.6；Step 3.3 When the neighbor node receives the broadcast flag signal of the leaf node n i , it is considered that the data perceived by the node n i at the time step t k is within the threshold range, and the recently received node n i slice value is used as the current slice value. For reorganization processing, perform step 3.6; 步骤3.4叶子节点对感知数据切片，并将切片数据传输给具有秘密随机数的邻居节点；Step 3.4 The leaf node slices the sensing data, and transmits the sliced data to the neighbor node with the secret random number; 步骤3.5节点接收切片数据，对接收到的切片数据和保留的自身切片数据进行重组操作；Step 3.5 The node receives the slice data, and performs a reorganization operation on the received slice data and the retained self-slice data; 步骤3.6节点将重组结果上传给父节点。Step 3.6 The node uploads the reorganization result to the parent node. 5.根据权利要求4所述的无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于，所述步骤3.4和步骤3.5通过以下步骤实现：5. The privacy protection-oriented continuous data aggregation method in the wireless sensor network according to claim 4, wherein the step 3.4 and the step 3.5 are realized by the following steps: 步骤a，对数据进行随机切分成J片数据，并添加秘密随机数再传输给安全链路邻居节点，叶子节点ni将切片数据传输给邻居节点nj，即
Figure FDA0002276331740000021
MOD r，其中，rij为两节点共享秘密随机数，r＝Rd*N为聚集结果范围，Rd为感知数据范围，N为节点数，
Figure FDA0002276331740000022
为在第一时间步节点的切片数据；In step a, the data is randomly divided into J pieces of data, and the secret random number is added and then transmitted to the neighbor node of the security link, and the leaf node n i transmits the slice data to the neighbor node n j , that is,
Figure FDA0002276331740000021
MOD r, where r ij is the secret random number shared by the two nodes, r=R d *N is the range of aggregation results, R d is the range of perception data, N is the number of nodes,
Figure FDA0002276331740000022
is the slice data of the node at the first time step; 步骤b，等待Δt时间以保证切片数据被邻居节点接收到；Step b, wait for Δt time to ensure that the slice data is received by neighbor nodes; 步骤c，每个节点ni如果接收到叶子节点nj的切片数据则进行重组操作，并设置节点nj的切片基数值
Figure FDA0002276331740000023
In step c, if each node n i receives the slice data of the leaf node n j , it performs a reorganization operation, and sets the slice cardinality value of the node n j
Figure FDA0002276331740000023
 6.根据权利要求4所述的无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于，在第一个时间步t1，叶子节点ni感知到数据
Figure FDA0002276331740000024
设置基数值
Figure FDA0002276331740000025
在时间步tk,每个叶子节点ni感知到数据
Figure FDA0002276331740000026
如果
Figure FDA0002276331740000027
则设置基数值
Figure FDA0002276331740000028
6. The privacy protection-oriented continuous data aggregation method in the wireless sensor network according to claim 4, wherein at the first time step t 1 , the leaf node n i perceives the data
Figure FDA0002276331740000024
set base value
Figure FDA0002276331740000025
At time step t k , each leaf node ni perceives the data
Figure FDA0002276331740000026
if
Figure FDA0002276331740000027
then set the base value
Figure FDA0002276331740000028
 7.根据权利要求1所述的无线传感器网络中面向隐私保护的连续数据聚集方法，其特征在于，连续的数据聚集阶段包括以下步骤：7. The continuous data aggregation method for privacy protection in the wireless sensor network according to claim 1, wherein the continuous data aggregation stage comprises the following steps: 步骤4.1叶子节点将重组值传输给父节点；Step 4.1 The leaf node transmits the reorganization value to the parent node; 步骤4.2中间节点收到所有子节点重组数据/聚集结果后，对这些数据进行聚集操作，并将聚集结果传输给父节点；Step 4.2 After receiving the reorganization data/aggregation results of all child nodes, the intermediate node performs an aggregation operation on these data, and transmits the aggregation results to the parent node; 步骤4.3沿着聚集树，中间节点层层将聚集结果向上传输，最终到达Sink节点，Sink节点得到当前时间步的最终聚集结果；Step 4.3 Along the aggregation tree, the intermediate nodes transmit the aggregation results up layer by layer, and finally reach the sink node, and the sink node obtains the final aggregation result of the current time step; 步骤4.4完成一轮数据聚集后，如果需要继续获得聚集结果则进行下一轮数据聚集，否则方法结束。Step 4.4 After a round of data aggregation is completed, if it is necessary to continue to obtain aggregation results, the next round of data aggregation is performed, otherwise the method ends.
CN201710026199.9A 2017-01-13 2017-01-13 Continuous data aggregation method facing privacy protection in sensor network Active CN106714088B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710026199.9A CN106714088B (en) 2017-01-13 2017-01-13 Continuous data aggregation method facing privacy protection in sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710026199.9A CN106714088B (en) 2017-01-13 2017-01-13 Continuous data aggregation method facing privacy protection in sensor network

Publications (2)

Publication Number Publication Date
CN106714088A CN106714088A (en) 2017-05-24
CN106714088B true CN106714088B (en) 2020-03-24

Family

ID=58908472

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710026199.9A Active CN106714088B (en) 2017-01-13 2017-01-13 Continuous data aggregation method facing privacy protection in sensor network

Country Status (1)

Country Link
CN (1) CN106714088B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108152577A (en) * 2017-10-18 2018-06-12 广东科学技术职业学院 A kind of point-to-point intelligent metering method
CN109194748B (en) * 2018-09-10 2021-03-23 上海微波技术研究所（中国电子科技集团公司第五十研究所） Method for reducing network overhead by caching communication information of Internet of things and readable storage medium
CN109548014B (en) * 2018-12-17 2022-04-15 杭州职业技术学院 A low-energy privacy-preserving aggregation method based on mobile aggregators
CN112492549A (en) * 2019-09-11 2021-03-12 中兴通讯股份有限公司 Data transmission method, device, terminal equipment and storage medium
CN113507076A (en) * 2021-07-14 2021-10-15 镇江市美盛母线有限公司 Bus duct remote temperature and humidity real-time measurement, feedback and control system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105263138A (en) * 2015-10-30 2016-01-20 中国船舶重工集团公司第七一六研究所 Sensor original data privacy protection method supporting sensor network data aggregation
CN105652089A (en) * 2015-12-29 2016-06-08 中国电子科技集团公司第十八研究所 Device and method for measuring insulation resistance of dry battery core

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105263138A (en) * 2015-10-30 2016-01-20 中国船舶重工集团公司第七一六研究所 Sensor original data privacy protection method supporting sensor network data aggregation
CN105652089A (en) * 2015-12-29 2016-06-08 中国电子科技集团公司第十八研究所 Device and method for measuring insulation resistance of dry battery core

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Adam Silberstein等.Constraint Chaining: On Energy--Efficient Continuous Monitoring in Sensor Networks.《SIGMOD》.2006, *
PDA: Privacy-Preserving Data Aggregation for Information Collection;WENBO HE等;《ACM Transactions on Sensor Networks》;20110831;第8卷(第1期);全文 *
无线传感器网络中安全高效的空间数据聚集算法;王涛春等;《软件学报》;20140831;第25卷(第8期);第1-3节 *
无线传感器网络数据隐私保护技术;范永健等;《计算机学报》;20120630;第35卷(第6期);第2-8节 *

Also Published As

Publication number Publication date
CN106714088A (en) 2017-05-24

Similar Documents

Publication Publication Date Title
CN106714088B (en) Continuous data aggregation method facing privacy protection in sensor network
Hu et al. A novel energy-efficient and privacy-preserving data aggregation for WSNs
CN103023653B (en) The Internet of Things Secure Group Communication method and device of low-power consumption
CN102833740B (en) Privacy protection method during data aggregation of wireless sensor network
Grover et al. A survey of broadcast authentication schemes for wireless networks
US20140317406A1 (en) Communication between network nodes that are not directly connected
CN103731825B (en) Bridge-type-based wireless sensing network key management scheme
CN107318109A (en) A kind of secure data fusion method based on dynamic partition technology
CN104735654A (en) Private data fusing method capable of detecting data integrity
CN106059774A (en) Data slice mixture privacy protection method based on cluster
CN101594271B (en) Wireless self-organization network establishing and operating method as well as related networks and devices thereof
CN103929744A (en) A wireless sensor network key management method
CN100594691C (en) Data Transfer Encryption Method in MANET Network
CN102123393A (en) Secret key management method for distributed wireless sensor network based on one-way function
CN106851630B (en) A kind of safe ad-hoc network single path routing data transmission method
CN106961660B (en) Method for collecting continuous data capable of being verified safely in sensor network
Kifayat et al. Group based secure communication for large-scale wireless sensor networks
Kurmi et al. An approach for data aggregation strategy in wireless sensor network using MAC authentication
Sugandhi et al. Analysis of Various Deterioration Factors of Data Aggregation in Wireless Sensor Networks
Nanda et al. Secure-GLOR: An adaptive secure routing protocol for dynamic wireless mesh networks
Suraci et al. Enhance the protection of transmitted data in 5G D2D communications through the Social Internet of Things
Shibu et al. Random bit extraction for secret key generation in MANETs
Gupta et al. A confidentiality scheme for energy efficient leach protocol using homomorphic encryption
Agrawal et al. Enhancing the security in WSN using three tier security architecture
Abdulkafı et al. Security Improvements of Internet of Things Systems

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant