CN109803015B - Decentralized shared storage system based on D2D and control method thereof - Google Patents
Decentralized shared storage system based on D2D and control method thereof Download PDFInfo
- Publication number
- CN109803015B CN109803015B CN201910054511.4A CN201910054511A CN109803015B CN 109803015 B CN109803015 B CN 109803015B CN 201910054511 A CN201910054511 A CN 201910054511A CN 109803015 B CN109803015 B CN 109803015B
- Authority
- CN
- China
- Prior art keywords
- data
- storage
- module
- channel
- data request
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a decentralized shared storage system based on D2D and a control method thereof, wherein the decentralized shared storage system comprises a data slicing module, a data storage module and a data processing module, wherein the data slicing module is used for slicing data; the data request module acquires the fragment data and sends a data request to the dispatching center module; transmitting the fragment data to the storage consensus domain module; the dispatching center module is used for carrying out first analysis and verification on the data request sent by the data request module; and transmitting the data request to the storage consensus domain module; the storage consensus domain module is used for carrying out second analysis and verification on the data request; judging the type of the data request; sending a signal for finishing judgment to a data request module; receiving the fragment data sent by a data request module; and inquiring, storing and backing up the fragment data. The method has the advantages that the data are fragmented and dispersedly stored in the D2D user, so that the data of the user can be ensured to be scattered and not to be checked, the trust problem among users is solved, and the backup of the user data and the retrospective restoration of the data are ensured.
Description
Technical Field
The invention relates to the technical field of D2D communication, in particular to a decentralized shared storage system based on D2D and a control method thereof.
Background
D2D (Device-to-Device, D2D communication technology) is based on D2D communication of cellular network, or called Proximity Service (ProSe), meaning that user data can be transmitted directly between terminals without transit through the network. In a conventional wireless communication network, the requirement for communication infrastructure is high, and the breakdown of the core network facility or the access network equipment may cause the breakdown of the communication system. Under the D2D communication mode, user data are directly transmitted between terminals, so that the condition that the user data are transmitted in the network in the cellular communication is avoided, and the link gain is generated; secondly, resources between D2D users and between D2D and cells can be multiplexed, thereby resource multiplexing gain can be generated; the efficiency of wireless spectrum resources can be improved through link gain and resource multiplexing gain, and further network throughput is improved. The introduction of D2D communication enables cellular communication terminals to establish Ad Hoc networks, the wireless communication infrastructure is damaged, or in coverage shadow areas of wireless networks, the terminals can implement end-to-end communication even access to cellular networks by means of D2D, and with the development of mobile communication services and technologies, close data sharing among users with proximity characteristics, a small range of social and business activities, and specific services for local specific users are becoming a non-negligible growth point in current and next-stage wireless platforms. The introduction of the D2D technology based on the perception of the adjacent users has the advantages of improving the user experience, improving the network throughput and the like.
Due to the characteristics of D2D, open point-to-point communication enables user data to be directly transmitted between terminals, which cannot guarantee the identity information of the opposite party faced by the user, and also brings about security problems on data such as an attacker who eavesdrops or actively interferes the data.
Disclosure of Invention
The present invention is directed to a decentralized shared village storage system based on D2D and a control method thereof, so as to solve the aforementioned problems in the prior art.
In order to achieve the purpose, the technical scheme adopted by the invention is as follows:
a D2D-based decentralized shared memory system, comprising:
the data slicing module is used for carrying out Bit operation on the data and dividing the data into a plurality of sliced data according to the size of the data;
the data request module acquires the fragment data and sends a data request to the dispatching center module; transmitting the fragment data to the storage consensus domain module;
the dispatching center module is used for carrying out first analysis and verification on the data request sent by the data request module; and transmitting the data request to a storage common identification domain module;
the storage consensus domain module is used for carrying out second analysis and verification on the data request; judging the type of the data request; sending a signal of finishing judgment to the data request module; receiving the fragment data sent by the data request module; and inquiring, storing and backing up the fragment data.
Preferably, the data request includes two part sequence codes, which are a first group of sequence codes and a second group of sequence codes, respectively, a first standard sequence code corresponding to the first group of sequence codes is preset in the scheduling center module, when the first group of sequence codes is completely the same as the first standard sequence code, the first time analysis and verification is passed, otherwise, the first time analysis and verification is not passed.
Preferably, a second standard sequence code corresponding to the second group of sequence codes is preset in the common identification domain storage module, when the second group of sequence codes is completely the same as the second standard sequence code, the second analysis and verification is passed, otherwise, the second analysis and verification is not passed.
Preferably, the storage common domain module includes a plurality of storage common domains, each of the storage common domains is composed of a plurality of storage nodes, and the storage nodes are configured to store, query, and index the fragmented data.
Preferably, the storage common domain module is any device with storage, calculation and networking functions.
Preferably, the storage nodes included in the storage community are divided into a main node and a plurality of sub-nodes, and the main node backs up each piece of fragment data according to the number of the current storage nodes and the number of the piece of fragment data.
Preferably, the scheduling center module obtains a historical score of storage nodes in each storage consensus domain by querying record information of each storage consensus domain, selects storage nodes with the same number as the fragmented data according to the historical scores, and stores the fragmented data into the corresponding storage nodes.
Preferably, the scoring indexes of the historical scores comprise the transmission rate, the available capacity, the online time, the data loss rate, the computing capacity and the query time of the storage nodes; the higher the score, the more data the storage node can store, otherwise the less.
Preferably, the master node in each storage consensus domain performs self-query to determine the historical score of the storage node in each storage consensus domain.
The present invention also provides a control method for the decentralized shared storage system according to any one of the above embodiments, including the steps of:
s1, dividing the data into a plurality of pieces of data by the data slicing module according to the size of the data;
s2, the data request module acquires the fragment data and sends a data request to the dispatching center module;
s3, the scheduling center module obtains the data request, and carries out the first analysis and verification on the data request, if the first analysis and verification fails, the failure result is fed back to the user; if the first parsing verification is successful, executing S4;
s4, the dispatching center module forwards the data request passing the first analysis and verification to the storage consensus domain module;
s5, the data request is obtained by the storage consensus domain module, secondary analysis and verification are carried out on the data request, if the secondary analysis and verification is not passed, a failure result is fed back to the user, and if the secondary analysis and verification is passed, S6 is executed;
s6, the storage consensus domain module judges whether the data request passing the analysis is query data or storage data, and sends a judgment completion signal to the data request module, and the data request module transmits the fragmented data to the storage consensus domain module after receiving the judgment completion signal; if the data request is storage data, executing S7, and if the data request is query data, executing S8;
s7, the storage common identification domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common identification domain module uses the D2D channel to store the received fragment data into the corresponding storage node and store the corresponding index; if the D2D channel fails to be established, then S9 is executed;
s8, the storage consensus domain module indexes the received fragment data, and if the corresponding data can be indexed, S11 is executed; if the index does not have the corresponding data, executing S12;
s9, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if the P2P channel is normal, the storage consensus domain module stores the fragment data into the corresponding storage node by using the P2P channel, and stores the corresponding index; if the P2P channel is abnormal, executing S10;
s10, the scheduling center module forwards the fragmented data to the current main node of the common domain storage module, and the main node distributes the data to each sub-node and stores the corresponding index;
s11, the storage common identification domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common identification domain module uses the D2D channel to transmit the indexed corresponding data to the user, and if the D2D channel is failed to be established, S13 is executed;
s12, the storage common domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common domain module uses the D2D channel to feed the query failure result back to the user, and if the D2D channel is unsuccessfully established, S15 is executed;
s13, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if so, the storage consensus domain module uses the P2P channel to transmit the indexed corresponding data to the user, and if the P2P channel is abnormal, S14 is executed;
s14, the storage consensus domain module transmits the indexed corresponding data to the dispatching center module, and the dispatching center module transmits the received corresponding data to the user;
s15, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if so, the storage consensus domain module uses the P2P channel to feed the query failure result back to the user, and if the P2P channel is abnormal, S16 is executed;
and S16, the common domain storage module feeds the query failure result back to the scheduling center module, and the scheduling center module feeds the query failure result back to the user.
The invention has the beneficial effects that: 1. the data are fragmented and protected in a scattered mode to the D2D user, so that the data of the user can be guaranteed to be scattered and cannot be checked, and the trust problem among the users is solved. 2. The use of P2P can ensure the backup of user data and the retrospective restoration of data. 3. The method has extremely strong cross-platform performance and is not limited to PHONE, LAPTOP, PC and Internet of things equipment. 4. The method has decentralized distributed fault tolerance, and can tolerate partial node abnormity.
Drawings
FIG. 1 is a control flow diagram of a decentralized shared memory system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the invention, are intended for purposes of illustration only and are not intended to limit the scope of the invention.
As shown in fig. 1, the present invention provides a decentralized shared storage system based on D2D and a control method thereof, wherein the control system includes: the data slicing module is used for carrying out Bit operation on the data and dividing the data into a plurality of sliced data according to the size of the data; the data request module is used for acquiring the fragment data and sending a data request to the dispatching center module; transmitting the fragment data to the storage consensus domain module; the dispatching center module is used for carrying out first analysis and verification on the data request sent by the data request module; and transmitting the data request to a storage common identification domain module; the storage consensus domain module is used for carrying out second analysis and verification on the data request; judging the type of the data request; sending a signal of finishing judgment to the data request module; receiving the fragment data sent by the data request module; and inquiring, storing and backing up the fragment data. The modules cooperate to perform corresponding operations on the data, so that the data is stored and inquired in a scattered manner and is stored in the D2D user in a scattered manner, the data of the user is guaranteed to be scattered and cannot be checked, and the stored data can be backed up and can be restored in a traceable manner.
In this embodiment, the data fragmentation module performs fragmentation on data, which is any text file existing in any system.
In this embodiment, the data request includes two part sequence codes, which are a first group of sequence codes and a second group of sequence codes, and the scheduling center module is preset with a first standard sequence code corresponding to the first group of sequence codes, and when the first group of sequence codes is completely the same as the first standard sequence code, the first time analysis and verification is passed, otherwise, the first time analysis and verification is not passed.
In this embodiment, a second standard sequence code corresponding to the second group of sequence codes is preset in the common identification domain storage module, and when the second group of sequence codes is completely the same as the second standard sequence code, the second analysis and verification pass, otherwise, the second analysis and verification does not pass.
In this embodiment, the storage common domain module includes a plurality of storage common domains, each of the storage common domains is composed of a plurality of storage nodes, and the storage nodes are configured to store, query, and index fragmented data.
In this embodiment, the storage common domain module is any device with storage, calculation and networking functions, and is not limited to PHONE, LAPTOP, PC and internet of things; has strong cross-platform performance.
In this embodiment, the storage nodes included in the storage community are divided into a main node and a plurality of sub-nodes, and have self-health multi-redundancy backup detection capability, that is, the main node backs up each piece of fragment data according to the number of current storage nodes and piece data.
In this embodiment, the scheduling center module obtains the historical scores of the storage nodes in each storage consensus domain by querying the record information of each storage consensus domain, selects the storage nodes with the number equal to that of the fragmented data according to the historical scores, and stores the fragmented data into the corresponding storage nodes.
In this embodiment, the scoring indexes of the historical score include a transmission rate, an available capacity, an online time, a data loss rate, a calculation capability, and a query time of the storage node; the higher the score, the more data the storage node can store, otherwise the less. The historical scoring is characterized in that the network speed transmission rate of the nodes is low, the available capacity is insufficient, the online time cannot meet the requirement of real-time acquisition of a user, the data loss rate is too high, the calculation capacity is poor, the query time consumption is too long, and the like.
In this embodiment, the master node in each storage consensus domain performs self-query to determine the historical score of the storage node in each storage consensus domain, and the master node has computing capability, and can query the transmission rate, the available capacity, the online time, the data loss rate, the computing capability and the query time of the storage node in each storage consensus domain by itself, and perform computation according to these parameters to obtain the historical score. And the main node for storing the common knowledge domain distributes data to the nodes according to the high and low distribution of the historical scores, or does not select the storage node corresponding to the historical scores under the condition that the historical score value is too low.
In this embodiment, the control method includes the following steps:
s1, dividing the data into a plurality of pieces of data by the data slicing module according to the size of the data;
s2, the data request module acquires the fragment data and sends a data request to the dispatching center module;
s3, the scheduling center module obtains the data request, and carries out the first analysis and verification on the data request, if the first analysis and verification fails, the failure result is fed back to the user; if the first parsing verification is successful, executing S4;
s4, the dispatching center module forwards the data request passing the first analysis and verification to the storage consensus domain module;
s5, the data request is obtained by the storage consensus domain module, secondary analysis and verification are carried out on the data request, if the secondary analysis and verification is not passed, a failure result is fed back to the user, and if the secondary analysis and verification is passed, S6 is executed;
s6, the storage consensus domain module judges whether the data request passing the analysis is query data or storage data, and sends a judgment completion signal to the data request module, and the data request module transmits the fragmented data to the storage consensus domain module after receiving the judgment completion signal; if the data request is storage data, executing S7, and if the data request is query data, executing S8;
s7, the storage common identification domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common identification domain module uses the D2D channel to store the received fragment data into the corresponding storage node and store the corresponding index; if the D2D channel fails to be established, then S9 is executed;
s8, the storage consensus domain module indexes the received fragment data, and if the corresponding data can be indexed, S11 is executed; if the index does not have the corresponding data, executing S12;
s9, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if the P2P channel is normal, the storage consensus domain module stores the fragment data into the corresponding storage node by using the P2P channel, and stores the corresponding index; if the P2P channel is abnormal, executing S10;
s10, the scheduling center module forwards the fragmented data to the current main node of the common domain storage module, and the main node distributes the data to each sub-node and stores the corresponding index;
s11, the storage common identification domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common identification domain module uses the D2D channel to transmit the indexed corresponding data to the user, and if the D2D channel is failed to be established, S13 is executed;
s12, the storage common domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common domain module uses the D2D channel to feed the query failure result back to the user, and if the D2D channel is unsuccessfully established, S15 is executed;
s13, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if so, the storage consensus domain module uses the P2P channel to transmit the indexed corresponding data to the user, and if the P2P channel is abnormal, S14 is executed;
s14, the storage consensus domain module transmits the indexed corresponding data to the dispatching center module, and the dispatching center module transmits the received corresponding data to the user;
s15, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if so, the storage consensus domain module uses the P2P channel to feed the query failure result back to the user, and if the P2P channel is abnormal, S16 is executed;
and S16, the common domain storage module feeds the query failure result back to the scheduling center module, and the scheduling center module feeds the query failure result back to the user.
In this embodiment, the P2P is internet peer-to-peer communication, a distributed application architecture for distributing tasks and workloads among peers, and is a networking or network form formed by peer-to-peer computing model in an application layer. Belongs to the prior art.
In this embodiment, the control method is used for a decentralized shared storage system based on D2D, and by using the above steps, data is stored in a distributed manner in a Bit slice splitting manner to a plurality of storage common domain nodes, so that decentralized storage of D2D can be materialized and realized, decentralized storage of D2D also rises from a theoretical layer to an application layer, and the practical application of the D2D communication technology is promoted. The data request is stored in a fragmentation mode, the problem of mutual trust among users is solved, and backup of user data and retroactive restoration of the data are guaranteed.
By adopting the technical scheme disclosed by the invention, the following beneficial effects are obtained:
the invention provides a decentralized shared storage system based on D2D and a control method thereof, data are fragmented and stored in a D2D user in a decentralized manner, so that the data of the user can be guaranteed to be decentralized and cannot be checked, the trust problem among users is solved, and the P2P technology can guarantee the score of user data and the retrospective restoration of the data. According to the storage system, data are stored in a plurality of storage common identification domain nodes in a distributed mode in a Bi t-bit slicing and cutting mode, decentralized storage of D2D is embodied and realized, decentralized storage of D2D is also increased from a theoretical layer to an application layer, and landing practicability of the D2D communication technology is promoted. The data Bit fragmentation technology, the self-health redundant backup mechanism and the decentralized storage of the data enable fragmentation to be safer, the problem of mutual trust among users is solved, the D2D sharing process can be carried out more efficiently, base station load is reduced, and the utilization rate of frequency spectrum resources is higher. The storage system has decentralized distributed fault tolerance and can tolerate the abnormal state of part of nodes; the data are easy to be stored dispersedly after being sliced, so that the possibility of centralized attack and brute force cracking is reduced; the method is not limited to PHONE/LAPTOP/PC/internet of things equipment, and equipment which can be stored, calculated and networked can be used as a storage consensus domain module, so that the universality is excellent.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements should also be considered within the scope of the present invention.
Claims (7)
1. A D2D-based decentralized shared memory system, comprising:
the data slicing module is used for carrying out Bit operation on the data and dividing the data into a plurality of sliced data according to the size of the data;
the data request module acquires the fragment data and sends a data request to the dispatching center module; transmitting the fragment data to the storage consensus domain module;
the dispatching center module is used for carrying out first analysis and verification on the data request sent by the data request module; and transmitting the data request to a storage common identification domain module;
the storage consensus domain module is used for carrying out second analysis and verification on the data request; judging the type of the data request; sending a signal of finishing judgment to the data request module; receiving the fragment data sent by the data request module; inquiring, storing and backing up the fragment data;
the storage common identification domain module comprises a plurality of storage common identification domains, each storage common identification domain is composed of a plurality of storage nodes, and the storage nodes are used for storing, querying and indexing the fragment data;
the dispatching center module acquires historical scores of storage nodes in the storage consensus domains by inquiring the record information of the storage consensus domains, selects the storage nodes with the same number as the fragmented data according to the historical scores, and stores the fragmented data into the corresponding storage nodes; the grading index of the historical grading comprises the transmission rate, the available capacity, the online time, the data loss rate, the computing capacity and the query time of the storage node; the higher the score, the more data the storage node can store, otherwise the less.
2. The D2D-based decentralized shared memory system according to claim 1, wherein: the data request comprises two parts of sequence codes, namely a first group of sequence codes and a second group of sequence codes, a first standard sequence code corresponding to the first group of sequence codes is preset in the dispatching center module, when the first group of sequence codes is completely the same as the first standard sequence code, the first time of analysis and verification is passed, otherwise, the first time of analysis and verification is not passed.
3. The D2D-based decentralized shared memory system according to claim 1, wherein: and a second standard sequence code corresponding to the second group of sequence codes is preset in the storage common identification domain module, when the second group of sequence codes is completely the same as the second standard sequence code, the second analysis and verification is passed, otherwise, the second analysis and verification is not passed.
4. The D2D-based decentralized shared memory system according to claim 1, wherein: the storage common identification domain module is any equipment with the functions of storage, calculation and networking.
5. The D2D-based decentralized shared memory system according to claim 1, wherein: the storage nodes contained in the storage consensus domain are divided into a main node and a plurality of sub-nodes, and the main node backs up each piece of fragment data according to the number of the current storage nodes and the number of the piece of fragment data.
6. The D2D-based decentralized shared memory system according to claim 5, wherein: and the master node in each storage consensus domain carries out self-query to determine the historical scores of the storage nodes in each storage consensus domain.
7. A control method for the decentralized shared memory system according to any one of claims 1 to 6, characterized by comprising the steps of:
s1, dividing the data into a plurality of pieces of data by the data slicing module according to the size of the data;
s2, the data request module acquires the fragment data and sends a data request to the dispatching center module;
s3, the scheduling center module obtains the data request, and carries out the first analysis and verification on the data request, if the first analysis and verification fails, the failure result is fed back to the user; if the first parsing verification is successful, executing S4;
s4, the dispatching center module forwards the data request passing the first analysis and verification to the storage consensus domain module;
s5, the data request is obtained by the storage consensus domain module, secondary analysis and verification are carried out on the data request, if the secondary analysis and verification is not passed, a failure result is fed back to the user, and if the secondary analysis and verification is passed, S6 is executed;
s6, the storage consensus domain module judges whether the data request passing the analysis is query data or storage data, and sends a judgment completion signal to the data request module, and the data request module transmits the fragmented data to the storage consensus domain module after receiving the judgment completion signal; if the data request is storage data, executing S7, and if the data request is query data, executing S8;
s7, the storage common identification domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common identification domain module uses the D2D channel to store the received fragment data into the corresponding storage node and store the corresponding index; if the D2D channel fails to be established, then S9 is executed;
s8, the storage consensus domain module indexes the received fragment data, and if the corresponding data can be indexed, S11 is executed; if the index does not have the corresponding data, executing S12;
s9, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if the P2P channel is normal, the storage consensus domain module stores the fragment data into the corresponding storage node by using the P2P channel, and stores the corresponding index; if the P2P channel is abnormal, executing S10;
s10, the scheduling center module forwards the fragmented data to the current main node of the common domain storage module, and the main node distributes the data to each sub-node and stores the corresponding index;
s11, the storage common identification domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common identification domain module uses the D2D channel to transmit the indexed corresponding data to the user, and if the D2D channel is failed to be established, S13 is executed;
s12, the storage common domain module judges whether the D2D channel between the storage node and the user is successfully established, if so, the storage common domain module uses the D2D channel to feed the query failure result back to the user, and if the D2D channel is unsuccessfully established, S15 is executed;
s13, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if so, the storage consensus domain module uses the P2P channel to transmit the indexed corresponding data to the user, and if the P2P channel is abnormal, S14 is executed;
s14, the storage consensus domain module transmits the indexed corresponding data to the dispatching center module, and the dispatching center module transmits the received corresponding data to the user;
s15, the storage consensus domain module judges whether the P2P channel between the storage node and the user is normal, if so, the storage consensus domain module uses the P2P channel to feed the query failure result back to the user, and if the P2P channel is abnormal, S16 is executed;
and S16, the common domain storage module feeds the query failure result back to the scheduling center module, and the scheduling center module feeds the query failure result back to the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910054511.4A CN109803015B (en) | 2019-01-21 | 2019-01-21 | Decentralized shared storage system based on D2D and control method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910054511.4A CN109803015B (en) | 2019-01-21 | 2019-01-21 | Decentralized shared storage system based on D2D and control method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109803015A CN109803015A (en) | 2019-05-24 |
| CN109803015B true CN109803015B (en) | 2021-10-12 |
Family
ID=66559807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910054511.4A Active CN109803015B (en) | 2019-01-21 | 2019-01-21 | Decentralized shared storage system based on D2D and control method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109803015B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114641084B (en) * | 2022-02-18 | 2024-06-18 | 山东大学 | Distributed collaborative optimal channel access method based on social trust model |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546755A (en) * | 2011-12-12 | 2012-07-04 | 华中科技大学 | Data storage method of cloud storage system |
| CN103927489A (en) * | 2014-04-22 | 2014-07-16 | 陈幼雷 | System and method for trusted storage of data |
| CN107103252A (en) * | 2017-04-27 | 2017-08-29 | 电子科技大学 | Data access control method based on block chain |
| CN108073823A (en) * | 2016-11-18 | 2018-05-25 | 阿里巴巴集团控股有限公司 | Data processing method, apparatus and system |
| CN108156040A (en) * | 2018-01-30 | 2018-06-12 | 北京交通大学 | A kind of central control node in distribution cloud storage system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2559398A (en) * | 2017-02-04 | 2018-08-08 | PQ Solutions Ltd | Controlled and verifiable information destruction |
-
2019
- 2019-01-21 CN CN201910054511.4A patent/CN109803015B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546755A (en) * | 2011-12-12 | 2012-07-04 | 华中科技大学 | Data storage method of cloud storage system |
| CN103927489A (en) * | 2014-04-22 | 2014-07-16 | 陈幼雷 | System and method for trusted storage of data |
| CN108073823A (en) * | 2016-11-18 | 2018-05-25 | 阿里巴巴集团控股有限公司 | Data processing method, apparatus and system |
| CN107103252A (en) * | 2017-04-27 | 2017-08-29 | 电子科技大学 | Data access control method based on block chain |
| CN108156040A (en) * | 2018-01-30 | 2018-06-12 | 北京交通大学 | A kind of central control node in distribution cloud storage system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109803015A (en) | 2019-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111371877B (en) | Consensus method of heterogeneous alliance chain | |
| US20180372507A1 (en) | Information sharing method of smart electricity meter, smart electricity meter and acquisition router | |
| CN109417829B (en) | Method and apparatus for determining cluster head | |
| CN108881354B (en) | Push information storage method and device, server and computer storage medium | |
| CN112887000B (en) | Information feedback method, device and system | |
| CN114218612B (en) | Consensus method suitable for alliance chain high-frequency transaction scene | |
| CN111179087B (en) | Alliance chain consensus method based on grid arbitration | |
| Xu et al. | SIoTFog: Byzantine-resilient IoT fog networking | |
| CN113645278B (en) | Cross-chain message transmission method, device and storage medium of block chain | |
| CN111181747A (en) | Gateway cooperation realization method and device, IoT gateway and storage medium | |
| CN112152914A (en) | Instant messaging method and system based on Beidou short message | |
| CN109803015B (en) | Decentralized shared storage system based on D2D and control method thereof | |
| EP2597909A1 (en) | Method, base station and trunking communication system for selecting temporary core network | |
| Qu et al. | Spectrum-aware network coded multicast in mobile cognitive radio ad hoc networks | |
| Liang et al. | Blockchain-based efficient recovery for secure distributed control in software defined optical networks | |
| CN111971984B (en) | Low-power consumption Bluetooth communication method, electronic device, network and storage medium | |
| CN113791959A (en) | Alarm pushing method, system, terminal and storage medium of service platform | |
| CN105516317A (en) | Multi-level load equalization efficient collection method for power utilization information | |
| CN101695049A (en) | Method and device for processing businesses in monitoring system | |
| CN112491935A (en) | Water wave type broadcasting method and system for block chain | |
| CN111818152B (en) | Leader election consensus method based on distributed network | |
| CN115037785A (en) | Instant communication system and method | |
| EP2958270B1 (en) | Direct-link quality monitoring method, communications device, and system | |
| CN110635927B (en) | Node switching method, network node and network system | |
| CN109587189B (en) | Node management method and device |
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 |