Network architecture, network resource management method and related device

Abstract

The invention provides a network architecture, a network resource management method and a related device, and the network architecture comprises a main node of an IAB network, which is used for being connected with a core network through a wired return link; a plurality of distributed nodes of the IAB network; and the resource management platform is used for authenticating whether the distributed nodes are legal identities or not by adopting a block chain technology, and indicating the main node to be connected with the distributed nodes with the legal identities through a wireless return link to form a target network. The management method comprises the following steps: checking whether idle resources exist in a target network to obtain a checking result; if the idle network resources exist, evaluating a reputation value of each distributed node in the target network, and determining an optimal route of the network resources in the target network according to the reputation value; and obtaining transaction resource information of each link node on the optimal route, packaging the transaction resource information into a block, and completing block chain consensus by using the block. The network architecture disclosed by the invention can be conveniently expanded and has high security.

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of communication technology, and in particular to a network architecture, a network resource management method, and related apparatus. Background Technology

[0002] The rapid development of mobile communication technology has ushered us into a new mobile era. With the surge in the number of IoT devices and users, the demand for ultra-dense base station networks is becoming increasingly urgent.

[0003] Existing ultra-dense base station network architectures mostly employ wired backhaul solutions, meaning that each base station (node) in the network is connected via a wired backhaul link, such as fiber optic cable. Therefore, every time a new base station (node) needs to be added to expand the network, a cable must be laid to connect the new base station (node), hindering convenient network expansion. Summary of the Invention

[0004] This invention provides a network architecture, network resource management method, and related apparatus to address the problem that existing ultra-dense base station networking architectures mostly use wired backhaul schemes, requiring the deployment of lines to connect to new base stations (nodes) each time the network needs to be expanded, thus hindering convenient network expansion.

[0005] To solve the above-mentioned technical problems, the present invention is implemented as follows:

[0006] In a first aspect, embodiments of the present invention provide a network architecture, including:

[0007] The master node of the integrated IAB network for accessing backhaul is used to connect to the core network via a wired backhaul link;

[0008] The IAB network has multiple distributed nodes;

[0009] The resource management platform is used to authenticate the legitimate identities of each distributed node using blockchain technology, and instructs the master node to connect with the legitimate distributed nodes through a wireless backhaul link to form a target network.

[0010] Optionally, the master node has an array antenna;

[0011] The array antenna is used to establish the wireless backhaul link with the distributed nodes;

[0012] The array antenna is also used to improve the signal transmission power to the legitimate distributed nodes by employing beamforming.

[0013] Optionally, the resource management platform is further configured to optimize and adjust the spectrum resources of the backhaul links allocated by the master node to the distributed nodes with legitimate identities, wherein the objective function of the optimization and adjustment is determined based on the access rate and backhaul rate between the master node and the distributed nodes with legitimate identities.

[0014] In a second aspect, embodiments of the present invention provide a network resource management method, applied to a network architecture as described in any one of the first aspects, comprising:

[0015] The test results are obtained by checking whether there are any idle resources in the target network.

[0016] If the test result indicates that there are idle network resources in the target network, the reputation value of each distributed node in the target network is evaluated, and the optimal route for the network resources in the target network is determined based on the reputation value.

[0017] Obtain transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete blockchain consensus using the blocks.

[0018] Optionally, evaluating the reputation value of each of the distributed nodes in the target network includes:

[0019] An initial reputation value is assigned to each of the distributed nodes in the target network. Every preset time period, the reputation value of each distributed node is updated based on the transaction behavior of the distributed nodes in the target network during the time period.

[0020] Optionally, determining the optimal route for network resources in the target network based on the reputation value includes:

[0021] Perform network topology analysis on the target network to obtain multiple candidate routing links;

[0022] The cost of each candidate route link is calculated based on the reputation value and the transmission rate of each candidate route link.

[0023] The shortest path algorithm is used to determine the candidate route link with the lowest cost as the optimal route.

[0024] Thirdly, embodiments of the present invention provide a network resource management device, applied to a network architecture as described in any one of the first aspects, comprising:

[0025] The verification module is used to verify whether there are idle resources in the target network and obtain the verification result;

[0026] An execution module is configured to, if the test result indicates that there are idle resources in the target network, evaluate the reputation value of each of the distributed nodes in the target network, and determine the optimal route for network resources in the target network based on the reputation value;

