CN114521027A - Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium - Google Patents
Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114521027A CN114521027A CN202210003200.7A CN202210003200A CN114521027A CN 114521027 A CN114521027 A CN 114521027A CN 202210003200 A CN202210003200 A CN 202210003200A CN 114521027 A CN114521027 A CN 114521027A
- Authority
- CN
- China
- Prior art keywords
- base station
- resource
- user
- scheduling
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 230000005540 biological transmission Effects 0.000 claims abstract description 52
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 claims description 5
- 238000013468 resource allocation Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 description 11
- 238000004364 calculation method Methods 0.000 description 5
- 230000004069 differentiation Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and a device for dynamically scheduling power grid resources, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring resource scheduling requests of a plurality of users at the current time and a plurality of resource blocks to be allocated from different base stations; determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay; and scheduling a plurality of resource blocks to be allocated according to the resource scheduling priority. The invention reasonably schedules the channel resources by adjusting the resource scheduling priority of the users and dynamically updating the priority of each service terminal, thereby meeting the differentiated requirements of various services of different slice users and simultaneously improving the fairness of the resources distributed by the users in the cell.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a method and a device for dynamically scheduling power grid resources, electronic equipment and a storage medium.
Background
With the development of energy internet, in order to adapt to a novel power grid mode, power grid application provides more severe bearing requirements for a wireless network. The method provides high-quality service in the aspects of bandwidth, time delay, reliability and the like when power services such as accurate load control, video monitoring, intelligent distributed power distribution automation and the like require communication.
The network slicing technology in the fifth generation mobile communication divides a physical network into a plurality of virtual networks logically, so that the requirement of various power services on the differentiation of communication performance can be well met. However, with the continuous expansion of the power grid service scale, how to satisfy various service differentiation requirements of different slice users by reasonably allocating communication and network resources and improve allocation fairness and system capacity becomes a hot research problem in the field of wireless communication in the power industry.
In summary, there is a need for a method for dynamically scheduling power grid resources, which is used to solve the above problems in the prior art.
Disclosure of Invention
Because the existing method has the problems, the invention provides a method and a device for dynamically scheduling power grid resources, electronic equipment and a storage medium.
In a first aspect, the present invention provides a method for dynamically scheduling power grid resources, including:
acquiring resource scheduling requests of a plurality of users at the current time and a plurality of resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing delay of each user; the user is a network slicing user;
determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay;
and scheduling the resource blocks to be allocated according to the resource scheduling priority.
Further, the scheduling the resource blocks to be allocated according to the resource scheduling priority includes:
determining a first user set according to the resource scheduling priority; each user in the first user set corresponds to a different base station; the resource scheduling priority of each user in the first user set is highest in a plurality of users covered by the corresponding base station;
determining a signal-to-interference-and-noise ratio corresponding to each base station according to the first user set;
determining the transmitting power of each base station according to the signal to interference plus noise ratio corresponding to each base station;
and correspondingly allocating the resource blocks to be allocated to users in the first user set according to the transmitting power of each base station.
Further, the resource transmission rate is determined by the channel bandwidth corresponding to the user, the noise power and the transmission power of the base station; and the transmitting power of the base station corresponding to each user in the plurality of users is equal.
Further, the determining the transmission power of each base station according to the signal to interference plus noise ratio corresponding to each base station includes:
determining a first base station and an upper limit of the transmitting power according to the signal-to-interference-and-noise ratio corresponding to each base station; the signal-to-interference-and-noise ratio corresponding to the first base station is the lowest;
taking the upper limit of the transmission power as the transmission power of the first base station;
determining the transmitting power of the second base station according to the principle of equal signal-to-interference-and-noise ratio; the second base station is a base station except the first base station in a plurality of base stations corresponding to the first user set.
Further, after the scheduling the resource blocks to be allocated according to the resource scheduling priority, the method further includes:
deleting the plurality of resource blocks to be allocated from a current resource block list;
judging whether the resource block list is empty or not;
if the resource block list is empty, finishing scheduling, otherwise, continuing allocation until the resource block list is empty.
In a second aspect, the present invention provides a device for dynamically scheduling power grid resources, including:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is used for acquiring resource scheduling requests of a plurality of users at the current moment and a plurality of resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing time delay of each user; the user is a network slicing user;
the processing module is used for determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay;
and scheduling the resource blocks to be allocated according to the resource scheduling priority.
Further, the processing module is specifically configured to:
determining a first user set according to the resource scheduling priority; each user in the first user set corresponds to a different base station; the resource scheduling priority of each user in the first user set is highest in a plurality of users covered by the corresponding base station;
determining a signal-to-interference-and-noise ratio corresponding to each base station according to the first user set;
determining the transmitting power of each base station according to the signal-to-interference-and-noise ratio corresponding to each base station;
and correspondingly allocating the resource blocks to be allocated to users in the first user set according to the transmitting power of each base station.
Further, the obtaining module is specifically configured to:
the resource transmission rate is determined by the channel bandwidth corresponding to the user, the noise power and the transmitting power of the base station; and the transmitting power of the base station corresponding to each user in the plurality of users is equal.
Further, the processing module is specifically configured to:
determining a first base station and an upper limit of the transmitting power according to the signal to interference plus noise ratio corresponding to each base station; the signal-to-interference-and-noise ratio corresponding to the first base station is the lowest;
taking the upper limit of the transmission power as the transmission power of the first base station;
determining the transmitting power of the second base station according to the principle of equal signal-to-interference-and-noise ratio; the second base station is a base station except the first base station in a plurality of base stations corresponding to the first user set.
Further, the processing module is further configured to:
after the plurality of resource blocks to be distributed are scheduled according to the resource scheduling priority, deleting the plurality of resource blocks to be distributed from a current resource block list;
judging whether the resource block list is empty or not;
if the resource block list is empty, finishing scheduling, otherwise, continuing to distribute until the resource block list is empty.
In a third aspect, the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the method for dynamically scheduling power grid resources according to the first aspect is implemented.
In a fourth aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method for dynamic scheduling of power grid resources according to the first aspect.
According to the technical scheme, the method, the device, the electronic equipment and the storage medium for dynamically scheduling the power grid resources provided by the invention have the advantages that the channel resources are reasonably scheduled by adjusting the resource scheduling priority of the users and dynamically updating the priority of each service terminal, so that the fairness of the users in the cell for distributing the resources is improved while the requirements of different slice users for various service differentiation are met.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a system framework of a method for dynamically scheduling power grid resources according to the present invention;
FIG. 2 is a schematic flow chart of a method for dynamically scheduling power grid resources according to the present invention;
FIG. 3 is a schematic flow chart of a method for dynamically scheduling power grid resources according to the present invention;
fig. 4 is a schematic structural diagram of a device for dynamically scheduling power grid resources according to the present invention;
fig. 5 is a schematic structural diagram of an electronic device provided in the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
In the embodiment of the invention, U adjacent cells with same frequency interference are assumed, M randomly distributed users exist in each cell, the number of wireless resource blocks of a base station of each cell is N, and the system bandwidth is B.
Specifically, each resource block of each cell is allocated to 1 user in the scheduling period, and users in different cells have co-channel interference.
The specific SINR (Signal to Interference plus Noise Ratio, SINR) for allocating resource block n to user m in cell u is as follows:
wherein G isu,m,nThe channel gain for cell u user m over resource block n,
for the gain, p, of user m on the co-channel interference channels of other cellsu,m,nAnd allocating the downlink transmission power of the resource block n for the user m in the cell u, wherein z is Gaussian white noise.
Further, according to the shannon formula, under a certain error rate condition, a specific calculation formula of the maximum throughput of the user m allocated to the cell u by the resource block n is as follows:
wherein, B0＝B/N，
Is constant, B represents the system bandwidth, N represents the resource block of each cellThe BER represents the bit error rate.
Further, the specific calculation formula of the downlink total throughput is as follows:
wherein λ isu,m,n1 means that the base station u allocates resource block n to user m, whereas λu,m,n0 means that the base station u does not allocate resource block n to user m.
Further, the requirements of the multi-cell system on fairness and throughput under the power grid slicing service scene are comprehensively considered, and the embodiment of the invention provides a power grid resource dynamic scheduling target of max C (lambda C)u,m,n,pu,m,n)。
Specifically, the constraints are as follows:
C2:λu,m,n∈{0,1}
where C1 and C2 are constraints on resource blocks, and C1 indicates that each resource block of each cell is allocated to 1 user in a scheduling period; c3 is a power constraint for each base station, PuRepresents the upper transmit power limit of base station u; c4 is a resource transmission rate constraint for cell u, user m.
In order to achieve the above objective of dynamic scheduling of power grid resources, the method for dynamic scheduling of power grid resources provided in the embodiment of the present invention may be applied to a system architecture as shown in fig. 1, where the system architecture includes a base station 100 and a user 200.
In the embodiment of the present invention, the base station 100 is configured to obtain resource scheduling requests of a plurality of users 200 at the current time.
It should be noted that the resource scheduling request includes the amount of data to be sent, the resource transmission rate, and the packet queuing delay of each user.
In the embodiment of the invention, the user is a network slicing user.
Further, the slice type of the network slice includes a plurality of types, such as a video type, a voice type, and the like.
For example, there are 10 adjacent cells with co-channel interference, each cell has 20 randomly distributed users, and 10 cells correspond to 10 base stations respectively. The cell corresponding to the base station 1 includes two slice types, which are slice type a and slice type B. Slice type a contains 6 users and slice type B contains 4 users.
The base station 100 is configured to determine a resource scheduling priority of each user according to the amount of data to be sent, the resource transmission rate, and the data packet queuing delay, and schedule a plurality of resource blocks to be allocated according to the resource scheduling priority.
It should be noted that fig. 1 is only an example of a system architecture according to the embodiment of the present invention, and the present invention is not limited to this specifically.
Based on the above illustrated system architecture, fig. 2 is a schematic flow chart corresponding to a method for dynamically scheduling power grid resources provided in an embodiment of the present invention, and as shown in fig. 2, the method includes:
It should be noted that the resource scheduling request includes the amount of data to be sent, the resource transmission rate, and the packet queuing delay of each user.
Further, in the embodiment of the present invention, the user is a network slicing user.
It should be noted that, the fifth generation mobile communication provides customized services to users in a network slice form, and different users require different service qualities.
Specifically, the calculation formula of the resource scheduling priority of the user m at the time t is as follows:
wherein,
representing the amount of data to be transmitted by cell u user m at time t,
representing the amount of data to be transmitted for all users at time t.
Representing the resource transmission rate of user m at time t,
representing the average resource transmission rate of user m for a preset time period before time t,
indicating the queuing delay of the packet of user m in the buffer at time t,
representing the maximum queuing delay for user m,
indicating the packet loss rate bound for user m,
taking the logarithm to be a negative number.
It should be noted that the maximum queuing delay and the packet loss rate limit corresponding to the user m are determined by the service type of the network slice corresponding to the user m.
In order to reduce the algorithm complexity, the embodiment of the present invention disassembles the above optimal problem into the following two steps:
the method comprises the following steps: and performing resource allocation under the condition of equal power for each cell.
Step two: and performing power allocation among the cells based on the resource allocation result of each cell.
Specifically, the resource transmission rate is determined by the channel bandwidth, noise power and transmission power of the base station corresponding to the user; and the transmission power of the base station corresponding to each user in the plurality of users is equal.
In the embodiment of the invention: and r is wlan 2(1+ s/n), where s denotes a base station transmission power, and in the embodiment of the present invention, the transmission powers s of the base stations corresponding to the users are all equal, that is, resource allocation is performed on each cell under equal power.
And 203, scheduling a plurality of resource blocks to be allocated according to the resource scheduling priority.
For example, user a1 has the highest resource scheduling priority among the users covered by base station a, the first resource block of base station a is allocated to user a1, user B1 has the highest resource scheduling priority among the users covered by base station B, and the first resource block of base station B is allocated to user B1.
According to the scheme, the channel resources are reasonably scheduled by adjusting the resource scheduling priority of the user and dynamically updating the priority of each service terminal, the transmission rate, the time delay and the scheduling fairness of the slice users are considered while the different service differentiation requirements of different slice users are met, the network resources are efficiently utilized, and the throughput of the system is maximized.
Further, after the resource allocation under the equal power of each cell is completed, the λ is usedu,m,nHas been determined so that cu,m,n、γu,m,nAnd pu,m,nCan be simplified as cu,n、γu,nAnd pu,n。
In the embodiment of the present invention, a specific calculation formula of the total throughput of the downlink is as follows:
further, based on the above formula, one can obtain:
as can be seen from the above formula, it is only necessary to satisfy the respective groups
At maximum, then the downlink throughput of the grid system is at a maximum.
The nature of the mean theorem and convex function by the inequality is readily demonstrated: if so that
The value of (A) is maximized only in
Namely gamma1,n＝...＝γU,nIs satisfied.
In the embodiment of the invention, the signal-to-interference-and-noise ratio of the user on the resource block is influenced by the power. Therefore, in order to guarantee the total throughput of the multi-cell system, it is necessary to make
As close as possible to
Wherein,
by
Simplified after resource block allocation.
Based on the above principle, in step 203, the step flow of the embodiment of the present invention is as shown in fig. 3, which specifically includes the following steps:
It should be noted that each user in the first user set corresponds to a different base station; the resource scheduling priority of each user in the first user set is highest in a plurality of users covered by the corresponding base station.
For example, the base station a covers the user 1, the user 2, and the user 3, wherein the resource scheduling priority corresponding to the user 2 is the highest, and the base station a allocates the resource block to the user 2; the base station B covers the user 4, the user 5, and the user 6, wherein the resource scheduling priority corresponding to the user 6 is the highest, and the base station B allocates the resource block to the user 6. User 2, user 6 are both in the first set of users.
In one possible implementation, the standard deviation { sigma } of the signal-to-interference-and-noise ratio of the co-frequency resource block is calculated1,σ2,...,σN}。
Wherein,
Specifically, the first base station and the upper limit of the transmission power are determined according to the signal-to-interference-and-noise ratio corresponding to each base station.
It should be noted that the first base station has the lowest signal to interference plus noise ratio.
According to σ1:σ2:...:σNAnd calculating the power upper limit of the same-frequency resource block, wherein the specific calculation formula is as follows:
according to the embodiment of the invention, the power upper limit in the same-frequency resource block is obtained by adopting the ratio of the standard deviation of the signal-to-interference-and-noise ratio of the same-frequency channel.
Further, the upper limit of the transmission power is taken as the transmission power of the first base station.
And determining the transmitting power of the second base station according to the principle of equal signal-to-interference-and-noise ratio.
The second base station is a base station other than the first base station in the plurality of base stations corresponding to the first user set.
In the embodiment of the invention, the resource blocks of other base stations are according to gamma1,n＝...＝γU,nPower allocation is performed. The power of each cell should guarantee the following inequality:
according to the scheme, the maximum power is distributed for the channel resource with the worst signal-to-interference-and-noise ratio, the signal-to-interference-and-noise ratios of the users with the same frequency slices are balanced, the same frequency interference among the cells is reduced, and the throughput of the power grid multi-cell system is further improved.
And step 304, correspondingly allocating a plurality of resource blocks to be allocated to users in the first user set according to the transmission power of each base station.
In the embodiment of the invention, the coordination is carried out according to the downlink transmitting power of the sub-channel to meet the gamma1,n＝...＝γI,n. Meanwhile, considering the fairness of the edge users, the maximum power is allocated to the channel resource with the worst signal-to-interference-and-noise ratio.
According to the scheme, by aiming at the problem of inter-cell co-frequency interference in multi-cell resource scheduling in an electric power scene, the transmitting power is reasonably distributed for users obtaining channel resources, the system throughput is improved under the condition of reducing the inter-cell co-frequency interference, the throughput loss caused by the co-frequency interference is reduced, the resource distribution fairness of different users in the multi-cell electric power service scene is improved, and the service quality requirements of different electric power service terminals are better met.
Further, after step 203, the embodiment of the present invention deletes a plurality of resource blocks to be allocated from the current resource block list;
judging whether the resource block list is empty or not;
if the resource block list is empty, finishing scheduling, otherwise, continuing allocation until the resource block list is empty.
According to the scheme, the efficiency of scheduling the channel resources is improved through the resource block list.
Based on the same inventive concept, fig. 4 exemplarily shows a device for dynamically scheduling power grid resources according to an embodiment of the present invention, where the device may be a process for dynamically scheduling power grid resources.
The apparatus, comprising:
an obtaining module 401, configured to obtain resource scheduling requests of multiple users at a current time and multiple resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing delay of each user; the user is a network slicing user;
a processing module 402, configured to determine a resource scheduling priority of each user according to the data amount to be sent, the resource transmission rate, and the data packet queuing delay;
and scheduling the resource blocks to be allocated according to the resource scheduling priority.
Further, the processing module 402 is specifically configured to:
determining a first user set according to the resource scheduling priority; each user in the first user set corresponds to a different base station; the resource scheduling priority of each user in the first user set is the highest among a plurality of users covered by the corresponding base station;
determining a signal-to-interference-and-noise ratio corresponding to each base station according to the first user set;
determining the transmitting power of each base station according to the signal-to-interference-and-noise ratio corresponding to each base station;
and correspondingly allocating the resource blocks to be allocated to users in the first user set according to the transmitting power of each base station.
Further, the obtaining module 401 is specifically configured to:
the resource transmission rate is determined by the channel bandwidth corresponding to the user, the noise power and the transmitting power of the base station; and the transmitting power of the base station corresponding to each user in the plurality of users is equal.
Further, the processing module 402 is specifically configured to:
determining a first base station and an upper limit of the transmitting power according to the signal to interference plus noise ratio corresponding to each base station; the signal-to-interference-and-noise ratio corresponding to the first base station is the lowest;
taking the upper limit of the transmission power as the transmission power of the first base station;
determining the transmitting power of the second base station according to the principle of equal signal to interference plus noise ratio; the second base station is a base station except the first base station in a plurality of base stations corresponding to the first user set.
Further, the processing module 402 is further configured to:
after the plurality of resource blocks to be distributed are scheduled according to the resource scheduling priority, deleting the plurality of resource blocks to be distributed from a current resource block list;
judging whether the resource block list is empty or not;
if the resource block list is empty, finishing scheduling, otherwise, continuing to distribute until the resource block list is empty.
Based on the same inventive concept, another embodiment of the present invention provides an electronic device, which specifically includes the following components, with reference to fig. 5: a processor 501, a memory 502, a communication interface 503, and a communication bus 504;
the processor 501, the memory 502 and the communication interface 503 complete mutual communication through the communication bus 504; the communication interface 503 is used for implementing information transmission between the devices;
the processor 501 is configured to call the computer program in the memory 502, and when the processor executes the computer program, the processor implements all the steps of the above method for dynamically scheduling power grid resources, for example, when the processor executes the computer program, the processor implements the following steps: acquiring resource scheduling requests of a plurality of users at the current time and a plurality of resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing delay of each user; the user is a network slicing user; determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay; and scheduling the resource blocks to be allocated according to the resource scheduling priority.
Based on the same inventive concept, a further embodiment of the present invention provides a non-transitory computer-readable storage medium, having a computer program stored thereon, which when executed by a processor implements all the steps of the above method for dynamically scheduling power grid resources, for example, the processor implements the following steps when executing the computer program: acquiring resource scheduling requests of a plurality of users at the current time and a plurality of resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing delay of each user; the user is a network slicing user; determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay; and scheduling the resource blocks to be allocated according to the resource scheduling priority.
In addition, the logic instructions in the memory may be implemented in the form of software functional units and may be stored in a computer readable storage medium when sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a device for dynamically scheduling power grid resources, or a network device) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. Based on such understanding, the foregoing technical solutions may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a device for dynamically scheduling power grid resources, or a network device, etc.) to execute the method for dynamically scheduling power grid resources according to the embodiments or some parts of the embodiments.
In addition, in the present invention, terms such as "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Moreover, in the present invention, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Furthermore, in the description herein, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A method for dynamically scheduling power grid resources is characterized by comprising the following steps:
acquiring resource scheduling requests of a plurality of users at the current time and a plurality of resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing time delay of each user; the user is a network slicing user;
determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay;
and scheduling the resource blocks to be allocated according to the resource scheduling priority.
2. The method according to claim 1, wherein the scheduling the resource blocks to be allocated according to the resource scheduling priority comprises:
determining a first user set according to the resource scheduling priority; each user in the first user set corresponds to a different base station; the resource scheduling priority of each user in the first user set is the highest among a plurality of users covered by the corresponding base station;
determining a signal-to-interference-and-noise ratio corresponding to each base station according to the first user set;
determining the transmitting power of each base station according to the signal-to-interference-and-noise ratio corresponding to each base station;
and correspondingly allocating the resource blocks to be allocated to users in the first user set according to the transmitting power of each base station.
3. The method for dynamically scheduling power grid resources according to claim 1, wherein the resource transmission rate is determined by a channel bandwidth corresponding to the user, a noise power and a transmission power of a base station; and the transmitting power of the base station corresponding to each user in the plurality of users is equal.
4. The method according to claim 2, wherein the determining the transmission power of each base station according to the sinr corresponding to each base station comprises:
determining a first base station and an upper limit of the transmitting power according to the signal to interference plus noise ratio corresponding to each base station; the signal-to-interference-and-noise ratio corresponding to the first base station is the lowest;
taking the upper limit of the transmission power as the transmission power of the first base station;
determining the transmitting power of the second base station according to the principle of equal signal-to-interference-and-noise ratio; the second base station is a base station except the first base station in a plurality of base stations corresponding to the first user set.
5. The method of claim 1, wherein after the scheduling the resource blocks to be allocated according to the resource scheduling priority, the method further comprises:
deleting the plurality of resource blocks to be allocated from a current resource block list;
judging whether the resource block list is empty or not;
if the resource block list is empty, finishing scheduling, otherwise, continuing to distribute until the resource block list is empty.
6. An apparatus for dynamically scheduling power grid resources, comprising:
the system comprises an acquisition module, a resource scheduling module and a resource allocation module, wherein the acquisition module is used for acquiring resource scheduling requests of a plurality of users at the current moment and a plurality of resource blocks to be allocated from different base stations; the resource scheduling request comprises the data volume to be sent, the resource transmission rate and the data packet queuing delay of each user; the user is a network slicing user;
the processing module is used for determining the resource scheduling priority of each user according to the data volume to be sent, the resource transmission rate and the data packet queuing delay;
and scheduling the resource blocks to be allocated according to the resource scheduling priority.
7. The apparatus for dynamically scheduling power grid resources according to claim 6, wherein the processing module is specifically configured to:
determining a first user set according to the resource scheduling priority; each user in the first user set corresponds to a different base station; the resource scheduling priority of each user in the first user set is highest in a plurality of users covered by the corresponding base station;
determining a signal-to-interference-and-noise ratio corresponding to each base station according to the first user set;
determining the transmitting power of each base station according to the signal-to-interference-and-noise ratio corresponding to each base station;
and correspondingly allocating the resource blocks to be allocated to users in the first user set according to the transmitting power of each base station.
8. The device for dynamically scheduling power grid resources according to claim 7, wherein the obtaining process is specifically configured to:
determining a first base station and an upper limit of the transmitting power according to the signal-to-interference-and-noise ratio corresponding to each base station; the signal-to-interference-and-noise ratio corresponding to the first base station is the lowest;
taking the upper limit of the transmission power as the transmission power of the first base station;
determining the transmitting power of the second base station according to the principle of equal signal-to-interference-and-noise ratio; the second base station is a base station except the first base station in a plurality of base stations corresponding to the first user set.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1 to 5 are implemented when the processor executes the program.
10. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210003200.7A CN114521027A (en) | 2022-01-04 | 2022-01-04 | Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210003200.7A CN114521027A (en) | 2022-01-04 | 2022-01-04 | Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114521027A true CN114521027A (en) | 2022-05-20 |
Family
ID=81596538
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210003200.7A Pending CN114521027A (en) | 2022-01-04 | 2022-01-04 | Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114521027A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115942443A (en) * | 2023-03-10 | 2023-04-07 | 深圳国人无线通信有限公司 | Downlink power adjustment method and system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103781118A (en) * | 2014-01-14 | 2014-05-07 | 西安电子科技大学 | Heterogeneous wireless network access control and resource distribution joint method based on multiple services |
| CN106937393A (en) * | 2017-04-25 | 2017-07-07 | 电子科技大学 | A kind of scheduling method for wireless resource based on priority |
| CN107567088A (en) * | 2017-09-13 | 2018-01-09 | 海南大学 | Poewr control method and device, storage medium and terminal device based on terminal direct connection |
| CN108366427A (en) * | 2018-03-16 | 2018-08-03 | 西安电子科技大学 | Throughput of system and efficiency balance method based on power control in D2D communications |
| CN111586646A (en) * | 2020-05-27 | 2020-08-25 | 重庆大学 | Resource allocation method for D2D communication combining uplink and downlink channels in cellular network |
| US20200305169A1 (en) * | 2019-03-20 | 2020-09-24 | Lenovo (Singapore) Pte. Ltd. | Multiple resource allocation mode configurations |
| CN111770581A (en) * | 2020-06-30 | 2020-10-13 | 广东电网有限责任公司 | Power communication network wireless resource scheduling method and device |
| CN112543508A (en) * | 2020-12-17 | 2021-03-23 | 国网安徽省电力有限公司信息通信分公司 | Wireless resource allocation method and network architecture for 5G network slice |
-
2022
- 2022-01-04 CN CN202210003200.7A patent/CN114521027A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103781118A (en) * | 2014-01-14 | 2014-05-07 | 西安电子科技大学 | Heterogeneous wireless network access control and resource distribution joint method based on multiple services |
| CN106937393A (en) * | 2017-04-25 | 2017-07-07 | 电子科技大学 | A kind of scheduling method for wireless resource based on priority |
| CN107567088A (en) * | 2017-09-13 | 2018-01-09 | 海南大学 | Poewr control method and device, storage medium and terminal device based on terminal direct connection |
| CN108366427A (en) * | 2018-03-16 | 2018-08-03 | 西安电子科技大学 | Throughput of system and efficiency balance method based on power control in D2D communications |
| US20200305169A1 (en) * | 2019-03-20 | 2020-09-24 | Lenovo (Singapore) Pte. Ltd. | Multiple resource allocation mode configurations |
| CN111586646A (en) * | 2020-05-27 | 2020-08-25 | 重庆大学 | Resource allocation method for D2D communication combining uplink and downlink channels in cellular network |
| CN111770581A (en) * | 2020-06-30 | 2020-10-13 | 广东电网有限责任公司 | Power communication network wireless resource scheduling method and device |
| CN112543508A (en) * | 2020-12-17 | 2021-03-23 | 国网安徽省电力有限公司信息通信分公司 | Wireless resource allocation method and network architecture for 5G network slice |
Non-Patent Citations (2)
| Title |
|---|
| ZHENGYUAN LIU: "Intelligent and Energy-efficient Distributed Resource Allocation for 5G Cloud Radio Access Networkd", 2021 17TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT, 2 December 2021 (2021-12-02) * |
| 陈强: "基于改进式贪婪算法的5G网络切片动态资源调度策略", 网络与信息安全学报第4卷第7期, 15 July 2018 (2018-07-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115942443A (en) * | 2023-03-10 | 2023-04-07 | 深圳国人无线通信有限公司 | Downlink power adjustment method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106900011B (en) | MEC-based task unloading method between cellular base stations | |
| Liu et al. | Economically optimal MS association for multimedia content delivery in cache-enabled heterogeneous cloud radio access networks | |
| Wang et al. | Carrier load balancing and packet scheduling for multi-carrier systems | |
| TWI390883B (en) | Method and apparatus to support sdma transmission in a ofdma based network | |
| EP2421295B1 (en) | Downlink inter-cell interference coordination method and base station | |
| JP4991833B2 (en) | Dynamic resource allocation method and apparatus in multi-cell wireless communication system | |
| KR100798854B1 (en) | Method for Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System | |
| JP5322906B2 (en) | Base station apparatus and scheduling method | |
| US20110077041A1 (en) | Method and device for user scheduling and managing transmit power in a communication system | |
| CN112543508A (en) | Wireless resource allocation method and network architecture for 5G network slice | |
| CN114271005B (en) | Control device | |
| CN101674680A (en) | Method and device for allocating bands and base station | |
| CN105451241A (en) | Maximum and minimum fairness resource distribution method in heterogeneous network based on interference coordination | |
| Chuck et al. | Bandwidth recycling in IEEE 802.16 networks | |
| CN102158962A (en) | Clustering method, resource allocation method and related equipment for base station cooperation | |
| CN104902484B (en) | LTE inter-cell interference coordination methods and device | |
| Shajaiah et al. | Towards an application-aware resource scheduling with carrier aggregation in cellular systems | |
| CN106572497A (en) | Heuristic D2D resource allocation method based on proportional-fair algorithm | |
| CN114521027A (en) | Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium | |
| CN103748950A (en) | Scheduling and allocation method and device in coordinated multiple point system | |
| CN114641036A (en) | Load balancing method and device, base station and computer readable storage medium | |
| Chen et al. | Virtualized radio resource pre-allocation for QoS based resource efficiency in mobile networks | |
| Fooladivanda et al. | Joint user association and resource allocation in heterogeneous cellular networks: Comparison of two modeling approaches | |
| CN116633401A (en) | Beam scheduling method, device, system, communication equipment and storage medium | |
| CN113115401B (en) | Access control method for maximizing satisfied user number in cellular network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |