CN108399051A - Wsn data storage mechanisms based on the excitation of block chain - Google Patents

Wsn data storage mechanisms based on the excitation of block chain Download PDF

Info

Publication number
CN108399051A
CN108399051A CN201810109708.9A CN201810109708A CN108399051A CN 108399051 A CN108399051 A CN 108399051A CN 201810109708 A CN201810109708 A CN 201810109708A CN 108399051 A CN108399051 A CN 108399051A
Authority
CN
China
Prior art keywords
data
node
block
data block
storage
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201810109708.9A
Other languages
Chinese (zh)
Other versions
CN108399051B (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.)
Daoyun Co.,Ltd.
Original Assignee
Nanjing University of Information Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Information Science and Technology filed Critical Nanjing University of Information Science and Technology
Priority to CN201810109708.9A priority Critical patent/CN108399051B/en
Publication of CN108399051A publication Critical patent/CN108399051A/en
Application granted granted Critical
Publication of CN108399051B publication Critical patent/CN108399051B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608—Saving storage space on storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • G06Q30/0214—Referral reward systems
    • 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)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Human Computer Interaction (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Game Theory and Decision Science (AREA)
  • Signal Processing (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses the wsn data storage mechanisms encouraged based on block chain, one group of data that the program stores sensor network nodes, regard a block in block chain as, hold (Provable Data Possession using provable data, PDP) mechanism carries out digging mine and the storage of new data block, it greatly reduces in traditional block chain using a large amount of computational problems caused by PoW mechanism, greatly reduces the consumption of electric energy.In addition, the present invention has stored data and new data block using order-preserving hash function comparison nodes, new data can be allowed to be stored in closest in the network node of data with existing, and only store different sub-blocks, so the memory space of network node can be greatlyd save, and Xi Tong Give give the digital cash reward of one unit of the node.

Description

Wsn data storage mechanisms based on the excitation of block chain
Technical field
The present invention relates to the wsn data storage mechanisms encouraged based on block chain, belong to computer science and technology field.
Background technology
Wireless sensor network (WSN) is a kind of distributed sensor, its tip is can to perceive and check outside The sensor node in the world.Sensor node in WSN wirelessly communicates, and network settings are flexible, and device location can be with It changes at any time, the connection of wired or wireless way can also be carried out with internet.It is in addition to the mobility, disconnected with wireless network Other than the common traits such as connecing property, also there are a lot of other salient features.
But all there is serious restriction in usual sensor node, lead in network bandwidth, the energy content of battery and memory space etc. Cause each node may be in order to retain and save the resource (such as electricity, memory space, CPU computing capabilitys etc.) of oneself, refusal carries For the services such as information forwarding and data storage.For this purpose, some sensor networks use integral incentive mechanism and are based on game theory (Zhide Chen, Yihui Qiu, Jingjing Liu, the Li Xu.Incentive mechanism for such as incentive mechanism Selfish nodes in wireless sensor networks based on evolutionary game, Computers and Mathematics with Applications, 62 (2011) 3378-3388. Liu Tao, Guan Yawen, bear Flame, a kind of trust management model with incentive mechanism in Huang Wenchao, the unattended WSN of Lu Qi Wei, Wuhan University Journal (reason Learn version), 2013, Vol.59, No.6,578-582).
Invention content
The incentive mechanism in wsn primarily focuses on information forwarding at present, lacks and the data of network node in wsn are stored Incentive mechanism.But the memory capacity of wireless sensor network node is limited, data storage capacities are also a kind of valuable source； For this purpose, present invention is specifically directed to the inspiration problems of data storage, and research is unfolded.
Technical solution is as follows：
Feature and advantage
The one group of data that sensor network nodes can be stored, regard a block in block chain as.The present invention uses can Prove that data hold (Provable Data Possession, PDP) mechanism to carry out digging mine and the storage of new data block.Because This system has stored data and new data block using order-preserving hash function comparison nodes, and new data can be allowed to be stored in closest to Have in the network node of data, and only stores different sub-blocks, so the memory space of network node can be greatlyd save, And Xi Tong Give give the digital cash reward of one unit of the node.
Wsn data storage mechanisms based on the excitation of block chain：Digital cash (bit coin is rewarded to the node of storage data Deng), the reward that the data Yue Duo Give of node storage give is more.
Sign flag is as follows：
If G, GTIt is the module and multiplicative group for being all q ranks, g and the generation member that u is G respectively.In group G, GTIn it is discrete right Number problem is difficult to resolve, and Bilinear map maps e：G×G→GTIt is the Bilinear map of a safety.
H is a hash function.The data block of storage is labeled as：M={ m1,m2,...,mn, every piece of PDP authenticators For：σ={ σ1,σ2,...,σn}；μ is examined integrated data block.H1It is an order-preserving hash function.
The build of each effective data block includes following content in this system：
(1) the Merkle tree roots of the data of notebook data block are integrated into：root；
(2) the hsah values of the build of previous data block；
(3) M is to need stored data block.
Specific method：
One new data block information to be stored is broadcasted in sensor network, and each network node is then to the data The PDP challenges of block are calculated, if the PDP is properly inspected, which is just stored by this node, the node Thus to obtain the reward of the storage data block, i.e., the digital cash of one unit.
It is specific as follows：
(1) new data to be stored block M={ m1,m2,...,mn, the public key of data publisher is (gx, U), private key x；H1It is an order-preserving hash function, data publisher calculates H1(M), and it is each sub-block miGenerate certification DeviceThe solicited message of storage data is broadcasted in sensor network.
(2) each network node is according to H1(M) value, searching and the immediate data block M ' of the value, calculate H1(M '), then Random number v is chosen for the sub-block i of data block Mi, note Q=(i, vi)；Network node H1(M ') and Q are sent to data hair Cloth person.
(3) data publisher receives H from each network node1(M '), and by they and H1(M) value is compared, finally Selection and H1(M) the immediate H of value1(M ') value, and remember and send the H1The network node of (M ') value is J node.Then according to from J The Q that node receives, is calculated as follows： Afterwards, (σ, μ) is sent to J node.
(4) after J node receives (σ, μ), whether true following formula is verified：Such as Fruit is set up, and data publisher is by data block M={ m1,m2,...,mnBe sent to network node J carry out storage , Bing Give gives J node The digital cash reward of one unit.
(5) by the property of order-preserving hash functions it is found that J node legacy data block contains and new data block M={ m1, m2,...,mnIdentical data, therefore it only needs to store and the different sub-block of legacy data.Therefore pass through this The storage mode of sample can greatly reduce required memory space.
Advantageous effect
The present invention is used rewards digital cash, the data Yue Duo Give of node storage to the network node for storing data in wsn The reward given is more.Second, the present invention holds technology to carry out digging mine and the storage of new data block using provable data, subtracts A large amount of computational problems caused by PoW mechanism are used in light traditional block chain；In addition, the present invention is come using order-preserving hash functions Comparison node has stored data and new data block, and new data can be allowed to be stored in closest in the network node of data with existing, and Different data are only stored, the memory space of network node has been saved, has been with a wide range of applications.
Specific implementation mode
(1) new data to be stored block M={ m1,m2,...,mn, the public key of data publisher is (gx, U), private key x；H1It is an order-preserving hash function, data publisher calculates H1(M), and it is each sub-block miGenerate certification DeviceThe solicited message of storage data is broadcasted in sensor network.
(2) each network node is according to H1(M) value, searching and the immediate data block M ' of the value, calculate H1(M '), then Random number v is chosen for the sub-block i of data block Mi, note Q=(i, vi)；Network node H1(M ') and Q are sent to data hair Cloth person.
(3) data publisher receives H from each network node1(M '), and by they and H1(M) value is compared, finally Selection and H1(M) the immediate H of value1(M ') value, and remember and send the H1The network node of (M ') value is J node.Then according to from J The Q that node receives, is calculated as follows： Afterwards, (σ, μ) is sent to J node.
(4) after J node receives (σ, μ), whether true following formula is verified：Such as Fruit is set up, and data publisher is by data block M={ m1,m2,...,mnBe sent to network node J carry out storage , Bing Give gives J node The digital cash reward of one unit.
(5) by the property of order-preserving hash functions it is found that J node legacy data block contains and new data block M={ m1, m2,...,mnIdentical data, therefore it only needs to store and the different sub-block of legacy data.Therefore pass through this The storage mode of sample can greatly reduce required memory space.
Sign flag is as follows：
If G, GTIt is the module and multiplicative group for being all q ranks, g and the generation member that u is G respectively.In group G, GTIn it is discrete right Number problem is difficult to resolve, and Bilinear map maps e：G×G→GTIt is the Bilinear map of a safety.
H is a hash function.The data block of storage is labeled as：M={ m1,m2,...,mn, every piece of PDP authenticators For：σ={ σ1,σ2,...,σn}；μ is examined integrated data block.H1It is an order-preserving hash function.

Claims (1)

1. the wsn data storage mechanisms based on the excitation of block chain, which is characterized in that the digital goods of node reward of storage data Coin, the reward that the data Yue Duo Give of node storage give are more；
If G, GTIt is the module and multiplicative group for being all q ranks, g and the generation member that u is G respectively；In group G, GTMiddle discrete logarithm problem It is difficult to resolve, Bilinear map maps e：G×G→GTIt is the Bilinear map of a safety；
H is a hash function；The data block of storage is labeled as：M={ m1,m2,...,mn, every piece of PDP authenticators are：σ= {σ1,σ2,...,σn}；μ is examined integrated data block；H1It is an order-preserving hash function；
The build of each effective data block includes following content：
(1) the Merkle tree roots of the data of notebook data block are integrated into：root；
(2) the hsah values of the build of previous data block；
(3) M is to need stored data block；
The specific method is as follows：
One new data block information to be stored is broadcasted in sensor network, and each network node is then to the data block Also thus PDP challenges are calculated, if the PDP is properly inspected, which is just stored by this node, and the node Obtain the reward for storing the data block, i.e., the digital cash of one unit；Steps are as follows：
The new data to be stored block M={ m of step 1) one1,m2,...,mn, the public key of data publisher is (gx, u), it is private Key is x；H1It is an order-preserving hash function, data publisher calculates H1(M), and it is each sub-block miGenerate authenticatorThe solicited message of storage data is broadcasted in sensor network；
The each network node of step 2) is according to H1(M) value, searching and the immediate data block M ' of the value, calculate H1(M '), then for The sub-block i of data block M chooses random number vi, note Q=(i, vi)；Network node H1(M ') and Q are sent to data publication Person；
Step 3) data publisher receives H from each network node1(M '), and by they and H1(M) value is compared, finally Selection and H1(M) the immediate H of value1(M ') value, and remember and send the H1The network node of (M ') value is J node；Then according to from J The Q that node receives, is calculated as follows： Afterwards, (σ, μ) is sent to J node；
After step 4) J node receives (σ, μ), whether true following formula is verified：Such as Fruit is set up, and data publisher is by data block M={ m1,m2,...,mnBe sent to network node J carry out storage , Bing Give gives J node The digital cash reward of one unit；
Step 5) is by the property of order-preserving hash functions it is found that J node legacy data block contains and new data block M={ m1, m2,...,mnIdentical data, therefore it only needs to store and the different sub-block of legacy data；Therefore pass through this The storage mode of sample can greatly reduce required memory space.
CN201810109708.9A 2018-02-05 2018-02-05 Wsn data storage method based on block chain excitation Active CN108399051B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810109708.9A CN108399051B (en) 2018-02-05 2018-02-05 Wsn data storage method based on block chain excitation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810109708.9A CN108399051B (en) 2018-02-05 2018-02-05 Wsn data storage method based on block chain excitation

Publications (2)

Publication Number Publication Date
CN108399051A true CN108399051A (en) 2018-08-14
CN108399051B CN108399051B (en) 2020-08-11

Family

ID=63096289

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810109708.9A Active CN108399051B (en) 2018-02-05 2018-02-05 Wsn data storage method based on block chain excitation

Country Status (1)

Country Link
CN (1) CN108399051B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109003003A (en) * 2018-09-03 2018-12-14 夸克链科技（深圳）有限公司 A kind of work quantity algorithm difficulty stacking method
CN109544158A (en) * 2018-11-02 2019-03-29 北京新唐思创教育科技有限公司 Block data processing method and computer storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JING ZOU 等: "Dynamic Provable Data Possession Based on Ranked Merkle Hash Tree", 《IEEE》 *
孟浩华 等: "一种基于Merkle-Tree 的云存储数据持有性检查方案", 《计算机与数字工程》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109003003A (en) * 2018-09-03 2018-12-14 夸克链科技（深圳）有限公司 A kind of work quantity algorithm difficulty stacking method
CN109544158A (en) * 2018-11-02 2019-03-29 北京新唐思创教育科技有限公司 Block data processing method and computer storage medium

Also Published As

Publication number Publication date
CN108399051B (en) 2020-08-11

Similar Documents

Publication Publication Date Title
US9569771B2 (en) Method and system for storage and retrieval of blockchain blocks using galois fields
Yang et al. Lightweight distributed secure data management system for health internet of things
US9361479B2 (en) Method and system for electronic content storage and retrieval using Galois fields and geometric shapes on cloud computing networks
Hsien et al. A Survey of Public Auditing for Secure Data Storage in Cloud Computing.
Kohli et al. An analysis of energy consumption and carbon footprints of cryptocurrencies and possible solutions
US9137250B2 (en) Method and system for electronic content storage and retrieval using galois fields and information entropy on cloud computing networks
US9037564B2 (en) Method and system for electronic content storage and retrieval with galois fields on cloud computing networks
CN105308897B (en) Method and apparatus for anonymity and authentic authentication in infiltration type social networking
CN111541666B (en) Certificateless cloud end data integrity auditing method with privacy protection function
CN108769111A (en) A kind of server connection method, computer readable storage medium and terminal device
RU2012107193A (en) DEVICE AND METHOD FOR MAINTAINING VEHICLE DATA INTEGRITY OF THE VEHICLE AND THE VEHICLE BLACK BOX SYSTEM WITH THEIR USE
CN103501352A (en) Cloud storage data security auditing method allowing group-user identity revocation
Xi et al. Privacy preserving shortest path routing with an application to navigation
US20190288848A1 (en) Cryptographic hash generation system
CN108399051A (en) Wsn data storage mechanisms based on the excitation of block chain
Pereira et al. Shorter hash-based signatures
CN114640444B (en) Privacy protection set intersection acquisition method and device based on domestic cryptographic algorithm
WO2017049790A1 (en) Online/offline signature system and method based on multivariate cryptography
CN105515778A (en) Cloud storage data integrity service signature method
CN114338025A (en) Ciphertext equivalence testing method in cloud environment
Khor et al. Public Blockchain-Based Data Integrity Verification for Low-Power IoT Devices
US20150071435A1 (en) Identity based encryption
CN107086917A (en) The encryption method that a kind of parallelization and structuring public key can search for
CN112468521B (en) Data processing method and device based on privacy protection and server
WO2019105164A1 (en) Online and offline circulating unbalanced oil and vinegar signature method

Legal Events

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

Effective date of registration: 20211104

Address after: No.15, 1st floor, building 25, 360 Huayang Nanhu Avenue, Tianfu New District, Chengdu, Sichuan 610000

Patentee after: Daoyun Co.,Ltd.

Address before: 210044 No. 219 Ningliu Road, Nanjing City, Jiangsu Province

Patentee before: NANJING University OF INFORMATION SCIENCE & TECHNOLOGY

TR01 Transfer of patent right