A resource allocation method and device

Abstract

This embodiment discloses a resource allocation method and device, which relates to the field of communications. The method includes: broadcasting resource requests to all nodes; monitoring the resource requests from all nodes and obtaining corresponding node information from the resource requests; calculating all resource requests received within a preset period according to the node information and a preset resource scheduling algorithm, obtaining resource allocation results, and forming a resource allocation strategy; sending communication data according to the resource allocation strategy. By adopting this method, excessive dependence on individual nodes including central nodes is effectively reduced, the adaptability is strong, and the reliability of communication is guaranteed.

Description

Technical Field

[0001] The present disclosure relates to the field of communications, and in particular to a resource allocation method and device. Background Art

[0002] High-speed data buses are widely used in aerospace, weapons and equipment, and other fields. Compared with traditional civilian communication systems, these bus technologies have higher requirements in terms of reliability and latency. Some mature technical standards include: the very early MIL-STD-1553B standard, the fiber-based FC-AE-1553 draft, and the Ethernet AFDX standard.

[0003] In the prior art, there are generally fewer nodes for near-field communication and a larger available bandwidth. For example, there may be an available frequency band of 100MHz in the millimeter wave band, that is, the frequency band resources for near-field communication are relatively abundant. In order to improve the reliability of the communication system, the communication system often adopts a self-organizing method to realize multi-node communication; the same frequency resources can be reused between communication nodes through multi-carrier modulation. Generally speaking, the central scheduling method can simplify the allocation of system resources. For example, the NC (Network controller) node (hereinafter referred to as NC) is responsible for the transmission requests and resource allocation of all NT (Network terminal) nodes (hereinafter referred to as NT). This method can greatly reduce the resource allocation algorithm and coordinate the transmission between multiple nodes; however, the scheduling based on the central node also brings some problems: for example, data transmission between nodes needs to be forwarded through NC; if NC fails, the entire communication system will be paralyzed, etc.; these problems need to be avoided as much as possible for communication systems, especially for aerospace and other scenarios that require high reliability communication. Summary of the invention

[0004] In view of the above-mentioned technical problems in the prior art, the embodiments of the present disclosure propose a resource allocation method and device, which can solve the problems existing in the prior art such as strong dependence on individual nodes, low transmission efficiency, and low accuracy.

[0005] A first aspect of an embodiment of the present disclosure provides a resource allocation method, including:

[0006] Broadcast resource requests to all nodes;

[0007] Monitor the resource requests from all nodes and obtain corresponding node information from the resource requests;

[0008] Calculate all resource requests received within 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;

[0009] The communication data is sent according to the resource allocation strategy.

[0010] In some embodiments, the method further includes: calculating corresponding broadcast resources according to the node information; and generating the resource request according to the broadcast resources.

[0011] In some embodiments, the method further comprises: periodically sending control signaling using the broadcast resources.

[0012] In some embodiments, the control signaling includes at least channel state information, quality of service, buffer status report and destination node address.

[0013] In some embodiments, the resource request also includes a resource scheduling algorithm identifier of the corresponding node.

[0014] In some embodiments, the method further includes: verifying the legitimacy of its own resource scheduling algorithm by acquiring the resource scheduling algorithms of other nodes.

[0015] In some embodiments, the method further comprises: updating the resource scheduling algorithm.

[0016] In some embodiments, updating the resource scheduling algorithm specifically includes:

[0017] Sending a request to update the resource scheduling algorithm to all nodes;

[0018] When all nodes receive the request, they propose an update selection of the resource scheduling algorithm within a preset period;

[0019] Determine whether to update the resource scheduling algorithm according to a preset update strategy.

[0020] In some embodiments, the preset update strategy specifically includes: when the number of requests for updating the resource scheduling algorithm is greater than a preset threshold, the node updates the resource scheduling algorithm.

[0021] A second aspect of an embodiment of the present disclosure provides a resource allocation device, including:

[0022] Broadcast module, used to broadcast resource requests to all nodes;

[0023] A monitoring module, used to monitor the resource requests from all nodes and obtain source node information from the resource requests;

[0024] A resource allocation strategy generation module, used to calculate all resource requests received within a preset period according to the node information and a preset resource scheduling algorithm, obtain a resource allocation result, and form a resource allocation strategy;

[0025] The sending module is used to send communication data according to the resource allocation strategy.

[0026] A third aspect of the embodiments of the present disclosure provides an electronic device, including:

[0027] memory and one or more processors;

[0028] The memory is communicatively connected to the one or more processors, and the memory stores instructions that can be executed by the one or more processors. When the instructions are executed by the one or more processors, the electronic device is used to implement the methods described in the aforementioned embodiments.

[0029] A fourth aspect of the embodiments of the present disclosure provides a computer-readable storage medium having computer-executable instructions stored thereon. When the computer-executable instructions are executed by a computing device, they can be used to implement the methods described in the aforementioned embodiments.

[0030] A fifth aspect of an embodiment of the present disclosure provides a computer program product, which includes a computer program stored on a computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, they can be used to implement the methods described in the above embodiments.

[0031] The beneficial effect of the embodiment of the present disclosure is that by monitoring the resource requests of all nodes and the preset resource scheduling algorithm, the resource allocation result is obtained, the resource allocation strategy is formed, and the communication data is sent according to the resource allocation strategy. This method effectively reduces the excessive dependence on individual nodes including the central node, has strong adaptability, and ensures the reliability of communication. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] The features and advantages of the present disclosure will be more clearly understood by referring to the accompanying drawings, which are schematic and should not be construed as limiting the present disclosure in any way. In the accompanying drawings:

[0033] Figure 1 is a flow chart of a resource allocation method according to some embodiments of the present disclosure;

[0034] Figure 2 is a specific example application diagram of a resource allocation method according to some embodiments of the present disclosure;

[0035] Figure 3 is a specific example application diagram of a resource allocation method according to some embodiments of the present disclosure;

[0036] Figure 4 is a schematic diagram of a request for updating a resource scheduling algorithm according to some embodiments of the present disclosure;

[0037] Figure 5 is a schematic diagram of a process application of updating a resource scheduling algorithm according to some embodiments of the present disclosure;

[0038] Figure 6 is a structural schematic diagram of a resource allocation device according to some embodiments of the present disclosure;

[0039] Figure 7 It is a schematic diagram of the structure of an electronic device according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0040] In the detailed description below, many specific details of the present disclosure are set forth by way of example 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 can be implemented without these details. It should be understood that the use of the terms "system," "device," "unit," and / or "module" in the present disclosure is a method for distinguishing different parts, elements, parts, or assemblies at different levels in a sequential arrangement. However, these terms may be replaced by other expressions if other expressions can achieve the same purpose.

[0041] It should 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 may be directly on, connected to, coupled to, or communicating with other devices, units or modules, or there may be intermediate devices, units or modules, unless the context clearly indicates an exception. For example, the term "and / or" as used in this disclosure includes any and all combinations of one or more of the relevant listed items.

[0042] The terms used in this disclosure are only for describing specific embodiments and are not intended to limit the scope of this disclosure. As shown in the specification and claims of this disclosure, unless the context clearly indicates an exception, the words "one", "a kind" and / or "the" do not specifically refer to the singular, but may also include the plural. Generally speaking, the terms "include" and "comprise" only indicate the inclusion of clearly identified features, wholes, steps, operations, elements and / or components, and such expressions do not constitute an exclusive list, and other features, wholes, steps, operations, elements and / or components may also be included.

[0043] These and other features and characteristics, methods of operation, functions of related elements of the structure, combinations of parts, and economies of manufacture of the present disclosure may be better understood with reference to the following description and drawings, which form a part of the specification. However, it is to be clearly understood that the drawings are for illustration and description purposes only and are not intended to limit the scope of protection of the present disclosure. It is to be understood that the drawings are not drawn to scale.

[0044] Various structural diagrams are used in this disclosure to illustrate various variations of the embodiments of the present disclosure. It should be understood that the above or below structures are not intended to limit the present disclosure. The scope of protection of the present disclosure shall be subject to the claims.

[0045] In the prior art, there are generally fewer nodes for near-field communication and a larger available bandwidth. For example, there may be an available frequency band of 100MHz in the millimeter wave band, that is, the frequency band resources for near-field communication are relatively abundant. In order to improve the reliability of the communication system, the communication system often adopts a self-organizing method to realize multi-node communication; the same frequency resources can be reused between communication nodes through multi-carrier modulation. Generally speaking, the central scheduling method can simplify the allocation of system resources. For example, the NC (Network controller) node (hereinafter referred to as NC) is responsible for the transmission requests and resource allocation of all NT (Network terminal) nodes (hereinafter referred to as NT). This method can greatly reduce the resource allocation algorithm and coordinate the transmission between multiple nodes; however, the scheduling based on the central node also brings some problems: for example, data transmission between nodes needs to be forwarded through NC; if NC fails, the entire communication system will be paralyzed, etc.; these problems need to be avoided as much as possible for communication systems, especially for aerospace and other scenarios that require high reliability communication.

