CN110113148A - A kind of software definition opportunistic network node identities verification method based on block chain - Google Patents
A kind of software definition opportunistic network node identities verification method based on block chain Download PDFInfo
- Publication number
- CN110113148A CN110113148A CN201910347895.9A CN201910347895A CN110113148A CN 110113148 A CN110113148 A CN 110113148A CN 201910347895 A CN201910347895 A CN 201910347895A CN 110113148 A CN110113148 A CN 110113148A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- formula
- grading
- block
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- General Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- Power Engineering (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Computing Systems (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of software definition opportunistic network node identities verification method based on block chain, first grades to received each message by mobile node, and the message grading of generation is sent to corresponding region authenticated unit；Then the message grading by region authenticated unit to the mobile node received for same message polymerize, generate the trust value offset of each message, and form trust value offset block, it is proved again using associated working amount and the common recognition mechanism of equity proof selects target area authenticated unit, the trust value offset block formed is uploaded to pre-generated publicly accessible trust block chain.Using proof of work mechanism in block chain and " miner's election " mechanism, propose the solution for software definition opportunistic network interior joint Authentication Questions, it can be under the premise of not changing network structure primary characteristic, internet security greatly is optimized, provides guarantee for the normal internal communication of software definition opportunistic network.
Description
Technical field
The present invention relates to field of computer technology, and in particular to a kind of software definition opportunistic network node based on block chain
Auth method.
Background technique
As a kind of novel network structure, software definition opportunistic network has opportunistic network and software defined network
Double grading.Firstly, it is a kind of network structure of movable self-organization as opportunistic network, with tolerable structure clash
Feature, this is the important difference with traditional network.Self-organizing, network topology constantly change between non-stop layer node, mobile node
Limited with the storage capacity and the energy of mobile node is the most distinct characteristic of opportunistic network.It is different comprising several in opportunistic network
Node, these all nodes have certain communication range, and have certain characteristics of motion, the movement of different nodes
The attributes such as model, communication range may be different.These constantly mobile nodes constitute the basis of opportunistic network communication, section
Communications status can be kept in point moving process, constitutes the communication link of dynamic change.The node of opportunistic network is able to carry out message
Forwarding, when two nodes in the communication radius of other side due to that can not interact directly, then other nodes will be relied on
Mobile, carrying forwards to assist the two nodes to carry out indirect communication, this communication for just resulting in opportunistic network has randomness
And time delay.Secondly, as software defined network (SDN, Software Defined Network), it is by the closed net of tradition
The decoupling of network system is data plane, control plane and applies plane, by can logically realize in control plane programming
The centralized management of network environment, open and programmability is the most important feature of SDN.Currently, SDN technology is in data center
The fields such as network, network virtualization, cloud computing and WLAN are used widely, this to realize network structure collection in logic
The middle thought separated with data forwarding that controls causes depth to be paid close attention in academia.SDN technology is by the control plane of the network equipment
It is independent from complicated embedded topological structure, whole network topology is carried out by the central controller of software-driven
Deployment is controlled instead of traditional system embedment formula with opening, convenient and fast PLC technology plane, greatlies simplify user network
The workflow of management provides good network programmability.
At least there is following technology in implementing the present invention, it may, the method for finding the prior art in present inventor
Problem:
Unique structure makes software definition opportunistic network have the feature of some protrusions, and such as: network topology dynamic is more
Change, the communication strategy of forwarded hop-by-hop, network more fragility itself etc..Authentication center and storage base since there is no centralization
It stands, compared to traditional fixed cable network, software definition opportunistic network is easier pseudo- by listening in information, node identities
It makes, the security threats such as data tampering and distributed denial of service attack.On the other hand, software definition opportunistic network interior joint from
Body safety is also very fragile.Node will also have both the function of router while autonomous and forwarding message, inside
Memory space it is also extremely limited, once being trapped, the important informations such as key, message in node can all be leaked, crack, quilt
The node of capture pretends normal node to destroy the normal function of network it is also possible to be steered and rejoin network.
It follows that the presence of software definition opportunistic network is subject to node identities forgery and leads to uneasiness in the prior art
Full technical problem.
Summary of the invention
In view of this, the present invention provides a kind of software definition opportunistic network node identities authentication based on block chain
Method is subject to node identities forgery to solve or at least partly solve software definition opportunistic network presence in the prior art
And lead to unsafe technical problem.
First aspect present invention provides a kind of software definition opportunistic network node identities verification method based on block chain,
Include:
Mobile node grades to received each message according to preset condition, and the grading of the message of generation is sent to pair
The region authenticated unit answered, wherein the confidence level that message is graded to indicate message；
Message grading of each region authenticated unit to the mobile node received for same message polymerize, and generates
The trust value offset of each message, and form trust value offset block, wherein trust value offset to message can
Reliability is integrated, and is graded according to the message that each mobile node generates, and reverse push exports the confidence level of each mobile node；
It is proved using associated working amount and the common recognition mechanism of equity proof selects one from the authenticated unit of each region
A target area authenticated unit, the trust value offset block formed are uploaded to pre-generated publicly accessible trust
Block chain.
In one embodiment, mobile node grades to received each message according to preset condition, comprising:
Mobile node divides received all message in groups, is expressed as M={ M1,M2,...,Mj... }, MjCorresponding one
Message j in a message groups M；
It is calculated using confidence level of the formula (1-1) to single message in the group of division:
In formula (1-1),For M in the message groups M that is sent by node kjConfidence level,For message sending node k with
Message MjBetween distance, b and γ are two default regulation parameters, are respectively used to the lower bound and gradual change speed of control message confidence level
Rate, if node k does not have evaluable message,
Or
It combines formula (1-2) to calculate the confidence level of single message in the group of division using formula (1-1), is disappeared
The confidence level set of all message in breath group M
In formula (1-2), RkIndicate that the current trust value of message sending node, Ref are the current trust value of receiving node
Set, α1And α2The respectively weight of the two factor；
Receiving node is based on Bayesian inference and confidence level setCalculate all in message groups M disappear
The polymerization confidence level of breath.
In one embodiment, receiving node is based on Bayesian inference and confidence level setIt calculates
The polymerization confidence level of all message in outbound message group M, comprising:
Shown in derivation process such as formula (1-3):
Wherein,The corresponding complementary event of expression event e, in formulaP (e/C) table
Show the prior probability of event e, for value range between 0 to 1, i.e. P (e/C) ∈ [0,1], P (e) indicate that event e occurs general
Rate,The complementary event of expression event eThe probability of generation,It is respectively event e and complementary time with P (ck/e)The prior probability of generation presets believability threshold TH, and as P (e/C) > TH, event e generates positive grading, the i.e. event
Belong to certainty, conversely, generating negative grading, if P (e/C) is equal with TH, event e will not produce the node for sending the message
Raw prestige fluctuation.
In one embodiment, the calculation of trust value offset are as follows: gathered by the calculation method of formula (1-4)
All gradings for being directed to a certain message are closed, its trust value offset is obtained:
In formula (1-2),Indicate the trust value offset for the node k that current region authenticated unit obtains, m and n difference
The quantity for indicating front grading and negatively grading, θ1And θ2The weight of respectively m and n, θ1And θ2Value determined by formula (1-5),
In formula (1-5), F () is sensitivity coefficient, for controlling influence of the grading to whole result of a small number of nodes
Degree, F () are calculated by formula (1-6),
In formula (1-6), Δ A/A is the variation ratio of evaluation index, i.e., what single malice grading generated whole grading
Changing ratio, Δ F/F are the change rate of non-determined factor, i.e., certain any grading is to whole contributive rate.
In one embodiment, a mesh is selected from the authenticated unit of each region based on proof of work mechanism
Region authenticated unit is marked, the trust value offset block formed is uploaded to pre-generated publicly accessible trust block
Chain specifically includes:
It is chosen by way of formula (1-7):
Hash(IDLA,time,PreHash,nonce)≤Si (1-7)
In formula (1-7), IDLAIndicate the number of current region authenticated unit LA, time indicates timestamp, PreHash table
Show previous block cryptographic Hash, mono- numerical value generated at random of nonce, SiIndicate the Hash threshold value of LAi, SiIn form for n company
The binary sequence that continuous 0 starts, the degree-of-difficulty factor of proof of work and the number of n are positively correlated；
All areas authenticated unit calculates cryptographic Hash after nonce value of more correcting one's mistakes, according to SHA-256 hash algorithm,
Meet the qualification for then having the wheel and uploading offset block of formula (1-8) condition；
Si=2Nm-Nz-1 (1-8)
Formula (1-8) defines character string SiExpression-form, wherein int () indicate return bracket in be worth integer portion
Point, NmFor the digit of the resulting cryptographic Hash of SHA-256 hash algorithm, NmEqual to 256, NzIndicate hexadecimal string SiHead end
Continuous 0 number；
The sum of absolute value by comparing trust value offsets all in the authenticated unit of each region come select upload mesh
Mark region authenticated unit:
O in formula (1-9)iFor LAiCurrent trust value side-play amount set,Indicate the section that current region authenticated unit obtains
The trust value offset of point k, FmaxTo limit FiThe upper bound.
In one embodiment, trust value offset block includes block stem and block body.
In one embodiment, the method also includes:
Using the consistent scheme of Distributed Coordination all mobile nodes and region authenticated unit are reached common understanding.
Said one or multiple technical solutions in the embodiment of the present application at least have following one or more technology effects
Fruit:
A kind of software definition opportunistic network node identities verification method based on block chain provided by the invention, first by moving
Dynamic node grades to received each message according to preset condition, and the message grading of generation is sent to corresponding region and is recognized
Unit is demonstrate,proved, then message grading of each region authenticated unit to the mobile node received for same message polymerize,
The trust value offset of each message is generated, and forms trust value offset block, wherein trust value offset is to message
Confidence level integrated；Method again based on proof of work mechanism selects a mesh from the authenticated unit of each region
Region authenticated unit is marked, the trust value offset block formed is uploaded to pre-generated publicly accessible trust block
Chain.
Block chain technology is applied to by the present invention for the safety issue in software definition opportunistic network in the prior art
The verifying of software definition opportunistic network interior joint identity, can be in the decentralization trusted without any single-point using block chain technology
In environment, by combining distributed account book technology and its exclusive common recognition mechanism, promote each node compliance in network
Common recognition.By the exclusive common recognition mechanism of analysis block chain, such as common proof of work mechanism (PoW, Proof of Work)
Realization process, and " miner's election " mechanism of interface block chain, propose for software definition opportunistic network interior joint authentication
Solution to the problem can greatly optimize internet security under the premise of not changing network structure primary characteristic, be soft
Part defines the normal internal communication of opportunistic network and provides guarantee.It solves software definition opportunistic network in the prior art and there is appearance
Node identities are subject to forge and lead to unsafe technical problem.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is the present invention
Some embodiments for those of ordinary skill in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1 is the process of the software definition opportunistic network node identities verification method based on block chain in the embodiment of the present invention
Figure；
Fig. 2 is the schematic diagram for the security framework that the method for the embodiment of the present invention is applied；
Fig. 3 is the schematic diagram of Hash threshold value in the embodiment of the present invention；
Fig. 4 is block form schematic diagram in the embodiment of the present invention；
Fig. 5 is block chain form schematic diagram in the embodiment of the present invention；
When Fig. 6 is that all gradings in the embodiment of the present invention for a certain message are polymerize, mistake comparation and assessment example disappears with falseness
The function relation figure of breath ratio；
Fig. 7 (a) is the schematic diagram using the node verification precision based on Epidemic routing algorithm；
Fig. 7 (b) is the schematic diagram using the node verification precision of Prophet routing algorithm；
Fig. 7 (c) is the schematic diagram using the node verification precision of Maxprop routing algorithm；
Fig. 8 is that the function of the sum of the absolute value that block time-consuming T and trust value offset are generated in embodiment of the present invention Fi closes
System's figure；
Fig. 9 is message grading and the time-consuming contrast schematic diagram of " block " transmission in the embodiment of the present invention.
Specific embodiment
It is an object of the invention to exist to be subject to node identities puppet for software definition opportunistic network in the prior art
It makes and leads to unsafe technical problem, provide a kind of software definition opportunistic network node identities authentication based on block chain
Method.
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
Embodiment one
Present inventor by largely practice discovery, in existing software definition opportunistic network there are safeties to ask
Topic, it is contemplated that the features such as decentralization of block chain, network be healthy and strong, safe and reliable, flexibility is very suitable for soft now for solving
Part defines the heart defect in opportunistic network technology.The feature of block chain technology maximum is to go what is trusted without any single-point
In centralization environment, by combining distributed account book technology and its exclusive common recognition mechanism, each node in network is promoted to reach
Consistency common recognition, block chain is substantially the chain structure database an of decentralization, is closed using traditional cryptography as pointer
Join each " block ".The present invention common recognition mechanism exclusive by analysis block chain, such as common proof of work mechanism (PoW,
Proof of Work), equity prove mechanism (PoS, Proof of Stake), practical Byzantine failure tolerance (PBFT, Practical
Byzantine Fault Tolerance) mechanism realization process, and " miner's election " mechanism of interface block chain proposes needle
To the solution of software definition opportunistic network interior joint Authentication Questions, in the premise for not changing network structure primary characteristic
Under, internet security is greatly optimized, provides guarantee for the normal internal communication of software definition opportunistic network.
A kind of software definition opportunistic network node identities verification method based on block chain is present embodiments provided, is referred to
Fig. 1, this method comprises:
Step S1: mobile node grades to received each message according to preset condition, and the message of generation is graded
It is sent to corresponding region authenticated unit, wherein the confidence level that message is graded to indicate message.
Specifically, mobile node includes message sending node and message recipient node, and mobile node can be to other nodes
Message is sent, while can also receive the message of other nodes transmission, so message sending node and message recipient node are opposite
For.
Fig. 2 is the security framework based on block chain technology of method provided by the invention application, which mainly includes moving
Dynamic node and region authenticated unit LA.Meeting in random movement can be passed through between each node in communication context certain
Carrying out information exchange, LA is only used for supplemental communication and ensures the effect of safety, so, this is connect between being still node by movement
It touches to communicate as leading network structure, i.e. software definition opportunistic network.
Message recipient node can judge that calculating message to received message grades according to itself, and preset condition may include pre-
If adjustment parameter and for message sending node between message at a distance from etc..When the numerical value of grading can just be born, positive grading indicates to work as
Front nodal point is it is thought that a more believable message, and negative grading then indicates a fabulous message.In view of software
Define the memory capacity limitation of opportunistic network interior joint, after a period of time often, all gradings that each node can be run up to
It is uploaded to it apart from nearest static infrastructure: in the authenticated unit LA of region.
Step S2: message grading of each region authenticated unit to the mobile node received for same message gathers
It closes, generates the trust value offset of each message, and form trust value offset block, wherein trust value offset is to right
The confidence level of message is integrated, and is graded according to the message that each mobile node generates, and reverse push exports each mobile node
Confidence level.
Specifically, since not mobile node may be different to the message grading of same message, in order to message can
Reliability optimizes, then needs region authenticated unit to polymerize the received message grading for same message, thus raw
At the trust value offset of each message.
Specifically, the trust value of each node can be obtained by calculating the sum of all offsets, in this, as node body
The foundation of part verifying.By trust value offset, the message that can be generated according to each mobile node is graded to judge each shifting
The communication behavior of dynamic node, i.e., sincere degree when being communicated between node, for example, led between each mobile node
When letter, if some node is transmitted to other nodes for message that it is received is intact, current communication is exactly primary
Sincere reliable behavior；, whereas if the message that it is received forward again after distorting by this node, then it is not one
The communication of secondary sincerity.In the present invention, the confidence level of mobile node can be derived according to the confidence level of message.
The common recognition mechanism that step S3: being proved using associated working amount and equity proves, from the authenticated unit of each region, choosing
A target area authenticated unit is taken out, the trust value offset block formed is uploaded to pre-generated publicly accessible
Trust block chain.
Specifically, the common recognition mechanism proved with equity is proved the invention proposes associated working amount to safeguard trust block
Chain.In order to safeguard node identities verification result, calculated result is packaged by the LA of each region generates " block " (i.e. trust value offset
Measure block), and " miner's election " mechanism of analog block chain competes " block " upload authority, it will by target area authenticated unit
" block " is uploaded to publicly accessible trust block chain, proves by using associated working and stake proof is consensus
Mechanism, the total value of offset is bigger in block, and corresponding LA is easier to find solution for proof of work function.So far, entirely
All nodes and LA in network environment cooperate jointly safeguards a reliable and consistent trust block chain.
In the present solution, the effect of fixed region authenticated unit LA is as follows:
(1) the message grading for storing all nodes in its compass of competency compensates for single in software definition opportunistic network
The memory capacity of node limits；
(2) on the basis of based on the grading of each message, polymerization generates the degree of belief offset of single message, is packaged into trust value
Offset " block " has shared the calculating pressure of mobile node；
(3) " miner " election is participated in, the upload power of competition " block ", " block " is uploaded to publicly accessible by the LA that wins
Trust block chain, the confidence level of each node is inquired for all devices, the authentication and maintenance of node are realized with this.
The verifying of software definition opportunistic network node identities and maintenance process based on block chain technology can be divided into three steps:
1) message grading is calculated；2) trust value offset is calculated；3) generation and upload of trust value offset block.
In one embodiment, mobile node grades to received each message according to preset condition, comprising:
Mobile node divides received all message in groups, is expressed as M={ M1,M2,...,Mj... }, MjCorresponding one
Message j in a message groups M；
It is calculated using confidence level of the formula (1-1) to single message in the group of division:
In formula (1-1),For M in the message groups M that is sent by node kjConfidence level,For message sending node k with
Message MjBetween distance, b and γ are two default regulation parameters, are respectively used to the lower bound and gradual change speed of control message confidence level
Rate, if node k does not have evaluable message,
Or
It combines formula (1-2) to calculate the confidence level of single message in the group of division using formula (1-1), is disappeared
The confidence level set of all message in breath group M
In formula (1-2), RkIndicate that the current trust value of message sending node, Ref are the current trust value of receiving node
Set, α1And α2The respectively weight of the two factor；
Receiving node is based on Bayesian inference and confidence level setCalculate all in message groups M disappear
The polymerization confidence level of breath.
Specifically, during the grading of message refers to two node communications, the credibility of the information content is exchanged, number of grading
The value the high, indicates that the confidence level of the message is higher.The single grading of certain message is generated on the node for receiving the secondary message
's.
In the specific implementation process, all message in same group and do not have same confidence level, when original state,
Therefore the confidence level of certain single message can be obtained by formula (1-1), if node k does not have evaluable message,Except this it
Outside, the Node Credit height for sending current message also will affect the confidence level of the message, and recipient node to neighbouring LA by sending out
It requests, the current prestige of query messages sending node, and is polymerize with distance factor out, be just easy to get more believable knot
Fruit, as shown in formula (1-2).
That is to say, can calculate only with formula (1-1) the confidence level of message, formula (1-1) can also be combined
(1-2) calculates the confidence level of single message.When used in combination, but the usage scenario of the two is different.Work as safety
When frame is in original state, since other message generated gradings can only pass through formula as reference at this time not yet
The estimation of (1-1) Lai Jinhang confidence level.With the continuous service of frame, confidence level is constantly calculated and is accumulated, so that subsequent meter
There are the data that can be used for reference, at this point, passing through the more accurate confidence level estimation of formula (1-2) Lai Jinhang.
By formula (1-2), message recipient node can calculate the confidence level set of all message in message groups MIt is then based on the confidence level set C of the above-mentioned a certain message groups M obtained, recipient node can utilize Bayes
Reasoning process calculates the polymerization confidence levels of all message in message groups M.
Wherein, receiving node is based on Bayesian inference and confidence level setIt calculates in message groups M
The polymerization confidence level of all message, comprising:
Shown in derivation process such as formula (1-3):
Wherein,The corresponding complementary event of expression event e, in formulaP (e/C) table
Show the prior probability of event e, for value range between 0 to 1, i.e. P (e/C) ∈ [0,1], P (e) indicate that event e occurs general
Rate,The complementary event of expression event eThe probability of generation,With P (ck/ e) it is respectively event e and complementary timeThe prior probability of generation presets believability threshold TH, and as P (e/C) > TH, event e generates positive grading, the i.e. event
Belong to certainty, conversely, generating negative grading, if P (e/C) is equal with TH, event e will not produce the node for sending the message
Raw prestige fluctuation.
Specifically, as in network node and LA can not learn ratio shared by any time malicious node in network,
Therefore the confidence level polymerization that traditional statistics outline method carries out message is not available it.The reverse probability that " Bayesian inference " proposes is pre-
Survey method is that the present invention provides theory supports, i.e., the probability occurred according to the current limited anti-judge's part of observed result, and
Continuous correction result precision in subsequent observation.Shown in specific derivation method such as formula (1-3).The numerical value of P (e/C) determines event
The genuine and believable degree of e also just determines that message e generates the quality of credible grading, presets confidence level threshold by statistical experiment
Value TH, as P (e/C) > TH, event e generates positive grading, i.e. the event category certainty, conversely, negative grading is generated, if P
(e/C) equal with TH, then event e will not generate prestige fluctuation to the node for sending the message.
In one embodiment, the calculation of trust value offset are as follows: gathered by the calculation method of formula (1-4)
All gradings for being directed to a certain message are closed, its trust value offset is obtained:
In formula (1-4),Indicate the trust value offset for the node k that current region authenticated unit obtains, m and n difference
The quantity for indicating front grading and negatively grading, θ1And θ2The weight of respectively m and n, θ1And θ2Value determined by formula (1-5),
In formula (1-5), F () is sensitivity coefficient, for controlling influence of the grading to whole result of a small number of nodes
Degree, F () are calculated by formula (1-6),
In formula (1-6), Δ A/A is the variation ratio of evaluation index, i.e., what single malice grading generated whole grading
Changing ratio, Δ F/F are the change rate of non-determined factor, i.e., certain any grading is to whole contributive rate.
Specifically, on the basis of generating the grading of each message single, each mobile node periodically calculates this node
Resulting all gradings are uploaded to neighbouring LA, since malicious node can generate mistake grading deliberately to interfere whole network environment
Information exchange, and different node may generate different gradings to same message, so LA is often collected into for a certain
Several conflicts of message are graded.For example, thering is x node to give positive grading some message m, and there is y node to give
Negative grading, the present invention are polymerize all gradings for a certain message by calculation method shown in formula (1-4), obtain it
Trust value offset.Fig. 6 is referred to, when being polymerize for all gradings in the embodiment of the present invention for a certain message, mistake is commented
The function relation figure of ratio and spoofing ratio.
Δ A/A is the variation ratio of evaluation index, i.e., the changing ratio that single malice grading generates whole grading, Δ F/
F is the change rate of non-determined factor, i.e., certain any grading is to whole contributive rate.It should be noted that the present invention is each section
Point, which generates the reliable premise for trusting grading, to be carried out under the hypothesis that attacker is unable to control most of node, i.e., most of
The generally acknowledged grading of node is more likely then correct and objective, it is therefore desirable to weaken minority by setting sensitivity coefficient
The influence of group.Absolute value | F () | bigger, then a small number of malice gradings can generate bigger shadow to the credibility of the overall evaluation
It rings, so, it should F is controlled in lower value.
In one embodiment, the method based on proof of work mechanism is selected from the authenticated unit of each region
One target area authenticated unit, the trust value offset block formed are uploaded to pre-generated publicly accessible letter
Appoint block chain, specifically include:
It is chosen by way of formula (1-7):
Hash(IDLA,time,PreHash,nonce)≤Si (1-7)
In formula (1-7), IDLAIndicate the number of current region authenticated unit LA, time indicates timestamp, PreHash table
Show previous block cryptographic Hash, mono- numerical value generated at random of nonce, SiIndicate the Hash threshold value of LAi, SiIn form for n company
The binary sequence that continuous 0 starts, the degree-of-difficulty factor of proof of work and the number of n are positively correlated；
All areas authenticated unit calculates cryptographic Hash after nonce value of more correcting one's mistakes, according to SHA-256 hash algorithm,
Meet the qualification for then having the wheel and uploading offset block of formula (1-8) condition；
Si=2Nm-Nz-1 (1-8)
Formula (1-8) defines character string SiExpression-form, wherein int () indicate return bracket in be worth integer portion
Point, NmFor the digit of the resulting cryptographic Hash of SHA-256 hash algorithm, NmEqual to 256, NzIndicate hexadecimal string SiHead end
Continuous 0 number；
The sum of absolute value by comparing trust value offsets all in the authenticated unit of each region come select upload mesh
Mark region authenticated unit:
O in formula (1-9)iFor LAiCurrent trust value side-play amount set,Indicate the section that current region authenticated unit obtains
The trust value offset of point k, FmaxTo limit FiThe upper bound.
Specifically, due to not having to concentrate fixed administrative center, respective trust value offset is generated in all LA
After " block ", needs to select one " miner " and be uploaded in trust value offset block chain.It is being mostly based on block
In the system of chain technology, miner's selection scheme based on proof of work mechanism is often used, such as bit coin known to us.
During all LA election contest " digging mine " qualification, each LA constantly changes the value of nonce, and nonce value is compiled with current LA
Number, previous block cryptographic Hash and timestamp etc. be used as parameter, participate in Hash operation jointly, " miner " election that the present invention takes
Shown in method such as following formula (1-7).Then cryptographic Hash is further calculated according to SHA-256 hash algorithm, and is chosen according to formula (1-8)
Qualified LA out.Wherein, the form of Hash threshold value is as shown in Figure 3.
Software definition opportunistic network is that one kind is moved freely by node, is met at random to carry out the special net of message transmission
Network structure, it is logical to be formed with the route pattern of " storage-carrying-forwarding " independent of the complete routing between mobile node
Believe chance and hop-by-hop communication.But this communication mode also brings new problem.Software definition opportunistic network does not need building
There is fixed reliable transmission channel between two nodes of vertical communication, do not require network that there is connectivity, node it is random
The mobile unstability etc. for also resulting in communication.In secure context, software definition opportunistic network interior joint sparsity is higher, causes
Malicious node can arbitrarily be added in current network environment, and malicious node meeting malicious dissemination deceptive information, secondly and malice saves
Point can capture normal node to mislead it and carry out normal message propagation, so that the authenticity of message can not protect in whole network
Card.
It is reliably connected end to end secondly, software definition opportunistic network can not be established, therefore can not be using online to concentration
Formula authentication center carries out real time communication, and any node identities and the reliability of message of identifying can only all pass through traditional cryptography solution
Certainly, it has greater limitations.In addition, the mode that software definition opportunistic network interior joint carries information is held in terms of secret protection
It is easily maliciously intercepted or is distorted, the integrality of data and the fault-tolerance of equipment are all by very big threat.
Block chain can be considered a kind of tool that can solve safety issue in software definition opportunistic network.In discrete networks
In, block chain can safeguard the database that all members unanimously accept, even if node can not be real with centralized authentication center
Shi Tongxin can also guarantee the safe and reliable of data in block.The list structure that block chain is ordered into, in addition to number in each " block "
According to outer, timestamp, reference of precursor block etc. is also stored, and every time modification, update the common license that will obtain all members,
All members are in the status of complete equity in block chain, and keep identical block chain copy.The core of block chain is " to dig
The selection strategy of mine " power devises herein by the common election mechanism of block chain is imitated and a kind of has combined proof of work
Mechanism and equity prove trust offset " block " update scheme that mechanism combines, and data store organisation has good appearance
Mistake, under no enough calculation power supports, any malicious node can not all distort the record in chain.
It is had the advantage that using the safety of block chain technical optimization opportunistic network
1) decentralization: under block chain structure, data cooperate maintenance by each distributed node, and each node is protected
A block chain copy is stayed, Single Point of Faliure is effectively prevent, the scalability of whole system is also improved；
2) anti-tamper: the storage organization based on chained list makes malicious node in attempting to tamper with chain when data, needs simultaneously
Entire chained list is rebuild, so that crime cost is exponentially increased；
3) data consistency: in block chain structure, database is safeguarded jointly by all nodes, the operation only reached common understanding
It can just be allowed to, the inquiry request that any node issues all returns to obtain identical result；
4) it updates timeliness: proving the more new strategy of mechanism based on equity, so that the operation of more new block chain can be maximum every time
The variation for changing reflection node confidence, ensures that the update timeliness of data in chain；
5) fault-tolerance: " miner " election strategy based on proof of work mechanism, so that failing or being captured in part of nodes
In the case where obtaining, as long as there is enough calculation power to support, it still is able to the normal operation of guarantee system.
In summary it analyzes, node identities verifying and the data in software definition opportunistic network is solved with block chain technology
Secure storage problem has good feasibility.
In order to enable the result for updating offset block chain every time embodies the large change of trust value, the present invention passes through ratio
In more each LA the sum of absolute value of all trust value offsets come select upload LA block, specific calculation be formula (1-
9), in order to avoid FiIt is excessive and cause some LA continuously by selection upload scene, use FmaxTo limit FiThe upper bound, once offset
Amount block is successfully uploaded, and LAi will remove current offset duration set O immediatelyi, realize the fair relatively between each LA.
So far, by imitate block chain in " miner " election mode, the trust offset block that epicycle should be uploaded with
And execute the LA that upload acts and be selected, then, which is packaged into specific format for offset block, that is, it is inclined to form trust value
Shifting amount block.
Wherein, trust value offset block includes block stem and block body.
Specifically, offset block used in the embodiment of the present invention includes block stem and block body two parts, and Fig. 4 shows
The format of block is gone out.
Wherein, block stem Header verifies the legitimate verification of the block for LA, includes following field:
1) Block ID: block id, the unique identification as the block；
2) LA ID: it is responsible for uploading the id of the block；
3) Generation time: timestamp, the execution time of mark upload movement；
4) Prev Hash: the reference to previous block cryptographic Hash；
5) Nonce: the random number of Hash operation is participated in.
Block body Body then stores a side-play amount set, and the confidence values of arbitrary node k are by current offset in network
In block chain, cumulative gained is carried out by all offsets that node k is generated, trusts threshold when the resulting numerical value that adds up is more than or equal to
When value TH, then predicate node k is a believable normal node, conversely, predicate node k is one incredible if being less than TH
Malicious node.After being uploaded to offset block chain via LAi, all nodes and LA can common query, maintenance distribution
Offset set of records ends.
In order to guarantee the consistency of all mobile node identity results, the method also includes:
Using the consistent scheme of Distributed Coordination all mobile nodes and region authenticated unit are reached common understanding.
Specifically, by being analyzed above it is found that the great randomness of the generation of Nonce value, sometimes results in multiple LA and calculate
The equal this small probability event of resulting workload occurs, and system can't give up other extra blocks and only upload one at this time
It is a, if the LA for being responsible for upload block receives these blocks and all Nonce values all pass through validation checking, it will appear trust
The case where being worth offset block chain bifurcated.In order to which under conditions of decentralization, all nodes in network environment are safeguarded jointly
A public consistent offset block chain needs to reach all nodes and LA altogether
Know.After bifurcated occurs in main chain, block can be added to after one of branch by the LA that each round is campaigned for out, be demonstrate,proved by workload
Bright mechanism is it is found that after several wheels, and more workloads of the maximum branch's accumulation of length, this branch will be by as real
Main chain becomes the common recognition of all nodes of whole network, other branches then will not extend and be dropped again.In addition, in being lost
All blocks abandoned in branch will be collected, and attempt to be re-added on main chain, ensure that the one of all node identities results
Cause property.
In order to illustrate more clearly of the beneficial effect of method provided by the invention, said below by a specific example
It is bright.
All nodes are to be based on RWP (Random Waypoint) model in the rectangular community 600m × 600m in this experiment
Mobile, node total number is 300, and the communication radius of each node is 10m, and the average movement speed of node is 10m/s, maximum speed
Degree is 15m/s, minimum speed 5m/s.The mean residence time of each node is 15s, and the minimum and maximum residence time is respectively
20s and 10s.In order to enable entire map to include by the union of all LA communication contexts, the communication half of each LA of experimental setup
Diameter is 100m, and quantity is 25.Data collection interval is 60s, time-to-live TTL (the Time To of each data packet
Live it) is set as 600s, which is only applicable to mobile node, and is not suitable for LA, i.e., when certain in a mobile node
A message or grading were not uploaded to LA in 600 seconds, and the data of these time-out will be dropped.Total duration is simulated in experiment
3600s。
Due to the software definition opportunistic network node identities proof scheme expectation proposed by the present invention based on block chain technology
Interaction as more as possible between node, so tri- kinds of routing algorithms difference of this experimental selection Epidemic, Prophet, Maxprop
Experiment, and experiment effect is described by comparing.In first 60s after experiment starts, due to LA all in this period
It does not carry out nodal information rating collection also, therefore temporarily calculates extremely subsequent process, only each node without carrying out offset in LA
Between communication and grading generate, after 60s, node communication, life all can be gradually carried out in every segment data acquisition interval from test
Grading is uploaded, LA calculates offset and competes " block " upload authority etc. operation to LA at message grading, node.Test other phases
It is as shown in table 1 below to close parameter value.Experimental result is as shown in figure 6 above~9.Wherein, Fig. 6 is when being polymerize, mistake comparation and assessment example with
The function relation figure of spoofing ratio；Fig. 7 (a), 7 (b) and 7 (c) are respectively to be obtained using three kinds of different routing algorithms
Node identities verify precision.Fig. 8 is the letter of the sum of the absolute value that block time-consuming T and trust value offset are generated in the present embodiment Fi
Number relational graph；Fig. 9 is message grading and the time-consuming contrast schematic diagram of " block " transmission in the embodiment of the present invention.
1 experiment parameter table of table
On the whole, node identities checking research of the present invention by block chain Technology application in software definition opportunistic network
In, in an experiment by analysis grading and node identities verify precision, block generate time loss and communication-cost obtain with
Draw a conclusion:
1) discrimination precision of the node identities proof scheme proposed by the present invention based on block chain technology is calculated in three kinds of routings
90% or so can at least be reached under method, when malicious node ratio is lower, discrimination precision is then higher.
2) suitable cryptographic Hash M is selected in the present invention program, under the premise of calculation power needed for capable of guaranteeing block generation is enough,
Block generates time-consuming and remains at reduced levels.
3) the node identities maintenance strategy proposed by the present invention based on block chain structure, grading and trust value offset block
Communication time-consuming be kept at 120ms and 250ms hereinafter, using tolerable lower transmission delay as cost, guarantee node body
The reliability of part maintenance.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the present invention, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The present invention be referring to according to the method for the embodiment of the present invention, the process of equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications can be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, those skilled in the art can carry out various modification and variations without departing from this hair to the embodiment of the present invention
The spirit and scope of bright embodiment.In this way, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to include these modifications and variations.
Claims (7)
1. a kind of software definition opportunistic network node identities verification method based on block chain characterized by comprising
Mobile node grades to received each message according to preset condition, the message grading of generation is sent to corresponding
Region authenticated unit, wherein the confidence level that message is graded to indicate message；
Message grading of each region authenticated unit to the mobile node received for same message polymerize, and generates each
The trust value offset of message, and form trust value offset block, wherein trust value offset is to the confidence level to message
It is integrated, and is graded according to the message that each mobile node generates, reverse push exports the confidence level of each mobile node；
It is proved using associated working amount and the common recognition mechanism of equity proof selects a mesh from the authenticated unit of each region
Region authenticated unit is marked, the trust value offset block formed is uploaded to pre-generated publicly accessible trust block
Chain.
2. the method as described in claim 1, which is characterized in that mobile node according to preset condition to received each message into
Row grading, comprising:
Mobile node divides received all message in groups, is expressed as M={ M1,M2,...,Mj... }, MjA corresponding message
Message j in group M；
It is calculated using confidence level of the formula (1-1) to single message in the group of division:
In formula (1-1),For M in the message groups M that is sent by node kjConfidence level,For message sending node k and message Mj
Between distance, b and γ are two default regulation parameters, the lower bound and fade rates of control message confidence level are respectively used to, if section
Point k does not have evaluable message, then
Or
It combines formula (1-2) to calculate the confidence level of single message in the group of division using formula (1-1), obtains message groups
The confidence level set of all message in M
In formula (1-2), RkIndicate that the current trust value of message sending node, Ref are the current trust value set of receiving node,
α1And α2The respectively weight of the two factor；
Receiving node is based on Bayesian inference and confidence level setCalculate all message in message groups M
It polymerize confidence level.
3. method according to claim 2, which is characterized in that receiving node is based on Bayesian inference and confidence level setCalculate the polymerization confidence level of all message in message groups M, comprising:
Shown in derivation process such as formula (1-3):
Wherein,The corresponding complementary event of expression event e, in formulaP (e/C) indicates thing
The prior probability of part e, for value range between 0 to 1, i.e. P (e/C) ∈ [0,1], P (e) indicate the probability that event e occurs,The complementary event of expression event eThe probability of generation,With P (ck/ e) it is respectively event e and complementary timeHair
Raw prior probability presets believability threshold TH, and as P (e/C) > TH, event e generates positive grading, i.e., the event category can
Letter event, conversely, generating negative grading, if P (e/C) is equal with TH, event e will not generate letter to the node for sending the message
Reputation fluctuation.
4. the method as described in claim 1, which is characterized in that the calculation of trust value offset are as follows: pass through formula (1-4)
Calculation method polymerize all gradings for a certain message, obtain its trust value offset:
In formula (1-4),Indicate the trust value offset for the node k that current region authenticated unit obtains, m and n are respectively indicated
Quantity front grading and negatively graded, θ1And θ2The weight of respectively m and n, θ1And θ2Value determined by formula (1-5),
In formula (1-5), F () is sensitivity coefficient, for controlling influence degree of the grading to whole result of a small number of nodes,
F () is calculated by formula (1-6),
In formula (1-6), Δ A/A is the variation ratio of evaluation index, i.e., the variation that single malice grading generates whole grading
Ratio, Δ F/F are the change rate of non-determined factor, i.e., certain any grading is to whole contributive rate.
5. the method as described in claim 1, which is characterized in that proof of work mechanism is based on, from each region authenticated unit
In, select a target area authenticated unit, the trust value offset block formed be uploaded to it is pre-generated can be public
The trust block chain accessed altogether, specifically includes:
It is chosen by way of formula (1-7):
Hash(IDLA,time,PreHash,nonce)≤Si (1-7)
In formula (1-7), IDLAIndicate the number of current region authenticated unit LA, time indicates timestamp, before PreHash expression
One block cryptographic Hash, mono- numerical value generated at random of nonce, SiIndicate the Hash threshold value of LAi, SiIt is in form continuous with n
0 binary sequence started, the degree-of-difficulty factor of proof of work and the number of n are positively correlated；
All areas authenticated unit calculates cryptographic Hash after nonce value of more correcting one's mistakes, according to SHA-256 hash algorithm, meets
The qualification for then having the wheel and uploading offset block of formula (1-8) condition；
Si=2Nm-Nz-1 (1-8)
Formula (1-8) defines character string SiExpression-form, wherein int () indicate return bracket in be worth integer part, Nm
For the digit of the resulting cryptographic Hash of SHA-256 hash algorithm, NmEqual to 256, NzIndicate hexadecimal string SiHead end continuous 0
Number；
The sum of absolute value by comparing trust value offsets all in the authenticated unit of each region come select upload target area
Domain authenticated unit:
O in formula (1-9)iFor LAiCurrent trust value side-play amount set,Indicate the node k's that current region authenticated unit obtains
Trust value offset, FmaxTo limit FiThe upper bound.
6. the method as described in claim 1, which is characterized in that trust value offset block includes block stem and block body.
7. the method as described in claim 1, which is characterized in that the method also includes:
Using the consistent scheme of Distributed Coordination all mobile nodes and region authenticated unit are reached common understanding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910347895.9A CN110113148B (en) | 2019-04-28 | 2019-04-28 | Software defined opportunistic network node identity verification method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910347895.9A CN110113148B (en) | 2019-04-28 | 2019-04-28 | Software defined opportunistic network node identity verification method based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110113148A true CN110113148A (en) | 2019-08-09 |
| CN110113148B CN110113148B (en) | 2020-06-23 |
Family
ID=67487139
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910347895.9A Active CN110113148B (en) | 2019-04-28 | 2019-04-28 | Software defined opportunistic network node identity verification method based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110113148B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110955721A (en) * | 2019-10-23 | 2020-04-03 | 金蝶软件（中国）有限公司 | Block link point state maintenance method and device, computer equipment and storage medium |
| CN111431696A (en) * | 2020-03-26 | 2020-07-17 | 深圳市欧欣泰科技有限公司 | Identity-based block chain sealing mechanism |
| CN111431695A (en) * | 2020-03-24 | 2020-07-17 | 武汉理工大学 | Software defined tactical network node credit management method based on block chain |
| CN111770103A (en) * | 2020-06-30 | 2020-10-13 | 中国科学技术大学 | Network node security attribute evaluation method based on block chain consensus result feedback |
| CN113159743A (en) * | 2021-02-02 | 2021-07-23 | 上海大学 | Vehicle crowd sensing excitation system and method based on block chain and edge calculation |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222478A (en) * | 2017-05-27 | 2017-09-29 | 暨南大学 | Software defined network key-course security mechanism construction method based on block chain |
| CN107579998A (en) * | 2017-10-17 | 2018-01-12 | 光载无限（北京）科技有限公司 | Personal data center and digital identification authentication method based on block chain, digital identity and intelligent contract |
| WO2018077049A1 (en) * | 2016-10-27 | 2018-05-03 | Huawei Technologies Co., Ltd. | Distributed data store-equipped evolved packet core apparatus and method |
| CN108173827A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | Distributed SDN control planes safety certifying method based on block chain thinking |
| US20180294955A1 (en) * | 2017-04-05 | 2018-10-11 | Samsung Sds Co., Ltd. | System for processing data based on blockchain and operating method thereof |
| CN108847925A (en) * | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| US20180343126A1 (en) * | 2017-05-24 | 2018-11-29 | NXM Labs Inc. | System and method for utilizing connected devices to enable secure and anonymous electronic interaction in a decentralized manner |
| CN109246137A (en) * | 2018-10-23 | 2019-01-18 | 北京航空航天大学 | The safety protecting method and device of naval warfare data based on block chain |
| CN109639837A (en) * | 2019-01-31 | 2019-04-16 | 东南大学 | Block chain DPoS common recognition method based on faith mechanism |
| CN109634959A (en) * | 2018-11-30 | 2019-04-16 | 北京瑞卓喜投科技发展有限公司 | A kind of block index method and block index device |
-
2019
- 2019-04-28 CN CN201910347895.9A patent/CN110113148B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018077049A1 (en) * | 2016-10-27 | 2018-05-03 | Huawei Technologies Co., Ltd. | Distributed data store-equipped evolved packet core apparatus and method |
| US20180294955A1 (en) * | 2017-04-05 | 2018-10-11 | Samsung Sds Co., Ltd. | System for processing data based on blockchain and operating method thereof |
| US20180343126A1 (en) * | 2017-05-24 | 2018-11-29 | NXM Labs Inc. | System and method for utilizing connected devices to enable secure and anonymous electronic interaction in a decentralized manner |
| CN107222478A (en) * | 2017-05-27 | 2017-09-29 | 暨南大学 | Software defined network key-course security mechanism construction method based on block chain |
| CN107579998A (en) * | 2017-10-17 | 2018-01-12 | 光载无限（北京）科技有限公司 | Personal data center and digital identification authentication method based on block chain, digital identity and intelligent contract |
| CN108173827A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | Distributed SDN control planes safety certifying method based on block chain thinking |
| CN108847925A (en) * | 2018-06-20 | 2018-11-20 | 深圳大学 | A kind of fragment block chain generation method based on tree |
| CN109246137A (en) * | 2018-10-23 | 2019-01-18 | 北京航空航天大学 | The safety protecting method and device of naval warfare data based on block chain |
| CN109634959A (en) * | 2018-11-30 | 2019-04-16 | 北京瑞卓喜投科技发展有限公司 | A kind of block index method and block index device |
| CN109639837A (en) * | 2019-01-31 | 2019-04-16 | 东南大学 | Block chain DPoS common recognition method based on faith mechanism |
Non-Patent Citations (1)
| Title |
|---|
| 刘明达，拾以娟，陈左宁: ""基于区块链的分布式可信网络连接架构"", 《软件学报》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110955721A (en) * | 2019-10-23 | 2020-04-03 | 金蝶软件（中国）有限公司 | Block link point state maintenance method and device, computer equipment and storage medium |
| CN110955721B (en) * | 2019-10-23 | 2022-12-06 | 金蝶软件（中国）有限公司 | Block link point state maintenance method and device, computer equipment and storage medium |
| CN111431695A (en) * | 2020-03-24 | 2020-07-17 | 武汉理工大学 | Software defined tactical network node credit management method based on block chain |
| CN111431696A (en) * | 2020-03-26 | 2020-07-17 | 深圳市欧欣泰科技有限公司 | Identity-based block chain sealing mechanism |
| CN111431696B (en) * | 2020-03-26 | 2023-10-17 | 深圳市欧欣泰科技有限公司 | Block chain seal mechanism based on identity |
| CN111770103A (en) * | 2020-06-30 | 2020-10-13 | 中国科学技术大学 | Network node security attribute evaluation method based on block chain consensus result feedback |
| CN113159743A (en) * | 2021-02-02 | 2021-07-23 | 上海大学 | Vehicle crowd sensing excitation system and method based on block chain and edge calculation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110113148B (en) | 2020-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110113148A (en) | A kind of software definition opportunistic network node identities verification method based on block chain | |
| Shu et al. | Collaborative intrusion detection for VANETs: A deep learning-based distributed SDN approach | |
| CN109922162B (en) | Flat building equipment Internet of things monitoring system and method based on block chain | |
| Tan et al. | Blockchain-based key management for heterogeneous flying ad hoc network | |
| CN110113328A (en) | A kind of software definition opportunistic network DDoS defence method based on block chain | |
| CN109246137A (en) | The safety protecting method and device of naval warfare data based on block chain | |
| CN109462587A (en) | Block chain is layered common recognition method, block chain network system and block chain node | |
| CN109919771B (en) | Industrial internet transaction device applying hierarchical block chain technology | |
| CN108494581A (en) | The controller distributed information log generation method and device of SDN network | |
| CN110377002A (en) | A kind of adaptive interior CAN bus method of controlling security and system | |
| CN111752246A (en) | Unmanned aerial vehicle bee colony cooperative work platform based on block chain and artificial intelligence drive | |
| Kang et al. | Securing data sharing from the sky: Integrating blockchains into drones in 5G and beyond | |
| Pan et al. | Blockchain and AI empowered trust-information-centric network for beyond 5G | |
| CN111431695A (en) | Software defined tactical network node credit management method based on block chain | |
| Mahmood et al. | Trust on wheels: Towards secure and resource efficient IoV networks | |
| Ogundoyin et al. | An efficient authentication scheme with strong privacy preservation for fog-assisted vehicular ad hoc networks based on blockchain and neuro-fuzzy | |
| Al-Duwairi et al. | BotDigger: a fuzzy inference system for botnet detection | |
| CN112260836A (en) | Method for improving block chain throughput based on fragmentation technology | |
| He et al. | ROAchain: Securing route origin authorization with blockchain for inter-domain routing | |
| CN110324331A (en) | Power system security stability contorting terminal identity authentication method based on block chain | |
| CN107835077B (en) | Mutual trust cluster collaborative verification method for anonymous authentication of vehicle-mounted network | |
| CN109450685A (en) | A kind of common recognition method and node based on local links' node off-line | |
| CN117097489A (en) | Lightweight double-factor agriculture Internet of things equipment continuous authentication method and system | |
| Jiang et al. | LBlockchainE: A lightweight blockchain for edge IoT-enabled maritime transportation systems | |
| Zhang et al. | A parallel consensus mechanism using PBFT based on DAG-lattice structure in the internet of vehicles |
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 |