CN114900837A

CN114900837A - Network processing method, device, system, equipment and medium

Info

Publication number: CN114900837A
Application number: CN202210357752.8A
Authority: CN
Inventors: 张政; 梁伟; 刘小欧
Original assignee: China Telecom Corp Ltd
Current assignee: China Telecom Corp Ltd
Priority date: 2022-04-06
Filing date: 2022-04-06
Publication date: 2022-08-12
Anticipated expiration: 2042-04-06
Also published as: CN114900837B

Abstract

The application provides a network processing method, a device, a system, equipment and a medium, and relates to the technical field of communication. The method comprises the following steps: the method comprises the steps of obtaining credit scores of a plurality of network service nodes, wherein the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with a claimed position or not; and selecting at least part of the network service nodes to form a consensus group according to the reputation scores of the network service nodes, and storing communication transaction data which achieves the consensus by using the consensus group into a block chain, wherein the communication transaction data is transaction data generated in the process that any network service node provides network signals to the terminal equipment. According to the embodiment of the application, the security of the communication network can be provided.

Description

Network processing method, device, system, equipment and medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a network processing method, apparatus, system, device, and medium.

Background

In network technology, a network service node may be utilized to provide communication signals to a terminal device. For example, a base station or other device may be used to provide communication signals to a user's handset. As another example, a terminal device may be utilized to provide communication signals to other terminal devices.

However, during the network service process of the network service node, the communication network often lacks security due to lack of supervision of the network service node.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present application and therefore may include information that does not constitute prior art known to a person of ordinary skill in the art.

Disclosure of Invention

The present application provides a network processing method, apparatus, system, device and medium, which overcome the problem of lack of security of a communication network at least to some extent.

Other features and advantages of the present application will be apparent from the following detailed description, or may be learned by practice of the application.

According to an aspect of the present application, there is provided a network processing method applied to a supervisory node, including:

the method comprises the steps of obtaining credit scores of a plurality of network service nodes, wherein the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with a claimed position or not;

selecting at least part of the network service nodes to form a consensus group according to the reputation scores of the network service nodes, storing the communication transaction data achieving the consensus by using the consensus group into a block chain,

wherein the communication transaction data is transaction data generated in the process that any network service node provides network signals to the terminal equipment.

In one embodiment, obtaining reputation scores for a plurality of web service nodes comprises:

obtaining the successful verification times of multiple honesty verifications of each network service node;

determining the credit score of each network service node according to the successful verification times,

wherein the reputation score is positively correlated with the number of successful verifications.

In one embodiment, before determining the reputation score of each web service node according to the number of successful verifications, the method further comprises:

obtaining the failure verification times of multiple honest verifications of each network service node;

determining the reputation score of each network service node according to the successful verification times, wherein the reputation score comprises the following steps:

determining a difference between the successful verification times and the failed verification times;

and determining the credit score of each network service node according to the difference, wherein the credit score is positively correlated with the difference.

acquiring the block height difference of each network service node, wherein the block height difference is the difference between the current block height of a block chain and the block height when the network service node is successfully verified last time;

determining the reputation score of each network service node according to the successful verification times comprises the following steps:

determining the credit score of each network service node according to the successful verification times and the block height difference,

wherein the reputation score is positively correlated with the number of successful verifications and negatively correlated with the block height difference.

In one embodiment, determining the reputation score of each network service node according to the number of successful verifications and the block height difference comprises:

determining credit degree change factors of each network service node according to the successful verification times and the block height difference;

and carrying out normalization processing on the credit degree change factors to obtain credit scores of the network service nodes.

In one embodiment, the reputation degree change factor satisfies the formula:

wherein δ represents a credit degree change factor, θ represents an adjustment coefficient, s represents a difference between successful verification times and failed verification times, a represents a preset multiplying power, Δ b represents the number of blocks generated by a block chain within an honest verification time interval Δ t, and h is a block height difference.

In one embodiment, before obtaining the number of successful verifications of the plurality of honest verifications of each network service node, the method comprises:

judging whether each network service node receives honesty verification;

the method for acquiring the successful verification times of the multiple honest verification of each network service node comprises the following steps:

and under the condition that the network service nodes accept honest verification, acquiring the successful verification times of the multiple honest verification of each network service node.

In one embodiment, after determining whether each network service node accepts honest verification, obtaining reputation scores of a plurality of network service nodes further comprises:

under the condition that each network service node does not receive honest verification, acquiring a block height difference corresponding to each network service node, wherein the block height difference corresponding to each network service node is a difference value between the current block height of a block chain and the block height of each network service node when the network service node is added into the block chain network;

determining credit degree change factors corresponding to block height differences corresponding to the network service nodes;

and determining the credit score of each network service node according to the credit degree change factor corresponding to the block height difference corresponding to each network service node, wherein the current block height is negatively related to the credit score.

In one embodiment, prior to obtaining reputation scores for a plurality of web service nodes, the method further comprises:

selecting a plurality of network service nodes to be verified from the plurality of network service nodes at preset time intervals to perform honest verification to obtain verification results;

updating the credit scores of the network service nodes by using the verification result;

obtaining reputation scores for a plurality of web service nodes, comprising:

and obtaining the updated reputation scores of the plurality of network service nodes.

In one embodiment, selecting a plurality of network service nodes to be verified from a plurality of network service nodes for honest verification includes:

selecting a target network service node to be verified from a plurality of network service nodes;

selecting a plurality of network service nodes as network service nodes to be verified within a preset range with a target network service node to be verified as a center;

and the probability of each network service node selected as the target to-be-verified network service node is inversely related to the credit score of each network service node.

In one embodiment, the network service node is a terminal device in a near-area network for providing wireless network signals to other terminal devices.

According to another aspect of the present application, there is provided a network processing apparatus applied to a supervisory node, the apparatus including:

the credit obtaining module is used for obtaining credit scores of a plurality of network service nodes, wherein the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with the claimed position;

a consensus group construction module for selecting at least part of the plurality of network service nodes to form a consensus group according to the reputation scores of the plurality of network service nodes, so as to store the communication transaction data achieving the consensus by using the consensus group into the block chain,

According to yet another aspect of the present application, there is provided a blockchain network system including:

a plurality of network service nodes for providing network signals to the terminal device;

the monitoring node is used for acquiring credit scores of the network service nodes, wherein the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with the alleged position or not;

According to still another aspect of the present application, there is provided an electronic device including: a processor; and a memory for storing executable instructions for the processor; wherein the processor is configured to perform the network processing method described above via execution of the executable instructions.

According to yet another aspect of the present application, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the network processing method described above.

The network processing method, the device, the system, the equipment and the medium provided by the embodiment of the application can determine the credit score of each network service node according to the honesty verification of each network service node, and because the honesty verification can accurately evaluate the credibility of the network service nodes by judging whether the network service nodes are located at the positions claimed by the network service nodes, the network service nodes with high credibility can be selected from a plurality of network service nodes to form a consensus group according to the credit score, so that the credibility of the consensus group is ensured. And then the mode that the communication transaction data generated in the process of the network service node to the terminal equipment is subjected to consensus and then stored in the block chain is realized through the consensus group, so that the network signal providing process can be monitored by utilizing the consensus group with high reliability, and the safety of a communication network is improved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application. It is obvious that the drawings in the following description are only some embodiments of the application, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.

Fig. 1 is a system architecture diagram of a blockchain network system provided by an embodiment of the present application;

fig. 2 is a schematic flowchart illustrating a network processing method according to an embodiment of the present application;

FIG. 3 is a diagram illustrating a variation of a reputation degree variation factor provided by an embodiment of the present application;

FIG. 4 is a diagram illustrating a variation of a reputation score provided by an embodiment of the present application;

FIG. 5 is a logic diagram for constructing consensus groups provided by embodiments of the present application;

fig. 6 is a schematic flow chart illustrating another network processing method according to an embodiment of the present application;