[0046] To solve the above problems, the present disclosure provides a resource allocation method, such as Figure 1 As shown, specifically including:

[0047] S101, broadcast resource request to all nodes;

[0048] S102, monitoring the resource requests from all nodes, and obtaining corresponding node information from the resource requests;

[0049] S103, calculating all resource requests received within a preset period according to the node information and a preset resource scheduling algorithm, obtaining a resource allocation result, and forming a resource allocation strategy;

[0050] S104: Send communication data according to the resource allocation strategy.

[0051] In some embodiments, the method further includes: calculating corresponding broadcast resources according to the node information; and generating the resource request according to the broadcast resources.

[0052] In some embodiments, the method further comprises: periodically sending control signaling using the broadcast resources.

[0053] In some embodiments, the control signaling includes at least channel state information, quality of service, buffer status report and destination node address.

[0054] In some embodiments, the resource request also includes a resource scheduling algorithm identifier of the corresponding node.

[0055] In some embodiments, the method further includes: verifying the legitimacy of its own resource scheduling algorithm by acquiring the resource scheduling algorithms of other nodes.

[0056] In some embodiments, the method further comprises: updating the resource scheduling algorithm.

[0057] In some embodiments, updating the resource scheduling algorithm specifically includes:

[0058] Sending a request to update the resource scheduling algorithm to all nodes;

[0059] When all nodes receive the request, they propose an update selection of the resource scheduling algorithm within a preset period;

[0060] Determine whether to update the resource scheduling algorithm according to a preset update strategy.

[0061] In some embodiments, the preset update strategy specifically includes: when the number of requests for updating the resource scheduling algorithm is greater than a preset threshold, the node updates the resource scheduling algorithm.

[0062] In the disclosed specific embodiment, a part of the subcarriers are fixed to form a basic full-duplex wireless communication network, and the surplus subcarriers are uniformly placed in the virtual resource pool. When any node needs a large bandwidth, it uses blockchain technology to apply to the virtual resource pool. Each node approves through the same mutual trust and arbitration mechanism. While allowing the node to obtain subcarrier resources, it also retains the impression of subcarrier occupancy in the entire system, which can be automatically avoided in subsequent applications. After the node completes the high-bandwidth transmission, it releases the corresponding subcarrier to the resource pool, and other nodes can reapply for the use of these resources.

