CN113840349B - Self-organizing network routing method based on blockchain - Google Patents
Self-organizing network routing method based on blockchain Download PDFInfo
- Publication number
- CN113840349B CN113840349B CN202111113115.8A CN202111113115A CN113840349B CN 113840349 B CN113840349 B CN 113840349B CN 202111113115 A CN202111113115 A CN 202111113115A CN 113840349 B CN113840349 B CN 113840349B
- Authority
- CN
- China
- Prior art keywords
- data
- forwarding
- data packet
- network
- blockchain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000004891 communication Methods 0.000 claims description 12
- 238000005242 forging Methods 0.000 claims description 3
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 12
- 238000010586 diagram Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 8
- 230000008859 change Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000008520 organization Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 230000004936 stimulating effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/009—Security arrangements; Authentication; Protecting privacy or anonymity specially adapted for networks, e.g. wireless sensor networks, ad-hoc networks, RFID networks or cloud networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/03—Protecting confidentiality, e.g. by encryption
- H04W12/033—Protecting confidentiality, e.g. by encryption of the user plane, e.g. user's traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/10—Integrity
- H04W12/106—Packet or message integrity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/80—Wireless
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The invention discloses a self-organizing network routing method based on a blockchain, which comprises a blockchain wireless access network, a self-organizing network and a routing method for assisting in data forwarding in the self-organizing network. When transmitting data, the data sender encrypts the data content, attaches an account book containing the identity information of the data sender, packages the encrypted data and the account book, and transmits the packaged data and the account book to the forwarding node. The forwarding node encrypts the data packet and writes its identity information into the ledger, and then sends it to the next hop forwarding node until the data packet is received by the data receiver. After the data receiver successfully decrypts the data packet, the account book information is uploaded to the blockchain network, and rewards are distributed through automatic execution of intelligent contracts. The invention promotes the cooperation among nodes in the self-organizing network and obviously reduces the delay and the packet loss rate of data transmission in the self-organizing network.
Description
Technical Field
The invention relates to the field of blockchains, in particular to a self-organizing network routing method based on blockchains.
Background
Blockchain radio access networks are a kind of decentralized security architecture for sharing network resources and authentication between untrusted network entities. The blockchain radio access network connects different groups and builds a multilateral platform using the blockchain principle. Participants in a blockchain radio access network may self-organize, self-form, and self-configure into a dynamic network without the need for trusted intermediaries. The intelligent contracts stored on the chain automatically implement agreements between the blockchain radio access network participants that protect the interests of both parties.
Most of the existing research focuses on the application and evaluation of blockchain radio access networks in cellular network settings, and few in ad hoc networks. As an important extension scenario of a blockchain radio access network, an ad hoc network is a scalable adaptive network that does not rely on pre-existing infrastructure. Furthermore, the distribution characteristics of the blockchain radio access network are suitable for non-cooperative ad hoc networks. For areas without existing infrastructure, participants belonging to a multilateral participant can quickly self-form an ad hoc network based on the framework of a blockchain radio access network. For such an ad hoc network, how to reliably and cooperatively determine routes for data transmission is a major challenge. In ad hoc networks, peer behavior is difficult to predict, control or limit, especially in the framework of blockchain radio access networks, including multi-party mutual distrust. Because of limited resources, some selfish nodes may utilize the cooperation of other nodes to save resources through a pick-up behavior that makes nodes in the network unwilling to cooperate and results in reduced network performance.
Existing studies to prevent selfish behavior in ad hoc networks can be summarized as three methods: rewards based, reputation based and reciprocal based, but they all have respective problems. Most rewards-based solutions must rely on a trusted third party in the collection or tamper-resistant hardware. Reputation-based schemes require additional costs for nodes to oversee the behavior of others, resulting in second-order ride behavior, and no collusion between peers can be avoided. The reciprocity-based approach suffers from high transmission and storage overhead in propagating interaction histories and is not suitable for large-scale networks.
Disclosure of Invention
Technical problems: in order to solve the main obstacle of limiting the application of the blockchain wireless access network in the self-organizing scene, the invention provides a self-organizing network routing protocol based on the blockchain, which is used for stimulating the possible existence of a selfish behavior node as a forwarding node to help forwarding a data packet by introducing the blockchain. In the frame of the block chain wireless access network, a routing method for assisting in data forwarding is designed and used as a data transmission mechanism of an self-organizing and non-cooperative self-organizing network. Using an account book associated with the forwarding data packet to record forwarding node identity information and allocating rewards to forwarding nodes participating in forwarding using a blockchain technique. The keys correspond to identities to avoid ledgers being counterfeited and a series of rewards policies are designed to prevent forwarding nodes from adding pseudonyms to the ledgers. By the method, the blockchain technology is applied to the self-organizing network scene, and the self-organizing network performance is greatly improved.
The technical scheme is as follows: the invention discloses a self-organizing network routing method based on a block chain, which comprises a block chain wireless access network, a self-organizing network and a routing method for assisting in data forwarding in the self-organizing network; wherein:
the block chain wireless access network comprises a block chain network composed of block chain maintainers, and the block chain maintainers are in communication connection through the block chain network;
the self-organizing network consists of peer mobile entity nodes, wherein the mobile entity nodes are connected through network communication, and the mobile entity nodes are connected with a blockchain maintainer through network communication;
the routing method for assisting in data forwarding in the self-organizing network is used for encrypting data content by a data sender in the self-organizing network, attaching an account book containing identity information of the data sender, packaging the encrypted data and the account book into a data packet, and sending the data packet to a first forwarding node; the first forwarding node receives a data packet sent by a data sender, encrypts data content in the data packet, writes the identity information of the first forwarding node into an account book in the data packet, and forwards the data packet to the second forwarding node until the data packet is received by a data receiver; the data receiver receives the data packet forwarded by the last forwarding node, and after the data content in the received data packet is decrypted layer by layer, the data receiver uploads account information in the data packet to the blockchain network; the blockchain network completes the distribution of rewards by automatically executing intelligent contracts.
The routing method comprises the following steps:
step 1, uploading available contents, pricing and rewarding strategies to a blockchain network in a manner of intelligent contracts by a data sender, requesting corresponding contents by signing corresponding intelligent contracts, and sending data to the data receiver by the data sender after the intelligent contracts are uploaded to the blockchain;
step 2, the data sender encrypts the data content by utilizing the shared key with the data receiver and attaches an account book containing the identity information of the data receiver, the data sender packages the encrypted content and the account book into a data packet, writes the identity information, pricing and corresponding rewarding strategy of the data receiver in a data packet head, and then forwards the data packet to a first forwarding node in a flooding forwarding or routing table forwarding mode;
step 3, after receiving the data packet, the first forwarding node firstly judges whether the first forwarding node is a corresponding data receiver according to the data packet header information, and if the first forwarding node is the corresponding data receiver, the first forwarding node executes the step 4; if not, forwarding the data packet according to a forwarding strategy, if forwarding is decided, encrypting the data by the first forwarding node according to a secret key shared by the first forwarding node and a data receiver, writing own identity information in an account book, forwarding the data packet to a second forwarding node in a flooding forwarding or routing table forwarding mode, and continuously executing the step 3;
step 4, when the forwarding nodes receive the data packet and determine that the forwarding nodes are data receivers, the data receivers can decrypt the data content in the data packet layer by utilizing the shared secret key of the data receivers and the forwarding nodes according to the identity information of the forwarding nodes recorded in the account book; if the decryption is successful and the unencrypted data content is obtained, the data receiver uploads the account information to the blockchain network, and if the decryption is failed, the data packet is discarded and the account information is not uploaded to the blockchain network;
and 5, the blockchain network completes the rewards distribution according to the rewards strategy by automatically executing the corresponding intelligent contracts, and each forwarding node contained in the account book receives the corresponding rewards.
Wherein,
before transmitting data, the data sender and the data receiver upload the intelligent contract, the intelligent contract is generated in two steps, the data sender uploads the data content, pricing and rewarding strategy which can be provided by the data sender to the blockchain network in the intelligent contract mode, and the data receiver submits the identity information of the data receiver to perfect the intelligent contract to indicate that the data sender is required to send data.
The data packet structure is divided into three parts, wherein the first part is a data packet head containing the identity information, pricing and rewarding strategies of a data receiver; the second part is an account book recorded with the identity information of each forwarding node which forwards the data packet; the third part is the data content of the data packet after being encrypted layer by layer.
The pricing and rewarding strategies recorded in the head information of the data packet; the pricing indicates that the data sender can provide a certain reward for rewarding each forwarding node for forwarding the data packet, and the rewarding policy indicates rules to be followed when rewarding is distributed to the forwarding nodes for forwarding the data packet, specifically indicates that the forwarding nodes cannot increase rewards obtained by the forwarding nodes by forging extra identities; according to the principle followed by the rewarding strategy, the two strategies are included, wherein the first strategy is a unified rewarding allocation strategy, the rewards finally obtained by all forwarding nodes helping to forward the data packet are the same, the second strategy is a proportional rewarding allocation strategy, the rewarding relation obtained between two adjacent forwarding nodes is that the ratio of the rewards obtained by the next forwarding node to the rewards obtained by the previous forwarding node is a constant smaller than 1, and the ratio is called a proportioning factor.
In the layer-by-layer encryption of the data packet, a pair of secret keys is shared between any two nodes in the self-organizing network, the forwarding nodes encrypt the data content by utilizing the secret keys shared by the forwarding nodes and the data receivers before forwarding the data packet, and write the identity information of the forwarding nodes into an account book, and after the data packet is forwarded by a plurality of forwarding nodes, the data content in the data packet is encrypted layer by layer until the data packet is finally received by the data receivers.
The data receiver uploads account information to a blockchain network; in the scheme of forwarding by the flooding mode, the data receiver receives the same data packet from different paths, at this time, the data receiver only decrypts the data packet received first, and uploads account information contained in the data packet to the blockchain network.
And the automatic execution intelligent contract completes the distribution of rewards, the blockchain network automatically executes the corresponding intelligent contract according to account information, and completes the distribution of rewards according to a rewards strategy, and forwarding nodes recorded in the account can obtain rewards.
The forwarding node forwards the data packet according to a forwarding strategy, and the forwarding strategy according to the forwarding strategy is as follows: before forwarding the data, the forwarding node predicts the possible rewards according to the data packet header information and the account book information, and if the predicted rewards exceed the cost consumed when forwarding the data packet, the forwarding node forwards the data packet; if more than one data packet needs to be forwarded, the forwarding node will preferentially select to forward the data packet with the estimated high prize.
The cost consumed by the forwarding node when forwarding the data packet includes consumption of power resources, consumption of communication resources, consumption of storage resources and consumption of computing resources.
The beneficial effects are that: compared with the prior art, the invention can fully utilize the advantages of the blockchain technology, promote the nodes in the self-organizing network to cooperate, and has the following beneficial effects:
1) Compared with the traditional self-organizing network, the invention greatly reduces the occurrence of the selfish node taking behavior in the network and obviously reduces the network packet loss rate.
2) The invention deeply integrates the blockchain wireless access network technology and the self-organizing network technology, fully plays the advantages of transparent disclosure, non-falsification, automatic execution of intelligent contracts and the like of the blockchain technology, promotes the cooperation of nodes in the self-organizing network, and greatly reduces the delay of the network.
3) Compared with the research of the routing protocol in the existing self-organizing network, the invention does not need the participation of a third party trusted mechanism, does not need to protect data by means of tamper-proof hardware facilities, distributes rewards by utilizing a blockchain technology, and protects the data integrity by proposing tamper-proof account books.
4) The invention has a certain network effect, and is used for rewarding the forwarding nodes which help forwarding the data packet by introducing a rewarding strategy, and more nodes can be added into the network along with the continuous expansion of the network scale, so that the network performance is further improved, more nodes are attracted to be added, and positive feedback is formed.
Drawings
FIG. 1 is a schematic diagram of a mobile organization network routing method based on blockchain.
FIG. 2 is a schematic workflow diagram of a mobile organization network routing method based on blockchain.
Fig. 3 is a schematic diagram of a packet structure and a packet transmission process of a mobile organization network routing method based on a blockchain. Wherein, (a) is a schematic diagram of a data packet structure, and (b) is a schematic diagram of a data packet transmission process.
Fig. 4 shows the variation of network performance at different traffic intensities before and after the introduction of the present invention. Wherein, (a) is the change of network delay performance before and after the invention is introduced under different flow intensities, and (b) is the change of network packet loss rate performance before and after the invention is introduced under different flow intensities.
Figure 5 is a diagram illustrating the balance between network delay and packet loss rate,
fig. 6 is an illustration of the effect of rewards policy parameters on network performance. Wherein (a) is the impact of data pricing on network performance and (b) is the impact of scale factors on network performance.
Detailed Description
The present invention will be further illustrated with reference to the drawings and specific examples, which are intended to be illustrative of the invention and not to be limiting of the scope of the invention, since modifications will occur to those skilled in the art upon reading the invention, and various equivalent forms of the invention fall within the scope of the invention as defined in the application.
The invention discloses a self-organizing network routing method based on a blockchain, which comprises a blockchain wireless access network, a self-organizing network and a routing method for assisting in data forwarding in the self-organizing network; wherein:
the block chain wireless access network comprises a block chain network composed of block chain maintainers, and the block chain maintainers are in communication connection through the block chain network;
the self-organizing network consists of peer mobile entity nodes, wherein the mobile entity nodes are connected through network communication, and the mobile entity nodes are connected with a blockchain maintainer through network communication;
the routing method for assisting in data forwarding in the self-organizing network is used for encrypting data content by a data sender in the self-organizing network, attaching an account book containing identity information of the data sender, packaging the encrypted data and the account book into a data packet, and sending the data packet to a first forwarding node; the first forwarding node receives a data packet sent by a data sender, encrypts data content in the data packet, writes the identity information of the first forwarding node into an account book in the data packet, and forwards the data packet to the second forwarding node until the data packet is received by a data receiver; the data receiver receives the data packet forwarded by the last forwarding node, and after the data content in the received data packet is decrypted layer by layer, the data receiver uploads account information in the data packet to the blockchain network; the blockchain network completes the distribution of rewards by automatically executing intelligent contracts.
The routing method comprises the following steps:
step 1, uploading available contents, pricing and rewarding strategies to a blockchain network in a manner of intelligent contracts by a data sender, requesting corresponding contents by signing corresponding intelligent contracts, and sending data to the data receiver by the data sender after the intelligent contracts are uploaded to the blockchain;
step 2, the data sender encrypts the data content by utilizing the shared key with the data receiver and attaches an account book containing the identity information of the data receiver, the data sender packages the encrypted content and the account book into a data packet, writes the identity information, pricing and corresponding rewarding strategy of the data receiver in a data packet head, and then forwards the data packet to a first forwarding node in a flooding forwarding or routing table forwarding mode;
step 3, after receiving the data packet, the first forwarding node firstly judges whether the first forwarding node is a corresponding data receiver according to the data packet header information, and if the first forwarding node is the corresponding data receiver, the first forwarding node executes the step 4; if not, forwarding the data packet according to a forwarding strategy, if forwarding is decided, encrypting the data by the first forwarding node according to a secret key shared by the first forwarding node and a data receiver, writing own identity information in an account book, forwarding the data packet to a second forwarding node in a flooding forwarding or routing table forwarding mode, and continuously executing the step 3;
step 4, when the forwarding nodes receive the data packet and determine that the forwarding nodes are data receivers, the data receivers can decrypt the data content in the data packet layer by utilizing the shared secret key of the data receivers and the forwarding nodes according to the identity information of the forwarding nodes recorded in the account book; if the decryption is successful and the unencrypted data content is obtained, the data receiver uploads the account information to the blockchain network, and if the decryption is failed, the data packet is discarded and the account information is not uploaded to the blockchain network;
and 5, the blockchain network completes the rewards distribution according to the rewards strategy by automatically executing the corresponding intelligent contracts, and each forwarding node contained in the account book receives the corresponding rewards.
The technical scheme of the invention is further described in detail below with reference to the drawings and the embodiments of the specification.
As shown in fig. 1 and 2, the present invention includes a blockchain wireless access network, an ad hoc network composed of 9 nodes, and a routing method for assisting data forwarding in the ad hoc network.
The invention discloses a routing method for cooperatively forwarding data in an ad hoc network, which comprises the following steps:
1) Data sender v s With the data receiver v r Signing intelligent contracts for data content, pricing and rewarding policies, and v after the intelligent contracts are uploaded to the blockchain network s Will be to v r And transmitting the data.
2)v s By using it and v r The shared key between encrypts the data content and generates a copy containing v s Account book of identity informationv s The encrypted data is associated with->Packing and writing v in a header r Identity information, pricing and rewarding policy of (c), thereafter v s The data packet is sent to the first forwarding node v by means of flooding forwarding 1 、v 2 、v 3 。
3)v 1 、v 2 、v 3 On receipt of the signal from v s After the data packet is transferred, firstly judging that the data packet is not v according to the data packet head information r V according to rewarding policy and cost spent forwarding data packets 1 、v 2 、v 3 It is decided to continue forwarding the data packet in a flooded manner. After completing the encryption of the data packets and adding the respective identity information in the corresponding ledger, v 1 、v 2 、v 3 Forwarding data packets to v 4 、v 5 、v 6 . Wherein v is 4 Is a selfish node, does notWill continue to forward data packets v 5 、v 6 Forwarding the data packet in the manner of step 3) until the data packet is finally v r And (5) receiving.
4) When v r First, at first, it is received byV recorded in (b) s ，v 2 ，v 5 V when forwarding data packet r Will be according to->The forwarding node information recorded in (1) is firstly utilized to be combined with v 5 The shared key decrypts the packet and then re-uses it with v 2 Decrypting the data packet with the shared key, and finally utilizing the data packet and v s Decrypting the data packets with the shared key, v after successful acquisition of the unencrypted data content r Will->Uploading to the blockchain network.
5) When (when)After being uploaded to the blockchain network, the blockchain network completes rewards distribution according to rewards policy by executing corresponding intelligent contracts, and v 2 And v 5 A prize will be awarded.
Wherein v is prior to transmission of data s And v r The smart contract will be generated in two steps, first step, v s Uploading self-available content, pricing and rewarding policies to the blockchain network in the form of intelligent contracts, v r Submitting own identity information to perfect the intelligent contract, indicating v s The direction v is required r And transmitting the data.
To illustrate the packet structure and the change of the packet content and account information during the data transmission process, fig. 3 shows a schematic diagram of the packet structure and the packet transmission process of the block-chain-based ad hoc network routing method.
As shown in fig. 3 (a), the packet structure is divided into three parts: data packet header, account book, data content. The data receiver v is recorded in the data header phi r Identity information, data pricing, rewarding policy, etc., account bookThe identity information of the forwarding node forwarding the data packet each time is recorded, and the forwarding node uses the identity information and v before forwarding the data each time r The shared key encrypts the data content, M representing the data content that is not encrypted.
As shown in fig. 3 (b), the data pricing recorded in the data header phi represents v s Forwarding node v that will provide a certain reward for rewarding help forwarding 1 ，v 2 The rewards policy recorded in phi is a proportional rewards allocation policy which follows the principle of v 1 Or v 2 Cannot increase the rewards obtained by oneself by forging additional identities, and v 2 Obtained rewards and v 1 The ratio of rewards obtained is a scaling factor gamma, gamma being a constant smaller than 1;
in the data packet transmission process, v s ，v 1 ，v 2 Sequentially encrypting the data packets layer by layer, and moving a node v in the self-organizing network s ，v r ，v 1 ，v 2 A pair of secret keys is shared between every two pairs, M 0 ＝E(M,K s,r ) Representing v s By using it and v r Shared secret key K s,r Encrypting M, E being an encryption function, while v s Writing own identity information into account bookWherein M is 1 ＝E(M 0 ,K 1,r ) Representing v 1 By using it and v r Shared secret key K 1,r For M 0 Encryption is performed while v 1 Writing own identity information into account book +.>In the same way M 2 ＝E(M 1 ,K 2,r ) Representing v 2 By using it and v r Shared secret key K 2,r For M 2 Encryption is performed while v 2 Writing own identity information into account book +.>In the data packet is finally v r And (5) receiving.
In the scheme of forwarding by flooding, v r The same packet from different paths may be received in succession, v r Decrypting only the first received data packet, wherein the account information contained in the data packet isv r According to account information->Sequentially using secret keys K 2,r 、K 1,r 、K s,r Decrypting the data package to obtain the data content M and adding account information +.>Uploading to the blockchain network.
Information of the bookAfter being uploaded to the blockchain network, the blockchain will be based on ledger informationAutomatically executing corresponding intelligent contracts and completing the distribution of rewards according to rewards strategies, wherein the account book is at the momentV recorded in (b) 1 ，v 2 A prize will be awarded.
Forwarding node v 1 ，v 2 When forwarding the data packet, the data packet head information phi and the account book information are used for processing the data packetPredicting possible rewards, and if the predicted rewards exceed the cost of forwarding the data packet, v 1 ，v 2 Will choose to forward the packet if v 1 ，v 2 When there is more than one packet to be forwarded, then v 1 ，v 2 The data packet with higher estimated reward is selected to be forwarded preferentially, and the node v is forwarded 1 ，v 2 When forwarding the data packet, a certain amount of power resources, communication resources, storage resources and calculation resources are consumed.
Referring to fig. 4 to 6, in order to disclose the performance of the present invention in practical operation, practical tests and data recording were performed for the exemplary embodiment of the present invention as described, and the analysis results are as follows.
Fig. 4 reflects the impact on network delay and packet loss rate at different traffic intensities, before and after the introduction of the present invention. Compared with the traditional routing mechanism, the network transmission delay can be greatly reduced by introducing the invention, and the packet loss rate of the network can be reduced by the invention under the condition that a certain proportion of selfish nodes exist in the network. After the invention is introduced, the nodes continuously adjust own forwarding strategy to preferentially forward the data packets with relatively higher rewards, so that the whole network is less congested, the whole network delay is reduced, and under the condition that a certain proportion of selfish nodes exist in the network, the selfish nodes forward the data packets due to the influence of the rewards strategy, thereby reducing the whole network packet loss rate.
Fig. 5 reflects a schematic diagram of a balanced relationship between network delay and packet loss rate along with an increase of the proportion of network selfish nodes, and it can be seen that, for a scheme for forwarding a routing table, the packet loss rate of the network is significantly increased along with an increase of the proportion of the selfish nodes in the network, however, after the method is introduced, the packet loss rate of the network can be significantly reduced without sacrificing the network delay. In the flooding forwarding scheme, the network delay is very sensitive to the proportion of the selfish nodes, and the invention can effectively avoid long delay without sacrificing the packet loss rate.
Fig. 6 reflects the impact of the pricing and scaling factors of the packets in the rewarding policy on the average delay and packet loss rate of the network. It can be seen that the higher the packet pricing, the closer the scale factor in the rewards policy is to 1, and the lower the overall packet loss rate of the network. This is because the higher the pricing, the forwarding nodes will choose to forward the packet preferentially, and the closer the scale factor in the rewarding policy is to 1, the closer the rewards obtained between the forwarding nodes are, thus enabling the packet to transmit a further path, thus reducing the packet loss rate, in the scheme of routing table forwarding, the network delay is slightly increased due to the further path the packet can transmit, and the result of fig. 6 provides a reference for the selection of parameters in the rewarding policy.
The invention makes full use of the advantages of transparent disclosure, non-falsification, automatic execution of intelligent contracts and the like of the blockchain technology, constructs a blockchain-based self-organizing network routing method, applies the blockchain wireless access network to self-organizing network scenes, and remarkably improves the performance of the self-organizing network. The cooperation of nodes in the self-organizing network is promoted by proposing the rewarding strategy, the occurrence of the taking-up behavior in the self-organizing network is effectively avoided, meanwhile, the account book and the symmetric encryption technology are introduced, and the privacy and the integrity of the data content in the transmission process are ensured.
The foregoing is only a preferred embodiment of the invention, it being noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the present invention, and such modifications and adaptations are intended to be comprehended within the scope of the invention.
Claims (9)
1. The self-organizing network routing method based on the block chain is characterized by comprising a block chain wireless access network, a self-organizing network and a routing method for assisting in data forwarding in the self-organizing network; wherein:
the block chain wireless access network comprises a block chain network composed of block chain maintainers, and the block chain maintainers are connected through network communication;
the self-organizing network consists of peer mobile entity nodes, wherein the mobile entity nodes are connected through network communication, and the mobile entity nodes are connected with a blockchain maintainer through network communication;
the routing method for assisting in data forwarding in the self-organizing network is used for encrypting data content by a data sender in the self-organizing network, attaching an account book containing identity information of the data sender, packaging the encrypted data and the account book into a data packet, and sending the data packet to a first forwarding node; the first forwarding node receives a data packet sent by a data sender, encrypts data content in the data packet, writes the identity information of the first forwarding node into an account book in the data packet, and forwards the data packet to the second forwarding node until the data packet is received by a data receiver; the data receiver receives the data packet forwarded by the last forwarding node, and after the data content in the received data packet is decrypted layer by layer, the data receiver uploads account information in the data packet to the blockchain network; the blockchain network completes the distribution of rewards by automatically executing intelligent contracts;
the routing method comprises the following steps:
step 1, uploading available contents, pricing and rewarding strategies to a blockchain network in a manner of intelligent contracts by a data sender, requesting corresponding contents by signing corresponding intelligent contracts, and sending data to the data receiver by the data sender after the intelligent contracts are uploaded to the blockchain;
step 2, the data sender encrypts the data content by utilizing the shared key with the data receiver and attaches an account book containing the identity information of the data receiver, the data sender packages the encrypted content and the account book into a data packet, writes the identity information, pricing and corresponding rewarding strategy of the data receiver in a data packet head, and then forwards the data packet to a first forwarding node in a flooding forwarding or routing table forwarding mode;
step 3, after receiving the data packet, the first forwarding node firstly judges whether the first forwarding node is a corresponding data receiver according to the data packet header information, and if the first forwarding node is the corresponding data receiver, the first forwarding node executes the step 4; if not, forwarding the data packet according to a forwarding strategy, if forwarding is decided, encrypting the data by the first forwarding node according to a secret key shared by the first forwarding node and a data receiver, writing own identity information in an account book, forwarding the data packet to a second forwarding node in a flooding forwarding or routing table forwarding mode, and continuously executing the step 3;
step 4, when the forwarding nodes receive the data packet and determine that the forwarding nodes are data receivers, the data receivers can decrypt the data content in the data packet layer by utilizing the shared secret key of the data receivers and the forwarding nodes according to the identity information of the forwarding nodes recorded in the account book; if the decryption is successful and the unencrypted data content is obtained, the data receiver uploads the account information to the blockchain network, and if the decryption is failed, the data packet is discarded and the account information is not uploaded to the blockchain network;
and 5, the blockchain network completes the rewards distribution according to the rewards strategy by automatically executing the corresponding intelligent contracts, and each forwarding node contained in the account book receives the corresponding rewards.
2. The method according to claim 1, wherein the data sender and the data receiver upload the intelligent contract, before transmitting the data, the intelligent contract is generated in two steps, the data sender uploads the data content, the pricing and rewarding policy, which can be provided by the data sender, to the blockchain network in the form of the intelligent contract, and the data receiver perfects the intelligent contract by submitting the identity information of the data receiver, thereby indicating that the data sender is required to send the data.
3. The blockchain-based ad hoc network routing method of claim 2, wherein the data packet structure is divided into three parts, the first part being a data packet header containing the identity information, pricing and rewarding policies of the data receiver; the second part is an account book recorded with the identity information of each forwarding node which forwards the data packet; the third part is the data content of the data packet after being encrypted layer by layer.
4. The blockchain-based ad hoc network routing method of claim 3, wherein the data packets have pricing and rewarding policies recorded in header information thereof; the pricing indicates that the data sender can provide a certain reward for rewarding each forwarding node for forwarding the data packet, and the rewarding policy indicates rules to be followed when rewarding is distributed to the forwarding nodes for forwarding the data packet, specifically indicates that the forwarding nodes cannot increase rewards obtained by the forwarding nodes by forging extra identities; according to the principle followed by the rewarding strategy, the two strategies are included, wherein the first strategy is a unified rewarding allocation strategy, the rewards finally obtained by all forwarding nodes helping to forward the data packet are the same, the second strategy is a proportional rewarding allocation strategy, the rewarding relation obtained between two adjacent forwarding nodes is that the ratio of the rewards obtained by the next forwarding node to the rewards obtained by the previous forwarding node is a constant smaller than 1, and the ratio is called a proportioning factor.
5. A blockchain-based ad hoc network routing method according to claim 3, wherein in the layer-by-layer encryption of the data packet, a pair of keys is shared between any two nodes in the ad hoc network, the forwarding node encrypts the data content by using the key shared with the data receiver before forwarding the data packet, and writes the identity information of the forwarding node into the account book, and after forwarding by a plurality of forwarding nodes, the data content in the data packet is encrypted layer-by-layer until the data packet is finally received by the data receiver.
6. The blockchain-based ad hoc network routing method of claim 5, wherein the data receiver uploads ledger information to a blockchain network; in the scheme of forwarding by the flooding mode, the data receiver receives the same data packet from different paths, at this time, the data receiver only decrypts the data packet received first, and uploads account information contained in the data packet to the blockchain network.
7. The blockchain-based ad hoc network routing method of claim 1, wherein the automatically executing the intelligent contracts completes the distribution of rewards, the blockchain network automatically executes the corresponding intelligent contracts according to account information, the distribution of rewards is completed according to rewards policies, and forwarding nodes recorded in the account will obtain rewards.
8. The blockchain-based ad hoc network routing method of claim 7, wherein the forwarding node forwards the data packet according to a forwarding policy according to which: before forwarding the data, the forwarding node predicts the possible rewards according to the data packet header information and the account book information, and if the predicted rewards exceed the cost consumed when forwarding the data packet, the forwarding node forwards the data packet; if more than one data packet needs to be forwarded, the forwarding node will preferentially select to forward the data packet with the estimated high prize.
9. The blockchain-based ad hoc network routing method of claim 8, wherein the cost expended by the forwarding node in forwarding the data packet includes consumption of power resources, consumption of communication resources, consumption of storage resources, and consumption of computing resources.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111113115.8A CN113840349B (en) | 2021-09-18 | 2021-09-18 | Self-organizing network routing method based on blockchain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111113115.8A CN113840349B (en) | 2021-09-18 | 2021-09-18 | Self-organizing network routing method based on blockchain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113840349A CN113840349A (en) | 2021-12-24 |
| CN113840349B true CN113840349B (en) | 2024-03-12 |
Family
ID=78969336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111113115.8A Active CN113840349B (en) | 2021-09-18 | 2021-09-18 | Self-organizing network routing method based on blockchain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113840349B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117118744B (en) * | 2023-10-19 | 2024-01-26 | 三未信安科技股份有限公司 | Message encryption packaging and joint authentication method and system based on identification password |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111181853A (en) * | 2019-12-30 | 2020-05-19 | 布比（北京）网络技术有限公司 | Pure distributed data exchange method and system based on block chain |
| CN112217645A (en) * | 2020-09-28 | 2021-01-12 | 电子科技大学 | Anonymous communication system routing method based on block chain technology |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3707925A1 (en) * | 2017-11-09 | 2020-09-16 | Electric Society SA | An ad-hoc network |
-
2021
- 2021-09-18 CN CN202111113115.8A patent/CN113840349B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111181853A (en) * | 2019-12-30 | 2020-05-19 | 布比（北京）网络技术有限公司 | Pure distributed data exchange method and system based on block chain |
| CN112217645A (en) * | 2020-09-28 | 2021-01-12 | 电子科技大学 | Anonymous communication system routing method based on block chain technology |
Non-Patent Citations (3)
| Title |
|---|
| Ling, XT ; Chen, PC ; Wang, JH ; Ding, Z .Data Broker: Dynamic Multi-Hop Routing Protocol in Blockchain Radio Access Network.IEEE COMMUNICATIONS LETTERS.2021,全文. * |
| 周畅 ; 陆慧梅 ; 向勇 ; 吴竞邦.区块链在车载自组网中的应用研究及展望.计算机科学.2019,第02卷全文. * |
| 车载自组织网络中基于区块链的路况预警方案;李春燕;赵佳;刘吉强;张强;韩磊;;网络与信息安全学报(07);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113840349A (en) | 2021-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | Multi-access edge computing enhanced video streaming: Proof-of-concept implementation and prediction/QoE models | |
| Naumenko et al. | Erlay: Efficient transaction relay for bitcoin | |
| Zhong et al. | On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques | |
| CN110290094A (en) | A kind of control method and device of data access authority | |
| CN113287287A (en) | Method and apparatus for day-to-day based fog networking | |
| Xu et al. | Game theoretical secure caching scheme in multihoming edge computing-enabled heterogeneous networks | |
| US10757007B1 (en) | Techniques for payment-based network transmissions | |
| Yeh et al. | Blockchain-based privacy-preserving and sustainable data query service over 5G-VANETs | |
| Shen et al. | A P2P-based market-guided distributed routing mechanism for high-throughput hybrid wireless networks | |
| Shin et al. | T-chain: A general incentive scheme for cooperative computing | |
| CN112367163A (en) | Quantum network virtualization method and device | |
| CN113840349B (en) | Self-organizing network routing method based on blockchain | |
| Dong et al. | A blockchain-based hierarchical reputation management scheme in vehicular network | |
| CN109995739A (en) | A kind of information transferring method, client, server and storage medium | |
| Perarasi et al. | Malicious vehicles identifying and trust management algorithm for enhance the security in 5G-VANET | |
| Wu et al. | Quality of video oriented pricing incentive for mobile video offloading | |
| Ling et al. | Data broker: Dynamic multi-hop routing protocol in blockchain radio access network | |
| Xie et al. | A secure, service priority‐based incentive scheme for delay tolerant networks | |
| Singh et al. | An efficient secure key establishment method in cluster-based sensor network | |
| WO2019165330A1 (en) | System and methods for proof of network element | |
| Bhutta et al. | An efficient, scalable key transport scheme (eskts) for delay/disruption tolerant networks | |
| Skowronski | Fully distributed gridnet protocol, with no trusted authorities | |
| Onen et al. | Optimistic fair exchange for secure forwarding | |
| Boussaha et al. | Optimized in-network authentication against pollution attacks in software-defined-named data networking | |
| Garg et al. | Edge Supported QoS based Secure Data Communication mechanism for Software Defined Vehicular Networks |
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 |