fig. 7 is a logic diagram illustrating an exemplary selection of a network service node to be verified according to an embodiment of the present application;

FIG. 8 illustrates an exemplary logic diagram for generating a multi-layer data packet according to an embodiment of the present application;

FIG. 9 is a logic diagram of an exemplary honest verification provided by embodiments of the present application;

FIG. 10 is a schematic diagram of a network processing device in an embodiment of the present application; and

fig. 11 shows a block diagram of an electronic device in an embodiment of the present application.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

Furthermore, the drawings are merely schematic illustrations of the present application and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.

It should be understood that the various steps recited in the method embodiments of the present application may be performed in a different order and/or in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present application is not limited in this respect.

It should be noted that the terms "first", "second", and the like in the present application are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.

It is noted that references to "a", "an", and "the" modifications in this application are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that reference to "one or more" unless the context clearly dictates otherwise.

In network technology, a network service node may be utilized to provide communication signals to a terminal device. In one scenario, a base station may be utilized to provide communication signals to a terminal device such as a user's handset. In another scenario, a terminal device may be utilized to provide wireless communication signals to other terminal devices in order to increase network resource reuse.

However, in the process of network service process of the network service node, the lack of security is often caused by the lack of supervision of the network service node. Illustratively, as the types of base stations increase, private base stations and the like are difficult to monitor, and when a user connects to the private base stations by mistake, the communication security of the user is affected. For another example, in a near-field network, an effective monitoring means is often lacked for a terminal device capable of providing wireless communication signals for other terminal devices, so that the security of the near-field network is difficult to guarantee.

Based on this, embodiments of the present application provide a network processing method, apparatus, system, device, and medium, which can select a trusted consensus group with high honesty based on a blockchain technique of honesty verification, and monitor a process in which a network service node in a network provides a communication signal to a terminal device by using the trusted consensus group, thereby improving security of the network.

For the sake of understanding, the following sections of the present application will first describe terms of art concerned.

(1) Blockchain, which is a distributed ledger, blockchain technology utilizes a chained data structure to validate and store data.

Through the block chain, decentralized management of the network service nodes can be achieved, and data security of the network is guaranteed.

(2) Near-field network, a novel communication mode, the terminal device may be connected to other terminal devices through wireless technologies including but not limited to WiFi, bluetooth, long-short wave, and the like (the terminal device may be an internet of things device, and may also be a mobile phone, a computer, a gateway, and the like). Illustratively, the handset of user a may serve as a wireless communication signal providing source, and the devices of other users may acquire the wireless communication signal by connecting to the handset of user a.

Through near-field communication, the problem of insufficient coverage of mobile communication in certain scenes, such as the situation that the number of base stations is insufficient due to dense personnel or the situation that the number of base stations is insufficient due to wide regions, can be solved, and the reuse of network resources is realized.

It should be noted that, the near-domain network based on the block chain may improve the wireless Communication performance index and drive resource reuse while considering network security, and establish a near-domain network infrastructure serving the scenes of 5G (5th Generation Mobile Communication Technology), internet of things, industrial internet, Mobile internet, and the like.

(3) Integrity verification for verifying whether a network service node is located at its claimed location by verifying whether the actual location of the network service node coincides with the claimed location.

In the embodiment of the application, through honesty verification, when the network service node misreads the position, the network service node can be authenticated as a non-trusted node or a dishonest node, and when the network service node reports the true position, the network service node can be authenticated as a trusted node or an honest node.

Next, before beginning to introduce the network consensus scheme provided in the embodiments of the present application, a description will be given of a related blockchain network system.

Fig. 1 is a system architecture diagram of a blockchain network system according to an embodiment of the present invention. As shown in fig. 1, the blockchain network system 10 may include a supervisory node 11 and k network service nodes 121-12 k. Wherein k is an integer greater than or equal to 2.

And the supervision node 11 is used for selecting at least part of the k network service nodes 121-12k to form a consensus group according to the reputation scores. For example, with continued reference to fig. 1, the supervising node 11 may select the network service nodes 121 and 123 to form the consensus group. That is, network service nodes 121 and 123 may serve as members of the consensus group.

In one example, the supervising node 11 may also select at least some of the k network service nodes 121-12k for integrity verification.

In one example, the supervising node 11 may also calculate or adjust the reputation score of each network service node according to the honest verification result.

From the device perspective, in one example, the supervisory node 11 may be a network device with a high degree of trust that is set in advance. For example, the base station may be a trusted base station, a trusted computer, a trusted gateway, and the like, which are set by a communication carrier, and the present invention is not limited in particular.

In another example, the supervisory node 11 may be selected from network service nodes. For example, the member of the consensus group with the highest reputation score or the longest time to enter the consensus group can be used as the supervisory node 11. The monitoring node 11 may only assume the role of the monitoring node, and may also assume the roles of the monitoring node and the consensus group member, which is not specifically limited.

It should be noted that, when the monitoring node 11 is a network service node, the consensus group may be selected from a plurality of network service nodes including the monitoring node 11.

Having introduced the supervisory nodes both functionally and in terms of equipment, a description of the network service node follows.

A network service node for providing network signals to the terminal device. Illustratively, the network service node may be a base station or the like.

As yet another example, in the near-area network, the network service node is a terminal device in the near-area network for providing wireless network signals to other terminal devices. The network service node may be a terminal device having a communication signal use function and a forwarding function. Wherein the network signal may be a wireless network signal.

It should be noted that, when the network consensus scheme provided by the embodiment of the present application is adopted in a near-domain network, the security of signal transaction between terminal devices can be ensured through the block chain consensus technology while wireless resources in the network are fully reused and additional value of the wireless network is exerted, and the energy consumption is low and the efficiency is high.

For the k network service nodes in the embodiment of the present application, at least a part of the network service nodes may serve as a consensus group, and the remaining part of the network service nodes may provide communication signals for other terminal devices. In one example, the group member of the consensus group may assume the consensus function, or may combine the consensus function with the function of providing the communication signal to the other terminal device, which is not limited herein.

The terminal device is a device using a network signal, and may include, but is not limited to, a mobile phone, a tablet computer, a gateway, a laptop portable computer, a desktop computer, a wearable device, an augmented reality device, a virtual reality device, and the like, which need to use the network signal, which is not limited in particular.

After introducing the supervision node and the network service node, a detailed description is provided next for a network processing scheme according to an embodiment of the present application.

The present exemplary embodiment will be described in detail below with reference to the drawings and examples.

The embodiments of the present application provide a network processing method that may be performed by a supervisory node in a blockchain network system 10. The supervision node may refer to the relevant description of the above part of the embodiments of the present application, and is not described herein again.

Fig. 2 shows a schematic flowchart of a network processing method provided in an embodiment of the present application, and as shown in fig. 2, the network processing method provided in the embodiment of the present application includes the following steps S210 and S220.

S210, reputation scores of a plurality of network service nodes are obtained. For the network service node, reference may be made to the relevant description of the above-mentioned part of the embodiment of the present application, which is not described again.

And the reputation score is used for measuring the integrity of each network service node when reporting the position of the network service node.

The reputation score of each network service node can be determined according to honest verification of each network service node. For integrity verification, reference may be made to the related description of the above-mentioned part in the embodiments of the present application, which is not described herein again.

In some embodiments, S210 may include step a1 and step a2 described below.

Step A1, obtaining successful verification times of multiple honest verifications of each network service node.

For example, if the network service node performs 25 honest verifications, wherein 18 verifications are successful, the number of successful verifications is 18.

And step A2, determining the reputation score of each network service node according to the successful verification times. Wherein the reputation score is positively correlated with the number of successful verifications.

In one embodiment, the reputation score corresponding to the number of successful verifications may be determined by a preset correspondence between reputation scores and the number of successful verifications. The corresponding relationship between the reputation score and the successful verification may be in the form of a relational expression or a corresponding table, which is not particularly limited.