[0063] Specifically, Figure 2 and Figure 3 As shown, a specific example application diagram of a resource allocation method is shown. In the current data frame, two OFDM symbols and two carriers are allocated into a resource block; the resource block is used for one node (NT#1 or NT#2 or NT#3) to send a broadcast signal, and other resources are used to send data signals.

[0064] More specifically, in the initial access phase of each node, each node can calculate its corresponding broadcast resource based on its own node information (such as ID); in addition, each node periodically sends its own control signaling on the broadcast resource.

[0065] Within the broadcast resources, the control signaling transmitted by a node includes at least the information required by the scheduling algorithm, such as channel status, service quality, and cache quantity; different from the scheduling with a central node, the control signaling also includes the address of the target node to which it is sent.

[0066] Furthermore, all nodes use the same resource scheduling algorithm. When all nodes learn the resource request signals of other nodes, they input all variables including node information into the scheduling algorithm. Since the scheduling algorithm is predetermined, the output result is also predetermined, which can be described by the following formula:

[0067] k m =f1(CSI,QOS,BSR)

[0068] Among them, k m This means that the mth resource is allocated to node k;

[0069] CSI is the abbreviation of Channel State Information, that is, channel state information, then CSI = [CSI1, CSI2, ..., CSI N ] is the channel state of N (N ≥ 0 and is a natural number) nodes, where each channel state may include the channel state of the channel of the node to the target node;

[0070] QOS is the abbreviation of Quality of Service, that is, service quality, then QOS=[QOS1,QOS2,…,QOS N ] is the service quality of N nodes;

[0071] BSR is the abbreviation of Buffer Status Report, that is, buffer status report, then BSR = [BSR1, BSR2, ..., BSR N ] is the storage status report of N nodes;

[0072] f1 is the current resource scheduling algorithm.

[0073] From this, we can see that no matter what algorithm f1 uses, as long as CSI, QOS, BSR and other data are input into the scheduling algorithm at each node, the calculated resource allocation will be unique, that is, there is consensus among all nodes, which is consistent with the result of calculating the scheduling algorithm by a single node. In addition, since the scheduling result is a consensus, there is no need to send scheduling instructions between nodes, but they are sent directly in the broadcast resource according to the calculation results.

[0074] Specifically, f1 can use a variety of algorithms, such as round robin scheduling, PFS, or latency-limited algorithm. For example, when there is less data between nodes and spectrum resources are more abundant, a simple scheduling method can use the round robin scheduling algorithm; at this time, user broadcast resources and data resources can be aligned to simplify the complexity of transmission. When resources are relatively tight, a latency-limited algorithm can be used to ensure the minimum delay of transmission between nodes.

[0075] Furthermore, changes in data transmission services may require different resource scheduling algorithms to be used. Therefore, the method also includes updating the resource allocation strategy. Since the resource scheduling algorithm must remain consistent throughout the system, resource allocation can be achieved. Therefore, one aspect of the present invention also includes that each node broadcasts its current resource scheduling algorithm identifier on the broadcast resource. Each node verifies the legitimacy of its current resource scheduling algorithm based on the resource scheduling algorithm identifiers received from other nodes. For example, when a node just intervenes in the communication system, it recognizes that all other nodes use the same resource scheduling algorithm as its own resource scheduling algorithm, and at this time it considers that it has access to resource scheduling. If other nodes all use resource scheduling algorithms different from their own, then change their own resource scheduling algorithm.

[0076] Furthermore, when any node recognizes that the current resource scheduling algorithm does not meet the service requirements, it can send a request to update the resource scheduling algorithm through the broadcast channel when broadcasting the service requirements. At this time, the node can send the target resource scheduling algorithm and the parameters required for the request to all nodes through the data channel or the broadcast channel. Figure 4 As shown, a schematic diagram of a request for updating a resource scheduling algorithm is shown, wherein NT#1 sends a request indication in its own broadcast channel, and broadcasts the parameters required for updating the resource allocation strategy within the data resources allocated to itself in the current cycle; specifically, it may include: target resource scheduling algorithm f2, business changes of this node, business statistics of this node, business changes of all nodes, business statistics of all nodes, etc.

[0077] Furthermore, when all nodes receive a request to update the resource scheduling algorithm, they can recalculate and propose a resource scheduling algorithm update option within a predetermined period. The specific result may be the same as or different from the result of the NT#1 request. In addition, it is also possible to determine whether to update the current resource scheduling algorithm based on the update strategy stored in each node; specifically, when the number of update requests is greater than a preset threshold, all nodes default to updating the resource scheduling algorithm.

[0078] The embodiment of the present disclosure also provides a schematic diagram of a process application of updating a resource scheduling algorithm, such as Figure 5 As shown. In the first frame, NT#1 initiates an update request. In the subsequent multiple cycles, other NTs indicate to update the resource scheduling algorithm in the broadcast resources. Finally, in the Nth frame, the entire system switches to the second resource scheduling algorithm. For example, the first resource scheduling algorithm is the PFS scheduling algorithm. At this time, the entire system can allocate transmission resources more evenly to meet the basic data transmission between each node. However, when some dormant sensors start to start, and the service type is ultra-low latency transmission, the activated node initiates a consensus update of the resource scheduling algorithm, and the new algorithm is converted to a latency limited scheduling algorithm. At this time, ultra-low latency services are scheduled first, and ordinary services are scheduled after ultra-low latency services are met.

[0079] It should be noted that the above examples are only for more clear description of the implementation method of this case; in actual applications, in a 100MHz system, the number of carriers that can be allocated to broadcast signals is far more than 2 carriers, which is due to the fact that the number of control signaling bits is also large.

[0080] The disclosed embodiment discloses a resource allocation method, which realizes that if a node fails or sleeps, it will remain silent in the reserved signaling resources. However, since the resource scheduling algorithm is stored in each node, each node can still communicate effectively, and after a period of time, at least one node initiates the update of the resource scheduling algorithm. Since the relevant parameters include the recent business statistics of the node, the updated resource scheduling algorithm will select a more optimized algorithm based on the fact that the node is lost. Therefore, the entire system can always remain reliable and adaptive, and the system will not fail due to the failure of individual nodes.

[0081] The present disclosure also provides a resource allocation device 200, such as Figure 6 As shown, including:

[0082] Broadcast module 201, used to broadcast resource requests to all nodes;

[0083] A monitoring module 202 is used to monitor resource requests from all nodes and obtain source node information from the resource requests;

[0084] The resource allocation strategy generation module 203 is used to calculate all resource requests received within a preset period according to the node information and a preset resource scheduling algorithm, obtain a resource allocation result, and form a resource allocation strategy;

[0085] The sending module 204 is configured to send communication data according to the resource allocation strategy.

[0086] refer to Figure 7 , is a schematic diagram of an electronic device provided by an embodiment of the present disclosure, the electronic device 600 includes:

[0087] Memory 630 and one or more processors 610;

[0088] Among them, the memory 630 is communicatively connected with the one or more processors 610, and the memory 630 stores program instructions 632 that can be executed by the one or more processors. The program instructions 632 are executed by the one or more processors 610 to enable the one or more processors 610 to execute the method in the aforementioned embodiment of the present disclosure.

[0089] Specifically, the processor 610 and the memory 630 may be connected via a bus or other means, and the figure takes the connection via bus 640 as an example. The processor 610 may be a central processing unit (CPU). The processor 610 may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or a combination of the above chips.

[0090] The memory 630 is a non-transitory computer-readable storage medium that can be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as the cascaded progressive network in the embodiment of the present disclosure. The processor 610 executes various functional applications and data processing of the processor by running the non-transitory software programs, program instructions 632, and modules stored in the memory 630.

[0091] The memory 630 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required by at least one function; the data storage area may store data created by the processor 610, etc. In addition, the memory 630 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the memory 630 may optionally include a memory remotely arranged relative to the processor 610, and these remote memories may be connected to the processor 610 via a network (such as via a communication interface 620). Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0092] An embodiment of the present disclosure further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed to perform the method in the aforementioned embodiment of the present disclosure.

