A virtual power plant mass communication terminal packet access optimization method and system

Abstract

This invention discloses a method and system for optimizing the grouped access of massive communication terminals in a virtual power plant, belonging to the field of power grid communication technology. The method includes calculating the preference value of each communication terminal for each communication access group, and having the communication terminal join the communication access group with the highest preference value; calculating the contribution value of each communication terminal to other communication access groups, and if the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, then the communication terminal leaves the current communication access group and joins a communication access group with a higher contribution; iterating through the communication access groups and continuously changing communication access groups until no communication terminal changes communication access groups; and issuing scheduling data packets based on the finally established communication access groups. This invention uses grouped access to solve the preamble selection conflict problem when a large number of terminals access the network.

Description

Technical Field

[0001] This invention belongs to the field of power grid communication technology, specifically relating to a method and architecture for optimizing the group access of massive communication terminals in a virtual power plant. Background Technology

[0002] Building a new power system with renewable energy as its core is a crucial step towards achieving the goals of "carbon peaking and carbon neutrality." Compared to microgrids and active distribution networks, virtual power plants can effectively address the scheduling and control difficulties arising from differences in geographical location, operating characteristics, and response speed among various types of distributed resources, providing high-quality and flexible regulation resources for the power system. Considering the complex social attributes of distributed resources and the widespread distribution, mature construction, and flexible access of public communication networks, most distributed resources currently upload their operating conditions and environmental parameters to virtual power plants via public communication networks for optimization of grid control decisions.

[0003] With the development of new power systems, the amount of information generated by virtual power plants is growing explosively. Traditional public communication networks designed for H2H (Human to Human) communication can no longer meet the needs of large-scale communication terminals in virtual power plants for effective and random access, resulting in a low success rate of communication access. This leads to problems such as untimely information processing, difficulty in centralized computing, and reduced efficiency of power grid regulation and optimization, affecting the smooth operation of virtual power plant demand response and other services.

[0004] Existing technologies provide a distributed source-load-storage resource communication access method based on random grouping. This method analyzes the problem of low access success rate for large-scale terminals and proposes a hierarchical access method for large-scale devices. This includes: determining the number of groups that maximizes the access success rate and grouping distributed terminals using k-means clustering; selecting a sink node to access the base station based on the optimal communication distance according to the grouping results, ensuring that multiple access processes can be completed simultaneously in a single time slot. However, this method only considers the shortest communication distance and does not optimize the selection of the sink node. Therefore, inappropriate communication access still leads to a decrease in the overall transmission performance of the system, thus affecting the communication rate and access success rate. Summary of the Invention

[0005] To address the problems existing in the prior art, this invention provides a method and architecture for optimizing packet access for massive communication terminals in a virtual power plant. This invention utilizes packet access to resolve the preamble selection conflict problem when a large number of terminals access the system.

[0006] To achieve the above objectives, the present invention employs the following technical solution:

[0007] A hierarchical packet access communication method for a virtual power plant communication terminal, characterized in that it includes:

[0008] Calculate the preference value of each communication terminal for each communication access group; under the condition that the distance range between the communication terminal and the aggregation node is satisfied, sort each communication access group according to the preference value, and the communication terminal joins the communication access group with the largest preference value according to the sorting, until the communication access group initialization is completed;

[0009] Once all communication access groups in this time slot are temporarily established, the contribution value of the current communication terminal to other communication access groups is calculated. If the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, the communication terminal leaves the current communication access group and joins the communication access group with a larger contribution value. The communication terminals in each communication access group are traversed and the communication access groups are continuously changed until no communication terminal changes the communication access group.

[0010] Based on the final established communication access group, a scheduling data packet is issued. After the scheduling data packet is issued, the communication access group established in this time slot is disbanded, and communication access in the next time slot is initiated.

[0011] As a further improvement of the present invention, the calculation of the preference value of each communication terminal for each communication access group includes:

[0012] The success rate of the communication terminal accessing the corresponding communication access group aggregation node is used as the preference value, and the calculation method is as follows:

[0013]

[0014] Among them, a k (t) represents the sink node n k The number of communication terminals requesting access within a time slot in the corresponding group; A k Represents the convergence node n k The maximum number of communication terminals allowed to access communication within a time slot; ξ is the resource ratio allocated by the aggregation node to each allowed communication terminal.

[0015] As a further improvement of the present invention, the communication terminal s m With the convergence node n k The distance range d between m,k The following relationship should be satisfied:

[0016]

[0017] In the formula, P m Indicates communication terminal s m The signal transmission power, E is a constant, W m,k N m,k V m,k They represent communication terminals s respectively mWith the convergence node n k The channel bandwidth, noise interference, and electromagnetic interference between them are considered, with σ representing the lower limit of the signal-to-noise ratio.

[0018] As a further improvement of the present invention, the calculation of the current communication terminal s m Contribution value to other communication access groups include:

[0019]

[0020] in, Indicates terminal s m Join the communication access group For the t-th time slot, there is a communication access group consisting of one aggregation node and multiple communication terminals. The utility function is expressed by the following equation:

[0021]