[0027] The consensus module is used to obtain transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete the blockchain consensus with the blocks.

[0028] Fourthly, embodiments of the present invention provide an electronic device, including a processor, a memory, and a program or instructions stored in the memory and executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the network resource management method as described in any one of the second aspects.

[0029] Fifthly, embodiments of the present invention provide a readable storage medium on which a program or instructions are stored, which, when executed by a processor, implement the steps of the network resource management method as described in any one of the second aspects.

[0030] In a sixth aspect, embodiments of the present invention provide a computer program product, including computer instructions, which, when executed by a processor, implement the steps of the network resource management method as described in any one of the second aspects.

[0031] In this embodiment of the invention, the master node of the IAB network transmits access traffic from multiple distributed nodes back to the network via wireless technology (wireless backhaul link). Network expansion requires no additional wiring to connect new base stations (nodes), enabling convenient network expansion. Furthermore, blockchain technology is used to authenticate the legitimacy of each distributed node, directing the master node to connect with legitimate distributed nodes via the wireless backhaul link. Leveraging the immutability of blockchain, the problem of unauthorized access to distributed nodes via the wireless backhaul link is eliminated, effectively preventing malicious nodes or users from abusing wireless resources and improving security. The network architecture of this embodiment of the invention is easily scalable and highly secure. Attached Figure Description

[0032] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the invention. Furthermore, the same reference numerals denote the same parts throughout the drawings. In the drawings:

[0033] Figure 1 This is a schematic diagram illustrating the principle of the network architecture in an embodiment of the present invention;

[0034] Figure 2A schematic diagram illustrating the principle of spectrum allocation strategy;

[0035] Figure 3 Flowchart of the alternating optimization algorithm;

[0036] Figure 4 This is a flowchart illustrating the network resource management method.

[0037] Figure 5 This is a flowchart illustrating the IAB trusted routing algorithm based on reputation value weighting.

[0038] Figure 6 This is a schematic diagram of the PBFT consensus process;

[0039] Figure 7 This is a schematic block diagram of the network resource management device according to an embodiment of the present invention;

[0040] Figure 8 This is a schematic block diagram of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0041] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0042] The terms "first," "second," etc., used in this embodiment of the invention are used to distinguish similar objects, not to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate so that embodiments of the invention can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first" and "second" are generally of the same class, without limiting the number of objects; for example, the first object can be one or more. Furthermore, in this embodiment of the invention, "or" indicates at least one of the connected objects. For example, "A or B" covers three scenarios: Scenario 1: includes A but does not include B; Scenario 2: includes B but does not include A; Scenario 3: includes both A and B. The character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0043] In the technical solutions of the embodiments of the present invention, terms such as "connection", "coupling" or "connected" are not limited to physical or mechanical connections, but may include electrical connections.

[0044] Furthermore, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0045] This invention provides a network architecture, including:

[0046] The master node of the integrated IAB network for accessing backhaul is used to connect to the core network via a wired backhaul link;

[0047] Multiple distributed nodes in the IAB network;

[0048] The resource management platform uses blockchain technology to authenticate the legitimate identities of each distributed node and instructs the master node to connect with the legitimate distributed nodes via a wireless backhaul link to form the target network.

[0049] Integrated Access and Backhaul (IAB) networks refer to a network architecture that integrates the functions of the access network and the backhaul network. This network design aims to improve network efficiency, reduce costs, and simplify network management, especially its plug-and-play nature, enabling base stations to quickly backhaul without relying on traditional wired fiber optic networks.

[0050] In some embodiments, see Figure 1 As shown, Figure 1 This is a schematic diagram illustrating the network architecture of an embodiment of the present invention. "IAB Master Node" refers to the master node; "5GC" refers to the core network, specifically the 5G core network in this embodiment, and correspondingly, the master node is a 5G base station; "IAB Distributed Node Network" refers to distributed nodes certified as legitimate by the resource management platform; "Malicious Node" refers to distributed nodes certified as illegitimate by the resource management platform; and "Blockchain" indicates that the resource management platform uses blockchain technology to authenticate the legitimacy of each distributed node.

