Method for slicing wapi power local wireless network based on qos requirement
By constructing a network slicing model with directed graphs and traffic and latency matrices, the problem of service optimization and security control of WAPI power local wireless network under QoS requirements was solved, realizing the optimal utilization of network resources and terminal security control.
Patent Information
- Application Number
- CN202510106959.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-01-23
- Publication Date
- 2026-02-10
- Estimated Expiration
- 2045-01-23
AI Technical Summary
The existing WAPI power local wireless network's network slicing technology, under QoS requirements, struggles to achieve tiered optimization control of power communication services and lacks flexible security control measures.
By constructing a directed graph, a traffic matrix, and a latency matrix, a network slicing model is built. The network slices are then solved using the traffic and latency matrices of the target application scenario, optimizing network resource utilization and achieving security control and QoS requirements for terminals.
It achieves optimal utilization of network resources, meets dynamic user needs, improves network resource utilization, and enables security control of terminals through network slicing, ensuring the security of different services and terminal services.
Smart Images
Figure QLYQS_1 
Figure QLYQS_7 
Figure QLYQS_8
Abstract
Description
TECHNICAL FIELD
[0001] The application belongs to the technical field of power network, and particularly relates to a slicing method of a WAPI power local wireless network based on QoS requirements. BACKGROUND
[0002] WAPI (WLAN Authentication and Privacy Infrastructure, wireless local area network authentication and privacy infrastructure) is a wireless local area network security standard. Unlike the one-way encryption authentication of the traditional Wi-Fi, the WAPI adopts two-way encryption authentication, which can provide more reliable and all-round security than the Wi-Fi. In recent years, the WAPI has been widely applied in the power industry.
[0003] In the WAPI power local wireless network, the network slicing technology can be used to control the security of the accessed terminal. In order to realize the QoS (Quality of Service, service quality) optimization control of the power communication service in different levels, a network slicing technology based on QoS requirements is needed. SUMMARY
[0004] The application provides a slicing method of a WAPI power local wireless network based on QoS requirements.
[0005] To solve one or part or all of the above technical problems, the technical solution adopted by the application is as follows:
[0006] A slicing method of a WAPI power local wireless network based on QoS requirements comprises the following steps: constructing a directed graph according to the network topology of the WAPI power local wireless network; constructing a traffic matrix and a delay matrix of different application scenarios according to the QoS application scenarios; constructing a network slicing model; selecting a target application scenario and the traffic matrix and the delay matrix of the target application scenario in turn according to the priority order of the application scenarios; and solving the network slicing model by using the traffic matrix and the delay matrix of the target application scenario, and performing network slicing for the target application scenario.
[0007] Further, the directed graph is represented as V is a node set, representing the set of all forwarding nodes in the network topology; E is an edge set, representing all links in the network topology, and each edge is a four-tuple containing the two end points of the link, the available bandwidth of the link and the transmission delay of the link.
[0008] Further, the traffic matrix of the kth application scenario is represented as where n represents the number of sink nodes in the network topology, a total bandwidth requirement of the aggregation flow from the edge aggregation source node i to the edge aggregation destination node j in the application scenario k.
[0009] Further, the delay matrix of the kth application scenario is represented as , wherein n represents the number of aggregation nodes in the network topology, a total delay requirement of the aggregation flow from the edge aggregation source node i to the edge aggregation destination node j in the application scenario k.
[0010] Further, the objective function of the network slice model is represented as , The constraint conditions of the network slice model include delay constraint, capacity constraint, flow conservation constraint and requirement constraint. is represented as an edge of the directed graph, k is the number of aggregation flows, and the aggregation flow i is represented as , wherein and are the source point and the sink point of the aggregation flow i, is the data volume; is the flow of the aggregation flow i on the edge , is the unit cost of the flow.
[0011] Further, the delay constraint is represented as , and d is the delay threshold of the application scenario q.
[0012] Further, the capacity constraint is represented as .
[0013] Further, the flow conservation constraint is represented as , .
[0014] Further, the requirement constraint is represented as .
[0015] Compared with the prior art, the present application has the following advantages:
[0016] The present application performs network slicing on the WAPI power local wireless network, customizes and cuts the network through service scenario requirements, and realizes flexible network element networking, optimizes service processes and data routing, so that the utilization of network resources is optimized. The network slicing can meet the dynamic requirements of users, so that the network has the ability of dynamically allocating resources, thereby improving the utilization rate of network resources.
[0017] The network slice can also achieve security control of the terminal. When an exception occurs, the corresponding slice is blocked to protect other service slices from being affected. Different slices can deploy different network QoS, network functions and security services, isolate the resources of different terminals on the network, and better guarantee the security of different services and the security of terminal services through access control. DETAILED DESCRIPTION
[0018] For a better understanding of the present application, the following further clearly sets forth the content of the present application in conjunction with the embodiments, but the protection scope of the present application is not limited to the following embodiments. In the following description, a large number of specific details are given in order to provide a more thorough understanding of the present application. However, it is obvious to those skilled in the art that the present application can be implemented without one or more of these details.
[0019] Embodiment 1: The purpose of this embodiment is to provide a slicing method of WAPI power local wireless network based on QoS demand.
[0020] S1, a directed graph is constructed according to the network topology of the WAPI power local wireless network.
[0021] The directed graph of the network topology is represented as , V is a node set, representing the set of all forwarding nodes in the network topology; E is an edge set, representing all links in the network topology, and each edge is a four-tuple containing the two endpoints of the link, the available bandwidth of the link and the transmission delay.
[0022] S2, traffic matrices and delay matrices of different application scenarios are constructed according to QoS application scenarios.
[0023] The traffic matrix of the kth application scenario is represented as , where n represents the number of sink nodes in the network topology, representing the total bandwidth demand of the converged traffic from the edge sink source node i to the edge sink destination node j in the application scenario k. It is obtained through analysis of historical traffic.
[0024] The delay matrix of the kth application scenario is represented as , where n represents the number of sink nodes in the network topology, representing the total delay demand of the converged traffic from the edge sink source node i to the edge sink destination node j in the application scenario k. It is obtained through analysis of historical traffic.
[0025] The transmission delay of the link is only considered when defining the delay matrix, and the forwarding delay of the network device is ignored, because the reserved resources can meet the bandwidth requirement of the converged traffic, and the message does not need to be stored for a long time, so the forwarding delay can be ignored.
[0026] S3, constructing a network slice model.
[0027] The network slice representation of different scenarios is a virtual network that can provide QoS guarantee services for the application scenario, which is composed of a series of specific paths and reserved bandwidth resources on path nodes.
[0028] The network slice model is used to construct N slices to meet the QoS requirements of all application scenarios by calculating the path and reserving resources according to the given directed graph and the traffic matrix and delay matrix of each application scenario.
[0029] For the directed graph , each edge of it has a non-negative real number capacity , for the edge , . If there are k converged flows , , where and are the source point and sink point of the converged flow i, and is the data volume. The traffic of the converged flow i on the edge is represented as , and the unit cost of the traffic is represented as .
[0030] The objective function of the network slice model is to minimize the transmission cost, and the objective function is represented as , .
[0031] The constraint conditions of the network slice model include delay constraint, capacity constraint, flow conservation constraint and demand constraint.
[0032] The delay constraint is represented as , and d is the delay threshold of the application scenario q;
[0033] The capacity constraint is represented as ;
[0034] The flow conservation constraint is represented as , ;
[0035] The demand constraint is represented as .
[0036] S4. Select the target application scenario and its traffic matrix and latency matrix in order of priority according to the application scenario.
[0037] For n QoS application scenarios, the corresponding traffic matrices are as follows: The corresponding time delay matrices are respectively .
[0038] Based on the priority of application scenarios, select the application scenarios and their corresponding traffic and latency matrices in sequence.
[0039] S5. Solve the network slicing model using the traffic matrix and latency matrix of the target application scenario, and perform network slicing for the target application scenario.
[0040] Substitute the traffic matrix and latency matrix of the target application scenario into the network slicing model, solve the network slicing model, and obtain... Obtain the i-th converging flow in the traffic matrix along the path. The bandwidth resources allocated to the corresponding nodes are then used. Finally, network slices are formed based on the solutions corresponding to all converged traffic in the traffic matrix and delay matrix.
[0041] After slicing the target application scenario, the resources on each node will be reduced accordingly, for example, by updating the edges. Available traffic is .
[0042] S6. After all application scenarios have been network sliced, output the network slicing results for all application scenarios.
[0043] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Any other modifications or equivalent substitutions made by those skilled in the art to the technical solutions of the present invention, as long as they do not depart from the spirit and scope of the technical solutions of the present invention, should be covered within the scope of the claims of the present invention.
Claims
1. A slicing method for WAPI power local wireless networks based on QoS requirements, characterized in that, include: Construct a directed graph based on the network topology of the WAPI power local wireless network; Construct traffic and latency matrices for different application scenarios based on QoS application scenarios; Construct a network slicing model; Select the target application scenarios and their traffic and latency matrices in order of priority. The network slicing model is solved using the traffic matrix and latency matrix of the target application scenario, and network slicing is performed for the target application scenario. The directed graph is represented as G(V,E), where V is the set of nodes, representing the set of all forwarding nodes in the network topology; E is the set of edges, representing all links in the network topology. Each edge is a quadruple, containing the two endpoints of the link, the available bandwidth of the link, and the transmission delay. The objective function of the network slicing model is expressed as min(C). The constraints of the network slicing model include latency constraints, capacity constraints, flow conservation constraints, and demand constraints; (u,v) represents the edge of the directed graph, (u,v)∈E; h is the number of convergence flows, and convergence flow i is represented as... ,in and It is the source and sink of the converging flow i. It refers to the amount of data. Let a(u,v) be the flow of converged flow i on edge (u,v), and let a(u,v) be the unit cost of the flow. The time delay constraint is expressed as: d is the latency threshold for application scenario q; The capacity constraint is expressed as: c(u,v) is the capacity of edge (u,v); The flow conservation constraint is expressed as: , ; The requirement constraint is expressed as: .
2. The slicing method for WAPI power local wireless networks based on QoS requirements according to claim 1, characterized in that, The traffic matrix for the k-th application scenario is represented as follows: Where n represents the number of convergence nodes in the network topology. This represents the total bandwidth requirement for the converged traffic from edge convergence source node i to edge convergence destination node j in application scenario k.
3. The slicing method for WAPI power local wireless networks based on QoS requirements according to claim 2, characterized in that, The delay matrix for the k-th application scenario is represented as follows: Where n represents the number of convergence nodes in the network topology. This represents the total latency requirement for the converged traffic from edge convergence source node i to edge convergence destination node j in application scenario k.