CN112437494A - Resource allocation method and device - Google Patents
Resource allocation method and device Download PDFInfo
- Publication number
- CN112437494A CN112437494A CN202011328208.8A CN202011328208A CN112437494A CN 112437494 A CN112437494 A CN 112437494A CN 202011328208 A CN202011328208 A CN 202011328208A CN 112437494 A CN112437494 A CN 112437494A
- Authority
- CN
- China
- Prior art keywords
- resource
- scheduling algorithm
- nodes
- resource allocation
- node
- 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
- 238000013468 resource allocation Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 87
- 238000004891 communication Methods 0.000 claims abstract description 39
- 238000012544 monitoring process Methods 0.000 claims abstract description 11
- 230000011664 signaling Effects 0.000 claims description 11
- 230000005540 biological transmission Effects 0.000 description 14
- 238000010586 diagram Methods 0.000 description 11
- 238000005516 engineering process Methods 0.000 description 4
- 239000000969 carrier Substances 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 241001522296 Erithacus rubecula Species 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 241001025261 Neoraja caerulea Species 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000000712 assembly Effects 0.000 description 1
- 238000000429 assembly Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000005059 dormancy Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000007958 sleep Effects 0.000 description 1
- 239000002904 solvent Substances 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 239000000126 substance Substances 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/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- 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/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment discloses a resource allocation method and device, and relates to the field of communication. Wherein, the method comprises the following steps: broadcasting a resource request to all nodes; monitoring the resource requests transmitted by all nodes, and acquiring corresponding node information from the resource requests; calculating all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm to obtain a resource allocation result and form a resource allocation strategy; and sending communication data according to the resource allocation strategy. By adopting the method, the excessive dependence on individual nodes including the central node is effectively reduced, the self-adaptability is strong, and the reliability of communication is ensured.
Description
Technical Field
The present disclosure relates to the field of communications, and in particular, to a resource allocation method and apparatus.
Background
High-speed data buses are widely used in the fields of aerospace, weaponry, etc., and these bus technologies have higher requirements in terms of reliability and latency than conventional civilian communication systems. Some mature technical standards include: the very early MIL-STD-1553B standard, the FC-AE-1553 draft based on optical fiber, the AFDX standard of Ethernet, etc.
In the prior art, nodes for near field communication are generally fewer, and an available bandwidth is larger, for example, an available frequency band of 100MHz may exist in a millimeter wave band, that is, a frequency band resource for near field communication is rich. In order to improve the reliability of the communication system, the communication system often adopts an ad hoc mode to realize multi-node communication; the communication nodes can multiplex the same frequency resource in a multi-carrier modulation mode. Generally, a central scheduling method can simplify the allocation of system resources, for example, NC (Network controller) nodes (hereinafter, referred to as NC) are responsible for the transmission requests and resource allocation of all NT (Network terminal) nodes (hereinafter, referred to as NT), and this method can greatly reduce the algorithm of resource allocation and can coordinate the transmission among a plurality of nodes; however, the central node based scheduling also brings problems: for example, data transmission between nodes needs to be forwarded through the NC; if NC is in fault, the whole communication system is completely paralyzed, etc.; these problems need to be avoided to the utmost for communication systems, especially for aerospace and other communication scenarios where high reliability is required.
Disclosure of Invention
In view of the above technical problems in the prior art, the embodiments of the present disclosure provide a resource allocation method and apparatus, which can solve the problems in the prior art, such as strong dependency on individual nodes, low transmission efficiency, and low accuracy.
A first aspect of the embodiments of the present disclosure provides a resource allocation method, including:
broadcasting a resource request to all nodes;
monitoring the resource requests transmitted by all nodes, and acquiring corresponding node information from the resource requests;
calculating all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm to obtain a resource allocation result and form a resource allocation strategy;
and sending communication data according to the resource allocation strategy.
In some embodiments, the method further comprises: calculating corresponding broadcast resources according to the node information; and generating the resource request according to the broadcast resource.
In some embodiments, the method further comprises: and periodically sending control signaling by using the broadcast resource.
In some embodiments, the control signaling includes at least channel state information, quality of service, buffer status report, and destination node address.
In some embodiments, the resource request further includes a resource scheduling algorithm identifier of the corresponding node.
In some embodiments, the method further comprises: and verifying the validity of the resource scheduling algorithm of the node by acquiring the resource scheduling algorithm of other nodes.
In some embodiments, the method further comprises: and updating the resource scheduling algorithm.
In some embodiments, updating the resource scheduling algorithm specifically includes:
sending a request for updating the resource scheduling algorithm to all nodes;
when all nodes receive the request, updating and selecting the resource scheduling algorithm in a preset period;
and judging whether to update the resource scheduling algorithm according to a preset update strategy.
In some embodiments, the preset update policy specifically includes: and when the quantity of the requests for updating the resource scheduling algorithm is larger than a preset threshold value, the node updates the resource scheduling algorithm.
A second aspect of the embodiments of the present disclosure provides a resource allocation apparatus, including:
a broadcast module for broadcasting the resource request to all nodes;
the monitoring module is used for monitoring the resource requests transmitted by all the nodes and acquiring source node information from the resource requests;
the resource allocation strategy generation module is used for calculating all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm to obtain a resource allocation result and form a resource allocation strategy;
and the sending module is used for sending the communication data according to the resource allocation strategy.
A third aspect of the embodiments of the present disclosure provides an electronic device, including:
a memory and one or more processors;
wherein the memory is communicatively coupled to the one or more processors, and the memory stores instructions executable by the one or more processors, and when the instructions are executed by the one or more processors, the electronic device is configured to implement the method according to the foregoing embodiments.
A fourth aspect of the embodiments of the present disclosure provides a computer-readable storage medium having stored thereon computer-executable instructions, which, when executed by a computing device, may be used to implement the method according to the foregoing embodiments.
A fifth aspect of embodiments of the present disclosure provides a computer program product comprising a computer program stored on a computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, are operable to implement a method as in the preceding embodiments.
The beneficial effects of the embodiment of the disclosure are: and acquiring a resource allocation result by monitoring resource requests of all nodes and a preset resource scheduling algorithm, forming a resource allocation strategy, and sending communication data according to the resource allocation strategy. By adopting the method, the excessive dependence on individual nodes including the central node is effectively reduced, the self-adaptability is strong, and the reliability of communication is ensured.
Drawings
The features and advantages of the present disclosure will be more clearly understood by reference to the accompanying drawings, which are illustrative and not to be construed as limiting the disclosure in any way, and in which:
FIG. 1 is a flow diagram illustrating a method of resource allocation according to some embodiments of the present disclosure;
FIG. 2 is a diagram of a specific example application of a resource allocation method according to some embodiments of the present disclosure;
FIG. 3 is a diagram of a specific example application of a resource allocation method according to some embodiments of the present disclosure;
FIG. 4 is a schematic illustration of a request to update a resource scheduling algorithm, according to some embodiments of the present disclosure;
FIG. 5 is a schematic diagram illustrating a flow application of an update resource scheduling algorithm according to some embodiments of the present disclosure;
FIG. 6 is a schematic structural diagram of a resource allocation apparatus according to some embodiments of the present disclosure;
fig. 7 is a schematic structural diagram of an electronic device according to some embodiments of the present disclosure.
Detailed Description
In the following detailed description, numerous specific details of the disclosure are set forth by way of examples in order to provide a thorough understanding of the relevant disclosure. However, it will be apparent to one of ordinary skill in the art that the present disclosure may be practiced without these specific details. It should be understood that the use of the terms "system," "apparatus," "unit" and/or "module" in this disclosure is a method for distinguishing between different components, elements, portions or assemblies at different levels of sequence. However, these terms may be replaced by other expressions if they can achieve the same purpose.
It will be understood that when a device, unit or module is referred to as being "on" … … "," connected to "or" coupled to "another device, unit or module, it can be directly on, connected or coupled to or in communication with the other device, unit or module, or intervening devices, units or modules may be present, unless the context clearly dictates otherwise. For example, as used in this disclosure, the term "and/or" includes any and all combinations of one or more of the associated listed items.
The terminology used in the present disclosure is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present disclosure. As used in the specification and claims of this disclosure, the terms "a," "an," "the," and/or "the" are not intended to be inclusive in the singular, but rather are inclusive in the plural, unless the context clearly dictates otherwise. In general, the terms "comprises" and "comprising" are intended to cover only the explicitly identified features, integers, steps, operations, elements, and/or components, but not to constitute an exclusive list of such features, integers, steps, operations, elements, and/or components.
These and other features and characteristics of the present disclosure, as well as the methods of operation and functions of the related elements of structure and the combination of parts and economies of manufacture, will be better understood by reference to the following description and drawings, which form a part of this specification. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the disclosure. It will be understood that the figures are not drawn to scale.
Various block diagrams are used in this disclosure to illustrate various variations of embodiments according to the disclosure. It should be understood that the foregoing and following structures are not intended to limit the present disclosure. The protection scope of the present disclosure is subject to the claims.
In the prior art, nodes for near field communication are generally fewer, and an available bandwidth is larger, for example, an available frequency band of 100MHz may exist in a millimeter wave band, that is, a frequency band resource for near field communication is rich. In order to improve the reliability of the communication system, the communication system often adopts an ad hoc mode to realize multi-node communication; the communication nodes can multiplex the same frequency resource in a multi-carrier modulation mode. Generally, a central scheduling method can simplify the allocation of system resources, for example, NC (Network controller) nodes (hereinafter, referred to as NC) are responsible for the transmission requests and resource allocation of all NT (Network terminal) nodes (hereinafter, referred to as NT), and this method can greatly reduce the algorithm of resource allocation and can coordinate the transmission among a plurality of nodes; however, the central node based scheduling also brings problems: for example, data transmission between nodes needs to be forwarded through the NC; if NC is in fault, the whole communication system is completely paralyzed, etc.; these problems need to be avoided to the utmost for communication systems, especially for aerospace and other communication scenarios where high reliability is required.
To solve the above problem, an embodiment of the present disclosure provides a resource allocation method, as shown in fig. 1, specifically including:
s101, broadcasting a resource request to all nodes;
s102, monitoring the resource requests transmitted by all nodes, and acquiring corresponding node information from the resource requests;
s103, calculating all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm to obtain a resource allocation result and form a resource allocation strategy;
and S104, sending communication data according to the resource allocation strategy.
In some embodiments, the method further comprises: calculating corresponding broadcast resources according to the node information; and generating the resource request according to the broadcast resource.
In some embodiments, the method further comprises: and periodically sending control signaling by using the broadcast resource.
In some embodiments, the control signaling includes at least channel state information, quality of service, buffer status report, and destination node address.
In some embodiments, the resource request further includes a resource scheduling algorithm identifier of the corresponding node.
In some embodiments, the method further comprises: and verifying the validity of the resource scheduling algorithm of the node by acquiring the resource scheduling algorithm of other nodes.
In some embodiments, the method further comprises: and updating the resource scheduling algorithm.
In some embodiments, updating the resource scheduling algorithm specifically includes:
sending a request for updating the resource scheduling algorithm to all nodes;
when all nodes receive the request, updating and selecting the resource scheduling algorithm in a preset period;
and judging whether to update the resource scheduling algorithm according to a preset update strategy.
In some embodiments, the preset update policy specifically includes: and when the quantity of the requests for updating the resource scheduling algorithm is larger than a preset threshold value, the node updates the resource scheduling algorithm.
In the disclosed embodiment, a part of subcarriers are fixedly used for forming a basic full-duplex wireless communication network, the redundant subcarriers are uniformly placed in a virtual resource pool, when any node needs a large bandwidth, a block chain technology is adopted to initiate an application to the virtual resource pool, each node carries out examination and approval through the same mutual trust and arbitration mechanism, the node is allowed to obtain subcarrier resources, meanwhile, the impression of subcarrier occupation of the whole system is also reserved, and the subsequent application can be automatically avoided. After the node finishes high bandwidth transmission, the corresponding sub-carriers are released to the resource pool, and other nodes can reapply for using the resources.
Specifically, as shown in fig. 2 and fig. 3, a specific exemplary application diagram of a resource allocation method is presented. 2 OFDM symbols and 2 carriers in the current data frame are distributed into a resource block; the resource block is used for one node (NT # 1 or NT # 2 or NT #3) to transmit a broadcast signal, and the other resources are used for transmitting a data signal.
More specifically, in the initial access stage of each node, each node may calculate a broadcast resource corresponding to itself according to its node information (e.g., ID); in addition, each node periodically transmits its own control signaling on the broadcast resources.
In the broadcast resource, the control signaling transmitted by a node at least comprises information required by scheduling algorithms such as channel state, service quality, buffer quantity and the like; unlike the scheduling with a central node, the control signaling also includes the address of the target node to be sent.
Further, all nodes use the same resource Scheduling Algorithm (Scheduling Algorithm), and after all nodes learn the resource request signals of the other nodes, all variables including node information are input into the Scheduling Algorithm, and since the Scheduling Algorithm is predetermined, the output result is also predetermined, which may be specifically described by the following formula:
wherein the content of the first and second substances,
meaning that the mth resource is allocated to node k;
CSI is the abbreviation of Channel State Information, namely Channel State Information, then
]Is the channel state of N (N is more than or equal to 0 and is a natural number) nodes, wherein each channel state can comprise the channel state of the node to the target node;
QOS is an abbreviation of Quality of Service, then
]Quality of service for N nodes;
BSR is an abbreviation of Buffer Status Report, then
It can be seen from this that
By which algorithm is used, the calculated resource allocation will be unique, i.e. there is a consensus among all nodes, as long as CSI, QOS, BSR etc data is entered into the scheduling algorithm at each node, which is consistent with the result of calculating the scheduling algorithm from one single node. In addition, the scheduling results are sharedIf so, the nodes do not need to send the scheduling instruction, but directly send the scheduling instruction in the broadcast resource according to the calculation result.
In particular, the amount of the solvent to be used,
various algorithms may be used, such as round robin scheduling, PFS, or latency limited algorithm, among others. For example, when the data among the nodes is less and the spectrum resources are rich, a simple scheduling method may use a round robin scheduling algorithm; the user broadcast resources and data resources can be kept aligned at this time to simplify the complexity of transmission. When the resources are more tight, a latency limited algorithm can be used to ensure the lowest delay of the transmission between the nodes.
Further, variations in data transmission traffic may require different resource scheduling algorithms to be used. Accordingly, the method further comprises updating the resource allocation policy. The resource scheduling algorithm must be consistent in the whole system to realize the resource allocation. Therefore, one aspect of the present invention further includes that each node broadcasts its own current resource scheduling algorithm identification on the broadcast resources. And each node checks the validity of the current resource scheduling algorithm according to the received resource scheduling algorithm identification of other nodes. For example, when a node just intervenes in the communication system, it is recognized that all other nodes use the same resource scheduling algorithm as their own resource scheduling algorithm, and at this time, it considers itself to access resource scheduling. And if other nodes all use the resource scheduling algorithm different from the self resource scheduling algorithm, the self resource scheduling algorithm is changed.
Further, when any node recognizes that the current resource scheduling algorithm does not meet the service requirement, the broadcast channel may send a request for updating the resource scheduling algorithm when broadcasting the service requirement. At this time, the node may transmit the target resource scheduling algorithm and parameters required for the request to all nodes through a data channel or a broadcast channel. FIG. 4 shows a schematic diagram of a request for updating the resource scheduling algorithm, in which NT # 1 sends a request indication on its own broadcast channel and is currently in the current statusParameters required by updating the broadcast resource allocation strategy in the data resources periodically allocated to the user; the method specifically comprises the following steps: target resource scheduling algorithm
The node service change, the node service statistics, the whole node service change, the whole node service statistics and the like.
Furthermore, after all the nodes receive the request for updating the resource scheduling algorithm, recalculation can be carried out, and the resource scheduling algorithm is provided for updating and selecting in a preset period. The specific result may be the same as or different from the result of the NT # 1 request. In addition, whether the current resource scheduling algorithm is updated or not can be judged according to the updating strategy stored by each node; specifically, all nodes may update the default resource scheduling algorithm based on the number of update requests being greater than a certain preset threshold.
The embodiment of the present disclosure further provides a schematic diagram of a process application for updating a resource scheduling algorithm, as shown in fig. 5. In the first frame, NT # 1 initiates an update request, in a plurality of subsequent periods, other NTs indicate to update the resource scheduling algorithm in the broadcast resource, and finally, in the nth frame, the whole system switches to the second resource scheduling algorithm. For example, the first resource scheduling algorithm is a PFS scheduling algorithm, and at this time, the entire system can allocate transmission resources more evenly, so as to satisfy basic data transmission between nodes. However, when some sensors in the dormancy start to be started and the service type is the transmission of the ultra-low delay, the activated nodes lift the resource scheduling algorithm for consensus updating, the new algorithm is converted into a latency limited scheduling algorithm, the ultra-low delay service is scheduled preferentially at the moment, and the common service is scheduled after meeting the ultra-low delay service.
It should be noted that the above examples are only for more clearly describing the embodiments of the present disclosure; in practical applications, in a 100MHz system, the number of carriers that can be allocated to broadcast signals is much more than 2, which is caused by the large number of control signaling bits.
The embodiment of the disclosure discloses a resource allocation method, which realizes that if one node fails or sleeps, the node keeps silent in the reserved signaling resource. However, since the resource scheduling algorithm is stored in each node, each node can still perform effective communication, and after a period of time, at least one node initiates an update of the resource scheduling algorithm, and since the relevant parameters include recent traffic statistics of the node, the updated resource scheduling algorithm selects a more optimal algorithm based on the fact that the node is lost. Therefore, the whole system can always keep reliable and self-adaptive, and the system can not fail due to the failure of an individual node.
The embodiment of the present disclosure further provides a resource allocation apparatus 200, as shown in fig. 6, including:
a broadcasting module 201, configured to broadcast a resource request to all nodes;
the monitoring module 202 is configured to monitor resource requests sent by all nodes, and acquire source node information from the resource requests;
a resource allocation policy generation module 203, configured to calculate all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm, obtain a resource allocation result, and form a resource allocation policy;
a sending module 204, configured to send communication data according to the resource allocation policy.
Referring to fig. 7, a schematic diagram of an electronic device provided for an embodiment of the present disclosure, the electronic device 600 includes:
wherein the memory 630 is communicatively coupled to the one or more processors 610, the memory 630 having stored therein instructions 632 executable by the one or more processors 610, the instructions 632 being executable by the one or more processors 610 to cause the one or more processors 610 to perform the methods of the foregoing embodiments of the disclosure.
Specifically, the processor 610 and the memory 630 may be connected by a bus or other means, such as a bus 640. Processor 610 may be a Central Processing Unit (CPU). The Processor 610 may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, or combinations thereof.
The memory 630, as a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as the cascaded progressive network in the embodiments of the present disclosure. The processor 610 executes various functional applications of the processor and data processing by executing non-transitory software programs, instructions, and modules 632 stored in the memory 630.
The memory 630 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by the processor 610, and the like. Further, the memory 630 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 630 optionally includes memory located remotely from processor 610, which may be connected to processor 610 via a network, such as through communications interface 620. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
An embodiment of the present disclosure also provides a computer-readable storage medium, in which computer-executable instructions are stored, and the computer-executable instructions are executed to perform the method in the foregoing embodiment of the present disclosure.
The foregoing computer-readable storage media include physical volatile and nonvolatile, removable and non-removable media implemented in any manner or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. The computer-readable storage medium specifically includes, but is not limited to, a USB flash drive, a removable hard drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), an erasable programmable Read-Only Memory (EPROM), an electrically erasable programmable Read-Only Memory (EEPROM), flash Memory or other solid state Memory technology, a CD-ROM, a Digital Versatile Disk (DVD), an HD-DVD, a Blue-Ray or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
While the subject matter described herein is provided in the general context of execution in conjunction with the execution of an operating system and application programs on a computer system, those skilled in the art will recognize that other implementations may also be performed in combination with other types of program modules. Generally, program modules include routines, programs, components, data structures, and other types of structures that perform particular tasks or implement particular abstract data types. Those skilled in the art will appreciate that the subject matter described herein may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like, as well as distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
Those of ordinary skill in the art will appreciate that the various illustrative elements and method steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present disclosure may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present disclosure.
In summary, the present disclosure provides a resource allocation method, a resource allocation apparatus, an electronic device and a computer-readable storage medium thereof. And acquiring a resource allocation result by monitoring resource requests of all nodes and a preset resource scheduling algorithm, forming a resource allocation strategy, and sending communication data according to the resource allocation strategy. By adopting the method, the excessive dependence on individual nodes including the central node is effectively reduced, the self-adaptability is strong, and the reliability of communication is ensured.
It is to be understood that the above-described specific embodiments of the present disclosure are merely illustrative of or illustrative of the principles of the present disclosure and are not to be construed as limiting the present disclosure. Accordingly, any modification, equivalent replacement, improvement or the like made without departing from the spirit and scope of the present disclosure should be included in the protection scope of the present disclosure. Further, it is intended that the following claims cover all such variations and modifications that fall within the scope and bounds of the appended claims, or equivalents of such scope and bounds.
Claims (10)
1. A method for resource allocation, comprising:
broadcasting a resource request to all nodes;
monitoring the resource requests transmitted by all nodes, and acquiring corresponding node information from the resource requests;
calculating all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm to obtain a resource allocation result and form a resource allocation strategy;
and sending communication data according to the resource allocation strategy.
2. The method of claim 1, further comprising: calculating corresponding broadcast resources according to the node information; and generating the resource request according to the broadcast resource.
3. The method of claim 2, further comprising: and periodically sending control signaling by using the broadcast resource.
4. The method of claim 3, wherein the control signaling comprises at least channel state information, quality of service, buffer status report, and destination node address.
5. The method of claim 1, wherein the resource request further includes a resource scheduling algorithm identifier of the corresponding node.
6. The method of claim 5, further comprising: and verifying the validity of the resource scheduling algorithm of the node by acquiring the resource scheduling algorithm of other nodes.
7. The method of claim 1, further comprising: and updating the resource scheduling algorithm.
8. The method according to claim 7, wherein updating the resource scheduling algorithm specifically comprises:
sending a request for updating the resource scheduling algorithm to all nodes;
when all nodes receive the request, updating and selecting the resource scheduling algorithm in a preset period;
and judging whether to update the resource scheduling algorithm according to a preset update strategy.
9. The method according to claim 8, wherein the preset update policy specifically includes: and when the quantity of the requests for updating the resource scheduling algorithm is larger than a preset threshold value, the node updates the resource scheduling algorithm.
10. A resource allocation apparatus, comprising:
a broadcast module for broadcasting the resource request to all nodes;
the monitoring module is used for monitoring the resource requests transmitted by all the nodes and acquiring source node information from the resource requests;
the resource allocation strategy generation module is used for calculating all resource requests received in a preset period according to the node information and a preset resource scheduling algorithm to obtain a resource allocation result and form a resource allocation strategy;
and the sending module is used for sending the communication data according to the resource allocation strategy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011328208.8A CN112437494A (en) | 2020-11-24 | 2020-11-24 | Resource allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011328208.8A CN112437494A (en) | 2020-11-24 | 2020-11-24 | Resource allocation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112437494A true CN112437494A (en) | 2021-03-02 |
Family
ID=74694567
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011328208.8A Pending CN112437494A (en) | 2020-11-24 | 2020-11-24 | Resource allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112437494A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113099535A (en) * | 2021-03-29 | 2021-07-09 | 北京邮电大学 | Power communication multi-service bearing method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104796901A (en) * | 2015-04-21 | 2015-07-22 | 上海交通大学 | Method for dynamically distributing distributed spectrum resources |
| WO2015180169A1 (en) * | 2014-05-30 | 2015-12-03 | 华为技术有限公司 | Resource allocation method and device |
| US20150373700A1 (en) * | 2014-06-18 | 2015-12-24 | Motorola Solutions, Inc | Methods and systems for node operation according to network-wide resource-allocation schedules |
-
2020
- 2020-11-24 CN CN202011328208.8A patent/CN112437494A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015180169A1 (en) * | 2014-05-30 | 2015-12-03 | 华为技术有限公司 | Resource allocation method and device |
| CN106416173A (en) * | 2014-05-30 | 2017-02-15 | 华为技术有限公司 | Resource allocation method and device |
| US20150373700A1 (en) * | 2014-06-18 | 2015-12-24 | Motorola Solutions, Inc | Methods and systems for node operation according to network-wide resource-allocation schedules |
| CN104796901A (en) * | 2015-04-21 | 2015-07-22 | 上海交通大学 | Method for dynamically distributing distributed spectrum resources |
Non-Patent Citations (1)
| Title |
|---|
| 春哥大魔王: "分布式概念-去中心化副本控制实现", Retrieved from the Internet <URL:https://cloud.tencent.com/developer/article/1591153> * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113099535A (en) * | 2021-03-29 | 2021-07-09 | 北京邮电大学 | Power communication multi-service bearing method and device |
| CN113099535B (en) * | 2021-03-29 | 2022-08-12 | 北京邮电大学 | Power communication multi-service bearing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107528680B (en) | Real-time transmission method and device based on industrial internet field layer bus architecture | |
| WO2018059564A1 (en) | Method and device for determining discontinuous reception configuration | |
| CN110839248B (en) | Configuration method and equipment | |
| US9094984B2 (en) | Avoiding collisions between semi-persistent allocation and dynamic allocation in radio access networks | |
| KR20110061578A (en) | Coordinating data delivery using time suggestions | |
| IL269497B2 (en) | Method for transmitting data, terminal device, and network device | |
| WO2004031918A2 (en) | Method to convey uplink traffic information | |
| CN110324897B (en) | Frequency domain resource allocation indication information sending method and device, frequency domain resource allocation indication information receiving method and device, storage medium, base station and user terminal | |
| CN109392169B (en) | Data transmission method, terminal and base station | |
| CN108551668B (en) | Information transmission method, device, equipment and storage medium | |
| US9455907B1 (en) | Multithreaded parallel packet processing in network devices | |
| US20190098648A1 (en) | Air Interface Resource Allocation Method and Network Device | |
| JP2021517783A (en) | CSI report transmission method, terminal equipment and network equipment | |
| CN108063653B (en) | Time delay control method, device and system | |
| US20220104213A1 (en) | Method of scheduling plurality of packets related to tasks of plurality of user equipments using artificial intelligence and electronic device performing the method | |
| US9756654B2 (en) | Timer-based scheme for user equipment queue state estimation | |
| CN104581967A (en) | Method for adjusting contention access resource, and method and device for sending contention access request | |
| CN112437494A (en) | Resource allocation method and device | |
| CN107295643B (en) | Scheduling method, device and equipment | |
| WO2022218516A1 (en) | Devices and methods for collaborative learning of a transmission policy in wireless networks | |
| CN112436930A (en) | Communication method and device | |
| CN114666279B (en) | Method and system for issuing PCC session management policy in 5G system | |
| CN112399470B (en) | LoRa communication method, loRa gateway, loRa system and computer readable storage medium | |
| CN114640630B (en) | Flow control method, device, equipment and readable storage medium | |
| US20190108060A1 (en) | Mobile resource scheduler |
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 |