[0051] In some embodiments, during the identity authentication process, the distributed node needs to generate a public key and private key pair in sync with the identity authentication through a series of identity verifications. The public key is used to identify the node, and the private key is used for encryption and signing operations to ensure the security and integrity of the information.

[0052] In this embodiment of the invention, the master node of the IAB network transmits access traffic from multiple distributed nodes back to the network via wireless technology (wireless backhaul link). Network expansion requires no additional wiring to connect new base stations (nodes), enabling convenient network expansion. Furthermore, blockchain technology is used to authenticate the legitimacy of each distributed node, directing the master node to connect with legitimate distributed nodes via the wireless backhaul link. Leveraging the immutability of blockchain, the problem of unauthorized access to distributed nodes via the wireless backhaul link is eliminated, effectively preventing malicious nodes or users from abusing wireless resources and improving security. The network architecture of this embodiment of the invention is easily scalable and highly secure.

[0053] In some embodiments, the master node has an array antenna;

[0054] The array antenna is used to establish wireless backhaul links with distributed nodes;

[0055] The array antenna is also used to improve the signal transmission power to authorized distributed nodes using beamforming. Power distribution through directional beamforming of the array antenna reduces power leakage and meets the QoS (Quality of Service) requirements of authorized distributed nodes.

[0056] In some embodiments, the resource management platform is also used to optimize and adjust the spectrum resources of the backhaul links allocated by the master node to the legitimate distributed nodes. The objective function for optimization and adjustment is determined based on the access rate and backhaul rate between the master node and the legitimate distributed nodes.

[0057] It should be noted that when IAB distributed nodes work collaboratively, due to the transmission characteristics of wireless signals, nodes sharing wireless channels are prone to mutual interference. This is especially true in IAB networks, where access and backhaul links on nodes share resources. Therefore, network resource management is crucial. If resource management is chaotic, severe co-channel interference and self-interference will occur between nodes, degrading network performance.

[0058] In some embodiments, the spectrum resources of the backhaul links allocated to distributed nodes with legitimate identities by the master node are optimized and adjusted. Specifically, this can be done by acquiring spectrum awareness information of the surrounding environment of each IAB distributed node in the target network, and making collaborative decisions on the resource allocation of distributed nodes across the entire target network through a consensus algorithm. Therefore, when distributed nodes conduct network resource transactions, they need to know whether there are idle resources and complete the resource transaction with users and the upstream nodes on the backhaul path using a reasonable allocation strategy. To reduce co-channel interference between nodes, a bandwidth allocation strategy based on differentiated load requirements is designed between backhaul links. To further reduce co-channel interference between nodes, the service characteristics of access users are given priority, and a dynamic allocation strategy for shared bandwidth is designed. Specifically, see [link to relevant documentation]. Figure 2 As shown, Figure 2 This diagram illustrates the principle of spectrum allocation strategy. For the IAB master node, spectrum allocation is shared by the access links of its associated users and the backhaul links of distributed nodes N1 and N2, representing an integrated access and backhaul system. Orthogonal allocation is performed, first satisfying the rate requirements of user services, and then allocating spectrum based on the differentiated load requirements of the distributed nodes. For the spectrum allocation of IAB distributed nodes, such as N1, spectrum is shared by its upstream node and users.

[0059] In some embodiments, the spectrum resources of the backhaul links allocated by the master node to the legitimate distributed nodes are optimized and adjusted. The objective function of the optimization and adjustment is determined based on the access rate and backhaul rate between the master node and the legitimate distributed nodes. Specifically, it can be: allocating power resources to the access link and the backhaul link respectively. In this embodiment of the invention, a step-by-step optimization method is adopted, the optimization objective is the sum of the access and backhaul rates, and the optimization parameters are spectrum and power.

[0060] Since the capacity of the IAB network is limited by the wireless backhaul links between the IAB master node and the distributed nodes, an optimization model is established for the IAB master node and its associated distributed nodes.

[0061] First, a capacity model for the wireless link needs to be established, assuming all nodes are equipped with array antennas and users have omnidirectional antennas. Under perfect beam alignment, the effective gains of the backhaul and access links are respectively... and G max Wireless links all operate in the millimeter-wave band, and the signal-to-noise-plus-interference ratio (SINR) of the link is approximately equal to the signal-to-noise ratio (SNR). Assume the maximum backhaul power resource of the node is P. max The transmit power from the IAB master node to the i-th distributed node can be expressed as P. i The transmit power from the node to the user is P. n Then SINR is:

[0062]

[0063] in, It is the spectrum resource allocated to the i-th backhaul link. This refers to the spectrum resources allocated to the k0th access link. B is the available bandwidth, N0 is additive white Gaussian noise with a power spectral density of -174dBm / Hz, and PL is the path loss. The probability distribution of line-of-sight transmission can be obtained from the 3GPP congestion model. Considering both line-of-sight and non-line-of-sight transmission, a weighted path loss model that better reflects actual transmission can be obtained. Let K0 be the path loss of the access link. Let represent the path loss of the i-th backhaul link.

[0064] According to Shannon's formula, the capacity of the access and backhaul links can be obtained as follows:

[0065]

[0066]

[0067] The IAB master node needs to provide as much capacity as possible for other distributed nodes. Therefore, the sum of the access and backhaul rates on the IAB master node is used as the optimization objective (R0). D ),

[0068]

[0069] in, It refers to the rate requirements of the backhaul link service. It refers to the rate requirements of access link services.

[0070] The optimization problem is as follows:

[0071]

[0072] This invention prioritizes the service characteristics of access links, that is, it prioritizes allocating spectrum to meet the rate requirements of access links, i.e., increases... The constraints are used to guarantee user QoS. Furthermore, using the aforementioned heuristic bandwidth allocation strategy, the following optimization problem is simplified:

[0073]

[0074] It is easy to prove that this problem is a convex optimization problem, which can be solved using MATLAB's CVX toolbox or through an iterative method. Since the allocation of spectrum resources is based on the aforementioned heuristic allocation strategy, this step-by-step optimization method can obtain an approximate optimal solution.

[0075] To make the obtained solution closer to the optimal solution, the spectrum and bandwidth are further optimized alternately, that is, the optimization problems P2 and P3 are solved alternately to achieve rapid convergence.

[0076]

[0077]

[0078] See Figure 3 As shown, Figure 3 The flowchart for the alternating optimization algorithm shows that, by taking into account the rate requirements of user services and optimizing the allocation of spectrum and power resources, this resource management method has a significant improvement over the traditional resource management method of equal spectrum and equal power allocation.

[0079] This invention provides a network resource management method applicable to the network architecture of any of the embodiments of this invention. See also... Figure 4 As shown, Figure 4 A flowchart illustrating network resource management methods, including:

[0080] Step 11: Check whether there are idle resources in the target network and obtain the test results;

[0081] Step 12: If the test results indicate that there are idle network resources in the target network, evaluate the reputation value of each distributed node in the target network, and determine the optimal route for the network resources in the target network based on the reputation value;

[0082] Step 13: Obtain the transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete the blockchain consensus with blocks.

[0083] Since the distributed nodes are not directly connected to the core network via wired fiber optic cables, in order to provide backhaul services to users, the distributed nodes must route user traffic to the master node via a wireless backhaul path (i.e., a wireless backhaul link) using a routing algorithm, and then the master node will transmit the traffic to the core network via a wired backhaul (through a wired backhaul link).

[0084] Regarding routing algorithms, traditional centralized routing algorithms are not suitable for plug-and-play IAB distributed nodes. Furthermore, in traditional centralized routing algorithms, the central node needs to know the cost of all links in the entire network and use an algorithm (such as the shortest path algorithm) to find the optimal route. Although centralized routing algorithms can guarantee a globally optimal solution, they are susceptible to bottleneck effects from the central node, single points of failure, interference from malicious nodes, and changes in link load.

[0085] In this embodiment of the invention, the reputation value of each distributed node in the target network is evaluated, and the optimal route for network resources in the target network is determined based on the reputation value. Distributed routing is used to solve the problems in the prior art, reduce the impact of single point of failure or malicious nodes on network performance, quickly respond to changes in link load, and perform load balancing.

[0086] Specifically, reputation value, also known as node reputation value, is a metric used in blockchain networks to measure a node's trustworthiness and reliability within the network. The design of node reputation values ​​aims to promote network security and efficiency, especially in decentralized environments.

