Radio resource allocation method and system of power distribution network data acquisition system

Through the combination of Dutch unified price auction method and D2D communication link, the communication channel is allocated and transmission power is controlled, which solves the problem of balance between transmission rate and spectrum efficiency of cellular nodes, and realizes reliable transmission and efficient data transmission of power supply and demand information in the smart grid. .

CN119093577APending Publication Date: 2024-12-06GUANGXI ELECTRIC NET CO LTD WUZHOU POWER SUPPLY BUREAU
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410907765.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-08
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

When the prior art improves the transmission rate of cellular nodes, the spectrum efficiency is reduced, and the unreliable transmission of power supply and demand information in the smart grid makes it difficult to achieve system reliability and cost balance.

Method used

The Dutch unified price auction method is used to determine the electricity price of the control center, and the control center and EMU are connected through the D2D communication link, and data transmission is transmitted using the cellular auxiliary underlying mode, which allocates communication channels and controls transmission power to maximize the total rate of cellular nodes, while ensuring communication reliability.

Benefits of technology

It effectively improves the total data transmission rate of cellular nodes, reduces communication delay, avoids the increase in cost caused by the reduction of spectrum efficiency, and balances the relationship between reliability and cost.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119093577A_ABST
    Figure CN119093577A_ABST
Patent Text Reader

Abstract

The invention discloses a radio resource allocation method and system for a power distribution network data acquisition system, and relates to the technical field of computer vision, and the method comprises the steps: capturing light source information, and carrying out data preprocessing to generate a light field image; extracting depth information from the light field image by using a stereo matching method; constructing a Poisson model, and preliminarily generating a triangular mesh; and the unmanned aerial vehicle transmits the generated triangular mesh to a ground station through a wireless network, and outputs an optimized three-dimensional model. By combining the light field technology and the stereo matching method, the depth information can be accurately extracted from the light field image, so that the high-precision three-dimensional model is generated. Through the construction of the Poisson model and the triangular mesh, the point cloud data can be effectively optimized, and the continuity and integrity of the three-dimensional model are ensured. The Poisson model can also recover a continuous three-dimensional surface from the point cloud, and an efficient and accurate three-dimensional model reconstruction method is provided.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of smart grid communication technology, and in particular to a radio resource allocation method and system for a distribution network data acquisition system. Background Art

[0002] In order to increase the node transmission rate, existing communication technologies mainly reduce spectrum efficiency as a cost, which increases the operating costs for communication service providers. At the same time, in the operation of smart grids, the unreliable transmission of power supply and demand information and the inability of the control center to accurately send real-time electricity prices to all consumers may bring certain difficulties to the reliable operation of the system. In addition, D2D communication has the characteristics of low cost and low latency. At the same time, if D2D transmission and cellular transmission are carried out simultaneously in the communication channel, the spectrum efficiency can also be improved to a certain extent, providing a new perspective for information transmission. However, how to combine D2D communication with cellular communication to ensure that the system communication reliability requirements are met, improve the total transmission rate, and balance the relationship between the communication reliability cost and the RTP operation inaccuracy cost is a key challenge in the current technological development. Summary of the invention

[0003] In view of the above-mentioned problems, the present invention is proposed.

[0004] Therefore, the technical problem solved by the present invention is: how to improve the radio resource allocation method to maximize the total transmission rate of the cellular node while meeting the RTP operation reliability requirements, while balancing the relationship between the communication reliability cost and the RTP operation inaccuracy cost.

[0005] To solve the above technical problems, the present invention provides the following technical solutions: a radio resource allocation method for a distribution network data acquisition system, comprising the following steps: using a Dutch uniform price auction method to determine a new control center electricity price;

[0006] A D2D communication link is used to link the control center and related EMUs during the price announcement phase, and the real-time electricity price information is transmitted to each household EMU;

[0007] Each household EMU uses the average of past values ​​of real-time electricity prices, demand scale and other information to replace the actual value to quantify the expected economic losses and expected supply-demand gap of each household EMU;

[0008] The control center constructs the optimization problem of maximizing the total rate of cellular nodes by allocating communication channels and controlling the transmission power under the constraints of expected economic losses and expected supply-demand gap.

[0009] As a preferred solution of the radio resource allocation method of the distribution network data acquisition system described in the present invention, wherein: the Dutch uniform price auction method is that the asking price of the control center is determined by the bid of the EMU, and the difference between the allocated demand request and the available power supply is the smallest;

[0010] If a request's bid price is not lower than the asking price, the currently allocated demand request is considered allocated;

[0011] The control center asking price formula determined by the EMU bid is determined by the following formula:

[0012]

[0013] Among them, b * is the price demanded by the control center, Γ is the available power, a i is the power demand scale of the ith EMU, b i is the bid of the ith EMU, and Ω(b) is a cumulative demand function.

[0014] As a preferred solution of the radio resource allocation method of a distribution network data acquisition system described in the present invention, wherein: the price announcement stage is linked using a D2D communication link, the D2D communication link operates in a cellular assisted underlying mode, so that D2D transmission and uplink cellular transmission are carried out simultaneously, and the RTP control center and the EMU are located at the same location as the cellular nodes in the coverage area of ​​the cellular base station.

[0015] As a preferred solution of the radio resource allocation method of the distribution network data acquisition system described in the present invention, wherein: the D2D communication link link is also used to calculate the transmission signal superposition signal gain through the log-normal shadow effect and path loss;

[0016] Through the log-normal shadow effect and path loss, the transmission signal from node i∈L to node j∈L in channel s∈S is superimposed on the signal gain, which is expressed as:

[0017]

[0018] Where Φ is the path loss coefficient, φ is the path loss exponent, and d i,j is the link distance between nodes, δ i,j,s is the standard deviation of a zero-mean Gaussian random variable.

[0019] As a preferred solution of the radio resource allocation method of the distribution network data acquisition system described in the present invention, wherein: the RTP operation communication reliability is due to communication failure, the instantaneous value is missing, and the time average value of the past value is used to quantify the expected economic loss of the EMU;

[0020] The expected economic loss is expressed as:

[0021]

[0022] Among them, when When is a positive number, The return value is Otherwise the return value is 0, P s represents the success probability of data transmission, erfc -1 (·) is the inverse of the complementary error function, J is the packet size, represents the average of the past values ​​of the control center’s asking price, and b′ represents the minimum asking price set by the control center.

[0023] As a preferred solution of the radio resource allocation method of the distribution network data acquisition system described in the present invention, wherein: the expected supply-demand gap is the difference in electricity generated when estimating the demand scale using past values;

[0024] The expected supply-demand gap is expressed as:

[0025]

[0026] Among them, Λ is the maximum expected supply-demand gap, Δ is the difference in the demand scale between two consecutive requests, and M is the set of EMUs.

[0027] As a preferred solution of the radio resource allocation method of the power distribution network data acquisition system described in the present invention, wherein: the total rate of the cellular nodes is maximized by allocating communication channels and controlling the transmission power;

[0028] The cellular node rate is expressed as:

[0029] r i,s =Blog2(1+γ i,1,s )

[0030] Among them, r i,s represents the data rate of cellular node i∈N in channel s;

[0031] The maximization of the total rate of the cellular nodes is an optimization problem, and the expression is:

[0032]

[0033] Among them, S represents the set of all communication channels, B is the bandwidth of the communication channel, and x i,s is a binary variable used to indicate whether any node i is assigned to channel s∈S, x 0,s Indicates whether the control center is assigned to channel s∈S, γ i,j,sis the signal-to-noise ratio from the sending node i to the receiving node j in channel s, γ 0,j,s represents the signal-to-noise ratio from the control center to the jth EMU in channel s during the price announcement phase, γ i,0,s represents the signal-to-noise ratio from the i-th EMU in channel s to the control center when submitting a demand request, γ i,1,s Represents the signal-to-noise ratio from cellular node i to cellular base station.

[0034] Another object of the present invention is to provide a radio resource allocation method for a distribution network data acquisition system, which allocates radio resources at the communication channel and transmission power levels, improves the overall data transmission rate, and solves the problem of reduced spectrum efficiency while improving the overall transmission rate with existing traditional communication methods.

[0035] In order to solve the above technical problems, the present invention provides the following technical solutions: A radio resource allocator system of a distribution network data acquisition system, comprising: a data collection module, a price determination module, a price announcement module, an RTP operation communication reliability module and a cellular node total rate optimization module;

[0036] The data collection module obtains information such as transaction price, power demand, communication failure, etc. through information exchange between EMU and the control center;

[0037] The price determination module calculates the price of the control center by combining the EMU bid and the power demand information;

[0038] The price announcement module is a control center that transmits the determined asking price to each EMU, and the EMU compares the bid price with the asking price to determine whether to buy the electricity;

[0039] The RTP operation communication reliability module calculates the communication reliability index based on information such as communication failure, power demand, price, etc.

[0040] The cellular node total rate optimization module maximizes the total rate of all cellular nodes by allocating communication channels and controlling transmission power.