Through the steps A1-A2, a higher credit score can be set for the network service node with accurate position. Since the network service node can normally provide network signals for the terminal devices nearby the network service node at the alleged position when the network service node is located at the alleged position, the more successful verification times indicate that the network service node is more reliable in position, and the more reliable network signals can be provided for the surrounding terminal devices. Therefore, the credibility of the network service node can be accurately measured through the credibility score corresponding to the successful verification times of honest verification.

In other embodiments, S210 may include steps A11-A14, described below.

And step A1, obtaining the successful verification times of the multiple honesty verifications of each network service node.

For step a1, refer to the relevant descriptions in the above embodiments of the present application, and are not described herein again.

And step A3, obtaining the times of failure verification of the multiple honesty verifications of each network service node.

Illustratively, continuing with the previous example, if 24 honest verifications were performed, with 8 verifications failing, then the number of failed verifications would be 8.

Step a4, determine the difference s between the number of successful verifications and the number of failed verifications.

Illustratively, continuing with the previous example, when the number of successful verifications is 18 and the number of failed verifications is 8, the difference s is 10.

And step A2, determining the reputation score of each network service node according to the difference s. Wherein the reputation score is positively correlated with the difference s.

In one embodiment, the reputation score corresponding to the number of successful verifications may be determined by a preset correspondence between the reputation score and the difference s. The relationship between the reputation score and the successful verification may be in the form of a relational expression or a corresponding table, which is not particularly limited.

Through the steps A1-A4, a lower credit score can be set for the network service node with the position error. When the position of the network service node is wrong, the network service node cannot normally provide network signals for the terminal devices nearby the alleged position, and further, the more times of failed verification indicate that the position of the network service node is less credible, and the network service node cannot provide credible network signals for the surrounding terminal devices. Therefore, the credit of the network service node can be accurately evaluated through the verification result of honesty verification.

In still other embodiments, S210 may include step A1, step A2, and step A5, described below.

Step a5, obtain the block height difference of each network service node.

Wherein the block height difference is a difference between a current block height of the block chain and a block height at a last successful verification of the network service node. By block height, it is meant the number of blocks in the block chain between it and the founder block.

For example, if the current block height is h ₀ If the network service node performs 25 honest verifications in total, the verification of the 24 th time is successful, and the verification of the 25 th time is failed, wherein the block height when the verification of the 24 th time is successful is h ₁ Then the block height difference h may be equal to (h) ₀ -h ₁ )。

Wherein, the block height difference is a value greater than or equal to 0.

Step A2, determining the credit score of each network service node according to the successful verification times and the block height difference. Wherein the reputation score is positively correlated with the number of successful verifications and negatively correlated with the block height difference.

In one embodiment, the reputation score of each network service node can be determined according to the successful verification times and the block height difference of the network service node by using the preset relationship between the reputation score and the successful verification times and the block height difference. The relationship between the reputation score and the successful verification and the block height difference may be in the form of a relational expression or a corresponding table, which is not particularly limited.

Through the steps a1, a2 and a5, after the network service node is successfully authenticated, as time increases, the block height of the block chain increases, the block height difference increases, and accordingly, the reputation score of the network service node decreases as the block height difference increases. Therefore, the network service node can be stimulated to actively participate in honesty verification, and the situation that the network service node keeps the high score in a mode of not participating in honesty verification after the network service node obtains the high score is avoided.

It should be noted that the reputation scores of the network service nodes may also be calculated according to the number of successful verification times, the number of failed verification times, and the block height difference, and the specific calculation manner may refer to the related description in the above section of the embodiment of the present application, which is not described again.

In one example, the step a2 may include the following step a21 and step a 22.

Step A21, determining the credit degree variation factor of each network service node according to the successful verification times and the block height difference.

Wherein, the credit degree change factor represents the honesty degree or the credit degree of the network service node. In one example, the reputation degree change factor may be positively correlated with the number of successful verifications. That is, the reputation degree change factor of each network service node may increase as the number of successful verifications increases. In another example, the reputation change factor may be positively correlated with the number of successful verifications and negatively correlated with the number of failed verifications. That is, the reputation degree change factor of each network service node may increase with the number of successful verifications and decrease with the number of failed successes. In yet another example, the reputation change factor may be positively correlated with the number of successful verifications and negatively correlated with the tile height difference. That is, the reputation degree variation factor of each network service node may increase with the number of successful verifications and decrease with the increase of the block height difference.

In one particular example, the reputation degree change factor δ satisfies the following formula (1):

where θ represents an adjustment coefficient, which may be set according to actual conditions and specific requirements, and is not limited thereto. Illustratively, the adjustment coefficient θ may be a dynamic adjustment coefficient.

s represents the difference between the number of successful verifications and the number of failed verifications.

a represents a preset multiplying power, which can be set according to specific situations and actual needs to change the influence degree of the difference s on the reputation score, for example, a can be 3.

Δ b represents the number of blocks generated by the block chain within the honest-verified time interval Δ t, i.e., a new block is generated within the time of Δ t/Δ b.

h is the block height difference. For the block height difference h, reference may be made to the related descriptions in the above-mentioned embodiments of the present application, which are not described herein again.

With respect to the above formula (1), fig. 3 shows a schematic diagram of a variation of a reputation degree variation factor provided by an embodiment of the present application.

In fig. 3, a curve L1 shown by a solid line represents

As a function of s; the abscissa of the curve L1 represents s and the ordinate represents

Curve L2 table shown by dot-dash lineDisplay device

As a function of h; the abscissa of the curve L2 represents h and the ordinate represents

As shown by a curve L1 in fig. 3, when any network service node participates in honesty verification, the number of successful verifications or the number of failed verifications changes, and the difference s increases,

and also increases with increasing reputation change factor. Accordingly, if the difference s is decreased,

and also decreases, resulting in a decrease in the reputation degree change factor.

With continued reference to the curve L2 of fig. 3, as time increases, the block height difference h increases,

which in turn results in a reduction in the reputation change factor. And, after the network service node checks successfully, the block height difference h is decreased,

and consequently, the reputation degree change factor increases.

It should be noted that, besides the formula (1), other formulas capable of making the reputation degree change factor negatively correlated with the difference s and positively correlated with the block height difference h may also be adopted to calculate the reputation degree change factor of each network service node according to the difference s and/or the block height difference h of the network service node, which is not limited herein.

It should be noted that, besides the block height difference h, the reputation score of each network service node may also be calculated by using other parameters such as time or time-related parameters, which are not described in detail herein. For example, the time may be a time difference between the current time and the last time of successful verification, which is not particularly limited.

And step A22, carrying out normalization processing on the credit degree change factors to obtain the credit scores of the network service nodes.

And for the normalization processing, the credit degree change factors are uniformly quantized to be within the value range of [0,1 ]. Optionally, the reputation degree change factor may be uniformly quantized to be within a value range of (0,1), that is, the value range of the reputation score is (0, 1).

In one particular example, reputation scores

The following formula (2) can be satisfied:

fig. 4 is a diagram illustrating a variation of a reputation score according to an embodiment of the present application. Wherein, the abscissa in fig. 4 is the credit degree variation factor δ, and the ordinate is the credit score

As shown in FIG. 4, reputation score

Increasing with the increase of the credit degree change factor delta until approaching 1; and reputation score

Decreases as the reputation degree change factor δ decreases until it approaches 0, i.e., the reputation score

It should be noted that, other calculation formulas than the formula (2) that can normalize the reputation degree change factor to the value range of (0,1) and positively correlate the reputation score with the reputation degree change factor may also be used, which is not particularly limited.

Through the steps A21 and A22, the credit scores can be uniformly normalized to the same value interval, so that the credit scores of the network service nodes can be accurately measured by the same standard.

In still other embodiments, prior to the above step a1, S210 may further include the following step a 6.