[0022] in, for The number of terminals in the middle; R m,c (t) represents the communication terminal s in the t-th time slot. m The transmission rate between the 5G base station c and the 5G base station c; γ is the weighting coefficient; S m,k (t) represents the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access to 5G base stations;

[0023]

[0024] The communication terminal s in the t-th time slot m The contention packet for communication access is defined as Game. t (Φ t ,V), where Φ t Describes the set of communication terminals participating in the competition, satisfying V represents the value of the communication access group.

[0025] As a further improvement of the present invention, after calculating the contribution value of the current communication terminal to other communication access groups, if the contribution value is less than a set threshold or does not meet the distance range between the communication terminal and the aggregation node, the terminal remains in the current communication access group and a scheduling data packet is issued according to the current communication access group.

[0026] A hierarchical packet access communication system for virtual power plant communication terminals includes:

[0027] The virtual power plant layer includes the aggregation and control edge gateway;

[0028] The access layer, which includes 5G base stations;

[0029] The aggregation layer consists of K communication aggregation nodes, which upload the communication access data to the aggregation and control edge gateway via the base station.

[0030] The perception layer includes M distributed source-load-storage resources, each of which connects to the communication aggregation node through its communication terminal.

[0031] The virtual power plant layer adaptively optimizes the communication access group by using a group access method based on the group access decision of each communication terminal, the distance between the communication terminal and the aggregation node, and the distance between the communication terminal and the base station, and issues scheduling data packets according to the finally established communication access group.

[0032] As a further improvement of the present invention, the adaptive optimization of communication access groups using packet access is, under the constraint of the carrying capacity of the aggregation node, to maximize the average communication access success rate S of all communication terminals in the system by optimizing the packet selection variable. c () and average transmission rate R c The weighted sum of (t) is modeled as follows:

[0033]

[0034]

[0035]

[0036] Where γ is the weighting coefficient; C1 is the packet access constraint, indicating that each communication terminal can only access the aggregation control edge gateway through one aggregation node; C2 indicates that the number of communication terminals accessing each aggregation node cannot exceed its maximum threshold A. k .

[0037] As a further improvement of the present invention, the average communication access success rate S of all communication terminals c The model is:

[0038]

[0039] Where K represents the total number of aggregation nodes; x m,k (t) represents the sensing terminal s m The sink node selects a binary variable, where x m,k (t) = 1 indicates that s m Selecting the sink node n in the t-th time slot k Communication access is required; otherwise, x m,k(t) = 0; M is the number of distributed source-load-storage resource communication terminals, S m,k (t) represents the communication terminal s m For the convergence node n k The preference value corresponding to the communication access group, that is, the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k The success rate of access to 5G base stations is calculated using the following formula:

[0040]

[0041] Where ξ is the proportion of resources allocated by the aggregation node to each communication terminal allowed to access communication, and is a constant; A k Represents the convergence node n k The maximum number of sensor terminals allowed to access communication within a time slot; a k (t) represents the sink node n k The number of sensor terminals requesting access within a time slot in the group;

[0042] S m,k (t) represents the communication terminal s m With the convergence node n k The success rate of connection between them is calculated using the following formula:

[0043]

[0044] Among them, a k (t) represents the sink node n k The number of communication terminals requesting access within a time slot in the corresponding group; A k Represents the convergence node n k The maximum number of communication terminals allowed to access communication within a time slot; ξ is the resource ratio allocated by the aggregation node to each allowed communication terminal.

[0045] As a further improvement of the present invention, the average transmission rate R of all communication terminals c The (t) model is:

[0046]

[0047] Where, x m,k (t) represents the sensing terminal s m The sink node selects a binary variable, where x m,k (t) = 1 indicates that s m Selecting the sink node n in the t-th time slot k Communication access is required; otherwise, x m,k (t)=0;Sm,k (t) represents the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access between the network and 5G base stations; M represents the number of distributed source-load-storage resource communication terminals; R m,c (t) represents the communication terminal s in the t-th time slot. m The transmission rate between the 5G base station c and the 5G base station c is as follows:

[0048] R m,c (t)=W m,c log2[1+γ m,c (t)];

[0049] Among them, W m,c Indicates communication terminal s m The transmission bandwidth between γ and 5G base station c m,c (t) Communication terminal s m The signal-to-noise ratio between the 5G base station and the c-type 5G base station.

[0050] As a further improvement of the present invention, the adaptive optimization of communication access groups using the packet access method is to optimize the communication access decision of distributed source-load-storage resources by using a competitive packet method. The optimization method includes:

[0051] In the t-th time slot, a convergence node and multiple communication terminals form a communication access group, denoted as . The utility function is expressed by the following equation:

[0052]

[0053] in, for The number of terminals in the middle; R m,c (t) represents the communication terminal s in the t-th time slot. m The transmission rate between the 5G base station c and the 5G base station c; γ is the weighting coefficient; S m,k (t) represents the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access to 5G base stations;

[0054] Each communication terminal, acting as a player, tends to join a communication access group to increase its success rate in accessing the network; the competitive group for communication access by communication terminals in the t-th time slot is defined as Game. t (Φ t ,V), where Φ tDescribes the set of communication terminals participating in the competition, satisfying Indicates communication access group The value is defined as:

[0055]

[0056] Whether a communication terminal is allowed to join a communication access group depends on the contribution of the communication terminal to the value of the communication access group. In the contention group for communication access to distributed source-load-storage resources in the t-th time slot, terminal s... m Benefits Defined as its contribution to the value of the communication access group, it is calculated as follows:

[0057]

[0058] in, Indicates terminal s m Join the communication access group

[0059] A hierarchical packet access communication device for a virtual power plant communication terminal, comprising:

[0060] The initialization module calculates the preference value of each communication terminal for each communication access group; under the condition that the distance range between the communication terminal and the aggregation node is satisfied, it sorts each communication access group according to the preference value, and the communication terminal joins the communication access group with the largest preference value according to the sorting, until the communication access group initialization is completed;

[0061] The communication access module is used to calculate the contribution value of the current communication terminal to other communication access groups after all communication access groups in the current time slot are temporarily established. If the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, the communication terminal leaves the current communication access group and joins the communication access group with a larger contribution value. The module iterates through the communication terminals in each communication access group and continuously changes communication access groups until no communication terminal changes communication access groups.

[0062] The data packet delivery module delivers scheduled data packets based on the final established communication access group. After the scheduled data packets are delivered, the communication access group established in this time slot is disbanded, and communication access is performed in the next time slot.

[0063] An electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the hierarchical packet access communication method for a virtual power plant communication terminal.

[0064] A computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the hierarchical grouping access communication method for a virtual power plant communication terminal.

[0065] Compared with the prior art, the present invention has the following beneficial effects:

[0066] This invention proposes a virtual power plant communication access method based on competitive grouping. This method can fully consider the mutual coupling characteristics of access decisions of each terminal group, the distance combination characteristics between the terminal and the aggregation node and between the terminal and the base station, avoid massive communication terminals accessing the same group at the same time, reduce the failure of communication terminals with good channel status with the base station to access, realize the adaptive adjustment of massive communication terminal groups, improve the access success rate and improve the system transmission rate performance.

[0067] This invention proposes a hierarchical packet communication access architecture for virtual power plants, which uses packet access to solve the preamble selection conflict problem when a large number of terminals access the network. Attached Figure Description

[0068] Figure 1 This is a diagram of the hierarchical packet access communication system architecture for a virtual power plant communication terminal, as provided in this invention.

[0069] Figure 2 This is a flowchart of the communication access group formation algorithm provided in an embodiment of the present invention;

[0070] Figure 3 This is a comparison of the access success rate as the number of access requests changes, as presented in an embodiment of the present invention.

[0071] Figure 4 This is a comparison chart showing how the average transmission rate changes with the number of access requests, as provided in an embodiment of the present invention.

[0072] Figure 5 This is a schematic diagram of the hierarchical grouping access communication device for the virtual power plant communication terminal provided by the present invention;

[0073] Figure 6 This is a schematic diagram of an electronic device provided by the present invention. Detailed Implementation

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

[0075] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0076] Packet access technology reduces the probability of terminals competing for the same preamble in a unified random access assembly by assigning communication terminals requesting access at the same time to different groups. Within each group, a aggregation node assists the communication terminals in accessing the base station, thereby improving the access success rate of massive communication terminals. However, existing packet access technology still faces the following challenges.

[0077] On the one hand, to ensure signal quality of data transmission, the signal-to-noise ratio (SNR) of the data link between the communication terminal and the aggregation node must be within a certain range. However, since communication terminals are subject to channel interference from other communication terminals in the same group, each communication terminal needs to consider not only the spatial distance combination characteristics between itself and the aggregation node when optimizing packet access decisions, but also the coupling characteristics between the packet access strategies of different terminals. On the other hand, packet access optimization not only needs to maximize the communication terminal access success rate, but also improve the system transmission rate performance. However, there is a complex relationship between terminal access success rate and system transmission rate. With a fixed aggregation node, the terminal access success rate mainly depends on the distance combination characteristics between the communication terminal and the aggregation node, while the system transmission rate is related not only to the terminal access success rate, but also to the distance combination characteristics between the communication terminal and the base station. How to simultaneously improve the terminal access success rate and system transmission rate performance by optimizing the packet access scheme is the key challenge currently faced.

[0078] Traditional packet access methods use random grouping, without considering the carrying capacity of the aggregation node and the impact of communication distance. When a large number of communication terminals initiate access requests, it is impossible to reasonably select an appropriate aggregation node for communication access, causing network congestion. This leads to higher latency for latency-sensitive devices and a lower success rate of communication access for communication terminals, seriously affecting the information transmission performance of the network.

[0079] To achieve effective access for a massive number of communication terminals in a virtual power plant, combined with Figure 1This invention proposes a hierarchical packet access communication system for virtual power plant communication terminals, comprising:

[0080] The virtual power plant layer includes the aggregation and control edge gateway;

[0081] The access layer, which includes 5G base stations;

[0082] The aggregation layer consists of K communication aggregation nodes, which upload the communication access data to the aggregation and control edge gateway via the base station.

