CN115361395A - Internet of things data sharing method based on block chain payment channel network - Google Patents

Internet of things data sharing method based on block chain payment channel network Download PDF

Info

Publication number
CN115361395A
CN115361395A CN202210828802.6A CN202210828802A CN115361395A CN 115361395 A CN115361395 A CN 115361395A CN 202210828802 A CN202210828802 A CN 202210828802A CN 115361395 A CN115361395 A CN 115361395A
Authority
CN
China
Prior art keywords
node
transaction
nodes
mpr
data
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.)
Pending
Application number
CN202210828802.6A
Other languages
Chinese (zh)
Inventor
盖珂珂
张悦
祝烈煌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yangtze River Delta Research Institute Of Beijing University Of Technology Jiaxing
Beijing Institute of Technology BIT
Original Assignee
Yangtze River Delta Research Institute Of Beijing University Of Technology Jiaxing
Beijing Institute of Technology BIT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Yangtze River Delta Research Institute Of Beijing University Of Technology Jiaxing, Beijing Institute of Technology BIT filed Critical Yangtze River Delta Research Institute Of Beijing University Of Technology Jiaxing
Priority to CN202210828802.6A priority Critical patent/CN115361395A/en
Publication of CN115361395A publication Critical patent/CN115361395A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1042—Peer-to-peer [P2P] networks using topology management mechanisms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3821—Electronic credentials
    • G06Q20/38215—Use of certificates or encrypted proofs of transaction rights
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/026—Details of "hello" or keep-alive messages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • 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/008—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols involving homomorphic encryption
    • 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Technology Law (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to an Internet of things data sharing method based on a block chain payment channel network, and belongs to the technical field of block chains. The method comprises four stages of data acquisition and processing, transaction segmentation, transaction routing and transaction data recording. The Internet of things equipment serves as a participant node of the block chain, and when data sharing is needed, transaction is initiated in the payment channel network. The invention designs a transaction segmentation method based on homomorphic hash, which solves the problem of low transaction success rate caused by the limitation of mortgage assets in a payment channel network. The payment channel network adopts a table-driven routing mode based on a multipoint relay mechanism, and a minimum relay node selection algorithm is designed to reduce the routing maintenance cost. The payment channel network is abstracted into a directed graph, and the disjoint shortest paths of a plurality of nodes are planned to perform transaction routing, so that the transaction success rate is improved. And when the data sharing is finished, uploading the sharing record to the block chain for safe storage. The method realizes safe and efficient data sharing among the Internet of things devices.

Description

Internet of things data sharing method based on block chain payment channel network
Technical Field
The invention relates to a method for sharing data of an internet of things by using a block chain expanded by a payment channel network in the environment of the internet of things, and belongs to the technical field of block chain application.
Background
The internet of things equipment is widely deployed in various fields such as intelligent transportation, intelligent power grids and medical care. Data sharing among the Internet of things devices is a necessary trend for improving data value and constructing a digital integrated smart city. Facing the ever-increasing data volume and the increasingly complex network structure, the method faces a significant challenge for ensuring efficient and safe data sharing in the environment of the internet of things.
Traditional centralized infrastructure-based internet of things data sharing schemes face privacy and security challenges. The block chain has the characteristics of decentralization, tamper resistance and traceability, so that the block chain is considered to be an effective scheme for realizing safe and efficient data sharing in the environment of the Internet of things. However, most of the existing data sharing schemes based on the block chain face the problems of high calculation cost and low efficiency, and the internet of things equipment with limited resources cannot complete calculation-intensive consensus.
Disclosure of Invention
The invention aims to solve the technical problem of how to realize efficient and safe data sharing in the environment of the Internet of things. The data sharing method of the Internet of things based on the block chain payment channel network is creatively provided.
The invention adopts a Payment Channel Network (PCN) to expand the block chain, and realizes efficient Internet of things data sharing. In PCN, data is appended to the transaction. The participant creates a multi-signature wallet and reserves into the wallet a fund, referred to as the channel balance. Participants conduct direct transactions with a given user through a payment channel for a limited time. The participants who do not directly establish a payment channel transmit the transaction through the intermediate user, and the intermediate user collects the forwarding commission charge. When the transaction between the participants is carried out immediately under the chain, the final result is cleared and recorded on the blockchain when the channel is closed.
When the transaction amount exceeds the channel balance, the transaction fails because it cannot be forwarded through the channel. In order to improve the success rate of large-amount transaction, the large-amount payment is divided into a plurality of small-amount payments. Typically, the multiple transactions resulting from the splitting have the same hash lock, and the intermediate forwarding node checks whether the transaction is split by checking the hash lock of the transaction. Since the success rate of an undivided transaction is usually greater than that of a divided transaction, rational intermediate nodes tend to forward undivided transactions, which cannot guarantee fairness between transactions. Therefore, the invention provides a transaction segmentation mode based on homomorphic hash, so that the intermediate node cannot distinguish integral payment from segmentation payment. Homomorphic hashing refers to a hash function with homomorphic properties, and the homomorphic properties refer to that after output obtained by processing homomorphic encrypted data is decrypted, the result is the same as that of output obtained by processing unencrypted original data in the same way. Meanwhile, homomorphic hashing still keeps the collision resistance of a hash function, namely, a logarithm is difficult to find in a definition domain, and the logarithms have the same value after being subjected to function mapping.
In order to solve the problem of unstable infrastructure of the wireless Internet of things, the Internet of things data sharing based on the PCN adopts an ad hoc network. In conventional link state routing algorithms, the routing table is typically maintained in a flooding manner, i.e., each node broadcasts its own link state packet to all other nodes. However, in the case of large-scale and high-density internet of things devices, maintaining the network topology through flooding would cause huge overhead. An Optimized Link State Routing (OLSR) protocol reduces communication overhead through a Multi-point Relay (MPR) mechanism. The MPR mechanism only selects a part of nodes to forward link state information, and the part of selected nodes is called relay nodes.
Compared with single-path routing, multi-path routing has great advantages in fault tolerance, reliability, quality of service and the like. The node disjoint multi-path routing mechanism can balance network load while improving transaction success rate. Generally, the more independent a path is in a multi-path route, the more fully network resources can be utilized. The nodes have the right of independently selecting the paths, so the use condition of the paths can be adjusted according to the congestion degree of the network, and the utilization rate of the network is improved.
First, the concept and content of the present invention will be explained.
Block chains: the account book is an open distributed account book running on a peer-to-peer network, and trust can be established among a plurality of independent individuals or systems without a man-in-the-middle. The data in the block chain are sequentially connected into a chain structure in a block form, and the safety, verifiability and non-tampering property of the data are maintained in a cryptology mode.
A consensus mechanism: is a protocol or algorithm used to maintain data consistency in the blockchain system, and is also a key to establishing trust without a centralized mechanism in the blockchain system. And voting the transaction through the specific block link point, and finishing the verification and confirmation of the transaction within a certain time. If the nodes of parties with irrelevant interests achieve consensus on the transaction, the transaction is added to the whole block chain ledger, so that the data of the ledger is guaranteed to be consistent.
And (3) payment channel: a method for encrypting currency transaction. The participant creates a multi-signature wallet and reserves into the wallet an amount of money called the channel balance. Participants may conduct direct transactions with a given user for a limited time through a payment channel. The one-way payment channel allows only one-way flow of funds, while the two-way payment channel allows two-way transactions.
Payment Channel network (Payment Channel network, PCN for short): is a chain-down cryptocurrency transaction scheme aimed at improving blockchain scalability. The payment channel network is essentially a set of bidirectional payment channels, and the transaction forwarding can be carried out between participants who do not directly establish the payment channels through intermediate users. The transaction between the participants is carried out immediately under the chain, and the final result is cleared and recorded on the blockchain when the channel is closed.
Homomorphic hashing: refers to a hash function having homomorphic properties. Homomorphic properties refer to the fact that after output obtained by homomorphic encrypted data processing is decrypted, the result is the same as that of unencrypted original data output processed in the same way. Meanwhile, homomorphic hashing still keeps the collision resistance of the hash function, namely, a logarithm is difficult to find in a definition domain, and the logarithm has the same value after being subjected to function mapping.
Table-driven routing protocol: a table-based routing protocol. In this protocol, each node maintains one or more tables of routing information to all other nodes in the network. When detecting that the network topology structure changes, the node sends the route updating information in the network, and when receiving the updating information, the node updates the table of the node, so that the routing information of the node is consistent, timely and accurate.
Multi-point Relay (MPR) mechanism: in the routing table maintenance process, in order to reduce flooding overhead, a part of nodes are selected for forwarding broadcast. The part of the selected nodes are called relay nodes, and the link state information is generated only by the relay nodes, so that the control information flooded in the network is reduced.
The invention is realized by adopting the following technical scheme.
A data sharing method of an Internet of things based on a block chain payment channel network comprises the following steps:
step 1: and (5) collecting data.
Object perception of internet of things devices relies on connected sensors or other technical devices. The primary functions of these devices are to identify and locate objects, and to accurately collect object data when needed.
Preferably, since a large amount of internet of things devices can generate massive heterogeneous data, data processing may be performed before storage.
Step 1.1: data is standardized or converted to a uniform format to make it compatible with the corresponding application.
Step 1.2: a backup of the new converted format data is stored or created.
Step 1.3: repeated, over-time and invalid data are filtered, data redundancy is reduced, and accuracy is improved.
Step 1.4: integrating structured or unstructured data from other sources enriches the current dataset.
Step 2: a transaction is generated.
The participants of the transaction comprise a data requester and a data provider, wherein the data requester is an internet of things device with corresponding data requirements, and the data provider is an internet of things device with shared data resources.
When there is a need for data sharing, the data requester initiates a transaction with the data provider by executing an intelligent contract in the blockchain.
And 3, step 3: the transaction is split.
And the Internet of things equipment is used as a participating node of the payment channel network in the block chain to perform transaction forwarding.
The participants of the payment channel network mortgage an asset in the channel in advance, and when the transaction amount exceeds the mortgage asset in the current channel, the transaction fails.
In order to improve the success rate of large-amount transactions in the payment channel network, one large-amount transaction can be divided into a plurality of small-amount transactions based on a homomorphic hash mechanism.
And 4, step 4: and (4) maintaining the route.
The data sharing model of the Internet of things based on the block chain adopts an ad hoc network, each payment channel network node is a terminal and also serves as a router, and a route to another node in the network can be searched and maintained. When a node needs to communicate with nodes outside its coverage, multi-hop forwarding by intermediate nodes is required.
The method comprises the steps of adopting table-driven routing in an Internet-of-things data sharing model based on a block chain, broadcasting HELLO messages in one-hop neighbor nodes to monitor states of the neighbor nodes and construct neighbor tables of the nodes, wherein the HELLO messages comprise addresses of the neighbor nodes, cost for reaching the neighbor nodes and residual funds in channels between the HELLO messages and the neighbor nodes.
Further, the invention provides a multi-point relay selection algorithm for helping each node select a plurality of nodes from one-hop neighbor nodes thereof as multi-point relay (MPR) nodes, and only the multi-point relay nodes participate in forwarding Topology Control (TC) messages and participate in routing, thereby greatly reducing communication overhead brought by link state update messages. And the multipoint relay node periodically updates the latest topological state of the payment channel network according to the received topological control message.
And 5: and (5) forwarding the transaction.
The payment channel network is abstracted as a directed graph G = (V, E), V being the set of participating nodes and E being the set of all channels.
In the payment channel network, when two nodes perform transactions, a routing path composed of a plurality of payment channels needs to be planned. Furthermore, because the forwarding commission cost and the time delay cost required by different paths are different, and the path selection scheme directly influences the transaction performance of the system, the invention provides a node-disjoint multi-path routing algorithm, and the routing reliability is improved while the routing cost is minimized.
First, the MPR mechanism is used to obtain the current routing topology and fund view of the entire PCN. In order to reduce network communication overhead, an algorithm for solving the minimum MPR set selection problem is adopted. In addition, the payment channel network is abstracted into a directed graph, and a plurality of nodes of disjoint shortest paths are planned to perform transaction routing, so that the transaction success rate is improved, and path congestion is avoided.
And 6: a transaction record is stored.
In the block chain based on the payment channel network, a large number of transactions are carried out outside the block chain in real time, and the transactions outside the chain do not need to wait for the on-chain consensus process, so that the expandability of the block chain system is improved.
And when both sides of the transaction want to terminate the transaction, performing final clearing and merging according to the transaction records of the data sharing, then submitting the transaction records to the blockchain, and storing the merged data sharing transaction in a blockchain account book after negotiation and verification.
Advantageous effects
Compared with the prior art, the method of the invention has the following advantages:
1. according to the method, efficient data sharing among the terminal devices of the Internet of things is achieved by adopting the payment channel network expansion block chain. The payment channel network establishes a data transmission channel to support high-frequency data exchange. The transaction of the data exchange is performed outside the blockchain, and the exchange records are uploaded to the blockchain for consensus and storage only during the final clearing. In addition, the block chain provides a traceable distributed account book for the safe data sharing management of the Internet of things.
2. In order to improve the success rate of large-amount transactions, the invention introduces a homomorphic Hash driven transaction segmentation scheme in the data sharing scheme based on the PCN, and guarantees fairness by cutting off the association between the segmented transactions.
3. The invention provides an intelligent multi-path routing scheme, which improves the success rate of data sharing of the internet of things while ensuring high-frequency transaction of data sharing of the internet of things in a PCN.
Drawings
FIG. 1 is a top level architecture diagram of the process of the present invention.
FIG. 2 is a flow chart of the data sharing operation of the method of the present invention.
Fig. 3 is a diagram illustrating the comparison between the MPR mechanism and the flooding mechanism in the method of the present invention.
Detailed Description
The following will explain the concrete implementation process of the method of the present invention in detail with reference to the accompanying drawings and examples.
Examples
FIG. 1 shows the top level architecture of the method of the present invention.
A method for sharing data of an internet of things based on a blockchain payment channel network, as shown in fig. 2, includes the following steps.
Step 1: the internet of things equipment collects data.
Object perception of the internet of things equipment depends on connected technical equipment such as sensors, radio frequency identification and image identification, and is used for identifying and positioning targets and accurately collecting target data when needed.
Because a large amount of thing networking equipment can produce the heterogeneous data of magnanimity, can carry out data processing earlier, include:
standardizing or converting the data into a uniform format so that the data is compatible with corresponding application programs; storing or creating a backup of the new converted format data; repeated, outdated and invalid data are filtered to reduce data redundancy and improve accuracy; integrating structured or unstructured data from other sources enriches the current data set.
The collected data may be stored in a local or cloud database. Standardized data may be shared for transactions among participants in an internet of things environment.
And 2, step: a transaction is generated.
The participants of the transaction comprise a data requester and a data provider, wherein the data requester is an internet of things device with corresponding data requirements, and the data provider is an internet of things device with shared data resources.
When there is a data sharing requirement, the data requester initiates a transaction with the data provider by executing an intelligent contract in the blockchain, and thus, the data requester is the transaction initiator.
And step 3: and (4) transaction segmentation.
And the Internet of things equipment is used as a participating node of the payment channel network in the block chain to perform transaction forwarding.
The payment channel network requires all participants joining the network to mortgage an asset in the channel in advance, and when the transaction amount exceeds the mortgage asset in the current channel, the transaction fails.
In order to improve the success rate of large-amount transaction in a payment channel network, the invention provides a homomorphic hash mechanism which is used for dividing one large-amount transaction into a plurality of small-amount transactions. The method comprises the following specific steps:
let the data requester, i.e. the transaction initiator, divide the transaction Tx with a sum of a into n small transactions (Tx) 1 ,Tx 2 ,...,Tx n ) The amount of money corresponding thereto is (a) 1 ，a 2 ，...，a n ) Wherein Tx n Represents the nth transaction, a = a 1 +a 2 +...+a n 。
For a transaction Tx, a random number x is selected R Obtaining a hash value H by a homomorphic hash function H R 。
For transactions (Tx) 1 ,Tx 2 ,...,Tx n ) N random numbers (x) are respectively selected 1 ,x 2 ,...,x n ) Obtaining a hash value (H) through a homomorphic hash function H 1 ,h 2 ,...,h n )，h n Representing a random number x n A corresponding hash value. x is the number of n And (4) showing.
The node is arranged to receive a transaction with a hash value h and a ciphertext c, and the h and the c are calculated by the following formulas 1 and 2 respectively:
h＝H(x R +x)＝h R +H(x) (1)
c＝ε pk (x R +x) (2)
where H is the number of pairs x using a homomorphic hash function H R And a hash value obtained by mapping the sum of x, c is the public key of the receiver to x R And the sum of x is encrypted to obtain a ciphertext. Epsilon pk Representing a public key cryptographic function.
For each divided transaction Tx i By means of a random number x i To construct h i As shown in formula 3; encrypting the random number by using the public key of the receiving party to obtain a ciphertext c i As shown in formula 4:
h i ＝h+H(x i )＝h R +H(x)+H(x i ) (3)
c i ＝c+ε pk (x i )＝ε pk (x R +x)+ε pk (x i )＝ε pk (x R +x+x i ) (4)
the receiver decrypts c with its private key sk i To obtain x i Then calculate H (x) i )。
According to equation 3, the recipient knows h i And H (x) i ) H can then be calculated. Similarly, after c is decrypted using the private key to obtain x, h is obtained according to equation 1 R 。
In addition, the receiving party provides a receipt proof for all received split transactions, so as to ensure the safety and correctness of the transaction splitting scheme.
And 4, step 4: and (4) maintaining the route.
In the invention, an ad hoc network is adopted in the block chain-based Internet of things data sharing model, and each payment channel network node is a terminal and also serves as a router and can search and maintain a route to another node in the network. When a node is to communicate with nodes outside its coverage, intermediate nodes are required to perform multi-hop forwarding.
The method comprises the steps that table-driven routing is adopted in an Internet of things data sharing model based on a block chain, HELLO messages are broadcasted in one-hop neighbor nodes to monitor states of the neighbor nodes and construct neighbor tables of the nodes, and the HELLO messages comprise addresses of the neighbor nodes, cost for reaching the neighbor nodes and residual funds in channels between the neighbor nodes and the HELLO messages.
In addition, the present invention employs a multipoint relay mechanism, i.e., each node selects several nodes from its one-hop neighbor nodes as multipoint relay (MPR) nodes. Only the multipoint relay node participates in forwarding Topology Control (TC) messages and in routing. And the node periodically updates the latest topological state of the payment channel network according to the received topological control message.
Fig. 3 compares the link states within three hops when messages are broadcast using the flooding mechanism and the MPR selection mechanism. The number of retransmission nodes required for broadcasting messages in the flooding mode is 40, while the number of retransmission nodes required for the MPR mode is only 11. This means that the communication overhead caused by the link state update message can be greatly reduced by maintaining the routing table in the multi-relay forwarding mode.
By reducing the number of MPR nodes in the network, the communication overhead for topology maintenance can be reduced. Further, the present invention provides a method for selecting a minimum MPR set, which comprises the following steps:
first, the MPR node set selection problem is formally defined.
A node S is defined as a starting node, and S is equal to V, wherein V is a participating node set. N is a radical of 1 (S)、N 2 And (S) respectively represents a set of one-hop neighbor nodes and two-hop neighbor nodes of the node S. An MPR (S) is defined as the set of MPR nodes selected for node S. The optimal MPR set selection problem is expressed as a minimized set | MPR (S) | under the condition that equation 5-9 is satisfied:
Figure BDA0003745130180000081
Figure BDA0003745130180000082
N 1 (MPR(S))＝N 1 (M 1 )∪...∪N 1 (M k )-{S}-N 1 (S) (7)
Figure BDA0003745130180000083
Figure BDA0003745130180000084
wherein, M k Representing the kth MPR node, wherein k is the total number of MPR nodes of the node S; m i Represents the ith MPR node; n is a radical of 1 (MPR (S)) represents a one-hop neighbor set of the MPR node set of node S, N 1 (M 1 ) One-hop neighbor set, N, representing the first MPR node of node S 1 (M k ) A one-hop neighbor set representing a kth MPR node of the node S; u represents a node in the node set V, N 1 (U) watchShowing a one-hop neighbor set of a node U;
Figure BDA0003745130180000085
is a symbol of any number of symbols,
Figure BDA0003745130180000086
a symbol is present.
In order to solve the above problems, the present invention adopts a multi-point relay selection algorithm to reduce the number of MPR nodes as much as possible, thereby reducing the number of TC messages in the network and the forwarding time.
The inputs to the multipoint relay selection algorithm include the topology G = (V, E), the originating node S of the payment channel network. The output of the algorithm comprises MPR node set MPR (S) of the starting node S, one-hop neighbor set N 1 (S) two-hop neighbor set N 2 (S). The method comprises the following specific steps:
step 4.1: and (6) initializing.
First, MPR (S) is initialized to a one-hop neighbor node set N 1 (S). Then, the status of all nodes in MPR (S) is marked as unselected.
For each node V in MPR (S) i Calculating its two-hop neighbor node set N 2 The number of nodes that can be covered in (S) is marked as deg [ V ] i ]。
Step 4.2: node selection for MPR (S) set.
Checking each node in the current MPR (S) set, for the current node V i If the MPR set is already selected by other nodes and the forwarding intention is not 0, preferentially selecting V i MPR concentration of S is added and V is added i Is instead selected by S.
Step 4.3: adding necessary nodes and deleting redundant nodes in the MPR (S) set.
The communication overhead of maintaining the routing table is reduced by eliminating redundancy by traversing nodes in the MPR (S) set whose states are selected.
If there are nodes in the MPR (S) set that are not selected in the state, the nodes are traversed. Finding out the node V with the minimum degree in sequence i Detection at deletion V i Whether the remaining nodes in the hourly MPR (S) set can cover N 2 (S). If so, delete node V i Else, node V i Is marked as selected.
In the execution flow of the multipoint relay selection algorithm, the pseudo code is as follows:
Figure BDA0003745130180000091
and 5: and (6) forwarding the transaction.
The payment channel network is abstracted as a directed graph G = (V, E), V being the set of participating nodes and E being the set of all channels.
In the payment channel network, when two nodes carry out transaction, a routing path consisting of a plurality of payment channels is planned. Because the forwarding commission and the time delay cost required by different paths are different, and the path selection scheme directly influences the transaction performance of the system, the invention provides a node-disjoint multi-path routing algorithm, and the reliability of the routing is improved while the routing cost is minimized.
Inputs to the algorithm include the topology G = (V, E) of the payment channel network, the set of weights for the edges w, the set of channel balances Deposit, the start node S, the target node T, the transaction amount tx.a, and the preset number of paths k. The output of the algorithm is a set P of k node-disjoint shortest paths between S and T. Lines (1) to (22) of the pseudocode define a function Route to find the shortest path between S and T under the constraint of the channel balance. The main function of lines (23) to (29) is to establish the shortest paths for k and ei disjoint.
The specific process of the whole algorithm comprises the following steps:
step 5.1: lines (2) to (5) correspond to the initialization process of the variables. Adjacency lists (heads and e) are built to store the PCN topology based on routing tables maintained by the multi-relay forwarding algorithm. Wherein, the head is the first address of a linked list formed by corresponding edges of a node. Array e is used to store nodes pointed to by an edge. An array visit is defined to store the access state of the nodes in graph G and 0 is used to initialize visit (unaccessed state). An array dist is defined as the path length from the start node S to each vertex in V, and is initialized to ∞ (indicating that the path is unreachable). Since the distance from S to itself is 0, the initialized dist [ S.pos ] is 0, where pos is the position index of node S. A priority queue Q is defined, the first element of which is the length of the shortest path from S to the current node and the second element is the index of the current node. A start node S is added to Q for initialization.
And step 5.2: lines (6) to (21) correspond to the procedure of finding the shortest path from S to each node. A priority queue Q is employed to store vertices and distances that can be used to update the shortest path. When Q is not empty, the element with the shortest path length (denoted as V) is popped up each time. If V has been processed, skip directly; otherwise, V is marked as processed and vertices adjacent to it are processed. If V neighbor U can provide a shorter path length, then dist [ ]isupdated and U's relevant information is added to queue Q. And repeating the process until all the nodes are processed. The shortest Path from S to T can be constructed from the values in dist [ ] that are not equal to ∞, and the length of Path is stored in dist [ T.pos ].
Step 5.3: adding the current Path to P, copying a PCN topology, and deleting all nodes in the Path obtained currently. And calling a Route function to find the shortest path of another joining P. And exiting the algorithm until the preset path number k is reached or the condition is not met.
Step 6: a transaction record is stored.
In the block chain based on the payment channel network, a large number of transactions are carried out outside the block chain in real time, and the transactions outside the chain do not need to wait for the on-chain consensus process, so that the expandability of the block chain system is improved.
When both sides of the transaction want to terminate the transaction, final clearing and merging are carried out according to the transaction records of data sharing, then the transaction records are submitted to the blockchain, and the merged data sharing transaction is stored in a blockchain account book after being negotiated and verified.
In consideration of the storage limitation of the internet of things equipment, the common internet of things node only stores the block head, and the consensus service node stores the complete block chain ledger. The consensus process comprises the following steps.
Step 6.1: and (5) an endorsement stage.
The transaction initiator first sends a transaction proposal to the endorsement node, and the endorsement node verifies the validity of the transaction, including transaction format, repeated records, digital signature and the like.
The endorsement node then signs the execution result and returns it to the transaction initiator.
And n fault nodes are arranged, and when the transaction initiator receives n +1 identical endorsement results, the simulation execution results are considered to be agreed.
And after the transaction initiator verifies the endorsement result, combining the transaction proposal, the endorsement result and the signature thereof into a transaction, and sending the transaction to a sequencing node.
Step 6.2: and (5) a sequencing stage.
When any two devices in the internet of things system exchange data, transactions submitted from different participants need to be processed.
The sequencing node receives all transactions in the network and does not examine the contents of the transactions and sequences them according to a specified logic. The purpose of ordering the transaction data is to ensure the consistency of the sequence of transactions in the blockchain. When the block set generation policy is met (e.g., cached transactions reach a maximum number of transactions in a block, or block generation time is reached, etc.), the transactions are packed into a new block. After a new tile is signed, it will be broadcast to the verification node.
Step 6.3: and (5) a verification stage.
And finally checking and storing the block after the submitting node receives the broadcast.
The node verifies the validity of the transaction data (e.g., transaction format, signature, etc.), the validity of the information, and the validity of the specified endorsement policy. At each peer node, each transaction verifies the consistency of its endorsement before submitting it to the ledger.
Finally, valid transactions are ultimately recorded in the blockchain file system, and failed transactions are left to audit.
Pseudo code and explanation of the flow of the multipath routing algorithm execution are given below.
Figure BDA0003745130180000121
Figure BDA0003745130180000131
The invention relates to the following related symbols:
(symbol) means of
Tx i Transaction with serial number i
a i Transaction Tx i Amount of (a)
Pr(Tx i ) Transaction Tx i Probability of successful completion
h i Natural number x i Corresponding hash value
H Homomorphic hash function
ε pk Public key cryptographic function
G＝(V,E) Payment channel network topology
V i (V i ∈V) Vertex with sequence number i in topology
E j (E j ∈E) Edge with sequence number j in topology
deg[V i ] Vertex V i Degree of (1)
P i,j From vertex V i To vertex V j Set of paths of
(pk i ,sk i ) Vertex V i Public key and private key pair
N 1 (S) 1-hop neighbor node set of vertex S
N 2 (S) Set of 2-hop neighbor nodes of vertex S
MPR(S) Multipoint relay set of vertices S
According to the method, the safe and efficient sharing of the data of the Internet of things is realized through the block chain technology based on the payment channel network, the value of the data of the Internet of things is exerted to the greatest extent, and the promotion of virtuous circle and intelligent development of the whole ecology of the Internet of things is facilitated.
While the foregoing is directed to the preferred embodiment of the present invention, it is not intended that the invention be limited to the embodiment and the drawings disclosed herein. Equivalents and modifications may be made without departing from the spirit of the disclosure and the scope of the invention.