Step a6, determining whether each network service node has received honesty verification.

Accordingly, step a1 may include: and under the condition that the network service nodes accept honest verification, acquiring the successful verification times of the multiple honest verification of each network service node. That is, after it is determined that the network service node participates in the honest verification, the reputation scores of the network service nodes may be calculated according to the steps a1 to a2 and the steps a1 to A3, or the steps a1 to the steps a2 and the steps a 5.

In one embodiment, after step a6, S210 may further include step a7 through step a 9.

Step a7, when each network service node does not accept honesty verification, obtaining the block height difference corresponding to each network service node.

The block height difference corresponding to each network service node is the difference between the current block height of the block chain and the block height when each network service node joins the block chain network. That is, after the serving node joins the blockchain, the number of blocks newly added to the blockchain is increased.

Step A8, determining the credit degree variation factor corresponding to the block height difference corresponding to each network service node.

In one example, the reputation degree change factor δ corresponding to the block height difference h' corresponding to each web service node satisfies formula (3):

δ＝cot(2*arctanh′) (3)

wherein h' may be a difference between the current block height and the block height when the network service node joins the blockchain network.

With continued reference to fig. 3, a curve L3 shown in dotted lines in fig. 3 represents the variation of the reputation degree change factor δ with h ', and a curve L3 has an abscissa representing h' and an ordinate representing the reputation degree change factor δ. As shown by curve L3, for a chunk that is not verified, its reputation degree change factor δ decreases as h' increases.

Step A9, determining the credit score of each network service node according to the credit degree variation factor corresponding to the current block height, wherein the current block height is negatively related to the credit score. For step a9, reference may be made to the above-mentioned section of the present application in conjunction with the description of step a22, which is not repeated herein.

It should be noted that the reputation score is calculated through the block height difference h', and after the network service node joins the blockchain network, the reputation score can be gradually reduced from the initial reputation score before integrity verification is performed, so that the network service node newly joining the blockchain network can be stimulated to perform integrity verification, and the network security is further improved.

It should be noted that, besides the block height difference h', the reputation score of each network service node may also be calculated by using other parameters such as time or time-related parameters, which are not described in detail herein. For example, the time may be a time difference between the current time and the time of joining the blockchain network, which is not particularly limited.

In one example, for a network service node participating in the honest verification, a reputation degree change factor δ may be calculated based on the number of successful verifications, such as based on equation (1) above; and for the network service nodes which do not participate in the honest verification, the reputation change factor δ may be calculated based on the block height difference corresponding to each network service node, for example, based on the above formula (3). Then, after calculating the reputation degree change factor δ, the reputation score is calculated using formula (2).

In another example, in each round of honest verification, for the network service node that refers to the round of honest verification, the reputation degree change factor δ may be calculated based on the number of successful verifications, such as based on the above equation (1); and for network service nodes which do not participate in the honest verification in the round, calculating the credit degree change factor δ based on the block height difference corresponding to each network service node, for example, based on the above formula (3). Then, after calculating the reputation degree change factor δ, the reputation score is calculated using formula (2).

And S220, selecting a plurality of nodes from the plurality of network service nodes to form a consensus group according to the credit scores of the plurality of network service nodes, and storing the communication transaction data achieving the consensus to the block chain by using the consensus group.

For communication transaction data, it may be transaction data generated during the process of any network service node providing network signals to the terminal device.

And for the consensus group, the consensus group is used for constraining the communication transaction data of each network service node and the network service nodes in a mode of packaging the communication transaction data into the blocks. In some embodiments, the consensus group may pack the communication transaction data into blocks and add the new blocks to the blockchain, resulting in a new blockchain. For example, the consensus group may obtain encrypted transaction data submitted by the network service node, package the encrypted transaction data into blocks at a very high transaction rate, and publish the uplink. For example, the consensus group may equally divide the token award for a new block and the transaction fee contained by the new block.

In some embodiments, the consensus group may adopt a consensus algorithm to agree on the communication transaction data. The consensus algorithm may be a PoS (Proof of authority) consensus algorithm, a PoW (Proof of workload) consensus algorithm, a PBFT (Practical Byzantine Fault-tolerant algorithm), and the like, and is not limited in particular.

Illustratively, the consensus group may adopt a PBFT consensus algorithm to agree on the communication transaction data. In a specific example, the PBFT consensus algorithm may be used for consensus in a consensus group formed by network service nodes in near-field communication, that is, terminal devices in a near-field network that provide wireless communication signals for other terminal devices. Through PBFT, the Byzantine problem under the condition of a limited number of nodes is realized, less than 1/3 invalid network service nodes or malicious network service nodes can be tolerated, and certain performance is guaranteed while the fault tolerance rate is guaranteed.

It should be noted that, by using the PoS algorithm, the problem that the network service node in the near-domain network cannot be decentralized-managed and the security of the network service node cannot be ensured due to the fact that the traditional consensus algorithm such as PoW cannot be applied to the near-domain network can be solved, so that the network security is considered while the reuse of wireless network resources is considered.

In a specific scenario, for example, in a scenario where network infrastructure is lacking due to rare people and the like, a safe and convenient network can be provided for the terminal device through the consensus network based on the block chain technology provided by the embodiment of the application, so that the user network use experience is improved.

After introducing the consensus groups, S220 is explained next.

In some embodiments, S220 may include: and selecting the consensus group from the plurality of network service nodes according to a preset consensus group selection rule related to the credit score. For example, if the supervising node is a network service node, the consensus group may be selected from a plurality of network service nodes including the supervising node.

And the preset consensus group selection rule is used for selecting at least part with higher reputation score from the network service nodes to form the consensus group.

In one embodiment, the preset consensus group selection rule may include: and forming a consensus group by using a preset number of network service nodes with the highest credit scores. The preset number may be any integer greater than or equal to 2, and is not particularly limited.

Accordingly, S220 may include: and sequentially arranging the plurality of network service nodes according to the sequence of credit scores from top to bottom, and selecting a preset number of network service nodes to form a consensus group.

In another embodiment, the preset consensus group selection rule comprises: and adding one network service node with the highest credit score in the rest network service nodes except the consensus group to the original consensus group at preset time intervals.

Accordingly, S220 includes:

and selecting the network service node with the highest credit score from the rest network service nodes except the original consensus group of the plurality of network service nodes at preset time intervals to add the network service node into the original consensus group to obtain a new consensus group. The preset time period may be a time interval for generating a new block, i.e., Δ t. Or, a preset time period may also be set according to actual conditions and specific requirements, which is not particularly limited.

In one embodiment, one network service node in the original consensus group may be replaced with the newly added network service node.

In one example, the network service node with the highest reputation score in the original consensus group, or the network service node that has not been replaced for the longest time, may be replaced. Accordingly, the replaced network service node may become a new supervisory node.

Illustratively, fig. 5 shows a logic diagram for constructing a consensus group provided by the embodiments of the present application. As shown in fig. 5, the block-chain network includes network service nodes 121-126 as an example. If the supervisory node before replacement is the network service node 121, the consensus group is composed of the network service nodes 122 and 124, and the remaining network service nodes include the network service nodes 125 and 126.

If the network service node 121 determines that the reputation scores of the remaining network nodes, that is, the network service node 125 and the network service node 125 in the network service node 126, are the highest after acquiring the reputation scores of the network service node 122 and the network service node 126, the network service node 125 may be supplemented into the consensus group. And, in the original consensus group, i.e. network service node 122-124, the network service node 122 is not replaced for the longest time, i.e. the longest duration of its use as a member of the consensus group, then the network service node 122 can be used as a new supervising node. And, it should be further noted that the original supervising node, i.e. the network service node 121, may be used as a new remaining network service node.

Accordingly, as shown in FIG. 5, the new supervisory node is network service node 122, the new consensus group is formed by network service node 123 and 125, and the remaining network service nodes include network service node 126 and network service node 121.