[0083] The perception layer includes M distributed source-load-storage resources, each of which connects to the communication aggregation node through its communication terminal.

[0084] The virtual power plant layer adaptively optimizes the communication access group by using a group access method based on the group access decision of each communication terminal, the distance between the communication terminal and the aggregation node, and the distance between the communication terminal and the base station, and issues scheduling data packets according to the finally established communication access group.

[0085] This invention takes maximizing the weighted sum of average communication access success rate and average transmission rate as the optimization objective, and proposes a virtual power plant communication access optimization method based on competitive packet processing. This method fully considers the mutual coupling characteristics of access decisions for each communication terminal, the distance combination characteristics between the communication terminal and the aggregation node, and between the communication terminal and the base station, and performs adaptive optimization of access packets, achieving simultaneous optimization of system access success rate and transmission rate performance. The invention is described in detail below with reference to embodiments.

[0086] Example 1

[0087] This invention addresses the virtual power plant scenario by proposing a hierarchical packet access communication system for virtual power plant communication terminals. It utilizes packet access to solve the problem of low success rate for massive communication terminal access. Furthermore, it proposes a competition-based packet-based virtual power plant communication access optimization algorithm to optimize the packet access strategy and effectively improve the success rate of communication packet access and the system transmission rate performance. The technical solution proposed in this invention mainly includes the following three steps: 1) system model construction, 2) optimization problem modeling, and 3) competition-based packet-based virtual power plant communication access optimization.

[0088] Regarding system model construction, the specific contents include the following:

[0089] This invention considers the scenario of massive distributed source-load-storage resource communication terminal access in virtual power plants, and proposes a hierarchical grouping access architecture for massive communication terminals to meet the high adaptability requirements of massive terminal access.

[0090] The system architecture, from top to bottom, includes a virtual power plant layer, an access layer, an aggregation layer, and a sensing layer, such as... Figure 1As shown. The virtual power plant layer includes an aggregation and control edge gateway; the access layer consists of 5G base stations; the aggregation layer consists of K communication aggregation nodes, which upload the communication access data to the aggregation and control edge gateway via the base stations; the perception layer includes M distributed source-load-storage resources.

[0091] The sets of communication terminals and aggregation nodes are represented as S = {s1,...,s} m ,...,s M} and N = {n1,...,n k ,...,n K}, 5G base stations are represented as c.

[0092] This invention employs a quasi-static time-slot model, involving a communication access process with T equal-length time slots, denoted as T = {1,...,t,...,T}. Within each time slot, the communication terminal selects an appropriate aggregation node to access the base station. Binary variable x m,k (t) represents the communication terminal s m The selection of the aggregation node, where x m,k (t) = 1 indicates that s m Selecting the sink node n in the t-th time slot k Communication access is required; otherwise, x m,k (t) = 0. Grouping is determined based on the selection decision of the communication terminals. Specifically, communication terminals that select the same aggregation node are grouped together, for a total of K groups. The set of communication terminals in the k-th group is defined as D. k The connection success rate and system transmission rate model are shown below.

[0093] (1) Access success rate model

[0094] The signal reception quality between the aggregation node and the communication terminal has a significant impact on the successful access and data transmission of the communication terminal. Aggregation node n k Received from communication terminal s m The signal-to-noise ratio of the transmitted signal is:

[0095]

[0096] Among them, P m Indicates communication terminal s m The signal transmission power; G m,k (t), W m,k N m,k V m,k They represent communication terminals s respectively m With the convergence node n kThe signal-to-noise ratio (SNR) between two communication terminals within the same group is different from that between the aggregation node and the 5G base station. Inter-group interference from other communication terminals in the same group is a concern. This invention does not consider inter-group interference.

[0097] Communication terminal m With the convergence node n k Channel gain G between m,k for:

[0098]

[0099] Where, d m,k Indicates communication terminal s m With the convergence node n k The distance between them; α represents the path loss exponent, which is related to the transmission medium; E is a constant.

[0100] To ensure the signal reception quality of communication terminals, the signal-to-noise ratio should not be less than a certain range, i.e.

[0101] γ m,k (t)≥σ (3)

[0102] Where σ represents the lower limit of the signal-to-noise ratio.

[0103] Combining formulas (1)-(3), we can obtain the communication terminal s. m With the convergence node n k The distance d between m,k Should satisfy

[0104]

[0105] Among them, P m Indicates communication terminal s m The signal transmission power, E is a constant, W m,k N m,k V m,k They represent communication terminals s respectively m With the convergence node n k The signal-to-noise ratio (SNR) is influenced by factors such as channel bandwidth, noise interference, and electromagnetic interference. σ represents the lower limit of the SNR.

[0106] This invention constructs the access success rate between the communication terminal and the aggregation node as follows:

[0107]

[0108] Among them, a k (t) represents the sink node n k The number of communication terminals requesting access within a time slot in the corresponding group; A k Represents the convergence node nk The maximum number of communication terminals allowed to access communication within a time slot. Resource allocation within the group adopts a fixed allocation method, where the resource ratio ξ allocated by the aggregation node to each allowed communication terminal is a constant, applicable to all groups within the system.

