CN111988131B - Block chain construction method facing mobile crowd sensing - Google Patents
Block chain construction method facing mobile crowd sensing Download PDFInfo
- Publication number
- CN111988131B CN111988131B CN202010900064.2A CN202010900064A CN111988131B CN 111988131 B CN111988131 B CN 111988131B CN 202010900064 A CN202010900064 A CN 202010900064A CN 111988131 B CN111988131 B CN 111988131B
- Authority
- CN
- China
- Prior art keywords
- data
- sensing
- nodes
- block
- voting
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/002—Countermeasures against attacks on cryptographic mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0261—Power saving arrangements in terminal devices managing power supply demand, e.g. depending on battery level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/46—Secure multiparty computation, e.g. millionaire problem
- H04L2209/463—Electronic voting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/80—Wireless
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
-
- 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
Abstract
The invention discloses a block chain construction method facing mobile crowd sensing in the field of mobile crowd sensing, which comprises the following steps: dividing a sensing period into a plurality of time slots; in each time slot period, calculating the voting times of each clustering result in the convergent node by other convergent nodes; calculating the total times of voting of the clustering results by other aggregation nodes in the sensing period, wherein when the total times is greater than or equal to a voting threshold value, the clustering results are determined data; otherwise, the clustering result is uncertain data; encapsulating the determined data in a "determined" area of the block; encapsulating uncertain data in a region to be determined of the block; and other sink nodes receive the block where the 'determination' area is located, and the block where the 'determination' area is located is added to the tail of the block chain. In the method, all the sensing data are transmitted to the sink node instead of being broadcasted in the whole network during the time slot, so that the data security is improved, and the communication energy consumption of the mobile sensing node is reduced.
Description
Technical Field
The invention relates to the field of mobile crowd sensing networks, in particular to a block chain construction method facing mobile crowd sensing.
Background
The mobile crowd-sourcing perception relies on various intelligent devices carried by a large number of common users, and the intelligent devices with certain perception, computing capability and communication capability enable each common user to become a perception source, so that large-scale and complex urban and social perception tasks can be completed without professional skills. A typical mobile crowd sensing network structure is a mode of "mobile sensing node + sink node", where the mobile sensing node is a mobile user carrying an intelligent device.
In the prior art, patents of block chain-based security incentive method and system in crowd-sourcing sensing application (publication number CN108055119A) and alliance chain security incentive method based on crowd-sourcing sensing technology (CN110599337A) focus on solving the incentive mechanism problem in the crowd-sourcing sensing application based on block chains. Patents "crowd sensing worker selection mechanism and system based on block chain position privacy protection" (publication No. CN110493182A), "a crowd sensing system based on block chain user privacy protection" (publication No. CN110602694A), and "a crowd sensing double privacy protection method based on block chain" (publication No. CN110825810A) focus on solving the privacy protection problem in the application of crowd sensing based on block chain.
In practical application, the problems of high communication energy consumption and limited computing capacity based on the block chain cannot be ignored, and as an accessed node, the node only grasps local information, which is a bottleneck of the block chain in the application of the field of crowd sensing.
Disclosure of Invention
The invention provides a block chain construction method facing mobile crowd sensing, and aims to solve the problems that a block chain is high in communication energy consumption and limited in computing capacity in the application of the crowd sensing field, and a node only grasps local information.
In order to achieve the above purpose, the invention provides the following technical scheme:
a block chain construction method facing mobile crowd sensing comprises the following steps:
dividing a sensing period into a plurality of time slots;
in each time slot period, calculating the voting times of each clustering result in each aggregation node by other aggregation nodes;
calculating the total times of voting of the clustering results by other aggregation nodes in the sensing period, wherein when the total times is greater than or equal to a voting threshold value, the clustering results are determined data; otherwise, the clustering result is uncertain data;
encapsulating the determined data in a "determined" area of the block; encapsulating uncertain data in a region to be determined of the block;
other sink nodes receive the block where the 'determination' area is located, and the block where the 'determination' area is located is added to the tail of the block chain;
and the clustering result is obtained by performing data aggregation based on a pyramid tree algorithm on the sensing data by each aggregation node.
As a preferred scheme of the present invention, the step of aggregating the perception data based on the pyramid tree algorithm includes:
dividing the perception data into data of f characteristics;
setting the pyramid tree as an f +2 layer;
with the increase of the perception data, the pyramid tree grows, and the number of nodes on the nth layer of the pyramid tree is not less than the number of nodes on the n-1 layer;
each leaf node of the (f +2) th layer is a data set, and the data set is a clustering result.
As a preferred scheme of the present invention, a calculation formula for calculating the total number of times of voting by other aggregation nodes for the clustering result in the sensing period is as follows:
wherein d isj(x) Is the total number of votes by other sink nodes, c (r)j,uiX) is the number of times that the clustering result is voted by other aggregation nodes in each time slot period in the sensing period, n is the number of other aggregation nodes, x is the time slot number, x is 1, 2.
As a preferred scheme of the invention, the formula of the times of voting the clustering result by other aggregation nodes in each time slot period is expressed as
Wherein r isjIs the clustering result, uiAre other sink nodes participating in the vote, C (r)j,uiAnd T) is the result of each cluster result being voted.
As a preferred scheme of the invention, the value of the voting threshold k is that k is more than or equal to 1.
As a preferred solution of the present invention, the voting threshold k is 5% of the total number of aggregation nodes.
Based on the same conception, the invention also provides a block chain construction system facing the mobile swarm intelligence perception, which comprises at least one processor and a memory which is in communication connection with the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of the above.
Compared with the prior art, the invention has the beneficial effects that:
1. the method of the invention designs the time slot, and all the sensing data in the time slot are transmitted to the sink node instead of being broadcasted in the whole network, thereby improving the safety of the data and reducing the communication energy consumption of the mobile sensing node.
2. According to the invention, data clustering is carried out through a pyramid tree-based data aggregation algorithm, basic data units of the block are determined, and the problem of inconsistent perceived data dimension and quality caused by equipment difference of the perception nodes is solved.
3. The invention changes the workload proving algorithm based on Hash calculation in the traditional block chain technology, and divides the data structure of each block into 2 parts: the method is suitable for the field of mobile crowd sensing.
Description of the drawings:
fig. 1 is a flowchart of a block chain construction method facing mobile crowd sensing in embodiment 1 of the present invention;
fig. 2 is a schematic diagram of a pyramid tree in embodiment 1 of the present invention.
Detailed Description
The present invention will be described in further detail with reference to test examples and specific embodiments. It should be understood that the scope of the above-described subject matter is not limited to the following examples, and any techniques implemented based on the disclosure of the present invention are within the scope of the present invention.
Example 1
The blockchain is a distributed and decentralized network database system, and the traditional blockchain (bitcoin) construction process comprises the following steps:
1) broadcasting all transaction information to the whole network within a period of time;
2) each node incorporating the received information into a block;
3) each node attempts to find a proof of workload in its own block;
4) when a node finds out the workload certification, broadcasting to the whole network;
5) other node verification;
6) other nodes accept blocks, extending the chain following the end.
The method improves the traditional block chain construction, and provides a block chain construction method facing to mobile crowd sensing, which is specifically designed as follows:
dividing the whole sensing period T into l time slots, wherein each time slot generates a block;
the data structure of each block is divided into 2 parts: "deterministic data" + "non-deterministic data";
the construction method of each block is as follows: in a sensing time slot tx
1) Each perception node transmits the perceived data to the aggregation node;
2) the aggregation node performs data aggregation on all the perception data based on the pyramid tree algorithm to obtain a clustering result;
3) each clustering result needs authentication confirmation of other nodes, and a cross-slot voting mechanism is adopted in a confirmation algorithm;
4) the clustering result confirmed by voting is packaged in a 'determination' area of the block, and voting is not accepted any more; the unconfirmed clustering result is packaged in the area to be determined of the block;
5) other nodes accept the block, t, in the next sensing time slotx+1And carrying out data perception, and perfecting the block according to the clustering result.
6) Until the sensing period T ends.
The method for clustering the perception data based on the pyramid tree algorithm comprises the following steps: the method comprises the steps of clustering perception data with multidimensional characteristics by utilizing a tree structure of a pyramid tree (as shown in figure 2) to achieve the purpose of selecting the perception data, wherein for a data aggregation task with f characteristics, the pyramid tree is defined as a (f +2) layer tree, the tree grows continuously along with the addition of data, and all leaf nodes only appear at the bottom layer of the tree, namely the number of nodes of the nth layer is not less than that of nodes of the (n-1) th layer. The root node is only used as the root node of the whole tree to organize each layer; each leaf node of the lowest layer, i.e., the (f +2) th layer, represents a data set; and the middle 1 st to (f +1) th layers are non-leaf nodes, each layer represents a feature to which the task belongs, and all data are clustered according to the features to obtain the lowest-layer clustering result.
The steps of the block chain construction method facing the mobile crowd sensing are realized based on a cross-slot voting mechanism. And uniformly dividing the sensing period T into equal-length time slots T, namely T is l multiplied by T, respectively counting the voting times of each clustering result by the sensing node in each T time slot, and packaging the clustering result in a determined area of a block after the accumulation of the whole sensing period meets the coverage requirement. Defining each clustering result rjThe total number of votes by all sensing nodes u in the x (x ═ 1, 2.., l) th time slot is denoted as dj(x) Then, then
Will be encapsulated in the "determining" area of the block. In general, the distribution of sensing nodes exhibits a poisson distribution phenomenon, so that k takes a value of 5% of the number of all sensing nodes.
Because some sensing nodes may have quality defects in the sensing process, in order to improve the block construction quality, a plurality of sensing nodes submit data of the same reference point in a sensing period T, namely, a clustering result in each sensing period T is voted by at least k (k is more than or equal to 1) sensing nodes.
Considering that the same sensing node senses a reference point for multiple times in the sensing period T and the improvement on the block construction quality is limited, therefore, in the sensing period T, a sensing node reaches a reference point for multiple times and only votes for one time, and the formula of the voting times of other aggregation nodes represents the clustering result as the formula of the voting times of other aggregation nodes in each time slot period
Wherein r isjIs the clustering result, uiIs the other aggregation node participating in the vote, C (r)j,uiAnd T) is the result of each cluster result being voted.
Claims (7)
1. A block chain construction method facing mobile crowd sensing is characterized by comprising the following steps:
dividing a sensing period into a plurality of time slots;
in each time slot period, calculating the voting times of each clustering result in each aggregation node by other aggregation nodes;
calculating the total times of voting of the clustering results by other aggregation nodes in a sensing period, wherein when the total times is greater than or equal to a voting threshold value, the clustering results are determined data; otherwise, the clustering result is uncertain data;
packaging the determined data in a 'determined' area of a block; packaging the uncertain data in a to-be-determined area of a block;
other sink nodes receive the block where the 'determination' area is located, and the block where the 'determination' area is located is added to the end of the block chain;
and the clustering result is obtained by performing data aggregation based on a pyramid tree algorithm on the sensing data by each aggregation node.
2. The method as claimed in claim 1, wherein the step of aggregating the perceptual data based on the pyramid tree algorithm comprises:
dividing the perception data into data of f features;
setting the pyramid tree as an f +2 layer;
with the increase of the perception data, the pyramid tree grows, and the number of nodes on the nth layer of the pyramid tree is not less than the number of nodes on the n-1 layer;
each leaf node of the (f +2) th layer is a data set, and the data set is a clustering result.
3. The method for building a blockchain oriented to mobile crowd sensing as claimed in claim 1, wherein the formula for calculating the total number of times of voting by the other aggregation nodes for the clustering result in the sensing period is as follows:
wherein d isj(x) Is the total number of times that the clustering result was voted by the other aggregation nodes, c (r)j,uiX) is the number of times of voting by the other aggregation nodes in each time slot period in a sensing period, n is the number of the other aggregation nodes, x is a time slot number, x is 1,2, 1, l is the number of time slots in each sensing period, j is the number of clustering results, j is 1,2,3 … m, m is the total number of the clustering results of the aggregation nodes, r is the total number of the clustering results of the aggregation nodes, andjis the clustering result, uiAre the other aggregation nodes participating in the voting.
4. The method as claimed in claim 3, wherein when the number of times that the clustering result is voted by the other aggregation nodes is calculated, in the sensing period, a sensing node reaches a reference point multiple times and only votes once.
5. The method as claimed in claim 1, wherein the voting threshold k is greater than or equal to 1.
6. The method as claimed in claim 1, wherein the voting threshold k is 5% of the total number of the aggregation nodes.
7. A block chain construction system facing mobile crowd-sourcing perception is characterized by comprising at least one processor and a memory which is in communication connection with the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010900064.2A CN111988131B (en) | 2020-08-31 | 2020-08-31 | Block chain construction method facing mobile crowd sensing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010900064.2A CN111988131B (en) | 2020-08-31 | 2020-08-31 | Block chain construction method facing mobile crowd sensing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111988131A CN111988131A (en) | 2020-11-24 |
| CN111988131B true CN111988131B (en) | 2021-05-04 |
Family
ID=73448274
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010900064.2A Active CN111988131B (en) | 2020-08-31 | 2020-08-31 | Block chain construction method facing mobile crowd sensing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111988131B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113553612B (en) * | 2021-06-29 | 2023-08-11 | 福建师范大学 | Privacy protection method based on mobile crowd sensing technology |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825810A (en) * | 2019-10-28 | 2020-02-21 | 天津理工大学 | Block chain-based crowd sensing double privacy protection method |
| CN111177778A (en) * | 2019-12-24 | 2020-05-19 | 北京邮电大学 | Mobile crowd sensing method, system, server and storage medium |
| CN111262708A (en) * | 2020-01-16 | 2020-06-09 | 安徽大学 | Crowd sensing method based on block chain |
| CN111355799A (en) * | 2020-02-27 | 2020-06-30 | 百度在线网络技术（北京）有限公司 | Voting method, device, equipment and storage medium based on block chain |
| CN111464631A (en) * | 2020-03-31 | 2020-07-28 | 成都质数斯达克科技有限公司 | Service consensus method and device in alliance block chain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10686590B2 (en) * | 2016-12-23 | 2020-06-16 | Joseph Santilli | Methods and systems for crowdsourcing an outcome to an issue |
-
2020
- 2020-08-31 CN CN202010900064.2A patent/CN111988131B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825810A (en) * | 2019-10-28 | 2020-02-21 | 天津理工大学 | Block chain-based crowd sensing double privacy protection method |
| CN111177778A (en) * | 2019-12-24 | 2020-05-19 | 北京邮电大学 | Mobile crowd sensing method, system, server and storage medium |
| CN111262708A (en) * | 2020-01-16 | 2020-06-09 | 安徽大学 | Crowd sensing method based on block chain |
| CN111355799A (en) * | 2020-02-27 | 2020-06-30 | 百度在线网络技术（北京）有限公司 | Voting method, device, equipment and storage medium based on block chain |
| CN111464631A (en) * | 2020-03-31 | 2020-07-28 | 成都质数斯达克科技有限公司 | Service consensus method and device in alliance block chain |
Non-Patent Citations (2)
| Title |
|---|
| An Energy-Efficient Crowd-Sourcing-Based Indoor Automatic Localization System;Xi Liu et al.;《IEEE SENSORS JOURNAL》;20180715;第18卷(第14期);全文 * |
| 聚类金字塔树: 一种新的高维空间数据索引方法;张海勤等;《中国科技术大学学报》;20011231;第31卷(第6期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111988131A (en) | 2020-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110166282A (en) | Resource allocation methods, device, computer equipment and storage medium | |
| CN102541858B (en) | Based on mapping and the data balancing processing method of stipulations, Apparatus and system | |
| WO2023016090A1 (en) | Data processing method and apparatus for blockchain network, computer device, computer readable storage medium, and computer program product | |
| CN106102079B (en) | Based on the C-RAN carrier wave emigration resource requirement prediction technique for improving PSO | |
| CN106777093A (en) | Skyline inquiry systems based on space time series data stream application | |
| CN105808358B (en) | A kind of data dependence thread packet mapping method for many-core system | |
| CN111611062B (en) | Cloud-edge collaborative hierarchical computing method and cloud-edge collaborative hierarchical computing system | |
| CN106130960A (en) | Judgement system, load dispatching method and the device of steal-number behavior | |
| CN111988131B (en) | Block chain construction method facing mobile crowd sensing | |
| CN114663104A (en) | PBFT based on block chain product supply chain tracing | |
| Cen et al. | Developing a disaster surveillance system based on wireless sensor network and cloud platform | |
| CN107360031A (en) | It is a kind of based on optimization overhead gains than mapping method of virtual network | |
| Fan et al. | Machine learning based quantitative association rule mining method for evaluating cellular network performance | |
| CN110058942B (en) | Resource allocation system and method based on analytic hierarchy process | |
| WO2023029944A1 (en) | Federated learning method and device | |
| CN116467026A (en) | Cloud desktop data secure sharing and tracing method and system based on blockchain | |
| Gao et al. | Improved byzantine fault-tolerant algorithm based on alliance chain | |
| Ren et al. | Balanced allocation method of physical education distance education resources based on linear prediction | |
| CN106533756B (en) | A kind of communication feature extracts, flow generation method and device | |
| CN114978684A (en) | PBFT consensus method based on improved agglomeration type hierarchical clustering | |
| Bai et al. | An efficient skyline query algorithm in the distributed environment | |
| Liu et al. | Community discovery in weighted networks based on the similarity of common neighbors | |
| Han et al. | A novel classified ledger framework for data flow protection in aiot networks | |
| CN105868435A (en) | Efficient control method for realizing optical network construction on basis of linear correlation analysis | |
| CN106209978A (en) | A kind of alliance Services Composition selects system and system of selection |
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 |