[0041] A computer device comprises a memory and a processor, wherein the memory stores a computer program, and wherein the processor implements the steps of the radio resource allocation method of the distribution network data acquisition system as described above when executing the computer program.

[0042] A computer-readable storage medium having a computer program stored thereon, characterized in that when the computer program is executed by a processor, the steps of the radio resource allocation method of the distribution network data acquisition system as described above are implemented.

[0043] Beneficial effects of the present invention: The present invention uses D2D communication to directly connect the EMU to the RTP control center, thereby reducing communication delays and avoiding the problem of increased costs caused by reducing spectrum efficiency. The present invention increases the total data transmission rate of cellular nodes by allocating communication channels and controlling transmission power, while ensuring that the system can meet the basic requirements of communication reliability, and effectively balancing the relationship between reliability costs and RTP operation inaccuracy costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. Among them:

[0045] Figure 1 An overall flow chart of a radio resource allocation method for a distribution network data acquisition system provided by the first embodiment of the present invention;

[0046] Figure 2 A schematic diagram of each stage of a radio resource allocation method for a distribution network data acquisition system provided by a first embodiment of the present invention;

[0047] Figure 3 A system model diagram based on cellular-assisted underlying D2D communication for a radio resource allocation method for a distribution network data acquisition system provided by the first embodiment of the present invention;

[0048] Figure 4 A structural diagram of a radio resource allocation system of a distribution network data acquisition system provided by a second embodiment of the present invention;

[0049] Figure 5 An overall flow chart of a radio resource allocation method for a distribution network data acquisition system provided by a third embodiment of the present invention;

[0050] Figure 6 This is an overall flow chart of a radio resource allocation method for a distribution network data acquisition system provided in the third embodiment of the present invention. DETAILED DESCRIPTION

[0051] In order to make the above-mentioned purposes, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the drawings of the specification. Obviously, the described embodiments are part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary persons in the art without creative work should fall within the scope of protection of the present invention.

[0052] In the following description, many specific details are set forth to facilitate a full understanding of the present invention, but the present invention may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.

[0053] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The term "in one embodiment" that appears in different places in this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive with other embodiments.

[0054] The present invention is described in detail with reference to schematic diagrams. When describing the embodiments of the present invention, for the sake of convenience, the cross-sectional diagrams showing the device structure will not be partially enlarged according to the general scale, and the schematic diagrams are only examples, which should not limit the scope of protection of the present invention. In addition, in actual production, the three-dimensional dimensions of length, width and depth should be included.

[0055] At the same time, in the description of the present invention, it should be noted that the directions or positional relationships indicated by the terms "upper, lower, inner and outer" are based on the directions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore cannot be understood as limiting the present invention. In addition, the terms "first, second or third" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance.

[0056] In the present invention, unless otherwise clearly specified and limited, the terms "install, connect, connect" should be understood in a broad sense, for example: it can be a fixed connection, a detachable connection or an integral connection; it can also be a mechanical connection, an electrical connection or a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0057] Example 1

[0058] Reference Figure 1 to Figure 3 , as an embodiment of the present invention, provides a radio resource allocation method for a distribution network data acquisition system, comprising:

[0059] RTP is deployed in densely populated urban residential areas covered by cellular communication networks. In a community, there are multiple RTP control centers, each of which only serves a group of non-overlapping houses. Each house is equipped with an Energy Management Unit (EMU), which can autonomously arrange the power consumption in the house to minimize utility bills.

[0060] The EMU is not only an autonomous agent of the actual consumer, but also a communication gateway between the building and its associated RTP control center. For simplicity, we only focus on one control center and its associated EMU.

[0061] The control center is responsible for regularly determining new electricity prices based on instantaneous electricity supply and demand. Figure 2 As shown, each interval starts with a data collection phase, followed by a price determination phase and a price announcement phase.

[0062] The new price is valid within the usage interval, which starts immediately after the current price announcement phase ends and is valid until the next price announcement phase ends. Therefore, a usage interval partially overlaps with and spans two consecutive price update intervals.

[0063] Let M be the set of EMUs. During the data collection phase, each EMU i (i∈M) sends a demand request (a i ,b i ) to the management center, where a i is the required size, b i is the bid price. If the control center subsequently announces the price b * No higher than b i , then the i-th EMU consumes exactly a i power, and according to b * In the price determination phase, the Dutch uniform price auction method is used to determine the new asking price. Specifically, the asking price is set to the bid price, so that the difference between the allocated demand request and the available power supply is the smallest, where a request is considered allocated if the bid price is not lower than the ask price.