[0109] Similarly, the access success rate between the aggregation node and the 5G base station is constructed as follows:

[0110]

[0111] Where ξ is the proportion of resources allocated by the aggregation node to each communication terminal allowed to access communication, and is a constant; A k Represents the convergence node n k The maximum number of sensor terminals allowed to access communication within a time slot; a k (t) represents the sink node n k The number of sensor terminals requesting access within a time slot in the group.

[0112] Therefore, the average access success rate of the entire system can be expressed as:

[0113]

[0114] Where K is the number of aggregation nodes; x m,k (t) represents the sensing terminal s m The sink node selects a binary variable, where x m,k (t) = 1 indicates that s m Selecting the sink node n in the t-th time slot k Communication access is required; otherwise, x m,k (t) = 0. M is the number of distributed source-load-storage resource communication terminals, S m,k (t) represents the communication terminal s m For the convergence node n k The preference value corresponding to the communication access group, that is, the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access to 5G base stations.

[0115] (2) System throughput model

[0116] This invention obtains the communication terminal s in the t-th time slot through the following method. m Transmission rate with 5G base station c:

[0117] R m,c (t)=W m,c log2[1+γ m,c (t)] (8)

[0118] Among them, W m,c Indicates communication terminal s m The transmission bandwidth between γ and 5G base station c m,c (t) Communication terminal s m The signal-to-noise ratio between the 5G base station and the c-type 5G base station.

[0119] Therefore, the average transmission rate of the system can be obtained as:

[0120]

[0121] Where M represents the number of distributed source-load-storage resource communication terminals; K represents the number of aggregation nodes;

[0122] x m,k (t) represents the sensing terminal s m The sink node selects a binary variable, where x m,k (t) = 1 indicates that s m Selecting the sink node n in the t-th time slot k Communication access is required; otherwise, x m,k (t)=0;S m,k (t) represents the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access to 5G base stations; R m,c (t) represents the communication terminal s in the t-th time slot. m The transmission rate between the 5G base station and the 5G base station c

[0123] Based on the above model, this invention also models the optimization problem, specifically including:

[0124] The optimization objective of this invention is to maximize the weighted sum of the average communication access success rate and average transmission rate of all communication terminals in the system by optimizing the group selection variable, under the constraint of the aggregation node's carrying capacity. The optimization problem can be modeled as follows:

[0125]

[0126] Where γ is the weighting coefficient; C1 is the packet access constraint, indicating that each communication terminal can only access the aggregation control edge gateway through one aggregation node; C2 indicates that the number of communication terminals accessing each aggregation node cannot exceed its maximum threshold A. k .

[0127] Based on the system model, the virtual power plant communication access optimization method based on contention packet processing includes the following:

[0128] This invention optimizes the communication access decision for distributed source-load-storage resources using a competitive grouping approach. In the t-th time slot, a communication access group is defined as one aggregation node and multiple communication terminals, denoted as […]. The utility function can be expressed by the following formula:

[0129]

[0130] in, for The number of terminals in the middle; R m,c (t) represents the communication terminal s in the t-th time slot. m The transmission rate between the 5G base station c and the 5G base station c; γ is the weighting coefficient; S m,k (t) represents the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access to 5G base stations.

[0131] Due to the inter-coupling nature of communication terminal decisions, the optimization problem can be formulated as a competitive grouping problem. Each terminal, as a player, tends to join a communication access group to increase the success rate of communication access while avoiding impacting the overall system transmission rate performance. This invention defines the competitive grouping for communication terminal access in the t-th time slot as Game. t (Φ t ,V), where Φ t Describes the set of communication terminals participating in the competition, satisfying Indicates communication access group The value is defined as

[0132]

[0133] Whether a terminal is allowed to join a communication access group depends on its contribution to the value of the communication access group. In the contention group for communication access to distributed source-load-storage resources in the t-th time slot, terminal s... m Benefits Defined as its contribution to the value of the communication access group, it is calculated as follows:

[0134]

[0135] in, Indicates terminal s m Join the communication access group

[0136] This invention also provides a hierarchical packet access communication method for a virtual power plant communication terminal, comprising:

[0137] Calculate the preference value of each communication terminal for each communication access group; under the condition that the distance range between the communication terminal and the aggregation node is satisfied, sort each communication access group according to the preference value, and the communication terminal joins the communication access group with the largest preference value according to the sorting, until the communication access group initialization is completed;

[0138] Once all communication access groups in this time slot are temporarily established, the contribution value of the current communication terminal to other communication access groups is calculated. If the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, the communication terminal leaves the current communication access group and joins the communication access group with a larger contribution value. The communication terminals in each communication access group are traversed and the communication access groups are continuously changed until no communication terminal changes the communication access group.

[0139] Based on the final established communication access group, a scheduling data packet is issued. After the scheduling data packet is issued, the communication access group established in this time slot is disbanded, and communication access in the next time slot is initiated.