In another example, the network service node with the lowest reputation score in the original consensus group can be replaced, and the replaced network service node is used as the rest network service nodes except the supervision node and the consensus group member.

It should be noted that, by adopting the scheme of supplementing a network service node with the highest reputation score to update the consensus group each time in the embodiment of the present application, the reliability of the consensus group is ensured, and at the same time, the stability of the consensus group can be ensured, thereby further improving the network security.

The network processing method provided by the embodiment of the application can determine the credit score of the network service node according to the honest verification of each network service node, and as the honest verification can accurately evaluate the credibility of the network service node by judging whether the network service node is located at the position claimed by the network service node, the network service nodes with high credibility can be selected from a plurality of network service nodes according to the credit score to form a consensus group, so that the credibility of the consensus group is ensured. And then the mode that the communication transaction data generated in the process of the network service node to the terminal equipment is subjected to consensus and then stored in the block chain is realized through the consensus group, so that the network signal providing process can be monitored by utilizing the consensus group with high reliability, and the safety of a communication network is improved.

It should be further noted that, in the embodiment of the present application, by setting the role of the monitoring node, the consensus group selection process and the transaction process in the blockchain network system can be monitored, so that the network security is ensured. For example, the consensus group is selected by honest verification of the related reputation scores, so that the network service nodes with higher reputation degree have higher probability of being selected into the consensus group to participate in network consensus, and the network security is improved.

In some embodiments, to improve network security, the terminal device may obtain a reputation score for at least one connectable network service node. And selecting the network service node with the highest reputation score for connection in the at least one connectable network service node to acquire the network signal from the connected network service node.

In one embodiment, in order to improve network security, a connectable network service node with a reputation score greater than or equal to a reputation score reference value can be selected from at least one connectable network service node of the terminal device as a candidate network service node, and the candidate network service node is displayed on a display module of the terminal device, so that the terminal device can select one network service node from the candidate network service nodes to connect. Optionally, the information such as reputation scores and signal strength of the candidate network service nodes may be correspondingly displayed while the candidate network service nodes are displayed, so that the user can freely select a suitable network service node based on the requirements such as communication security consideration or communication use experience.

By the embodiment, because the credibility of the connectable network service node with the credibility greater than or equal to the credibility score reference value is higher, namely, the connectable network service node is the reliable network service node, the influence on the network security caused by the selection of the network service node with the lower credibility by the user can be avoided by displaying the candidate network service node on the display module of the terminal device.

In some embodiments, the network processing method according to the embodiment of the present application further includes: the consensus group receives communication transaction data of the first terminal equipment; packaging the communication transaction data into a new block if consensus on the communication transaction data is achieved; the new block is added to the blockchain.

Wherein the consensus group and the first terminal device are terminal devices in the same near-field network. The first terminal device is a terminal device capable of providing wireless communication signals to other terminal devices.

Through the embodiment, the transaction process of the wireless communication signals between the terminal devices can be monitored, and the safety of the near-field network is improved.

Fig. 6 is a flowchart illustrating another network processing method according to an embodiment of the present application. The embodiments of the present application are optimized based on the embodiments described above, and the embodiments of the present application may be combined with various alternatives in one or more of the embodiments described above.

S610, selecting a plurality of network service nodes to be verified from the plurality of network service nodes at preset time intervals to perform honesty verification to obtain verification results.

For the preset time interval, it may be set according to specific situations and actual requirements, for example, the preset time interval may be a time interval Δ t for generating a new block.

As for the verification result, it may be a successful verification or a failed verification. When the network service node to be verified is at the alleged position, or the position deviation from the alleged position is within the allowable error range, the verification result can be successful verification. Accordingly, when the network service node to be verified is not at the alleged position or the position deviation from the alleged position exceeds the allowable error range, the verification result is failure verification.

For the selection mode of the network service node to be verified, the network service node with lower credit score can be selected for honest verification. The selected network service nodes to be verified can be constructed into a verification set.

In one example, among the plurality of network service nodes, a preset number of network service nodes with lowest reputation scores can be selected as the network service nodes to be verified. The preset number may be set according to actual conditions and specific requirements, and is not particularly limited.

In another example, among the plurality of web service nodes, a web service node having a reputation score lower than a reputation score reference value may be selected as the web service node to be verified. The reputation score reference value may be set according to actual conditions and specific requirements, which is not particularly limited. Optionally, in order to ensure fairness of reputation scoring, the reputation scoring reference value may be used as an initial reputation scoring of the newly-joined blockchain network system.

In yet another example, the network service node to be verified may be selected through step B1 and step B2 described below.

And step B1, selecting a target network service node to be verified from the plurality of network service nodes.

In a specific example, for each network service node, the probability of being selected as the target network service node to be verified, hereinafter referred to as the selected probability, is negatively related to the reputation score of each network service node. For example, the corresponding relationship between the reputation score and the selected probability can be preset to determine the selected probability corresponding to the reputation score. The corresponding relationship between the reputation score and the selected probability may be a relational expression or a corresponding table, which is not particularly limited.

For example, the probability p (j) that the jth network service node is selected as the target network service node to be verified satisfies the formula (4):

wherein the content of the first and second substances,

and representing the reputation score of the jth network service node, wherein j is any integer less than or equal to n. n is the total number of the plurality of network service nodes, wherein if the supervision node is the network service node, n is k + 1. If the supervision node is not the network service node, n is k.

Through the above example, when the probability that each web service node is selected as the target web service node to be verified is negatively related to the reputation score of each web service node, the probability that the web service node with a lower reputation score is selected as the target web service node to be verified can be increased, and the supervision of the web service node with a lower reputation score can be improved while a certain chance is given to improve the reputation score of the web service node through honest verification.

Step B2, selecting multiple network service nodes as network service nodes to be verified within a preset range taking the target network service node to be verified as the center. All or part of the network service nodes within the preset range may be used as the network service nodes to be verified, which is not particularly limited. For example, the network service node with the reputation score lower than the reputation score reference value in the preset range can be selected as the network service node to be verified. For example, a preset number of network service nodes with the lowest reputation scores within a preset range may be selected as the network service nodes to be verified. As another example, a preset number of network service nodes may be randomly selected within a preset range as the network service nodes to be verified.

Illustratively, the preset range may be a wireless network coverage range of the target network service node to be verified. Fig. 7 is a logic diagram illustrating an exemplary selection of a network service node to be authenticated according to an embodiment of the present application.

As shown in fig. 7, for the network service nodes N1-N9, if the network service node N1 is selected as the target network service node to be verified, the remaining network service nodes within the wireless network coverage D1 of the network service node N1, that is, the network service nodes N2-N4, may be selected as the network service nodes to be verified.

After introducing the selection mode of the network service node to be verified, a specific verification mode of honest verification is described next.

For the verification mode, in some embodiments, the supervising node may send a verification data packet to a plurality of network service nodes to be verified, receive a communication parameter returned by each network service node to be verified based on the verification data packet, and determine whether each network service node to be verified is located at the alleged position according to the communication parameter.

The communication parameter of each service node to be verified may be a parameter that can change with the change of the transmission path. For example, the communication parameters of each service node to be verified may include: the time of arrival alpha and/or the signal strength beta of the data packet is verified. The time of arrival α of the verification packet may be a time when the verification packet arrives at the network service node to be verified. The signal strength β may be a strength value of a signal used for transmitting the data packet to be verified when the signal reaches the network service node to be verified.

It should be noted that, in the manner of verifying each service node to be verified by verifying the data packet, since the communication parameter is a parameter that changes with the change of the transmission path, each service node to be verified is difficult to falsify the communication parameter, so that the reliability of honest verification is ensured, and the network security is improved.

In one embodiment, the monitoring node may perform honest verification in a manner that the monitoring node sends verification data packets to the plurality of network service nodes to be verified respectively.