Claims (5)

1. A data sharing method of the Internet of things based on a block chain payment channel network is characterized by comprising the following steps:
step 1: the method comprises the steps that data are collected by the Internet of things equipment;
step 2: generating a transaction;
the data requester is an internet of things device with corresponding data requirements, and the data provider is an internet of things device with shared data resources;
when there is a data sharing requirement, a data requester initiates a transaction with a data provider by executing an intelligent contract in a blockchain, wherein the data requester is a transaction initiator;
and step 3: dividing the transaction;
the Internet of things equipment is simultaneously used as a participating node of a payment channel network in a block chain for transaction forwarding;
the participants of the payment channel network mortgage an asset in the channel in advance, and when the transaction amount exceeds the mortgage asset in the current channel, the transaction fails;
a homomorphic hash mechanism is adopted to divide a large-amount transaction into a plurality of small-amount transactions, and the method comprises the following steps:
let the data requester, i.e. the transaction initiator, divide the transaction Tx with a sum of a into n small transactions (Tx) 1 ,Tx 2 ,...,Tx n ) The amount of money corresponding thereto is (a) 1 ，a 2 ，...，a n ) Wherein Tx n Represents the nth transaction, a = a 1 +a 2 +...+a n ；
For a transaction Tx, a random number x is selected R Obtaining a hash value H by a homomorphic hash function H R ；
For transactions (Tx) 1 ,Tx 2 ,...,Tx n ) N random numbers (x) are respectively selected 1 ,x 2 ,...,x n ) Obtaining a hash value (H) through a homomorphic hash function H 1 ,h 2 ,...,h n )，h n Representing a random number x n A corresponding hash value; x is a radical of a fluorine atom n Representing;
the node is arranged to receive a transaction with a hash value h and a ciphertext c, and h and c are calculated by the following formulas 1 and 2 respectively:
h＝H(x R +x)＝h R +H(x) (1)
c＝ε pk (x R +x) (2)
where H is the number of pairs x using a homomorphic hash function H R And a hash value obtained by mapping the sum of x, c is the public key of the receiver to x R And the sum of x is encrypted to obtain a ciphertext; epsilon pk Representing a public key cryptographic function;
for each divided transaction Tx i By means of a random number x i To construct h i As shown in formula 3; encrypting the random number by using the public key of the receiving party to obtain a ciphertext c i As shown in formula 4:
h i ＝h+H(x i )＝h R +H(x)+H(x i ) (3)
c i ＝c+ε pk (x i )＝ε pk (x R +x)+ε pk (x i )＝ε pk (x R +x+x i ) (4)
the receiver decrypts c with its own private key sk i To obtain x i Then calculate H (x) i )；
According to equation 3, the recipient knows h i And H (x) i ) H can then be calculated; similarly, after c is decrypted using the private key to obtain x, h is obtained according to equation 1 R ；
Meanwhile, the receiver provides a receiving certificate for all received segmentation transactions, so as to ensure the safety and correctness of the transaction segmentation scheme;
and 4, step 4: maintaining a route;
the data sharing model of the Internet of things based on the block chain adopts an ad hoc network, each payment channel network node is a terminal and also serves as a router, and a route to another node in the network can be searched and maintained; when a node needs to communicate with a node outside the coverage range of the node, multi-hop forwarding of an intermediate node is needed;
the method comprises the steps that a table-driven route is adopted in an Internet of things data sharing model based on a block chain, HELLO messages are broadcasted in one-hop neighbor nodes to monitor states of the neighbor nodes and construct a neighbor table of the nodes, wherein the HELLO messages comprise addresses of the neighbor nodes, cost for reaching the neighbor nodes and residual funds in channels between the neighbor nodes and the HELLO messages;
by adopting a multipoint relay mechanism, each node selects a plurality of nodes from one hop of neighbor nodes as multipoint relay nodes, namely MPR nodes; only the multipoint relay node participates in forwarding the topology control message, namely the TC message, and participates in routing; the node regularly updates the latest topological state of the payment channel network according to the received topological control message;
and 5: forwarding the transaction;
abstracting a payment channel network into a directed graph G = (V, E), wherein V is a participation node set, and E is an all-channel set;
in a payment channel network, when two nodes transact, planning a routing path consisting of a plurality of payment channels, and adopting a node-disjoint multipath routing algorithm, wherein the input of the algorithm comprises the topology G = (V, E) of the payment channel network, the weight set w of edges, a channel balance set Deposit, an initial node S, a target node T, a transaction amount Tx.a and a preset path number k; the output of the algorithm is a k-node disjoint shortest path set P between S and T;
step 6: storing the transaction record;
in a block chain based on a payment channel network, a large number of transactions are carried out outside the block chain in real time, and the transactions outside the chain do not need to wait for an on-chain consensus process;
when both sides of the transaction want to terminate the transaction, the transaction records are subjected to final clearing and merging according to data sharing, and then submitted to the blockchain, and the merged data sharing transaction is subjected to negotiation and verification and then stored in a blockchain account book;
step 6: storing the transaction record;
when both sides of the transaction want to terminate the transaction, the transaction records are subjected to final clearing and merging according to data sharing, and then submitted to the blockchain, and the merged data sharing transaction is subjected to negotiation and verification and then stored in a blockchain account book; the common internet of things node only stores the block head, and the consensus service node stores the complete block chain ledger.
2. The method for sharing data of the internet of things based on the block chain payment channel network as claimed in claim 1, wherein when the data is collected in step 1, the collected data is processed, which includes:
standardizing or converting the data into a uniform format so that the data is compatible with a corresponding application program;
storing or creating a backup of the new converted format data;
filtering duplicate, stale and invalid class data;
integrating structured or unstructured data from other sources to enrich the current dataset;
standardized data enables transactional sharing among participants in an internet of things environment.
3. The method for sharing data of the internet of things based on the blockchain payment channel network as claimed in claim 1, wherein the minimum MPR set selection method is adopted when performing the route maintenance in step 4, and specifically the following steps are performed:
firstly, formally defining the MPR node set selection problem;
defining a node S as an initial node, wherein S belongs to V, and V is a participating node set; n is a radical of 1 (S)、N 2 (S) are respectively a set of one-hop and two-hop neighbor nodes of the node S; MPR (S) as nodesPoint S selected MPR node set, then the optimal MPR set selection problem is expressed as the minimized set | MPR (S) | under the condition that equation 5-9 is satisfied:
Figure FDA0003745130170000031
Figure FDA0003745130170000032
N 1 (MPR(S))＝N 1 (M 1 )∪...∪N 1 (M k )-{S}-N 1 (S) (7)
Figure FDA0003745130170000033
Figure FDA0003745130170000034
wherein M is k Representing the kth MPR node, wherein k is the total number of MPR nodes of the node S; m i Represents the ith MPR node; n is a radical of 1 (MPR (S)) represents a one-hop neighbor set of the MPR node set of node S, N 1 (M 1 ) One-hop neighbor set, N, representing the first MPR node of node S 1 (M k ) A one-hop neighbor set representing a kth MPR node of the node S; u represents a node in the node set V, N 1 (U) represents a one-hop neighbor set of node U;
Figure FDA0003745130170000035
is an arbitrary symbol and is a symbol of,
Figure FDA0003745130170000036
is the presence of a symbol;
the input of the multipoint relay selection algorithm comprises the topology G = (V, E) of the payment channel network, the starting node S; calculating outThe output of the method comprises MPR node set MPR (S) of the starting node S, one-hop neighbor set N 1 (S) two-hop neighbor set N 2 (S), specifically, the following:
step 4.1: initializing;
first, MPR (S) is initialized to a one-hop neighbor node set N 1 (S); then, the state of all nodes in the MPR (S) is marked as unselected;
for each node V in MPR (S) i Calculating its two-hop neighbor node set N 2 The number of nodes that can be covered in (S) is marked as deg [ V ] i ]；
Step 4.2: node selection of MPR (S) set;
checking each node in the current MPR (S) set, for the current node V i If the MPR set is already selected by other nodes and the forwarding intention is not 0, preferentially selecting V i MPR concentration of S is added and V is i Is changed to have been selected by S;
step 4.3: adding necessary nodes and deleting redundant nodes in an MPR (S) set;
the redundancy is eliminated by traversing nodes with selected states in the MPR (S) set, and the communication overhead of maintaining a routing table is reduced;
if nodes with the states of being not selected exist in the MPR (S) set, traversing the nodes; finding out the node V with the minimum degree in sequence i Detection at deletion V i Whether the remaining nodes in the hourly MPR (S) set can cover N 2 (S); if so, delete node V i Else, node V i Is marked as selected.
4. The method as claimed in claim 1, wherein a node-disjoint multipath routing algorithm is used when transaction forwarding is performed in step 5, and the method comprises the following steps:
step 5.1: initializing variables;
establishing an adjacency list head and an array e to store the PCN topology based on a routing table maintained by a multi-relay forwarding algorithm; wherein, the head is the first address of a linked list formed by corresponding edges of a node; the array e is used for storing nodes pointed by one edge; defining an array visit to store the access state of the nodes in the graph G, and initializing the visit by using 0, namely, the state of not accessing; defining an array dist as the path length from the starting node S to each vertex in V, and initializing the array dist to be infinity to represent that the path is unreachable; initializing dist [ S.pos ] to be 0 because the distance from S to the self is 0, wherein pos is the position index of the node S; defining a priority queue Q, wherein the first element of the priority queue Q is the length of the shortest path from S to the current node, and the second element is the index of the current node; the start node S is added to Q for initialization;
step 5.2: a process of finding a shortest path from S to each node;
storing vertices and distances that can be used to update the shortest path using a priority queue Q; when Q is not empty, the element with the shortest path length is popped out every time, and is marked as V; if V has been processed, skip directly; otherwise, marking V as processed state and processing the vertex adjacent to the V; if V neighbor U can provide a shorter path length, update dist [ ], and add U's relevant information to queue Q; repeating the above process until all the nodes are processed; the shortest Path from S to T can be constructed from the value in dist [ ] not equal to ∞ and the length of Path is stored in dist [ T.pos ];
step 5.3: adding the current Path into P, copying a PCN topology, and deleting all nodes in the Path obtained currently; calling a Route function to find another shortest path added into the P; and exiting until the preset path number k is reached or the condition is not met.
5. The method as claimed in claim 1, wherein in step 6, the consensus process comprises the following steps;
step 6.1: an endorsement stage;
the transaction initiator firstly sends a transaction proposal to the endorsement node, and the endorsement node verifies the validity of the transaction, including transaction format, repeated record and digital signature;
then, signing the execution result by the endorsement node, and returning the execution result to the transaction initiator;
the method comprises the following steps that n fault nodes are arranged, and when a transaction initiator receives n +1 identical endorsement results, the common recognition on simulation execution results is considered to be achieved;
after the transaction initiator verifies the endorsement result, the transaction proposal, the endorsement result and the signature thereof are combined into a transaction, and the transaction is sent to a sequencing node;
step 6.2: a sorting stage;
when any two devices in the internet of things system exchange data, transactions submitted by different participants need to be processed;
the sequencing node receives all transactions in the network, does not check the transaction contents, and sequences the transactions according to the specified logic; when the block set generation strategy is met, packaging the transaction into a new block; after a new tile is signed, it will be broadcast to the verification node;
step 6.3: a verification stage;
after the submitting node receives the broadcasted blocks, carrying out final verification and storing;
the node verifies the validity of the transaction data, the validity of the information and the validity of a specified endorsement policy; at each peer node, each transaction verifies the consistency of the endorsement before being submitted to the ledger;
finally, valid transactions are finally recorded in the blockchain file system, and failed transactions are left for auditing.
CN202210828802.6A 2022-07-14 2022-07-14 Internet of things data sharing method based on block chain payment channel network Pending CN115361395A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210828802.6A CN115361395A (en) 2022-07-14 2022-07-14 Internet of things data sharing method based on block chain payment channel network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210828802.6A CN115361395A (en) 2022-07-14 2022-07-14 Internet of things data sharing method based on block chain payment channel network