[0140] This invention proposes a virtual power plant communication access method based on competitive grouping. It fully considers the mutual coupling characteristics of access decisions for each terminal group, the distance combination characteristics between the terminal and the aggregation node, and between the terminal and the base station. This avoids a massive number of communication terminals simultaneously accessing the same group and reduces access failures for communication terminals with good channel conditions with the base station. Specific details are illustrated in the embodiments.

[0141] Example 2

[0142] To address the aforementioned competition issue, this invention employs a communication access group formation method, the specific process of which is as follows: Figure 2 As shown, the steps are described below:

[0143] Step 1: Communication Access Group Initialization

[0144] According to formula (5), the preference value of each communication terminal for each communication access group is defined as the success rate of the communication terminal accessing the aggregation node of the communication access group. This is based on the condition that the communication terminal s satisfies formula (4). m With the convergence node n k Given the distance range between them, the communication terminal sorts each communication access group in descending order according to the preference value and joins the communication access group with the highest preference value.

[0145] Step 2: Establish a communication access group

[0146] After all communication access groups in this time slot are temporarily established, each communication terminal calculates its contribution to other communication access groups according to formula (13). And it satisfies the condition of communication terminal s in formula (4) m With the convergence node n kIf the distance between the specified ranges indicates that the communication terminal has left the current communication access group, then the communication terminal is considered to have left the current communication access group. And join the communication access group that contributes more. The communication terminals in each communication access group can continuously switch communication access groups according to the above method until no communication terminal switches communication access groups.

[0147] Step 3: Schedule and distribute data packets according to the final established communication access group. After the data packets have been distributed, disband the communication access group established in this time slot.

[0148] Step 4: Enter the next time slot and repeat the above operation.

[0149] The calculation of the preference value for each communication terminal to each communication access group is defined as the access success rate of the communication terminal accessing the aggregation node of the communication access group. The calculation method is as follows:

[0150]

[0151] Among them, a k (t) represents the sink node n k The number of communication terminals requesting access within a time slot in the corresponding group; A k Represents the convergence node n k The maximum number of communication terminals allowed to access communication within a time slot; ξ is the resource ratio allocated by the aggregation node to each allowed communication terminal, which is a constant.

[0152] As an optional solution, the present invention provides the distance range d between the communication terminal and the aggregation node. m,k The calculation method is as follows:

[0153]

[0154] In the formula, P m Indicates communication terminal s m The signal transmission power, E is a constant, W m,k N m,k V m,k They represent communication terminals s respectively m With the convergence node n k Channel bandwidth, noise interference, and electromagnetic interference.

[0155] As an optional approach, calculate the contribution of each communication terminal to other communication access groups:

[0156]

[0157] in, For the terminal s in the contention packet for communication access of distributed source-load-storage resources in the t-th time slot mContribution to the value of the communication access group; Indicates communication access group Value; Indicates terminal s m Join the communication access group For the communication access group consisting of the aggregation node and multiple communication terminals in the t-th time slot, The utility function is expressed by the following equation:

[0158]

[0159] in, for The number of terminals in the middle; R m,c (t) represents the communication terminal s in the t-th time slot. m The transmission rate between the 5G base station c and the 5G base station c; γ is the weighting coefficient; S m,k (t) represents the communication terminal s m With the convergence node n k Connection success rate between; S k,c (t) represents the pool node n k Success rate of access to 5G base stations.

[0160] Communication Access Group value It can be expressed by the following formula:

[0161]

[0162] The contention group for communication terminal access in the t-th time slot is defined as Game. t (Φ t ,V), where Φ t Describes the set of communication terminals participating in the competition, satisfying V represents the value of the communication access group.

[0163] As an optional approach, after calculating the contribution value of each communication terminal to other communication access groups, if the contribution value is less than a set threshold or does not meet the distance range between the communication terminal and the aggregation node, the terminal remains in the current communication access group, and scheduling data packets are issued according to the current communication access group. If the contribution value is greater than the set threshold and meets the distance range between the communication terminal and the aggregation node, the terminal leaves the current communication access group and joins a communication access group with a greater contribution. The communication terminals in each communication access group are continuously switched until no communication terminal switches to another communication access group.

[0164] This invention presents a simulation experiment on the proposed hierarchical packet access optimization method for massive distributed source-load-storage resource communication. The simulation results are as follows: Figure 3 As shown.

[0165] Figure 3 To compare the communication access success rate with the number of access requests under the assumption of 3 aggregation nodes, this invention selects the Random Packet-Based Communication Access Algorithm (RPCA) as the comparison algorithm. Simulation results show that as the number of communication terminals requesting access increases, the average access success rate of the proposed algorithm increases by 96.43% compared to the comparison algorithm, significantly increasing the reliability of practical applications. Compared with random packet access, the algorithm proposed in this invention fully considers the spatial distance combination characteristics between communication terminals and aggregation nodes, avoiding the situation where a large number of communication terminals choose the same packet for access, thereby improving the system access success rate.