[0064] In fact, the price is calculated by the cumulative demand function It is determined, which takes into account the demand scale of all bids not less than b. It should be noted that Ω(b) is a non-increasing function. Let Γ be the available power supply, and the selling price is determined by the following formula:

[0065]

[0066] During the price announcement phase, the EMU receives the newly determined asking price. In addition to the price, the EMU also receives a list of EMUs that did not correctly receive the demand request during the previous data collection phase. Not appearing on this list means that the demand request was successfully submitted. After receiving the information, the EMU will only consume electricity if its own offer is not lower than the received asking price.

[0067] To achieve data collection and price announcement, the control center and related EMUs are linked by device-to-device (D2D) communication links, such as Figure 3 As shown, the D2D communication link operates in cellular assisted underlying mode, so that D2D transmission is performed simultaneously with uplink cellular transmission. This means that the RTP control center and EMU are co-located with the cellular nodes in the coverage area of ​​the cellular base station. Let N be the set of cellular nodes. To distinguish, use index 0 and index 1 to represent the RTP control center and cellular base station respectively. Then the set of all communication nodes is L = {0, 1, M, N}.

[0068] S is used to represent the set of all communication channels. Through the log-normal shadow effect and path loss, the transmission signal from node i∈L to node j∈L in channel s∈S is superimposed on the signal gain, and its formula is:

[0069]

[0070] Where Φ is the path loss coefficient, φ is the path loss exponent, and d i,j is the link distance between nodes, δ i,j,s is the standard deviation of a zero-mean Gaussian random variable in dB, which represents the change in channel quality due to position-dependent shadowing effects. The present invention apparently only considers the impact of path loss and log-normal shadowing effects on the channel, but in fact, the model still considers the impact of fast fading on the channel. Fast fading means that if the communication node moves very fast, then in continuous radio resource allocation instances, the rapid change in signal strength will be manifested by the rapid change in the communication link distance.

[0071] There are differences in the time scales between RTP message transmission and cellular user communication. For example, the RTP price update interval is 15 minutes, but the cellular media access control frame can be as short as 1 to 10 milliseconds. Figure 1 As shown in Figure 2, the RTP data collection phase and the price announcement phase may span multiple radio resource allocation instances. In these instances, the communication channels and transmission power allocations of cellular users may change, but remain unchanged for D2D nodes because each D2D node transmits only one data packet in each phase.

[0072] Using underlying D2D communication will cause D2D transmission and cellular transmission to be performed simultaneously in a single channel. Therefore, there will be interference between a pair of cellular nodes and D2D nodes assigned to the same communication channel. For each channel s∈S, the occupied node pair is (i, y(i, s)), where y(i, s)∈L is a node different from i∈L and assigned to channel s. If i is a cellular node, then y(i, s) must be a D2D node, and vice versa.

[0073] The signal-to-noise ratio from the sending node i to the receiving node j in channel s is determined by the following formula:

[0074]

[0075] Where, σ is the additive white Gaussian noise power, p i,s is the transmission power of node i in channel s. From formula (3), we can see that an increase in cellular signal-to-noise ratio may lead to a decrease in D2D signal-to-noise ratio in the same channel, and vice versa.

[0076] Given a signal-to-noise ratio, the data rate of a cellular node i∈N in channel s is determined by the Shannon formula:

[0077] r i,s =Blog2(1+γ i,1,s ) (4)

[0078] Where B is the bandwidth of the communication channel. Generally speaking, as a source of revenue for communication service providers, providers always want the cellular data rate to be as high as possible. Theoretically, the higher the cellular signal-to-noise ratio, the higher the data rate, but the higher the cellular signal-to-noise ratio, the lower the D2D communication reliability, which will have an adverse effect on RTP operations. Conversely, improving the D2D signal-to-noise ratio to obtain better communication reliability may also reduce the cellular data rate.

[0079] Communication errors can affect the operation of RTP in two cases: (a) the demand requests from EMUs fail to reach the control center; (b) the price announcements from the control center fail to reach all EMUs. The second case is caused by location-related errors, i.e., errors caused by transmissions from the control center being received with different qualities by EMUs located at different locations. In either case, as a penalty for the RTP operator’s failure to provide reliable communication, the affected EMUs will only be charged prices b′≤b * , which is the lowest price set by the control center. Therefore, the economic loss caused by communication failure to the i-th EMU can reach a i (b * -b′). Due to a i and b *can vary from one interval to another, so the economic loss is not a constant. In addition, due to communication errors, the control center may not know a i and b * For the actual decision of the control center, the present invention adopts the time average of the past values, that is, and To quantify the expected economic loss of the ith EMU, the formula is as follows:

[0080]

[0081] When b is a positive number, [b] + The return value is b, otherwise the return value is 0, P s represents the probability of successful data transmission. Given a modulation scheme, P s The value of determines the required signal-to-noise ratio. Taking binary phase shift keying modulation as an example, the signal-to-noise ratio calculation formula is as follows:

[0082]

[0083] Among them, erfc -1 (·) is the inverse of the complementary error function, and J is the packet size.

[0084] To simplify the notation, h(P s ) represents a function that returns the signal-to-noise ratio required to achieve the desired transmission success probability, taking into account the maximum economic loss Θ(Θ i ≤Θ, From formula (5), we can get:

[0085]

[0086] In formula (7), when submitting a demand request, s is the channel from the i-th EMU to the control center, that is, i∈M, j=0. Conversely, when the price is announced, j∈M, i=0, and s is the single communication channel from the control center to all EMUs.

[0087] Economic losses are not the only problem caused by communication errors. During the data collection phase, if the demand request of the i-th EMU is not successfully received, the control center cannot accurately obtain the demand scale a i and its related bid priceb i , as a penalty, the control center will charge the price b' to the i-th EMU. At the same time, without considering the penalty, the control center can only estimate the demand scale using the time average of past values. In this case, the available power is:

[0088]

[0089] M′ is the set of all EMUs that did not correctly receive the demand request during the data collection phase.

[0090] When Γ′ is used to replace Γ in formula (1) to determine the selling price, since Γ′ is an estimated value, there may be a large supply-demand gap. A small supply-demand gap may have a huge impact on the stable operation of the power grid. The impact of the estimated value on the system can be reduced by limiting the size difference between two consecutive requests. However, if the number of EMUs that fail to submit demand requests is not limited, the supply-demand gap is still unrestricted. Therefore, for random communication errors, the number of demand request failures is also a random variable. In summary, the expected supply-demand gap expression is given:

[0091]

[0092] Let Λ be the maximum expected supply-demand gap, that is Then the signal-to-noise ratio from the i-th EMU to the control center of channel s must meet the following conditions:

[0093]

[0094] It should be further explained that the present invention maximizes the total rate of all cellular nodes by allocating communication channels and controlling transmission power. This is an optimization problem. The specific problem is defined as follows:

[0095]

[0096] Constraint (11) ensures that the control center and each EMU can be accurately assigned to the same communication channel. Constraint (12) allows multiple communication channels to be assigned to each cellular node in order to maximize the total cellular rate. Constraints (13) and (14) ensure that each channel can be used by at most one cellular node and one D2D node. In constraint (15), This constraint ensures that all EMU receivers meet the signal-to-noise ratio requirements. In constraint (16), Λ′=1-Λ / (Δ|M). This constraint ensures that the demand requests sent by each dynamic EMU to the control center can meet the signal-to-noise ratio requirements, so that economic losses and supply-demand gaps are kept within an acceptable range. This optimization problem is a mixed integer nonlinear programming problem, and the present invention uses an iterative method to solve it.

[0097] Table 1 Resource allocation recursive algorithm

[0098]

[0100] For each cellular node, all other D2D nodes are its candidate paired nodes, and e = (e(1), e(2)) is used to represent a cellular-D2D node pair, where e(1) ∈ N, e(2) ∈ {0, M}. Therefore, let the set of candidate cellular-D2D node pairs be E. There are a total of |N| × (|M| + 1) candidate node pairs.

[0101] To assign cellular-D2D node pairs to the same communication channel s∈S, a dual objective function is defined: For a given node pair, operating in different channels may result in different data rates due to the different gain levels of different channels. f(e,z(e)) is used to represent the maximum data rate that the cellular node can achieve in channel z(e) without affecting the signal-to-noise ratio constraint of the D2D node.

[0102] Algorithm 1 gives a recursive solution method. For each candidate node pair, the algorithm will maximize the cellular data rate of the node pair through a channel. For each D2D node, the algorithm further selects a single node pair from the candidate pairs that produces the highest cellular data rate. * , define E * For all selected node pairs e * In addition, using Z * As the corresponding maximum rate channel allocation z * (e * )'s collection.

[0103] In Algorithm 1, at each iteration, the algorithm first solves the maximum weight matching problem (17), which is to find a single allocation channel z(e) among all available channels for each cellular-D2D node pair, so that f(e,z(e)) of all candidate paired node pairs is maximized. In this formula, z is the vector of z(e), z * is the solution vector of (17).

[0104] After solving (17), each node pair finds its own maximum allocation channel vector z * The fifth line in Algorithm 1 finds the channel with the highest data rate among these channels and assigns it a value, and identifies the corresponding cellular-D2D node pair as e * The node pair and its associated allocation channel z * (e * ) is added to the solution set in line 9. For the node pair e * , whose D2D node is e * (2) Since each D2D node can only be paired with one cellular node, all other * (2) will become invalid candidate solutions and will be deleted in line 6.* (e * ) has been assigned to node pair e * , so it is deleted from the set of available channels in line 7. With the updated node pairing candidate solutions and the set of available channels, iterations will continue until no channel is assigned due to no more candidate solutions.

[0105] In Algorithm 1, the loop will execute |M|+1 times. In the loop, (17) is a linear assignment problem, which is solved by the Hungarian algorithm. It is known that the complexity of the Hungarian algorithm at the tth iteration is O(max{|E (t) | 3 ,|S (t) | 3 To find the node pair with the highest data rate, lines 4 and 5 require complexity O(|E (t) |+1). The complexity of deleting invalid node pairs in line 6 is O(|N|-1). In general, when |M|≥|S|, the complexity of Algorithm 1 is O(|M| 4 |N| 3 ), otherwise O(|S| 3 |M||N| 3 ).

[0106] For a given pair of nodes, the data rate is maximized by transmitting power control. For node pair e, p(e,z(e)) = (p e(1),z(e) ,p e(2),z(e) ) represents the transmission power set of nodes e(1) and e(2) in channel z(e). To simplify the notation of the power control problem of node e in z(e), i=e(1), j=e(2) and s=z(e) are used hereafter. Combining equations (3), (4) and (10), the transmission power control problem can be expressed as:

[0107]

[0108] in, is an indicator function, which is 1 if event A occurs, otherwise 0. For each node pair, only one of the two constraints is valid.

[0109] Moreover, (20) is valid only when the D2D node j=0 is the control center, and (21) is valid only when the D2D node j∈M is an EMU.

[0110] Solving the optimization (19) is difficult because its objective function is not concave. Therefore, the objective function is converted into a differential convex structure and the optimization is solved by an iterative algorithm. For this differential convex transformation, the following two formulas are introduced:

[0111] α(u,v)=Blog2(g i,1,s u+g j,1,s v+σ) (22)

[0112] β(u)=Blog2(g j,1,s u+σ) (23)

[0113] definition Λ′ i =max(h(θ′ i ),h(Λ′)), then the optimization problem (19) can be transformed into the following form:

[0114]

[0115] Table 2 Recursive algorithm for convexity optimization

[0116]

[0117] As described in Algorithm 2, the optimization problem (24) can be solved recursively, and each iteration only involves solving a single convex optimization. In the tth iteration, to represent the convex optimization, β(u) is replaced by β (t) (u), β (t) (u) is β(u) in u (t) Since β(u) is concave and differentiable, the affine majority can be determined by a first-order approximation as follows:

[0118]

[0119] The convex optimization for the tth iteration is defined as follows:

[0120]

[0121] According to Algorithm 2, the Lagrange dual method is used to solve the optimization (26). The Lagrange multiplier formula of (26) is the sum of its objective function and weighted constraint function. Each constraint function has an independent weight, which is a non-negative constant called the Lagrange multiplier. k represents the Lagrange multiplier of constraint (27) for node k∈M, and λ represents λ k At the same time, μ is used to represent the Lagrange multiplier of constraint (28). Then the Lagrange multiplier of the tth iteration is:

[0122]

[0123] Given the Lagrange multiplier formula, the corresponding Lagrange dual function is defined as follows:

[0124]

[0125] Therefore, solving the optimization (26) using the Lagrangian dual method requires solving Applying the KKT condition to equation (29) yields the Lagrangian dual function. i,s The partial derivatives of are as follows:

[0126]

[0127] Meet the corresponding KKT conditions:

[0128]

[0129] If the D2D node is the control center, that is, j = 0, then for p i,s The partial derivative of is:

[0130]

[0131] Meet the corresponding KKT conditions:

[0132]

[0133] On the other hand, if the D2D node is an EMU, that is, j∈M, then its i,s The partial derivative of is:

[0134]

[0135] Meet the corresponding KKT conditions:

[0136]

[0137] Since the KKT condition has no unique closed-form solution, Newton’s method is used to obtain the numerical solution.

[0138] After solving the KKT condition and obtaining the Lagrangian dual function, the next step is to solve the Lagrangian dual problem in the same t-th iteration by minimizing equation (30), as shown below:

[0139]

[0140] For a differentiable Lagrange dual function, the gradient-gradient method is used to update the Lagrange multiplier and solve the Lagrange dual problem as follows:

[0141]

[0142] Among them, λ and μ is a constant step size, which is small enough to ensure convergence to the optimal point.

[0143] The following shows how to demap the assigned channels back to their original form:

[0144]

[0145] Among them, only when e∈E * ,

[0146] Example 2

[0147] Reference Figure 4 , as an embodiment of the present invention, provides a radio resource allocation system for a distribution network data acquisition system, characterized by: a data collection module, a price determination module, a price announcement module, an RTP operation communication reliability module and a cellular node total rate optimization module.

[0148] The data collection module obtains information such as transaction price, power demand, communication failure, etc. through information exchange between EMU and the control center.

[0149] The price determination module calculates the price asked by the control center based on the EMU bid and power demand information.

[0150] The price announcement module is where the control center transmits the determined asking price to each EMU, and the EMU compares the bid with the asking price to determine whether to buy electricity.

[0151] The RTP operation communication reliability module calculates the communication reliability index based on information such as communication failures, power demand, and price.

[0152] The cellular node total rate optimization module maximizes the total rate of all cellular nodes by allocating communication channels and controlling transmission power.

[0153] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc., which can store program code.

[0154] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in conjunction with such instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in conjunction with such instruction execution systems, devices or apparatuses.

[0155] More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk case (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be a paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, deciphering or, if necessary, processing in another suitable manner, and then stored in a computer memory.

[0156] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0157] Example 3

[0158] Reference Figure 5-6 This is another embodiment of the present invention. In order to verify the beneficial effects of the present invention, scientific demonstration is carried out through economic benefit calculation and simulation experiments. This embodiment experiments the existing traditional method and the method of this embodiment respectively.

[0159] In the simulation, unless otherwise specified, the following values ​​are used for various parameters: B = 200 KHz, φ = 2, δ = 8 dB, L = 84 bits, ζ λ =0.1,ζ μ=0.1. The noise power σ is assumed to be calculated at 25°C and BPSK modulation scheme. For RTP operation, the energy price is updated every 15 minutes. According to relevant data, the average energy consumption of a typical residential apartment is assumed to be 30KWh / day. Therefore, Δ is set to 0.3125KWh and Λ=0.01Δ|M|. This means that the system can accept a 1% supply-demand gap. The energy price is assumed to be 0.085$ / KWh. Set b′=0.0425$, This means being able to accept a 1% financial loss.

[0160] The simulated cellular base station has a coverage radius of 1 km. The number of cellular and D2D nodes within the coverage area is a simulation parameter that can be changed from one simulation to another to see the effect of increasing the number of nodes. In each simulation, each cellular and D2D node is randomly distributed within the coverage area, with the number of cellular nodes equal to the number of D2D nodes.

[0161] Figure 5 The summed rate of all cellular nodes is shown as the number of D2D nodes increases. In the figure, each data point is the result of 100 simulations using the same configuration. Figure 5 For example, Figure 6 The probability distribution is given for the case of 50 D2D nodes. Due to space limitations, the probability distributions for other cases are not given. However, for each configuration, the range of total rate values ​​is still shown at the two ends of the bar graph. Figure 5 In. Figure 5 In the figure, the mark inside each bar represents the average of 100 simulation runs. From the figure, we can see that the total rate of the cell increases with the number of nodes. This is reasonable because each additional node will make an additional contribution to the total rate.

[0162] Figure 5 The proposed scheme is compared with a baseline scheme. The proposed scheme uses Algorithm 1 to allocate communication channels and pair D2D nodes to cellular nodes, while the baseline scheme randomly pairs D2D nodes to cellular nodes that have not yet been paired. As shown in the figure, the baseline scheme achieves a significantly lower total cellular rate compared to the proposed scheme. For example, with 50 D2D nodes, the total rates of the baseline and proposed schemes are 33.48Mbps and 58.69Mbps, respectively. This clearly demonstrates the effectiveness of the proposed scheme in allocating radio resources to cellular nodes without compromising the reliability requirements of RTP operation.

[0163] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.

Claims

1. A radio resource allocation method for a distribution network data acquisition system, characterized in that: include: The new control center electricity price is determined by using the Dutch unified price auction method; A D2D communication link is used to link the control center and related EMUs during the price announcement phase, and the real-time electricity price information is transmitted to each household EMU; Each household EMU uses the average of past values ​​of real-time electricity prices, demand scale and other information to replace the actual value to quantify the expected economic losses and expected supply-demand gap of each household EMU; The control center constructs the optimization problem of maximizing the total rate of cellular nodes by allocating communication channels and controlling the transmission power under the constraints of expected economic losses and expected supply-demand gap.

2. The radio resource allocation method of the distribution network data acquisition system according to claim 1, characterized in that: The Dutch uniform price auction method is that the control center's asking price is determined by the bids of the EMUs, and the difference between the allocated demand request and the available power supply is minimized; If a request's bid price is not lower than the asking price, the currently allocated demand request is considered allocated; The control center asking price formula determined by the EMU bid is determined by the following formula: Among them, b* is the price asked by the control center, Γ is the available power, ai is the power demand scale of the i-th EMU, bi is the bid of the i-th EMU, and Ω(b) is a cumulative demand function.

3. The radio resource allocation method of the distribution network data acquisition system according to claim 2, characterized in that: The price announcement stage is linked using a D2D communication link, which operates in a cellular-assisted underlying mode, so that D2D transmission and uplink cellular transmission are carried out simultaneously, and the RTP control center and EMU are located at the same location as the cellular nodes in the coverage area of ​​the cellular base station.

4. The radio resource allocation method of the distribution network data acquisition system according to claim 3, characterized in that: The D2D communication link is also used to calculate the transmission signal superposition signal gain through log-normal shadow effect and path loss; Through the log-normal shadow effect and path loss, the transmission signal from node i∈L to node j∈L in channel s∈S is superimposed on the signal gain, which is expressed as: Where Φ is the path loss coefficient, φ is the path loss exponent, and d i,j is the link distance between nodes, δ i,j,s is the standard deviation of a zero-mean Gaussian random variable.

5. The radio resource allocation method of the distribution network data acquisition system according to claim 4, characterized in that: The replacement of actual values ​​to quantify the expected economic losses and expected supply-demand gap of each household’s EMU is due to communication failures, missing instantaneous values, and the time average of past values ​​is used to quantify the expected economic losses of the EMU; The expected economic loss is expressed as: Among them, when When is a positive number, The return value is Otherwise the return value is 0, P s represents the success probability of data transmission, erfc -1 (·) is the inverse of the complementary error function, J is the packet size, represents the average of the past values ​​of the control center’s asking price, and b′ represents the minimum asking price set by the control center.

6. The radio resource allocation method of the distribution network data acquisition system according to claim 5, characterized in that: The expected supply-demand gap is the difference in electricity generated when estimating the demand scale using past values; The expected supply-demand gap is expressed as: Among them, Λ is the maximum expected supply-demand gap, Δ is the difference in the demand scale between two consecutive requests, and M is the set of EMUs.

7. The radio resource allocation method of the distribution network data acquisition system according to claim 6, characterized in that: The total rate of the cellular nodes is maximized by allocating communication channels and controlling transmission power; · The total rate of the cellular nodes is expressed as: r i,s =Blog2(1+c i,1,s ) Among them, r i,s represents the data rate of cellular node i∈N in channel s; The maximization of the total rate of the cellular nodes is an optimization problem, and the expression is: Λ′=1-Λ / (Δ|M) Among them, S represents the set of all communication channels, B is the bandwidth of the communication channel, and x i,s is a binary variable used to indicate whether any node i is assigned to channel s∈S, x 0,s indicates whether the control center is assigned to channel s∈S, γi,j,s is the signal-to-noise ratio from the sending node i to the receiving node j in channel s, and γ 0,j,s represents the signal-to-noise ratio from the control center to the jth EMU in channel s during the price announcement phase, γ i,0,s represents the signal-to-noise ratio from the i-th EMU in channel s to the control center when submitting a demand request, γ i,1 ,s Represents the signal-to-noise ratio from cellular node i to cellular base station.

8. A system using the radio resource allocation method of a distribution network data acquisition system as claimed in any one of claims 1 to 7, characterized in that: It includes data collection module, price determination module, price announcement module, RTP operation communication reliability module and cellular node total rate optimization module; The data collection module obtains information such as transaction price, power demand, communication failure, etc. through information exchange between EMU and the control center; The price determination module calculates the price of the control center by combining the EMU bid and the power demand information; The price announcement module is a control center that transmits the determined asking price to each EMU, and the EMU compares the bid price with the asking price to determine whether to buy the electricity; The RTP operation communication reliability module calculates the communication reliability index based on information such as communication failure, power demand, price, etc. The cellular node total rate optimization module maximizes the total rate of all cellular nodes by allocating communication channels and controlling transmission power.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the radio resource allocation method for a power distribution network data acquisition system according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the radio resource allocation method for a power distribution network data collection system as described in any one of claims 1 to 7 are implemented.