In another embodiment, the monitoring node performs honesty verification by means of transmitting a verification data packet by the network service node to be verified. Specifically, the supervision node may send a plurality of layers of data packets to one of the network service nodes to be verified, and then each network service node to be verified sequentially receives the verification data packets to perform integrity verification in a manner that each network data node to be verified transmits the verification data packets to other subsequent network service nodes to be verified.

For example, the honesty verification method may include the following steps C1 and C2.

And step C1, constructing a multi-layer data packet by using a plurality of network service nodes to be verified selected from the plurality of network service nodes according to the credit scores of the plurality of network service nodes.

For the multilayer data packets, any layer of data packets in the multilayer data packets are constructed by using the verification parameters of the current network service node to be verified and the data packets of the previous network service node to be verified.

Illustratively, the authentication parameters may include a random number nonce and/or a broadcast time of the packet between the current network service node to be authenticated and the previous network service node to be authenticated. For example, the random number nonce may be an incremental value, for example, the random number of the current network service node to be verified may be obtained by adding a preset value to the random number of the previous network service node to be verified.

Optionally, in order to improve the integrity verification security, a tuple formed by the verification parameter and the data packet of the previous network service node to be verified may be encrypted to obtain the data packet of the current network service node to be verified. The key used for encryption may be obtained by negotiation between the supervision node and the current network service node to be verified. For example, in order to further improve the security of integrity verification, Encryption may be performed using a key generated by a key generation algorithm, such as AES (Advanced Encryption Standard), ECC (Elliptic Curve Cryptography), ECDH (Elliptic Curve Cryptography-Hellman key exchange), or RSA (a key agreement algorithm).

Illustratively, an ECDH algorithm can be adopted between the supervision node and each network service node to be verified to perform temporary Key agreement, and a temporary private Key Key obtained by the temporary agreement _pri Distributing to network service node, and obtaining temporary public Key Key by negotiation _pub And distributing to a supervision node.

It should be noted that the temporary private Key can be guaranteed by the ECDH algorithm _pri And temporary public Key Key _pub Only the supervision node and the network service node to be verified participating in negotiation know, so that only the network service node can decrypt and verify the data packet sent to each network service node, and the network security is guaranteed.

In one example, fig. 8 illustrates an exemplary logic diagram for generating a multi-layer data packet according to an embodiment of the present application.

As shown in fig. 8, in a case that the supervising node R needs to sequentially perform integrity verification on l network service nodes to be verified N1-Nl, the supervising node R may perform temporary key negotiation with each network service node to be verified, respectively, to obtain a temporary private key and a temporary public key of each network service node to be verified.

If the honest verification sequence of the network service nodes N1-Nl to be verified is from the network service node Nl to be verified to the target network service node to be verifiedThe service node N1 may generate a multi-layer data packet D according to the sequence from the target network service node N1 to the network service node Nl to be verified _l 。

In a multi-layer data packet D _l In the generation process of (3), the temporary public key of the target network service node N1 to be verified can be used to encrypt the verification parameters of the target network service node N1 to obtain the data packet D of the target network service node N1 to be verified ₁ 。

Then, the temporary public key of the network service node N2 to be verified is used to determine the verification parameter d of the network service node N2 to be verified ₂ And a data packet D ₁ Encrypting to obtain a data packet D of the network service node N2 to be verified ₂ 。

Similarly, data packet D of network service node Ni-1 to be verified is generated _i-1 Then, the temporary public key of the network service node Ni to be verified can be utilized to obtain the verification parameter d of the network service node Ni to be verified _i And a data packet D _i-1 Encrypting to obtain a data packet D of the network service node Ni to be verified _i . Illustratively, the verification parameter of the network service node Ni-1 to be verified and the data packet of the previous network service node to be verified may be represented as a triple, for example, may be represented as a triple (nonce, time, D) _i-1 ). Then, the data packet D can be obtained after encrypting the triple _i . Wherein i can be any positive integer less than or equal to l and greater than or equal to 2.

Similarly, until the data packet D of the network service node Nl-1 to be verified is generated _l-1 Then, the temporary public key of the network service node Nl to be verified can be utilized to determine the verification parameter d of the network service node Nl to be verified _l And a data packet D _l-1 Encrypting to obtain a data packet D of the network service node Nl to be verified _l I.e. multi-layer data packet D _l 。

In one example, step C1 includes step C11 and step C12.

And step C11, constructing a weighted graph according to the reputation scores of the network service nodes to be verified.

The nodes in the weighted graph represent network service nodes to be verified, and the edges in the weighted graph represent that two nodes connected by the edges have communication capacity.

In one example, the edge weight of each edge is determined based on the absolute difference in reputation scores of two nodes that the edge connects.

Illustratively, if the wireless network coverage areas of the network service node Ni to be verified and the network service node Nl to be verified at least partially overlap, it indicates that there is a communication capability between the network service node Ni to be verified and the network service node Nl to be verified, and the two nodes in the weighted graph are connected by an edge, and the edge weight of the edge may satisfy the following formula (5):

it should be noted that the edge weight may also be calculated by using a formula that enables the absolute difference between the edge weight between two network service nodes to be verified and the reputation score between the two network service nodes to be verified to be negatively correlated, which is not described in detail herein.

In another example, the edge weight of each edge is determined based on the distance between two nodes connected by the edge.

And step C12, determining the current network service node to be verified by using the edge weight between the current network service node to be verified and the previous network service node to be verified in a plurality of nodes connected with the previous network service node to be verified by using the weighted graph.

In one example, in the case that the edge weight is an absolute difference value of the reputation scores of two nodes, the node with the smallest edge weight connected to the last network service node to be verified is selected as the current network service node to be verified.

For example, referring to fig. 7, if there is an edge connection between the network service node N1 to be verified and the network service nodes N2-N4 to be verified, the edge weight between the network service node N1 to be verified and the network service node N2 to be verified is 0.21, the edge weight between the network service node N1 to be verified and the network service node N3 to be verified is 0.09, and the edge weight between the network service node N1 to be verified and the network service node N4 to be 0.58, the network service node N3 to be verified may be selected as a new current network service node to be verified.

By selecting the node with the minimum edge weight as the adjacent network service node to be verified in the above steps, the smaller the edge weight is, the closer the credibility between the two network service nodes to be verified is, so that the influence on the security of the network service node to be verified with higher credibility when the network service node to be verified with lower credibility sends a verification data packet to the network service node to be verified with higher credibility can be prevented, and the network security is further ensured.

In another example, in a case where the edge weight of each edge is based on a distance between two nodes connected by the edge, a node with the smallest edge weight connected to the last network service node to be verified may be selected as the current network service node to be verified.

By the method, the verification of the multiple network service nodes to be verified can be completed by using the shortest signal transmission path based on the shortest path idea of the Dijkstra algorithm, so that the honest verification rate is improved.

And step C13, constructing a data packet of the current network service node to be verified by using the verification parameters of the current network service node to be verified and the data packet of the previous network service node to be verified.

It should be noted that, the manner of constructing the data packet may refer to the above-mentioned part of the embodiment of the present application in conjunction with the related description of fig. 8, and is not described herein again.

And step C14, taking the current network service node to be verified as a new previous network service node to be verified, and circularly executing the steps C12-C14 until the construction of the multilayer data packet is completed.

In one example, to improve the efficiency of the multi-layer packet building process, in step C14, the current network service node to be verified may be removed from the weighted graph to obtain a new weighted graph, and then the process returns to step C12 to determine a new current network service node to be verified using the new weighted graph.

And step C2, sending a multilayer data packet to the last network service node to be verified, so that the plurality of network service nodes to be verified sequentially perform honesty verification operations according to the sequence from back to front. For example, the supervising node may send an honest verification request including multiple layers of data packets to the last network service node to be verified, so that the last network service node to be verified parses the multiple layers of data packets from the honest verification request and performs corresponding honest verification operations.