Publications (1)

Publication Number Publication Date
CN115361395A true CN115361395A (en) 2022-11-18

Family

ID=84031592

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210828802.6A Pending CN115361395A (en) 2022-07-14 2022-07-14 Internet of things data sharing method based on block chain payment channel network

Country Status (1)

Country Link
CN (1) CN115361395A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116032827A (en) * 2023-01-09 2023-04-28 暨南大学 AODV-based PCN optimal path routing method
CN116109416A (en) * 2023-04-12 2023-05-12 北京邮电大学 Block chain-based carbon transaction payment channel routing method and device
CN116596533A (en) * 2023-05-04 2023-08-15 广东盛迪嘉电子商务股份有限公司 Transaction-oriented payment method and system
CN116978509A (en) * 2023-09-22 2023-10-31 山东百康云网络科技有限公司 Electronic prescription circulation method
CN116032827B (en) * 2023-01-09 2024-05-10 暨南大学 AODV-based PCN optimal path routing method

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116032827A (en) * 2023-01-09 2023-04-28 暨南大学 AODV-based PCN optimal path routing method
CN116032827B (en) * 2023-01-09 2024-05-10 暨南大学 AODV-based PCN optimal path routing method
CN116109416A (en) * 2023-04-12 2023-05-12 北京邮电大学 Block chain-based carbon transaction payment channel routing method and device
CN116596533A (en) * 2023-05-04 2023-08-15 广东盛迪嘉电子商务股份有限公司 Transaction-oriented payment method and system
CN116978509A (en) * 2023-09-22 2023-10-31 山东百康云网络科技有限公司 Electronic prescription circulation method
CN116978509B (en) * 2023-09-22 2023-12-19 山东百康云网络科技有限公司 Electronic prescription circulation method