[0166] Figure 4 To compare the average transmission rate as the number of access requests changes, this invention selects RPCA as the comparison algorithm. Simulation results show that the proposed algorithm improves the average transmission rate by 10.45% compared to the comparison algorithm. This is because the random grouping communication access algorithm uses the proximity principle for group access optimization. When the number of terminals is too large, the success rate of some group access decreases, thus reducing the average transmission rate. The algorithm proposed in this invention considers the mutual coupling characteristics of group selection among communication terminals, comprehensively considering the distance combination characteristics between communication terminals and the aggregation node, and between communication terminals and the base station. It uses a competitive grouping method to determine the group a node terminal belongs to by judging the benefit of joining the group, avoiding a large number of communication terminals accessing the same group simultaneously, reducing the failure of communication terminals with good channel conditions to access the base station, and achieving adaptive adjustment of massive communication terminal groups, improving the access success rate while improving the system transmission rate performance.

[0167] like Figure 5 As shown, the present invention provides a hierarchical packet access communication system for a virtual power plant communication terminal, comprising:

[0168] The initialization module calculates the preference value of each communication terminal for each communication access group; under the condition that the distance range between the communication terminal and the aggregation node is satisfied, it sorts each communication access group according to the preference value, and the communication terminal joins the communication access group with the largest preference value according to the sorting, until the communication access group initialization is completed;

[0169] The communication access module is used to calculate the contribution value of the current communication terminal to other communication access groups after all communication access groups in the current time slot are temporarily established. If the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, the communication terminal leaves the current communication access group and joins the communication access group with a larger contribution value. The module iterates through the communication terminals in each communication access group and continuously changes communication access groups until no communication terminal changes communication access groups.

[0170] The data packet delivery module delivers scheduled data packets based on the final established communication access group. After the scheduled data packets are delivered, the communication access group established in this time slot is disbanded, and communication access is performed in the next time slot.

[0171] like Figure 6 As shown, the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of the hierarchical packet access communication method for a virtual power plant communication terminal that takes into account the latency characteristics of multiple interactive functions.

[0172] The present invention also provides a computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, it implements the steps of the hierarchical grouping access communication method for virtual power plant communication terminals that takes into account the latency characteristics of multiple interactive functions.

[0173] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0174] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0175] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0176] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0177] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that modifications or equivalent substitutions can still be made to the specific implementation of the present invention. Any modifications or equivalent substitutions that do not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A hierarchical packet access communication method for a virtual power plant communication terminal, characterized in that, include: Calculate the preference value of each communication terminal for each communication access group; Under the condition that the distance range between the communication terminal and the aggregation node is met, each communication access group is sorted according to the preference value, and the communication terminal is added to the communication access group with the largest preference value according to the sorting, until the communication access group initialization is completed; Once all communication access groups in this time slot are temporarily established, the contribution value of the current communication terminal to other communication access groups is calculated. If the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, the communication terminal leaves the current communication access group and joins the communication access group with a larger contribution value. The communication terminals in each communication access group are traversed and the communication access groups are continuously changed until no communication terminal changes the communication access group. The scheduling data packet is issued according to the finally established communication access group. After the scheduling data packet is issued, the communication access group established in this time slot is disbanded. And then proceed with communication access in the next time slot; The calculation of the preference value of each communication terminal for each communication access group includes: The success rate of the communication terminal accessing the corresponding communication access group aggregation node is used as the preference value, and the calculation method is as follows: in, Indicates the aggregation node The number of communication terminals requesting access within a time slot in the corresponding group; Indicates the aggregation node The maximum number of communication terminals allowed to access communication within a time slot; The proportion of resources allocated to each communication terminal that is allowed to access the aggregation node; The calculation of the current communication terminal Contribution value to other communication access groups ,include: in, Indicates terminal Join the communication access group , For the first A communication access group consists of one time slot, one aggregation node, and multiple communication terminals. The utility function is expressed by the following equation: in, for The number of terminals in the middle; For the first Communication terminals in each time slot With 5G base stations The transmission rate between them; These are the weighting coefficients; For communication terminals With aggregation node The success rate of connection between them; For aggregation node Success rate of access to 5G base stations; The first Communication terminals in each time slot Contention packets for communication access are defined as follows: ,in Describes the set of communication terminals participating in the competition, satisfying , This indicates the value of the communication access group.

2. The virtual power plant communication terminal hierarchical packet access communication method according to claim 1, characterized in that, The communication terminal With aggregation node Distance range between The following relationship should be satisfied: In the formula, Indicates communication terminal The signal transmission power, It is a constant. , , They represent communication terminals respectively. With aggregation node Channel bandwidth, noise interference, and electromagnetic interference between them. This indicates the lower limit of the signal-to-noise ratio.

3. The hierarchical grouping access communication method for virtual power plant communication terminals according to claim 1, characterized in that, After calculating the contribution value of the current communication terminal to other communication access groups, if the contribution value is less than a set threshold or does not meet the distance range between the communication terminal and the aggregation node, the terminal remains in the current communication access group, and scheduling data packets are issued according to the current communication access group.