The honesty verification operation of each network service node to be verified may include: receiving a data packet of the network service node to be verified, which is sent by a network service node to be verified behind the network service node to be verified, recording communication parameters when the data packet of the network service node to be verified is received, and returning receipt information containing the recorded communication parameters to the monitoring node. And for the last network service node to be verified, receiving a multi-layer data packet sent by the supervision node.

In one example, fig. 9 is a logic diagram of an exemplary honesty verification provided by an embodiment of the application. For convenience of illustration, the dashed arrow in fig. 9 shows the transmission direction of the data packet, and the solid arrow shows the transmission direction of the response piece information containing the communication parameters.

As shown in FIG. 9, the supervisory node R will forward multiple layers of data packets D _l And sending the network service node Nl to the last network service node Nl to be verified. Receiving multilayer data packet D by network service node Nl to be verified _l Thereafter, the communication parameters are recorded. Illustratively, the communication parameters may include: multilayer data packet D _l Arrival time alpha of network service node Nl to be verified _l And transmitting a multi-layer data packet D _l Signal strength beta of the transmission signal arriving at the network service node Nl to be verified _l 。

The network service node Nl to be verified sends a multi-layer data packet D _l After decryption, obtaining a data packet D of the network service node Nl-1 to be verified _l-1 And random number nonce _l . Network to be authenticatedService node Nl sends data packet D _l-1 Sending the data packet to the network service node nearby in a broadcast mode so that the network service node Nl-1 to be verified receives the data packet D _l-1 . And the network service node Nl to be verified utilizes the random number nonce _l Time of arrival alpha _l Signal intensity beta _l And generating the receipt information l. Illustratively, the random number nonce may be _l Time of arrival alpha _l Signal intensity beta _l The Receipt content is spliced, and accordingly, the Receipt content can be expressed as a script (nonce) _l ||α _l ||β _l ). And then, signing the receipt content by using a private key of the network service node Nl to be verified to obtain receipt information l, and returning the receipt information l to the monitoring node R.

Similarly, when the network service node Ni to be verified receives the data packet D _i Thereafter, the communication parameters are recorded, and the data packet D is recorded _i Decrypting to obtain data packet D _i-1 And random number nonce _i . Network service node Ni to be verified sends data packet D _i-1 Sending the data packet D to the network service node adjacent to the network service node in a broadcasting way so that the network service node Ni-1 to be verified receives the data packet D _i-1 . And, based on the communication parameters and the random number nonce _i And generating a receipt message i, and returning the receipt message i to the supervision node R.

Until the network service node N2 to be verified receives the data packet D ₂ Thereafter, the communication parameters are recorded, and the data packet D is recorded ₂ Decrypting to obtain a data packet D ₁ And random number nonce ₂ . The network service node N2 to be verified sends the data packet D ₁ Sending the data packet to the network service node to be verified in a broadcasting way, so that the network service node to be verified N1 receives the data packet D ₁ . And, based on the communication parameters and the random number nonce ₂ And generating the receipt information 2 and returning the receipt information 2 to the supervision node R.

The network service node N1 to be verified receives the data packet D ₁ Thereafter, the communication parameters are recorded, and the data packet D is recorded ₁ Decrypting to obtain random number nonce ₁ . Based on communication parameters and random number nonces ₁ And generating receipt information 1 and returning the receipt information 1 to the supervision node R.

In one example, to facilitate honest verification, the signal frequency and signal strength of the data packets sent by each network service node to be verified can be set to preset values.

C3, receiving communication parameters of a plurality of network service nodes to be verified. The communication parameters of each network service node to be verified comprise: the arrival time of the received data packet and the signal strength of the transmission signal of the received multi-layer data packet.

Continuing illustratively with fig. 9, supervisory node R may decrypt the receipt information using the public key to obtain the communication parameters.

And C4, determining the verification result of each network service node to be verified according to the communication parameters of the network service nodes to be verified, wherein the verification result is successful verification or failed verification.

In one example, the current network service node to be verified and the next network service node to be verified are taken as an example, and the arrival time difference Δ α between the two is _ij Can be expressed by the following formula (6):

Δα _ij ＝dis _ij /λ (6)

wherein dis _ij The distance between the current network service node to be verified and the next network service node to be verified is represented, and lambda represents the signal transmission rate.

In one example, the signal strength of the current network service node to be verified and the distance between the current network service node to be verified and the next network service node to be verified satisfy the following formula (7):

β＝B-20*log ₁₀ dis _ij -20*log ₁₀ F-32.44+σ (7)

where F denotes the transmission frequency of the communication signal for transmitting the packet, B denotes the transmission intensity of the communication signal for the packet, and σ denotes an error correction value.

Through the step C4, the actual location of each network service node to be verified can be determined according to the signal strength and the arrival time of each network service node to be verified, so that the verification result of successful verification and the verification result of failed verification can be obtained according to whether the actual location is consistent with the claimed location.

And, it should be noted that, by using the arrival time and the signal strength as communication parameters, even if the network service node to be verified with a wrong location changes the signal strength of the communication signal used for sending the data packet, the arrival time cannot be modified, and even if the transmission rate is modified, the signal strength cannot be modified, so that the authenticity of honest verification can be improved.

And S620, updating the reputation scores of the network service nodes by using the verification result.

It should be noted that, reference may be made to the above-mentioned section of the embodiment of the present application in conjunction with the related description of step a1 to step a9, and details of the updated reputation score are not described herein again.

S630, obtaining the updated credit scores of the plurality of network service nodes,

the reputation score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with the claimed position.

S630 is similar to S210, and reference may be made to specific contents of S210, which is not described herein again.

And S640, selecting at least part of the network service nodes to form a consensus group according to the credit scores of the network service nodes, and storing the communication transaction data achieving the consensus to the block chain by using the consensus group. Wherein the communication transaction data is transaction data generated in the process that any network service node provides network signals to the terminal equipment.

S640 is similar to S220, and reference may be made to specific contents of S220, which is not described herein again.

Based on the same inventive concept, the embodiment of the present application further provides a network processing apparatus, as described in the following embodiments.

Fig. 10 is a schematic diagram of a network processing apparatus in an embodiment of the present application, which may be applied to a supervisory node, and as shown in fig. 10, the network processing apparatus 1000 includes: a score acquisition module 1010 and a consensus fabric modeling block 1020.

The credit acquisition module 1010 is configured to acquire credit scores of a plurality of network service nodes, where the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used to verify whether an actual position of each network service node is consistent with a claimed position;

a consensus formation modeling block 1020 for selecting at least a portion of the consensus groups from the plurality of network service nodes based on the reputation scores of the plurality of network service nodes, storing the communication transaction data agreed with the consensus groups into the blockchain,

In one embodiment, the score obtaining module 1010 is configured to:

and determining the reputation score of each network service node according to the successful verification times, wherein the reputation scores are used for:

In one embodiment, the score obtaining module 1010 is configured to:

In one embodiment, the reputation degree change factor satisfies the formula:

In one embodiment, the score obtaining module 1010 is configured to:

judging whether each network service node receives honesty verification or not;

obtaining successful verification times of multiple honest verifications of each network service node, and using the successful verification times to:

In one embodiment, the score obtaining module 1010 is configured to:

In one embodiment, the network processing device 1000 further comprises:

the integrity verification module is used for selecting a plurality of network service nodes to be verified from the plurality of network service nodes at preset time intervals to perform integrity verification to obtain a verification result;

the score updating module is used for updating the credit scores of the network service nodes by using the verification result;

a score obtaining module 1010 configured to:

In one embodiment, the integrity verification module is to:

The network processing device provided by the embodiment of the application can determine the credit score of each network service node according to the honest verification of each network service node, and as the honest verification can accurately evaluate the credibility of the network service nodes by judging whether the network service nodes are located at the alleged positions, the network service nodes with high credibility can be selected from a plurality of network service nodes according to the credit score to form a consensus group, so that the credibility of the consensus group is ensured. And then the mode that the communication transaction data generated in the process of the network service node to the terminal equipment is subjected to consensus and then stored in the block chain is realized through the consensus group, so that the network signal providing process can be monitored by utilizing the consensus group with high reliability, and the safety of a communication network is improved.

It should be noted that the data transmission apparatus 1000 shown in fig. 10 may perform each step in the method embodiments shown in fig. 2 to 9, and implement each process and effect in the method embodiments shown in fig. 2 to 9, which are not described herein again.

Based on the same inventive concept, the embodiment of the present application further provides a block chain network system, including:

the supervision node is used for acquiring the credit scores of the network service nodes, wherein the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with the alleged position or not;

a consensus group construction module for selecting at least part of the plurality of network service nodes to form a consensus group according to the reputation scores of the plurality of network service nodes, so as to store the communication transaction data achieving the consensus by using the consensus group into a block chain,

It should be noted that the supervising node may refer to each step in the method embodiments shown in fig. 2 to 9, and implement each process and effect in the method embodiments shown in fig. 2 to 9, which are not described herein again.

The block chain network system provided by the embodiment of the application can determine the credit score of the network service node according to the honest verification of each network service node, and as the honest verification can accurately evaluate the credibility of the network service node by judging whether the network service node is located at the position claimed by the network service node, the network service node with high credibility can be selected from a plurality of network service nodes according to the credit score to form a consensus group, so that the credibility of the consensus group is ensured. And then the mode that the communication transaction data generated in the process of the network service node to the terminal equipment is subjected to consensus and then stored in the block chain is realized through the consensus group, so that the network signal providing process can be monitored by utilizing the consensus group with high reliability, and the safety of a communication network is improved.

As will be appreciated by one skilled in the art, aspects of the present application may be embodied as a system, method or program product. Accordingly, various aspects of the present application may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.

An electronic device 1100 according to this embodiment of the present application is described below with reference to fig. 11. The electronic device 1100 shown in fig. 11 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.

As shown in fig. 11, electronic device 1100 is embodied in the form of a general purpose computing device. The components of the electronic device 1100 may include, but are not limited to: the at least one processing unit 1110, the at least one memory unit 1120, and a bus 1130 that couples various system components including the memory unit 1120 and the processing unit 1110.

Wherein the storage unit stores program code that is executable by the processing unit 1110 to cause the processing unit 1110 to perform steps according to various exemplary embodiments of the present application described in the above section "exemplary methods" of the present specification. For example, the processing unit 1110 may perform the following steps of the above-described method embodiment:

the method comprises the steps of obtaining credit scores of a plurality of network service nodes, wherein the credit score of each network service node is determined according to honest verification of each network service node, and the honest verification is used for verifying whether the actual position of each network service node is consistent with the alleged position or not;

The storage unit 1120 may include a readable medium in the form of a volatile memory unit, such as a random access memory unit (RAM)11201 and/or a cache memory unit 11202, and may further include a read only memory unit (ROM) 11203.

Storage unit 1120 may also include a program/utility 11204 having a set (at least one) of program modules 11205, such program modules 11205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 1130 may be representative of one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 1100 may also communicate with one or more external devices 1140 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 1100, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 1100 to communicate with one or more other computing devices. Such communication can occur via an input/output (I/O) interface 1150.

Also, the electronic device 1100 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 1160.

As shown in FIG. 11, the network adapter 1160 communicates with the other modules of the electronic device 1100 via the bus 1130.

It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 1100, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present application.

In an exemplary embodiment of the present application, there is also provided a computer-readable storage medium, which may be a readable signal medium or a readable storage medium. On which a program product capable of implementing the method of the present application is stored.

In some possible embodiments, various aspects of the present application may also be implemented in the form of a program product comprising program code for causing a terminal device to perform the steps according to various exemplary embodiments of the present application described in the "exemplary methods" section above of this specification, when the program product is run on the terminal device.

More specific examples of the computer-readable storage medium in the present application may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

In the present application, a computer readable storage medium may include a propagated data signal with readable program code embodied therein, either in baseband or as part of a carrier wave.

Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof.

A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

In some examples, program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

In particular implementations, program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + +, or the like, as well as conventional procedural programming languages, such as the "C" programming language or similar programming languages.

The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.

In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory.

Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the application. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

Moreover, although the steps of the methods herein are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware.

Therefore, the technical solution according to the embodiments of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present application.

Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein.

This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.

Claims

1. A network processing method is applied to a supervision node and comprises the following steps:

selecting at least part of the network service nodes to form a consensus group according to the reputation scores of the network service nodes, storing communication transaction data achieving the consensus by using the consensus group into a block chain,

2. The method of claim 1, wherein obtaining reputation scores for a plurality of web service nodes comprises:

obtaining the successful verification times of the multiple honesty verifications of each network service node;

3. The method of claim 2, wherein before the determining the reputation score of each network service node according to the number of successful verifications, the method further comprises:

obtaining the failure verification times of the multiple honest verifications of each network service node;

4. The method according to claim 2 or 3, wherein before said determining the reputation score of each network service node according to the number of successful verifications, the method further comprises:

obtaining a block height difference of each network service node, wherein the block height difference is a difference value between the current block height of the block chain and the block height of the network service node when the network service node is successfully verified last time;

the determining the reputation scores of the network service nodes according to the successful verification times comprises:

5. The method of claim 4, wherein determining the reputation score of each network service node according to the number of successful verifications and the block height difference comprises:

determining credit degree change factors of the network service nodes according to the successful verification times and the block height difference;

6. The method of claim 5,

the credit degree variation factor satisfies the formula:

wherein δ represents the reputation degree change factor, θ represents an adjustment coefficient, s represents a difference between the successful verification times and the failed verification times, a represents a preset multiplying factor, Δ b represents the number of blocks generated by the block chain within an honest verification time interval Δ t, and h is the block height difference.

7. The method according to any of claims 2-6, wherein prior to said obtaining a number of successful verifications of a plurality of honest verifications of the respective network service nodes, the method comprises:

judging whether each network service node receives honesty verification;

the obtaining of the successful verification times of the multiple honest verifications of the network service nodes includes:

8. The method of claim 7, wherein after the determining whether the respective network service node accepts honest verification, the obtaining reputation scores of the plurality of network service nodes further comprises:

under the condition that each network service node does not receive honest verification, acquiring a block height difference corresponding to each network service node, wherein the block height difference corresponding to each network service node is a difference value between the current block height of the block chain and the block height of each network service node when the network service node is added into the block chain network;

determining credit degree change factors corresponding to the block height differences corresponding to the network service nodes;

9. The method of claim 1, wherein prior to the obtaining reputation scores for a plurality of web service nodes, the method further comprises:

selecting a plurality of network service nodes to be verified from the plurality of network service nodes at preset time intervals to perform honesty verification to obtain verification results;

updating the credit scores of the plurality of network service nodes by using the verification result;

the obtaining of the reputation scores of the plurality of web service nodes comprises:

10. The method of claim 9, wherein selecting a plurality of network service nodes to be verified from the plurality of network service nodes for honest verification comprises:

selecting a target network service node to be verified from the plurality of network service nodes;

selecting a plurality of network service nodes as network service nodes to be verified within a preset range with the target network service node to be verified as the center;

and the probability of each network service node selected as the target to-be-verified network service node is negatively related to the credit score of each network service node.

11. The method of claim 1,

the network service node is a terminal device in the near-field network for providing wireless network signals for other terminal devices.

12. A network processing apparatus, applied to a supervisory node, the apparatus comprising:

13. A blockchain network system, comprising:

14. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the network processing method of any one of claims 1-11 via execution of the executable instructions.

15. A computer-readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, is adapted to carry out the network processing method of any one of claims 1 to 11.