[0087] Using network topology, the target network is abstractly represented as an undirected connected graph G = (V, E), where V is the set containing all nodes (routers) in the graph, and E is the set containing all edges (links) in the graph. For any edge l ∈ E, the cost of the edge is represented by cost(l). The cost can be an attribute such as bandwidth or latency. The shortest path algorithm can find a path from the source node to the destination node in the network with the minimum cost.

[0088] Distributed nodes that have completed identity authentication (i.e., distributed nodes with legitimate identities) can participate in the blockchain ledger sharing and are assigned an initial node reputation value (Tv). init The reputation value of a node is updated based on its behavior during the transaction. A higher reputation value generally indicates greater security; therefore, choosing a node with a high reputation value for backhauling is considered safer. Nodes that complete resource transactions update their reputation value, i.e., their TV value. s+1 =Tv s +Δ. Where, Tv s This represents the current node's reputation value, Tv s+1 This represents the updated node reputation value, where Δ is a fixed value (which can be preset by the user according to actual needs). A node's reputation value is related to its contribution to the network; the more resource transactions it successfully completes, the higher its reputation value. In addition to the reward mechanism for node reputation value, there is also a penalty mechanism for malicious behavior, adopting the principle of "slow rise, fast fall," meaning that when a node engages in malicious behavior, its reputation value is rapidly reduced. s+1 =Tv s -2Δ quickly removes malicious nodes from the candidate nodes. Therefore, using reputation values ​​to assist routing can better improve communication security.

[0089] To meet the user's QoS, considering both communication security and effectiveness, a path with the minimum overall cost to the destination node is calculated by weighting link costs with reputation values ​​(i.e., by evaluating the reputation values ​​of each distributed node in the target network, the optimal route for network resources in the target network is determined based on the reputation values, which is also known as distributed routing).

[0090] Link cost is inversely proportional to the link's transmission rate; that is, the higher the transmission rate and the lower the cost, the more worthwhile the link is to be selected. Links with higher reputation scores are also more worthwhile to select. Therefore, by weighting link cost by reputation score, a new trust cost model is obtained, the expression of which is as follows:

[0091]

[0092] Where S represents the source node, N represents the neighbor node, D represents the destination node, α represents the cost constant, R represents the link transmission rate, and Tv s (S,N) is a weighted representation of the link cost from S to N based on reputation value, and cost(N,D) represents the cost from N to D.

[0093] In some embodiments, see Figure 5 As shown, the steps of the reputation-weighted IAB trusted routing algorithm (i.e., distributed routing algorithm) include:

[0094] Step 1: Initialize the network topology;

[0095] Step 2: Obtain the routing tables, reputation values, and other information of neighboring nodes;

[0096] Step 3: Based on the optimized available resources, calculate the reputation-weighted link cost from the source node to the neighboring nodes;

[0097] Step 4: Calculate the path with the minimum trusted cost from the source node to each node using the shortest path algorithm, update the routing table, and broadcast the routing table to neighboring nodes;

[0098] Step 5: Select the shortest path to the IAB master node based on the routing table, and obtain the resource transaction information on that path;

[0099] In some embodiments, each distributed node in the target network can be used as a consensus node, and the blockchain consensus can be completed with the block. That is, the optimal route can be agreed upon among all distributed nodes in the form of consensus, so as to realize the rapid deployment and implementation of the optimal route scheme.

[0100] In some embodiments, distributed nodes that serve as link nodes on the optimal route can be used as consensus nodes, and the blockchain consensus can be completed using the blocks. In other words, the optimal route is agreed upon among all link nodes in the form of consensus, thereby enabling the rapid deployment and implementation of the optimal route scheme.

[0101] In some embodiments, step 13 obtains the transaction resource information of each link node on the optimal route, packages the transaction resource information into blocks, and completes blockchain consensus using blocks. Specifically, this may include: after the distributed nodes package resource transactions into blocks (i.e., package transaction resource information into blocks), executing the consensus process. The consensus process is: sending the packaged blocks to other consensus nodes for consensus to achieve blockchain consistency. The Practical Byzantine Fault Tolerance (PBFT) algorithm avoids the waste of computing resources, improves the block generation speed of the blockchain system, and can achieve consensus in a short time, making it suitable for network services with high latency requirements. It also has strong security, as the Byzantine fault tolerance process can adapt to situations where the number of malicious nodes does not exceed 1 / 3 of the total number of nodes, achieving better fault tolerance in distributed networks and ensuring the consistency and validity of system data.