Similar Documents

Publication Publication Date Title
Prihodko et al. Flare: An approach to routing in lightning network
Roos et al. Settling payments fast and private: Efficient decentralized routing for path-based transactions
CN115361395A (en) Internet of things data sharing method based on block chain payment channel network
Tran et al. Optimal sybil-resilient node admission control
Asheralieva et al. Reputation-based coalition formation for secure self-organized and scalable sharding in iot blockchains with mobile-edge computing
Jiang et al. Ant-based adaptive trust evidence distribution in MANET
Zhang et al. Blockchain-empowered efficient data sharing in Internet of Things settings
CN108134772B (en) Safe routing method realized by adopting AODV (Ad hoc on demand distance vector) or DSDV (direct distance vector) protocol
Mazumdar et al. HushRelay: A privacy-preserving, efficient, and scalable routing algorithm for off-chain payments
US20220182243A1 (en) Method and Apparatus for Distributed Ledger
Wu et al. On increasing scalability and liquidation of lightning networks for blockchains
Dewan et al. Trusting routers and relays in ad hoc networks
Suguna et al. Establishment of stable certificate chains for authentication in mobile ad hoc networks
Zhang et al. Webflow: Scalable and decentralized routing for payment channel networks with high resource utilization
CN109905863A (en) The relaying cut-in method of distributed collaborative communication based on the storage of block chain
Singh et al. Blockchain-based BATMAN protocol using mobile ad hoc network (MANET) with an ensemble algorithm
David et al. MARS: Monetized ad-hoc routing system (a position paper)
Mahapatra et al. A secure multi-hop relay node selection scheme based data transmission in wireless ad-hoc network via block chain
Zhao et al. Convergence study of decentralized min-cost subgraph algorithms for multicast in coded networks
Sridhar et al. Proficient and secured routing in MANET based on trust and energy supported AODV
CN112291789B (en) Security routing protocol method and system for large-scale self-organizing network
CN113258986B (en) Block chain technology-based satellite self-organizing network OLSR (on-line analytical system) secure routing system
Salehi et al. Secure opportunistic routing protocols: methods, models, and classification
Szczypiorski et al. Steganographic routing in multi agent system environment
Oikonomou et al. Probabilistic flooding performance analysis exploiting graph spectra properties

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