[0093] The aforementioned computer-readable storage media include physical volatile and non-volatile, removable and non-removable media implemented in any manner or technology for storing information such as computer-readable instructions, data structures, program modules or other data. Computer-readable storage media specifically include, but are not limited to, USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), erasable programmable read-only memories (EPROMs), electrically erasable programmable read-only memories (EEPROMs), flash memory or other solid-state memory technologies, CD-ROMs, digital versatile disks (DVDs), HD-DVDs, Blue-Ray or other optical storage devices, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store the required information and can be accessed by a computer.

[0094] Although the subject matter described herein is provided in the general context of being executed in conjunction with the execution of operating systems and application programs on computer systems, it will be appreciated by those skilled in the art that other implementations may also be performed in conjunction with other types of program modules. In general, program modules include routines, programs, components, data structures, and other types of structures that perform specific tasks or implement specific abstract data types. It will be appreciated by those skilled in the art that the subject matter described herein may be practiced using other computer system configurations, including handheld devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, etc., and may also be used in a distributed computing environment in which tasks are performed by remote processing devices connected via a communication network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

[0095] Those of ordinary skill in the art will appreciate that the units and method steps of each example described in conjunction with the embodiments of the present disclosure herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present disclosure.

[0096] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present disclosure, or the part that contributes to the original technology or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present disclosure.

[0097] In summary, the present disclosure proposes a resource allocation method, device, electronic device and computer-readable storage medium thereof. By monitoring the resource requests of all nodes and the preset resource scheduling algorithm, the resource allocation result is obtained, the resource allocation strategy is formed, and the communication data is sent according to the resource allocation strategy. By adopting this method, the excessive dependence on individual nodes including the central node is effectively reduced, the adaptability is strong, and the reliability of communication is guaranteed.

[0098] It should be understood that the above specific embodiments of the present disclosure are only used to illustrate or explain the principles of the present disclosure, and do not constitute a limitation of the present disclosure. Therefore, any modifications, equivalent substitutions, improvements, etc. made without departing from the spirit and scope of the present disclosure should be included in the protection scope of the present disclosure. In addition, the claims attached to the present disclosure are intended to cover all changes and modifications that fall within the scope and boundaries of the attached claims, or the equivalent forms of such scope and boundaries.

Claims