[0102] When the target network is large and the number of distributed nodes (i.e., consensus nodes, a crucial concept in blockchain and distributed systems, referring to nodes that participate in reaching consensus within the network. These nodes are responsible for verifying transactions, generating new blocks, and ensuring the consistency and security of the entire network. The consensus mechanism is a protocol that ensures all participating nodes reach a consensus on the state of the blockchain) is large, nodes are screened, and those that meet the reputation value threshold (Tv) are selected. th The nodes form a consensus node set. These consensus nodes are divided into two types: leader nodes and voting nodes. Because network reputation is dynamic, the consensus node set also changes dynamically, and the role type of each consensus node dynamically changes based on its reputation value.

[0103] Because the IAB network tends to be centralized, meaning that every resource transaction request requires the participation of the IAB master node, the IAB master node will have the highest reputation value. If the leader node is selected based on the reputation value, the degree of centralization will be very serious. Therefore, this embodiment of the invention improves the election of the leader node.

[0104] During network initialization, an IAB master node is selected as the leader node. The behavior of all subsequent nodes is evaluated, and the node with the highest reputation value is chosen as the leader. If no single node has the highest reputation value, a leader node is randomly selected from the set of candidate nodes with the highest reputation values. After serving as leader for a period of time, voting nodes can vote to decide whether to demote the leader to a voting node. If demoted, the leader node is then chosen from the node with the next highest reputation value. This helps avoid the problem of excessive centralization caused by a single node continuously serving as leader and prevents malicious nodes from casting malicious votes to quickly escalate their leadership.

[0105] See Figure 6 As shown, Figure 6 This is a schematic diagram of the PBFT consensus process. The consensus phase is mainly divided into the following five stages:

[0106] 2) Client node initiates transaction request: The client node sends a transaction request to the leader node.

[0107] 2) Pre-preparation phase: After verifying the client request, the leader node assigns a sequence number to the request and stores the data generated by the transaction in the transaction pool. The client request message is then broadcast to all voting nodes.

[0108] 3) Preparation phase: After receiving the message from the leader node, the voting node verifies that the message is correct and has not been maliciously tampered with, adds a signature and verification result, and broadcasts it to other nodes.

[0109] 4) Submission Phase: All voting nodes verify the received preparation message. If the number of nodes whose verification results are correct exceeds 2 / 3 of the total number, the node will broadcast the submission message to other nodes.

[0110] 5) Response Phase: Consensus nodes receive commit messages from other nodes. If more than 2 / 3 of the total number of nodes verify the correct commit messages, it indicates that the resource transaction invention implementation has passed, and the new block is added to its local copy for storage. Client nodes receive responses from different consensus nodes. If more than 1 / 3 of the total number of consensus nodes respond identically, it is considered a PBFT consensus result.

[0111] In this embodiment of the invention, step 11: check whether there are idle resources in the target network and obtain the check result; step 12: if the check result indicates that there are idle network resources in the target network, evaluate the reputation value of each distributed node in the target network, and determine the optimal route of network resources in the target network based on the reputation value; step 13: obtain the transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete the blockchain consensus with blocks. This embodiment of the invention uses the node reputation value of the blockchain to determine the optimal route, optimizes the network resources in the target network, improves the utilization efficiency of network resources, and completes the blockchain consensus by using the transaction resource information in the optimal route in the form of blocks, reaching a consistent protocol among the distributed nodes in the network, and realizing the rapid implementation of the optimal route.

[0112] In some embodiments, the reputation value of each distributed node in the target network is evaluated, including:

[0113] Assign an initial reputation value to each distributed node in the target network, and update the reputation value of each distributed node every preset time period based on the transaction behavior of the distributed nodes in the target network within that time period.

[0114] It should be noted that the preset time period can be set by the user according to actual needs, and this invention does not limit it.