4. A virtual power plant communication terminal hierarchical packet access communication system, characterized by, include: The virtual power plant layer includes the aggregation and control edge gateway; The access layer, which includes 5G base stations; Convergence layer, which includes Each communication aggregation node uploads the communication access data to the aggregation and control edge gateway via the base station; The perception layer includes Each distributed source-load-storage resource connects to the communication aggregation node through its communication terminal. The virtual power plant layer adaptively optimizes the communication access group by using a group access method based on the group access decision of each communication terminal, the distance between the communication terminal and the aggregation node, and the distance between the communication terminal and the base station, and issues scheduling data packets according to the finally established communication access group. The adaptive optimization of communication access groups using packet access is, under the constraint of the aggregation node's carrying capacity, maximized by optimizing the packet selection variable to maximize the average communication access success rate of all communication terminals in the system. With average transmission rate The weighted sum is modeled as follows: in, These are the weighting coefficients; This is a group access constraint, meaning that each communication terminal can only access the aggregation control edge gateway through one aggregation node; This indicates that the number of communication terminals accessing each aggregation node cannot exceed its maximum threshold. ; The adaptive optimization of communication access groups using packet access involves optimizing the communication access decision for distributed source-load-storage resources using a competitive packet approach. The optimization methods include: In the In a time slot, one aggregation node and multiple communication terminals form a communication access group, denoted as _____. , The utility function is expressed by the following equation: in, for The number of terminals in the middle; For the first Communication terminals in each time slot With 5G base stations The transmission rate between them; These are the weighting coefficients; For communication terminals With aggregation node The success rate of connection between them; For aggregation node Success rate of access to 5G base stations; Each communication terminal, as a player, tends to join a communication access group to increase the success rate of communication access; the [number]th [terminal] will [be included in the group]. The contention packet for communication terminal access in a time slot is defined as follows: ,in Describes the set of communication terminals participating in the competition, satisfying , Indicates communication access group The value is defined as: Whether a communication terminal is allowed to join a communication access group depends on the value the communication terminal contributes to the communication access group. In the contention of packets for time-slot distributed source-load-storage resource communication access, the terminal Benefits Defined as its contribution to the value of the communication access group, it is calculated as follows: in, Indicates terminal Join the communication access group .

5. The virtual power plant communication terminal hierarchical packet access communication system according to claim 4, wherein, Average communication access success rate of all communication terminals The model is: in, Indicates the total number of aggregation nodes; For sensing terminals The aggregation node selects a binary variable, where express In the Select aggregation node for each time slot Access communication is required, otherwise ; The number of communication terminals for distributed source-load-storage resources. For communication terminals For aggregation nodes The preference value corresponding to the communication access group, that is, the communication terminal With aggregation node The success rate of connection between them; For aggregation node The success rate of access to 5G base stations is calculated using the following formula: in, The proportion of resources allocated to each permitted communication terminal at the aggregation node is taken as a constant. Indicates the aggregation node The maximum number of sensor terminals allowed to access communication within a time slot; Indicates the aggregation node The number of sensor terminals requesting access within a time slot in the group; For a communication terminal with a sink node The access success rate between them is as follows: in, Indicates the aggregation node The number of communication terminals requesting access within a time slot in the corresponding group; Indicates the aggregation node The maximum number of communication terminals allowed to access communication within a time slot; The proportion of resources allocated to each communication terminal that is allowed to access the aggregation node.

6. The virtual power plant communication terminal hierarchical packet access communication system according to claim 4, wherein, All communication terminals average transmission rate Model is: in, For sensing terminals The aggregation node selects a binary variable, where express In the Select aggregation node for each time slot Access communication is required, otherwise ; For communication terminals With aggregation node The success rate of connection between them; For aggregation node Success rate of access to 5G base stations; The number of communication terminals for distributed source-load-storage resources; For the first Communication terminals in each time slot With 5G base stations The transmission rate between them is as follows: ； in, Indicates communication terminal With 5G base stations The transmission bandwidth between them Communication terminal With 5G base stations The signal-to-noise ratio between them.

7. A hierarchical packet access communication device for a virtual power plant communication terminal, based on the hierarchical packet access communication method for a virtual power plant communication terminal according to any one of claims 1 to 4, characterized in that, include: An initialization module is used to calculate the preference value of each communication terminal for each communication access group; Under the condition that the distance range between the communication terminal and the aggregation node is met, each communication access group is sorted according to the preference value, and the communication terminal is added to the communication access group with the largest preference value according to the sorting, until the communication access group initialization is completed; The communication access module is used to calculate the contribution value of the current communication terminal to other communication access groups after all communication access groups in the current time slot are temporarily established. If the contribution value is greater than a set threshold and meets the distance range between the communication terminal and the aggregation node, the communication terminal leaves the current communication access group and joins the communication access group with a larger contribution value. The module iterates through the communication terminals in each communication access group and continuously changes communication access groups until no communication terminal changes communication access groups. The data packet delivery module delivers scheduled data packets based on the final established communication access group. After the scheduled data packets are delivered, the communication access group established in this time slot is disbanded, and communication access is performed in the next time slot.

8. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the hierarchical packet access communication method for a virtual power plant communication terminal according to any one of claims 1-3.

9. A computer-readable storage medium storing a computer program that, when executed by a processor, implements the hierarchical packet access communication method for a virtual power plant communication terminal according to any one of claims 1-3.

Images