1. A resource allocation method, characterized in that: include: The current node broadcasts resource requests to other nodes; Monitor the resource requests from other nodes and obtain corresponding node information from the resource requests; Calculate all resource requests received within 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; sending communication data according to the resource allocation strategy; Among them, 2 OFDM symbols and 2 carriers in the current data frame are allocated into a resource block; the resource block is used by a node to send a broadcast signal, and other resources are used to send data signals; During the initial access phase of each node, each node calculates its corresponding broadcast resource based on its own node information; in addition, each node periodically sends its own control signaling on the broadcast resource; In the broadcast resource, the control signaling transmitted by a node includes at least the information required by the scheduling algorithm, such as channel status, service quality, and buffer quantity; unlike the scheduling with a central node, the control signaling also includes the address of the target node to be sent; All nodes use the same resource scheduling algorithm. When any node learns the resource request signal of other nodes, it inputs all variables including node information into the scheduling algorithm. The scheduling algorithm is predetermined, and the output result is also predetermined, which is described by the following formula: k m =f1(CSI,QOS,BSR), Among them, k m This means that the mth resource is allocated to node k; CSI is the channel state information, then CSI = [CSI1, CSI2, ..., CSI N ] is the channel state of N nodes, where each channel state includes the channel state of the channel of the node to the target node, and N is a natural number greater than or equal to 0; QOS is the quality of service, then QOS=[QOS1,QOS2,…,QOS N ] is the service quality of N nodes; BSR is the buffer status report, then BSR=[BSR1,BSR2,…,BSR N ] is the cache status report of N nodes; f1 is the current resource scheduling algorithm.

2. The method according to claim 1, characterized in that The method further includes: calculating corresponding broadcast resources according to the node information; and generating the resource request according to the broadcast resources.

3. The method according to claim 2, characterized in that The method further includes: using the broadcast resources to periodically send control signaling.

4. The method according to claim 3, characterized in that The control signaling includes at least channel state information, service quality, buffer status report and destination node address.

5. The method according to claim 1, characterized in that The resource request also includes a resource scheduling algorithm identifier of the corresponding node.

6. The method according to claim 5, characterized in that The method further includes: verifying the legitimacy of its own resource scheduling algorithm by acquiring the resource scheduling algorithms of other nodes.

7. The method according to claim 1, characterized in that The method also includes: updating the resource scheduling algorithm.

8. The method according to claim 7, characterized in that Updating the resource scheduling algorithm specifically includes: Sending a request to update the resource scheduling algorithm to all nodes; When all nodes receive the request, they propose an update selection of the resource scheduling algorithm within a preset period; Determine whether to update the resource scheduling algorithm according to a preset update strategy.

9. The method according to claim 8, characterized in that The preset update strategy specifically includes: when the number of requests for updating the resource scheduling algorithm is greater than a preset threshold, the node updates the resource scheduling algorithm.

10. A resource allocation device, characterized in that: include: Broadcast module, used for the current node to broadcast resource requests to other nodes; A monitoring module, used to monitor the resource requests from other nodes and obtain source node information from the resource requests; A resource allocation strategy generation module, used to calculate all resource requests received within a preset period according to the node information and a preset resource scheduling algorithm, obtain a resource allocation result, and form a resource allocation strategy; A sending module, used for sending communication data according to the resource allocation strategy; Among them, 2 OFDM symbols and 2 carriers in the current data frame are allocated into a resource block; the resource block is used by a node to send a broadcast signal, and other resources are used to send data signals; During the initial access phase of each node, each node calculates its corresponding broadcast resource based on its own node information; in addition, each node periodically sends its own control signaling on the broadcast resource; In the broadcast resource, the control signaling transmitted by a node includes at least the information required by the scheduling algorithm, such as channel status, service quality, and buffer quantity; unlike the scheduling with a central node, the control signaling also includes the address of the target node to be sent; All nodes use the same resource scheduling algorithm. When any node learns the resource request signal of other nodes, it inputs all variables including node information into the scheduling algorithm. The scheduling algorithm is predetermined, and the output result is also predetermined, which is described by the following formula: k m =f1(CSI,QOS,BSR), Among them, k m This means that the mth resource is allocated to node k; CSI is the channel state information, then CSI = [CSI1, CSI2, ..., CSI N ] is the channel state of N nodes, where each channel state includes the channel state of the channel of the node to the target node, and N is a natural number greater than or equal to 0; QOS is the quality of service, then QOS=[QOS1,QOS2,…,QOS N ] is the service quality of N nodes; BSR is the buffer status report, then BSR=[BSR1,BSR2,…,BSR N ] is the cache status report of N nodes; f1 is the current resource scheduling algorithm.

Images