[0115] In some specific embodiments, an initial reputation value is assigned to each distributed node in the target network. Every preset time period, the reputation value of each distributed node is updated based on its transaction behavior within that time period. This includes: distributed nodes that have completed identity authentication (i.e., distributed nodes with legitimate identities in the target network) can participate in the blockchain ledger sharing and are assigned an initial node reputation value Tv. init The reputation value of a node is updated based on its behavior during the transaction. A higher reputation value generally indicates greater security; therefore, choosing a node with a high reputation value for backhauling is considered safer. Nodes that complete resource transactions update their reputation value, i.e., their TV value. s+1 =Tvs +Δ. Where, Tv s This represents the current node's reputation value, Tv s+1 This represents the updated node reputation value, where Δ is a fixed value (which can be preset by the user according to actual needs). A node's reputation value is related to its contribution to the network; the more resource transactions it successfully completes, the higher its reputation value. In addition to the reward mechanism for node reputation value, there is also a penalty mechanism for malicious behavior, adopting the principle of "slow rise, fast fall," meaning that when a node engages in malicious behavior, its reputation value is rapidly reduced. s+1 =Tv s -2Δ quickly removes malicious nodes from the candidate nodes. Therefore, using reputation values ​​to assist routing can better improve communication security.

[0116] In some embodiments, determining the optimal route for network resources in the target network based on reputation values ​​includes:

[0117] Perform network topology analysis on the target network to obtain multiple candidate routing links;

[0118] Calculate the cost of each candidate route link based on the reputation score and the transmission rate of each candidate route link;

[0119] The shortest path algorithm is used to determine the candidate route link with the lowest cost as the optimal route.

[0120] In some embodiments, the target network is subjected to network topology analysis to obtain multiple candidate routing links. Specifically, this may include: abstracting the target network as an undirected connected graph G = (V, E) through network topology, where V refers to the set containing all nodes (routers) in the graph, and E refers to the set containing all edges (links) in the graph (i.e., multiple candidate routing links).

[0121] The cost of each candidate route link is calculated based on the reputation score and the transmission rate of each candidate route link. Specifically, for any edge l∈E in the graph (i.e., any candidate route link in the undirected connected graph G=(V,E)), the cost of that edge is represented by cost(l). The cost can be attributes such as bandwidth and delay.

[0122] Then, the shortest path algorithm is used to determine the candidate route link with the minimum cost as the optimal route. The shortest path algorithm can find a path from the source node to the destination node with the minimum cost in the network.

[0123] Shortest path algorithms are a class of algorithms used to find the shortest path between two nodes in a graph. These algorithms have wide applications in computer science, network routing, geographic information systems, and other fields.

[0124] In some embodiments, the shortest path algorithm may include at least one of the following algorithms: Dijkstra's algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm, A* algorithm, and BFS (Breadth-First Search) algorithm.

[0125] In some embodiments, Dijkstra's algorithm is used to determine the candidate route link with the lowest cost as the optimal route.

[0126] In this embodiment of the invention, determining the optimal route for network resources in a target network based on reputation values ​​includes: performing network topology analysis on the target network to obtain multiple candidate routing links; calculating the cost of each candidate routing link based on the reputation value and the transmission rate of each candidate routing link; and using a shortest path algorithm to determine the candidate routing link with the lowest cost as the optimal route. This embodiment of the invention can accurately determine the optimal route and improve resource utilization efficiency.

[0127] This invention provides a network resource management method, applied to the network architecture described in any one of the embodiments of this invention. See also... Figure 7 As shown, Figure 7 This is a schematic diagram of a network resource management device according to an embodiment of the present invention. The network resource management device 70 includes:

[0128] The verification module 71 is used to verify whether there are idle resources in the target network and obtain the verification result;

[0129] The execution module 72 is configured to, if the test result indicates that there are idle resources in the target network, evaluate the reputation value of each of the distributed nodes in the target network, and determine the optimal route for network resources in the target network based on the reputation value;

[0130] The consensus module 73 is used to obtain the transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete the blockchain consensus with the blocks.

[0131] In some embodiments, the execution module 72 is further configured to assign an initial reputation value to each of the distributed nodes in the target network, and update the reputation value of each distributed node according to the transaction behavior of the distributed nodes in the target network during the preset time period.

[0132] In some embodiments, the execution module 72 is further configured to perform network topology analysis on the target network to obtain multiple candidate routing links;

[0133] The execution module 72 is further configured to calculate the cost of each candidate route link based on the reputation value and the transmission rate of each candidate route link;

[0134] The execution module 72 is further configured to use a shortest path algorithm to determine the candidate route link with the lowest cost as the optimal route.

[0135] The network resource management device provided in this embodiment of the invention can implement all the processes implemented in the method embodiment of the invention and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0136] This invention provides an electronic device 80, see [link to relevant documentation]. Figure 8 As shown, Figure 8 This is a schematic block diagram of an electronic device 80 according to an embodiment of the present invention, including a processor 81, a memory 82, and a program or instructions stored in the memory 82 and executable on the processor 81. When the program or instructions are executed by the processor, they implement the steps in any of the network resource management methods of the present invention.

[0137] This invention provides a readable storage medium on which a program or instruction is stored. When the program or instruction is executed by a processor, it implements the various processes of the network resource management method embodiment as described above and achieves the same technical effect. To avoid repetition, it will not be described again here.

[0138] The readable storage medium may include, for example, read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk. In some examples, the readable storage medium may be a non-transient readable storage medium.

[0139] This invention also provides a computer program product, including computer instructions. When the computer instructions are executed by a processor, they implement the various processes of any of the above-described network resource management method embodiments and achieve the same technical effect. To avoid repetition, they will not be described again here.

[0140] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0141] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of the present invention.

[0142] The embodiments of the present invention have been described above with reference to the accompanying drawings. However, the present invention is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of the present invention without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of the present invention.

Claims

1. A network architecture, characterized in that, include: The master node of the integrated IAB network for accessing backhaul is used to connect to the core network via a wired backhaul link; The IAB network has multiple distributed nodes; The resource management platform is used to authenticate the legitimate identities of each distributed node using blockchain technology, and instructs the master node to connect with the legitimate distributed nodes through a wireless backhaul link to form a target network.

2. The network architecture according to claim 1, characterized in that, The master node has an array antenna; The array antenna is used to establish the wireless backhaul link with the distributed nodes; The array antenna is also used to improve the signal transmission power to the legitimate distributed nodes by employing beamforming.

3. The network architecture according to claim 2, characterized in that, The resource management platform is also used to optimize and adjust the spectrum resources of the backhaul links allocated to the distributed nodes with legitimate identities by the master node. The objective function of the optimization and adjustment is determined based on the access rate and backhaul rate between the master node and the distributed nodes with legitimate identities.

4. A network resource management method, characterized in that, Applied to the network architecture as described in any one of claims 1 to 3, comprising: The test results are obtained by checking whether there are any idle resources in the target network. If the test result indicates that there are idle network resources in the target network, the reputation value of each distributed node in the target network is evaluated, and the optimal route for the network resources in the target network is determined based on the reputation value. Obtain transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete blockchain consensus using the blocks.

5. The network resource management method according to claim 4, characterized in that, Evaluating the reputation value of each of the distributed nodes in the target network includes: An initial reputation value is assigned to each of the distributed nodes in the target network. Every preset time period, the reputation value of each distributed node is updated based on the transaction behavior of the distributed nodes in the target network during the time period.

6. The network resource management method according to claim 5, characterized in that, Determining the optimal route for network resources in the target network based on the reputation value includes: Perform network topology analysis on the target network to obtain multiple candidate routing links; The cost of each candidate route link is calculated based on the reputation value and the transmission rate of each candidate route link. The shortest path algorithm is used to determine the candidate route link with the lowest cost as the optimal route.

7. A network resource management device, characterized in that, Applied to the network architecture as described in any one of claims 1 to 3, comprising: The verification module is used to verify whether there are idle resources in the target network and obtain the verification result; An execution module is configured to, if the test result indicates that there are idle resources in the target network, evaluate the reputation value of each of the distributed nodes in the target network, and determine the optimal route for network resources in the target network based on the reputation value; The consensus module is used to obtain transaction resource information of each link node on the optimal route, package the transaction resource information into blocks, and complete the blockchain consensus with the blocks.

8. An electronic device, characterized in that: It includes a processor, a memory, and a program or instructions stored in the memory and executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the network resource management method as described in any one of claims 4 to 6.

9. A readable storage medium, characterized in that: The readable storage medium stores a program or instructions that, when executed by a processor, implement the steps of the network resource management method as described in any one of claims 4 to 6.

10. A computer program product, characterized in that, It includes computer instructions that, when executed by a processor, implement the steps of the network resource management method as described in any one of claims 4 to 6.

Images