Channel access method, device, electronic device and computer readable storage medium
By broadcasting resource negotiation information and feedback information between network nodes, the problems of low negotiation efficiency and cross-collision are solved, and more efficient channel access and resource utilization are achieved.
Patent Information
- Application Number
- CN202410613419.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-05-16
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-05-16
AI Technical Summary
In the prior art, the point-to-point negotiation network has problems such as low negotiation efficiency and easy cross-collision in negotiation results, resulting in access conflicts.
When the first node and the second node negotiate, the resource negotiation information is sent to the third node within the communication range of the first node, and the negotiation feedback information is sent to the fourth node within the communication range of the second node, thereby realizing that the resource negotiation information is The broadcast of resource negotiation situation allows other nodes to quickly know the resource negotiation situation of the first node and the second node, thereby avoiding their negotiated resources, improving negotiation efficiency and reducing the probability of cross-collision.
It effectively improves negotiation efficiency, reduces the probability of cross-collision of negotiation results, reduces access conflicts, and improves network stability and resource utilization.
Smart Images

Figure CN118338453B_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present application relate to the field of computers, and specifically to a channel access method, device, electronic device, and computer-readable storage medium. Background Art
[0002] For the application of situational awareness and information sharing in various scenarios, it is necessary to build a highly decentralized, flexible, dynamically combined, and autonomously coordinated network.
[0003] The network is built based on the negotiation between nodes, and the access between nodes is controlled based on the results of the negotiation, thus forming a network.
[0004] However, the current point-to-point negotiation network still has problems such as low negotiation efficiency, easy cross-collision of negotiation results, and easy access conflicts. Summary of the invention
[0005] The embodiments of the present application provide a channel access method, device, electronic device and computer-readable storage medium, which can improve negotiation efficiency and reduce the probability of cross-collision of negotiation results.
[0006] In a first aspect, an embodiment of the present application provides a channel access method, which is applied to a first node in a network, and the method includes:
[0007] In response to the data transmission request, determining a second node to be transmitted;
[0008] Generate first resource negotiation information for the second node according to the first current negotiation result of the first node, and send the first resource negotiation information to the second node and a third node within the communication range of the first node;
[0009] receiving first negotiation feedback information for the first resource negotiation information returned by the second node, wherein the first negotiation feedback information is generated by the second node according to a second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node;
[0010] updating the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0011] Determining channel access resource information based on the target negotiation result, and controlling channel access of the first node based on the channel access resource information;
[0012] The first node, the second node, the third node and the fourth node can all be in the network.
[0013] In a second aspect, an embodiment of the present application further provides a channel access device, applied to a first node in a network, the device comprising:
[0014] A response module, configured to determine a second node to be transmitted in response to a data transmission request;
[0015] a sending module, configured to generate first resource negotiation information for the second node according to the first current negotiation result of the first node, and send the first resource negotiation information to the second node and a third node within the communication range of the first node;
[0016] a receiving module, configured to receive first negotiation feedback information returned by the second node for the first resource negotiation information, wherein the first negotiation feedback information is generated by the second node according to a second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node;
[0017] An updating module, configured to update the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0018] A first access module, configured to determine channel access resource information based on the target negotiation result, and control channel access of the first node based on the channel access resource information;
[0019] The first node, the second node, the third node and the fourth node can all be in the network.
[0020] Optionally, in some embodiments of the present application, the sending module includes:
[0021] A first determining unit, configured to determine data type information of the to-be-sent data corresponding to the data transmission request;
[0022] A second determining unit, configured to determine available resource information according to the first current negotiation result;
[0023] A generating unit is used to generate first resource negotiation information for the second node according to the data type information and the available resource information.
[0024] Optionally, in some embodiments of the present application, the update module includes:
[0025] a first updating unit, configured to update the first current negotiation result according to the first resource negotiation information to obtain a target negotiation result if the first negotiation feedback information satisfies a first preset condition;
[0026] a second updating unit, configured to extract resource negotiation approval information from the first negotiation feedback information if the first negotiation feedback information satisfies a second preset condition, and generate second resource negotiation information according to the first negotiation feedback information, the resource negotiation approval information, and the first current negotiation result, and perform resource negotiation with the second node through the second resource negotiation information to obtain second negotiation feedback information, and update the first current negotiation result according to the resource negotiation approval information and the second negotiation feedback information to obtain a target negotiation result;
[0027] A third update unit is used to generate third resource negotiation information directly based on the first negotiation feedback information and the first current negotiation result if the first negotiation feedback information meets a third preset condition, and to perform resource negotiation with the second node through the third resource negotiation information to obtain third negotiation feedback information, and to update the first current negotiation result according to the third negotiation feedback information to obtain a target negotiation result.
[0028] In some embodiments of the present application, the device further includes a transmission module, and the transmission module includes:
[0029] An occupying unit, used to occupy the target channel access resource corresponding to the channel access resource information to obtain a resource occupation result;
[0030] A third determining unit, configured to determine, according to the resource occupancy result, an actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request;
[0031] A transmission unit is used to transmit the data to be sent to the second node through the actual channel access resource.
[0032] In some embodiments of the present application, the third determining unit includes:
[0033] A first determining subunit is configured to use the target channel access resource as an actual channel access resource if the resource occupation result indicates that the target channel access resource is successfully occupied;
[0034] A second determining subunit is configured to determine a channel access substitute resource that replaces the target channel access resource from the available resources if the resource occupation result indicates that the target channel access resource has not been successfully occupied and the target negotiation result indicates that available resources exist, and use the channel access substitute resource as the actual channel access resource;
[0035] The third determination subunit is used to determine the actual channel access resource for transmitting the data to be sent according to the new target negotiation result of the next round of resource negotiation if the resource occupation result indicates that the target channel access resource is not successfully occupied and the target negotiation result indicates that there are no available resources.
[0036] In some embodiments of the present application, the third determining unit further includes:
[0037] An occupation marking subunit, used to mark the actual channel access resource by an occupation mark to obtain an updated target negotiation result;
[0038] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are no available resources, a resource negotiation mark is generated, wherein the resource negotiation mark is used to indicate that resource negotiation processing is performed again for the data transmission request in the next round of resource negotiation cycle;
[0039] In the next round of resource negotiation cycle, fourth resource negotiation information is generated according to the data to be sent, the first resource negotiation information and the resource occupation result, and resource negotiation processing is performed on the data transmission request according to the fourth resource negotiation information.
[0040] In some embodiments of the present application, the transmission module further includes a status marking unit, and the status marking unit includes:
[0041] A first state marking subunit, configured to identify the first node by a busy state if the first node successfully occupies the actual channel access resource and is in a state of transmitting the data to be sent based on the actual channel access resource;
[0042] The second status marking subunit is used to determine the target state according to the transmission state of the third node and identify the first node by the target state if the first node fails to successfully occupy the actual channel access resource and there is no data to be sent and no data to be received.
[0043] In some embodiments of the present application, the second state marking subunit is specifically used for:
[0044] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the to-be-sent data exists in the cache queue of the first node, adjusting the first node to a silent state;
[0045] After adjusting to the first duration of the silent state, try to occupy the target channel access resource again, and if the target channel access resource still cannot be occupied, mark the target channel access resource as being in an occupied state;
[0046] If after adjusting to the second time length of the silent state, the target negotiation result indicates that there are available target channel access resources, then try to occupy the target channel access resources again. If the target channel access resources are not successfully occupied, then determine a channel access alternative resource to replace the target channel access resource from the target negotiation result.
[0047] In some embodiments of the present application, the transmission unit is used to:
[0048] If there is a target negotiation result of a fifth node representing that the resource negotiation result is consistent with the actual channel access resource, determining a first service priority from the data transmission request of the first node and determining a second service priority from the data transmission request of the fifth node;
[0049] If the first service priority is higher than the second service priority, transmitting the to-be-sent data to the second node through the actual channel access resource;
[0050] If the first service priority is lower than the second service priority, waiting for the fifth node to complete transmission based on the actual channel access resource, and then transmitting the to-be-sent data to the second node based on the actual channel access resource;
[0051] If the first service priority is equal to the second service priority, the first node accesses the actual channel access resource through a competitive access strategy with the fifth node.
[0052] In some embodiments of the present application, the device further includes an access module, and the access module includes:
[0053] An access unit is used to, if the target negotiation result is empty and the target negotiation results of other nodes except the first node are also empty, then the first node and the other nodes adopt a competitive access strategy to access the target resource to complete the data transmission request.
[0054] In a third aspect, an embodiment of the present application provides a channel access method, which is applied to a second node in a network, and the method includes:
[0055] Receiving first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node;
[0056] generating first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node;
[0057] Returning the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0058] determining channel access resource information based on the first negotiation feedback information, and controlling channel access of the second node based on the channel access resource information;
[0059] The first node also sends the first resource negotiation information to a third node within the communication range of the first node, and the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0060] In a fourth aspect, an embodiment of the present application provides a channel access device, applied to a second node in a network, the device comprising:
[0061] A receiving module, configured to receive first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node;
[0062] A generating module, configured to generate first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node;
[0063] a returning module, configured to return the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0064] a second access module, configured to determine channel access resource information based on the first negotiation feedback information, and control channel access of the second node based on the channel access resource information;
[0065] The first node also sends the first resource negotiation information to a third node within the communication range of the first node, and the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0066] In some embodiments of the present application, the device further includes a synchronization module, which is specifically used to:
[0067] updating the second current negotiation result according to the first negotiation feedback information to obtain a first updated negotiation result;
[0068] generating fourth negotiation feedback information in response to a resource negotiation request of a target node in the fourth node;
[0069] Updating the first updated negotiation result according to the fourth negotiation feedback information to obtain a second updated negotiation result;
[0070] The fourth negotiation feedback information is sent to the target node, wherein the target node updates the real-time negotiation result of the target node according to the fourth negotiation feedback information to obtain a final negotiation result.
[0071] In a fifth aspect, an embodiment of the present application further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program implements the steps in the above-mentioned channel access method when executed by the processor.
[0072] In a sixth aspect, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps in the above-mentioned channel access method are implemented.
[0073] In a seventh aspect, the embodiments of the present application further provide a computer program product or a computer program, the computer program product or the computer program including computer instructions, the computer instructions being stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the methods provided in the various optional implementations described in the embodiments of the present application.
[0074] In summary, the first node of the embodiment of the present application responds to a data transmission request, determines the second node to be transmitted, generates first resource negotiation information for the second node according to the first current negotiation result of the first node, and sends the first resource negotiation information to the second node and the third node within the communication range of the first node, and receives the first negotiation feedback information returned by the second node for the first resource negotiation information, wherein the first negotiation feedback information is generated by the second node according to the second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to the fourth node other than the first node within the communication range of the second node, updates the first current negotiation result according to the first negotiation feedback information to obtain the target negotiation result, determines the channel access resource information based on the target negotiation result, and controls the channel access of the first node based on the channel access resource information, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0075] Among them, by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate, the resource negotiation status of the first node and the second node is broadcast to other adjacent nodes, so that the other nodes can quickly know the resource negotiation status of the first node and the second node, which helps the other nodes avoid the resources negotiated by the first node and the second node during resource negotiation, improves negotiation efficiency, and reduces the probability of cross-collision of negotiation results. BRIEF DESCRIPTION OF THE DRAWINGS
[0076] In order to more clearly illustrate the technical solutions in the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.
[0077] Figure 1 It is a scenario diagram of the channel access method provided in an embodiment of the present application;
[0078] Figure 2 It is a flow chart of the channel access method provided in the embodiment of the present application;
[0079] Figure 3 is a network diagram provided in an embodiment of the present application;
[0080] Figure 4 It is a schematic diagram of the effect of the channel access method provided in an embodiment of the present application;
[0081] Figure 5It is a schematic diagram of distributed channel access compared with the standard CSMA access method provided by an embodiment of the present application;
[0082] Figure 6 is a schematic diagram of data transmission provided by an embodiment of the present application;
[0083] Figure 7 is another flow chart of the channel access method provided by an embodiment of the present application;
[0084] Figure 8 is a structural diagram of a channel access device provided in an embodiment of the present application;
[0085] Fig. 9 is another structural schematic diagram of the channel access device provided in an embodiment of the present application;
[0086] Fig.10 It is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0087] The following will be combined with the drawings in this application to clearly and completely describe the technical solutions in this application. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments in the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.
[0088] The embodiments of the present application provide a channel access method, device, electronic device, and computer-readable storage medium. Specifically, the embodiments of the present application provide a channel access device applicable to electronic devices (including nodes in a network), wherein the electronic devices include terminal devices, and the terminal devices include but are not limited to mobile phones, tablet computers, desktop computers, laptop computers, televisions, touch-screen all-in-one computers, smart conference tablets, and other devices.
[0089] See also Figure 1 As shown, Figure 1 : is a schematic diagram of a scenario in which a first node performs the channel access method provided in an embodiment of the present application, wherein the specific execution process of the first node in the network performing the channel access method is as follows:
[0090] The first node 10 responds to the data transmission request, determines the second node 11 to be transmitted, generates first resource negotiation information for the second node 11 according to the first current negotiation result of the first node 10, and sends the first resource negotiation information to the second node 11. The first node 10 receives the first negotiation feedback information returned by the second node 11 for the first resource negotiation information, and updates the first current negotiation result according to the first negotiation feedback information to obtain the target negotiation result. Then, the first node determines the channel access resource information based on the target negotiation result, and controls the channel access of the first node based on the channel access resource information.
[0091] The first node also sends the first resource negotiation information to a third node 12 within the communication range of the first node.
[0092] Furthermore, the second node generates first negotiation feedback information according to the second current negotiation result of the second node, and sends the first negotiation feedback information to a fourth node 13 other than the first node within the communication range of the second node.
[0093] In this embodiment of the present application, the first node, the second node, the third node and the fourth node can all be in the network.
[0094] It can be understood that the embodiment of the present application realizes broadcasting the resource negotiation status of the first node and the second node to other adjacent nodes by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate. This enables the other nodes to quickly know the resource negotiation status of the first node and the second node, which helps the other nodes to avoid the resources negotiated by the first node and the second node during resource negotiation, thereby improving negotiation efficiency and reducing the probability of cross-collision of negotiation results.
[0095] It should be noted that the order of description of the following embodiments is not intended to limit the priority order of the embodiments.
[0096] See also Figure 2 , Figure 2 A schematic diagram of a flow chart of a channel access method provided in an embodiment of the present application. The channel access method is applied to a first node in a network, and the specific flow of the method is as follows:
[0097] 101. In response to a data transmission request, determine a second node to be transmitted.
[0098] The data transmission request may be generated by an upper layer or high-level node of the first node, for example, a data transmission request for the first node is generated by a remote control device, or a data transmission request is generated by other node devices such as a server.
[0099] The data transmission request usually points to the target device to be transmitted, that is, represents the opposite end device to which the data is transmitted. Therefore, by parsing the data transmission request, the second node to be transmitted can be determined.
[0100] In the embodiments of the present application, each node involved can be understood as a terminal device, a server or a transmission base station. For example, the node can include a mobile phone, a tablet computer or a drone.
[0101] 102. Generate first resource negotiation information for the second node according to a first current negotiation result of the first node, and send the first resource negotiation information to the second node and a third node within the communication range of the first node.
[0102] It should be noted that the first current negotiation result is the current negotiation result of the first node, wherein the first current negotiation result includes the current negotiation status of the first node with each other node, for example, the resources negotiated for each other node, including but not limited to time slots, frequencies and beams, negotiation duration, etc.
[0103] Among them, the first resource negotiation information is the information negotiated by the first node and the second node regarding the resources required for data transmission, including the resources desired to be used for transmitting data, etc., wherein, by determining the first resource negotiation information based on the first current negotiation result, it is possible to avoid duplicate resources being included in the negotiated resources, avoid negotiating conflicting resources, and reduce the probability of cross-collision of negotiation results.
[0104] By sending the first resource negotiation information to the second node, the first node and the second node can negotiate based on the first resource negotiation information, thereby determining the resources that can be used for data transmission between the first node and the second node.
[0105] Among them, by simultaneously sending the first resource negotiation information to a third node within the communication range of the first node, the third node can also be aware of the resource negotiation status of the first node and the second node, which helps the third node to avoid the resources negotiated by the first node and the second node during resource negotiation, thereby reducing or even avoiding conflicts or collisions in resource negotiations, and helping each node to occupy the resources it negotiated.
[0106] 103. Receive first negotiation feedback information returned by the second node for the first resource negotiation information, wherein the first negotiation feedback information is generated by the second node according to the second current negotiation result of the second node, and wherein the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node.
[0107] It should be noted that the first negotiation feedback information is the feedback of the second node on the first resource negotiation information, and at least includes fully approving the first resource negotiation information, partially approving the first resource negotiation information, and completely not approving the first resource negotiation information. Among them, when it belongs to the case of partial approval, the first negotiation feedback information must also clearly record the approved resources and the unapproved resources.
[0108] Among them, the second node generates first negotiation feedback information based on the second current negotiation result of the second node, thereby ensuring the accuracy of the effectiveness of the generated first negotiation feedback information. For example, based on the negotiation status of each resource recorded in the second current negotiation result, the approval status of the first resource negotiation information is determined. For example, if the resource targeted by the first resource negotiation information is a negotiated resource, the first negotiation feedback information includes partial approval of the first resource negotiation information or complete disapproval of the first resource negotiation information.
[0109] By receiving feedback from the second node regarding the first resource negotiation information, the resource negotiation result can be determined based on the first negotiation feedback information, and then the channel resource accessed for data transmission can be determined based on the resource negotiation result.
[0110] Among them, the second node sends the first negotiation feedback information to the fourth node within the communication range of the second node, which helps the fourth node to know the resource negotiation status between the first node and the second node. Correspondingly, it helps to avoid resource conflicts or collisions when the fourth node negotiates resources with the second node. For example, when the fourth node knows the resource negotiation status between the first node and the second node, it can avoid negotiating the resources negotiated between the first node and the second node.
[0111] 104. Update the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result.
[0112] By updating the first current negotiation result, the negotiated resources for transmitting data to the second node are obtained.
[0113] In the embodiment of the present application, the first node, the second node, the third node and the fourth node can all be in the network, wherein the network is a network formed by multiple nodes.
[0114] 105. Determine channel access resource information based on the target negotiation result, and control channel access of the first node based on the channel access resource information.
[0115] Among them, channel access based on negotiated resources can effectively reduce access conflicts.
[0116] It can be understood that the embodiment of the present application realizes broadcasting the resource negotiation status of the first node and the second node to other adjacent nodes by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate. This enables the other nodes to quickly know the resource negotiation status of the first node and the second node, which helps the other nodes to avoid the resources negotiated by the first node and the second node during resource negotiation, thereby improving negotiation efficiency and reducing the probability of cross-collision of negotiation results.
[0117] For example, see Figure 3 As shown, Figure 3 : is a network diagram provided in an embodiment of the present application, wherein the network includes nodes A, B, C, D and E, wherein the elliptical area on the left is the communication range of node A, also known as the broadcast range, the circular area in the middle is the communication range of node B, also known as the broadcast range, and the circular area on the right is the communication range of node C, wherein Figure 3 It can be seen that node C is within the communication range of node B, node D is within the communication range of node A, node E is within the communication range of nodes A and B, and node F is not within the communication range of nodes A and B, but within the communication range of node C. Based on the channel access method of the embodiment of the present application, if node A initiates a first resource negotiation message to negotiate resources with node B, then node D and node E can receive the first resource negotiation message broadcast by node A, while node C and node E can receive the first negotiation feedback message broadcast by node B, while node F cannot receive the first resource negotiation message broadcast by node A, and cannot receive the first negotiation feedback message broadcast by node B.
[0118] Correspondingly, if node C and node F perform resource negotiation, the data transmission between node A and node B does not affect the data transmission between node C and node F, that is, when node A and node B perform data transmission based on the previously negotiated resources, node C and node F can also perform data transmission based on their previously negotiated resources. That is, in the embodiment of the present application, when node A and node B transmit data, node C does not need to be in a silent state, so it can perform data transmission with its corresponding node F.
[0119] In the embodiment of the present application, after receiving the data transmission request, the first node may generate the first resource negotiation information based on the data type information of the to-be-sent data corresponding to the data transmission request and the available resource information described by the first current negotiation result. That is, optionally, in some embodiments of the present application, the step of “generating the first resource negotiation information for the second node according to the first current negotiation result of the first node” includes:
[0120] Determine data type information of the to-be-sent data corresponding to the data transmission request;
[0121] Determining available resource information according to the first current negotiation result;
[0122] First resource negotiation information for the second node is generated according to the data type information and the available resource information.
[0123] Among them, the data type information includes the service priority corresponding to the data transmission request or the data to be sent, and the size of the data to be sent (such as the length in the cache queue, etc.). In an embodiment of the present application, the data type information may also include the data length of all data to be sent in the first node's own cache queue, that is, the cache queue length.
[0124] The available resource information is the resources that have not been negotiated and represented by the first current negotiation result. For example, the first current negotiation result records the negotiated resources and the non-negotiated resources. Accordingly, the non-negotiated resources can be used as available resources. Accordingly, the information corresponding to the non-negotiated resources is the available resource information.
[0125] In the embodiment of the present application, the data transmission request (which can also be understood as a resource request) can be initiated by an upper node or a high-level node. For example, node V i When receiving a resource request from a high level, the first resource negotiation information [source node V i , destination node V j , time slot, frequency, beam, negotiation duration], and broadcast the first resource negotiation information to adjacent nodes, and wait for feedback from the node that receives the first resource negotiation information, wherein the target node V j That is the second node.
[0126] In the embodiment of the present application, for the first resource negotiation information, the second node may determine feedback for the first resource negotiation information based on its own second current negotiation result, that is, the second node determines the first negotiation feedback information for the first resource negotiation information according to its corresponding second current negotiation result. Accordingly, for different first negotiation feedback information, the first node updates its first current negotiation result according to corresponding different strategies. That is, optionally, in some embodiments of the present application, the step of “updating the first current negotiation result according to the first negotiation feedback information to obtain the target negotiation result” includes:
[0127] If the first negotiation feedback information satisfies a first preset condition, updating the first current negotiation result according to the first resource negotiation information to obtain a target negotiation result;
[0128] If the first negotiation feedback information satisfies a second preset condition, extracting resource negotiation approval information from the first negotiation feedback information, generating second resource negotiation information according to the first negotiation feedback information, the resource negotiation approval information and the first current negotiation result, performing resource negotiation with the second node through the second resource negotiation information to obtain second negotiation feedback information, and updating the first current negotiation result according to the resource negotiation approval information and the second negotiation feedback information to obtain a target negotiation result;
[0129] If the first negotiation feedback information meets the third preset condition, the third resource negotiation information is directly generated based on the first negotiation feedback information and the first current negotiation result, and resource negotiation is performed with the second node through the third resource negotiation information to obtain the third negotiation feedback information, and the first current negotiation result is updated according to the third negotiation feedback information to obtain the target negotiation result.
[0130] Among them, in the embodiment of the present application, satisfying the first preset condition indicates that the first negotiation feedback information fully recognizes the first resource negotiation information, satisfying the second preset condition indicates that the first negotiation feedback information partially recognizes the first resource negotiation information, and satisfying the third preset condition indicates that the first negotiation feedback information completely disapproves of the first resource negotiation information.
[0131] For example, in the embodiment of the present application, the second node V j Upon receiving the first node V i After sending the first resource negotiation information, the second node determines the first negotiation feedback information for the first resource negotiation information based on the data type information (service priority and cache queue length, etc.) of the data to be sent cached by itself and the second current negotiation result, and updates the second current negotiation result of the second node based on the first negotiation feedback information.
[0132] For example, the feedback status of the first negotiation feedback information of the second node is as follows:
[0133] ① If the first resource negotiation information is fully recognized, the second current negotiation result of the second resource negotiation result is modified according to the recognized first resource negotiation information, and a confirmation response of the first resource negotiation information is made;
[0134] ② If the first resource negotiation information is partially recognized, modify its own second current negotiation result according to the partially recognized first resource negotiation information, and make a partial recognition response of the first resource negotiation information;
[0135] ③ If the first resource negotiation information is completely rejected, a rejection response is made.
[0136] Correspondingly, the specific situation in which the first node updates its first current negotiation result according to the first negotiation feedback information fed back by the second node is as follows:
[0137] ① If the first resource negotiation information is fully recognized, the first current negotiation result is updated and the resource request is completed;
[0138] ② If the partially recognized first resource negotiation information is received, the first current negotiation result of the node itself is modified according to the partially recognized first resource negotiation information. At the same time, the partially recognized result of the first resource negotiation information can be returned to the node that issued the resource negotiation request, and renegotiated in the next round of resource negotiation;
[0139] ③ If the first resource negotiation information is completely rejected, the result is returned to the node that issued the resource negotiation request, and renegotiated in the next round of resource negotiation.
[0140] Accordingly, in the embodiment of the present application, since the first node simultaneously broadcasts the first resource negotiation information to the third node within its communication range, the third node knows the resource negotiation status of the first node, and for the first negotiation feedback information fed back by the second node, in the embodiment of the present application, if the third node is within the communication range of the second node, the first negotiation feedback information is also broadcast to the third node V k For example, a third node that receives the first resource negotiation information from the first node to the second node, if the third node is within the one-hop adjacent node range of the second node, can receive the first negotiation feedback information of the second node, confirm and update the target negotiation result of the adjacent node of the one-hop adjacent node stored in the second node, that is, the resource negotiation status from the first node to the second node, and mark that the sending or receiving of the second node affects the sending or receiving of the third node.
[0141] Correspondingly, if the third node is not within the communication range of the second node, the first negotiation feedback information cannot be received. For example, see Figure 3As shown, node D can only receive the first resource negotiation information broadcast by node A, but cannot receive the first negotiation feedback information broadcast by node B.
[0142] It can be understood that since the third node V k Store V in the target negotiation result i To V j The resource negotiation status of the node V is marked. j The sending pair of node V k Therefore, node V can be avoided in resource negotiation. i and node V j resource negotiation, thus reducing collisions.
[0143] Among them, if the node V k 、V j 、V i If the topological relationship is a straight line, then the node V k At this time, the two-hop resource negotiation information is stored, that is, the node V i To V j Resource negotiation information and node V j V k Resource negotiation information.
[0144] Correspondingly, if node V k The resource negotiation information is forwarded to the adjacent node V in one hop. l , then node V l In addition to the storage node V l With V k The resource status between nodes is also updated. i To V j Node V j V k The resource status of the node V l 、V k 、V j 、V i If the topological relationship is a straight line, then the node V l At most, it stores the three-hop resource negotiation information, that is, it stores the node V i To V j Resource negotiation information of node V j V k Resource negotiation information and node V k and node V l Resource negotiation information.
[0145] It can be understood that, in the embodiment of the present application, if the node V iThe service data is sent to multiple destination nodes, ie, multiple second nodes. The above steps are repeated to complete resource negotiation with each second node and storage of resource negotiation information.
[0146] It can be understood that the situation information of adjacent nodes within a two-hop range is similar, and consistent resource negotiation information is ultimately generated, thus forming distributed resource negotiation and access.
[0147] Among them, the distributed channel access technology is a distributed dynamic resource negotiation mechanism. The idea of this resource negotiation is: each node takes the real-time situation information of the k-hop range or more mastered by the node as input, and outputs the resource negotiation result according to the unified resource negotiation rules of the whole network; the resource negotiation results between neighboring nodes can achieve a distributed "negotiation result", and the data domain (or data plane) changes from the disorderly competition for channel resources to the orderly use of channel resources according to the negotiation results. The advantage of this resource negotiation mechanism is that it greatly reduces the collision probability of the data plane.
[0148] The generation of negotiation results mainly considers the problem of orderly negotiation of joint node resources. How does each node determine the local topology G above the k-hop range? i =(V i , E i ) and situation information such as node ID, service priority, cache queue length, node capability level, node adjacency, etc., to negotiate node resources in an orderly manner, ensure that node resources within k hops do not conflict, and node resources outside k+1 hops can be reused, reduce the probability of network node access conflict, make efficient use of resources, and thus improve network throughput.
[0149] The principle of distributed channel access technology is: through the periodic interaction of situation frames (control frames) between nodes, each node will update the local adjacent node resource status information table when receiving a situation frame, and forward the local resource status information table to the adjacent node through elastic periodic one-hop fusion. Through k rounds of one-hop fusion forwarding, the node learns the resource negotiation status of nodes within at least k hops, so in each situation cycle, each node knows the resource status of sending data within at least k hops in this cycle. The nodes in the negotiation result area obtain the situation information within at least k hops through the situation awareness technology, and each node obtains the resource allocation result through a consistent algorithm to reach the negotiation result.
[0150] like Figure 4 As shown, based on the result of this negotiation, each node accesses the channel at an appropriate time according to the negotiated resources (also known as consensus access or consensus networking access), discretely reducing the density of channel access from the time dimension. For example, see Figure 5 As shown, Figure 5This is a schematic diagram of distributed channel access compared to the standard CSMA access method provided by the embodiment of the present application, which disperses N nodes of one-hop neighbor nodes into m time slots, where i+j+...+k=N, avoiding the waste of channel resources caused by a large number of competitive access collisions. When a node has a data transmission requirement, it selects available resources to send data packets by querying the local target negotiation result.
[0151] Among them, in an embodiment of the present application, before negotiation, it is necessary to dynamically and real-time perceive the adjacent nodes of the node and store their neighbor relationships, for example, one-hop adjacent nodes, two-hop adjacent nodes, and three-hop adjacent nodes, etc. Correspondingly, in an embodiment of the present application, there are at least two modes of resource negotiation, namely active and passive. The active mode refers to negotiation by actively triggering the sending of control frames to the destination node. For example, the first node in an embodiment of the present application actively sends first resource negotiation information to the second node for resource negotiation. The passive mode refers to passively obtaining control frames actively sent by other nodes. For example, the second node in an embodiment of the present application passively receives the first resource negotiation information sent by the first node to negotiate resources with the first node.
[0152] Among them, in an embodiment of the present application, the first resource negotiation information not only includes the required channel resources, but also includes service transmission demand information, resource negotiation request information, resource occupancy information (such as wireless resource usage information) and wireless transmission capability information.
[0153] Furthermore, in an embodiment of the present application, when the resource negotiation is completed, data transmission processing can be performed based on the negotiated resources, that is, optionally, in some embodiments of the present application, after the step of "determining the channel access resource information based on the target negotiation result, and controlling the channel access of the first node based on the channel access resource information", the method further includes:
[0154] Occupying the target channel access resource corresponding to the channel access resource information to obtain a resource occupation result;
[0155] Determine, according to the resource occupancy result, an actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request;
[0156] The data to be sent is transmitted to the second node through the actual channel access resource.
[0157] It should be noted that the channel access resource information includes the timing of channel access in the time domain, the frequency of channel access in the frequency domain, beam resources, etc.
[0158] Among them, by determining the channel access resource information, it is helpful to access the channel based on the negotiated resources and then perform data transmission processing.
[0159] Among them, since data transmission depends on the real-time environmental conditions, it may not be possible to successfully occupy the negotiated resources when data transmission is carried out. Therefore, when the negotiated target channel access resources are not successfully occupied, the actual channel access resources can be determined based on the target negotiation results, and the data to be sent corresponding to the data transmission request can be transmitted based on the actual channel access resources.
[0160] Accordingly, in an embodiment of the present application, the actual channel access resource is determined according to the occupancy of the target channel access resource, that is, optionally, in some embodiments of the present application, the step of "determining the actual channel access resource for transmitting the data to be sent corresponding to the data transmission request according to the resource occupancy result" includes:
[0161] If the resource occupation result indicates that the target channel access resource is successfully occupied, the target channel access resource is used as the actual channel access resource;
[0162] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that available resources exist, determining a channel access substitute resource to replace the target channel access resource from the available resources, and using the channel access substitute resource as the actual channel access resource;
[0163] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are no available resources, the actual channel access resource for transmitting the data to be sent is determined according to a new target negotiation result of the next round of resource negotiation.
[0164] It can be understood that in the embodiment of the present application, the channel access replacement resources can be based on a channel sensing mechanism, and the channel access replacement resources can be obtained based on idle resources sensed.
[0165] Correspondingly, if the target negotiation result indicates that there are no available resources, the actual channel access resources can be obtained through re-negotiation.
[0166] For example, in an embodiment of the present application, after the step of "determining, according to the resource occupancy result, the actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request", the method further includes:
[0167] The actual channel access resource is marked by an occupation mark to obtain an updated target negotiation result;
[0168] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are no available resources, a resource negotiation mark is generated, wherein the resource negotiation mark is used to indicate that resource negotiation processing is performed again for the data transmission request in the next round of resource negotiation cycle;
[0169] In the next round of resource negotiation cycle, fourth resource negotiation information is generated according to the data to be sent, the first resource negotiation information and the resource occupation result, and resource negotiation processing is performed on the data transmission request according to the fourth resource negotiation information.
[0170] For example, if node V i Successfully reserved or negotiated resources (time slot, frequency, beam) Resr m If data is sent or received on the node V i Corresponding resources m Conduct occupancy marking;
[0171] If the node V i Failed to successfully occupy the resource Resr m , but there is data to be sent in the cache queue, then node V i Query the target negotiation result to query the available resources. If there are available resources, Resr n , then for node V i Corresponding resources n Conduct occupancy marking;
[0172] If no resource is occupied successfully and there are no available resources, the resource negotiation mark is set and the resource negotiation is performed again in the next round of resource negotiation. In the new negotiation cycle, the node updates the target negotiation result according to the data to be sent, the stored target negotiation result, and the actual resource occupation table, and then starts a new round of resource status update.
[0173] Among them, the actual channel access resources are identified by the occupancy mark, and the updated target negotiation result is obtained. The resource occupancy status is known through the updated target negotiation result, which helps to conduct effective resource negotiation based on the updated target negotiation result as a reference or basis for the next round of resource negotiation.
[0174] Among them, through re-negotiation after negotiation failure, it is ensured that the negotiated resources can be used to ensure data transmission. For example, see Figure 6 As shown, Figure 6It is a schematic diagram of data transmission provided in an embodiment of the present application, wherein the data transmission includes multiple cycles, each cycle includes a control frame for resource negotiation processing and a data frame for data transmission based on channel resources after resource negotiation processing, wherein, through multiple cycles of resource negotiation data transmission processing, it is ensured that resources for transmitting data can be negotiated, and that the data to be sent can be smoothly transmitted to the target node.
[0175] In the embodiment of the present application, the control domain resources are mainly used to carry control information, and the data domain resources are mainly used to transmit service data. The control information provides necessary channel access-related reference information for service data transmission. The control domain time domain resource blocks can be equal-length resource blocks or non-equal-length resource blocks; the data domain frequency domain resource blocks can also be subcarriers. The control information includes synchronization information, reference information, and situation information.
[0176] It can be understood that the embodiment of the present application implements a method for the distributed combined use of control domain and data domain functions, realizes efficient use of resources, ensures efficient and reliable transmission of data, and meets the needs of diversified QoS services under large-scale networking. The control domain implements the negotiation of data domain resources required for business data transmission based on the carried control information, and the data domain realizes efficient use of resources to ensure efficient and reliable transmission of data.
[0177] Among them, in the embodiment of the present application, since the resource negotiation process only requires a small amount of information such as the data type information of the data to be sent and the current negotiation result, as well as wireless transmission capability information and wireless resource usage information, the control frame or control field can be controlled within a small number of time slots to quickly complete the resource negotiation, and then provide an indication of the channel resources that can be used or occupied by the data frame or data field when transmitting data, thereby achieving efficient use of resources.
[0178] Furthermore, in an embodiment of the present application, negotiation is carried out in a competitive manner within the control time slot corresponding to the control frame or the control domain. Negotiation between nodes is not affected by the number N of nodes in the entire network, and there is no need to wait for available frames of all nodes, so negotiation efficiency is higher. In addition, the distributed resource negotiation of the present scheme occurs locally (for example, within three hops of the node), does not depend on a specific node (for example, no specific master node or central node is required for negotiation and control, and negotiation processing can be completed between local nodes). It is not affected by the scale of the entire network and the dynamic topology of the entire network. That is, when the network is merged or split due to task requirements and the network topology changes dynamically, resource negotiation and utilization are more flexible when networking nodes are connected and exited at will. Beyond three hops, node resources can be spatially reused, so nodes outside three hops will not affect each other.
[0179] In the embodiment of the present application, the node may be identified based on the state of the node transmitting data, that is, optionally, in some embodiments of the present application, the channel access method further includes:
[0180] If the first node successfully occupies the actual channel access resource and is in a state of transmitting the to-be-sent data based on the actual channel access resource, identifying the first node by a busy state;
[0181] If the first node fails to successfully occupy the actual channel access resource, and there is no data to be sent and no data to be received, a target state is determined according to the transmission state of the third node, and the first node is identified by the target state.
[0182] For example, if node V i In the resource Resr k If the node V i In the resource Resr k If no resources are occupied, no data is sent or received, then the node is in one of the following states:
[0183] The state in which at least one neighboring node is receiving information from another node and no neighboring node is sending (QUITE_T), or, the state in which at least one neighboring node is sending to another node and no neighboring node is receiving (QUITE_R), or, the state in which at least one neighboring node is receiving or at least one neighboring node is sending (QUITE_TR), or, the state in which the node hopes to receive information from a neighboring node but is in a collision (COLLISION), or, the state in which the node is idle (IDLE).
[0184] Among them, by identifying the status of each node, it is helpful to know the transmission status of each node based on the identification, which helps to manage each node.
[0185] Among them, in an embodiment of the present application, when a node successfully occupies a negotiated channel access resource, the node is adjusted to a silent state. The node in the silent state initiates occupation of the negotiated resource again after a certain period of time. If the negotiated resource is still occupied after a longer period of time, the available resource is determined from the target negotiation result, and an attempt is made to occupy the available resource. That is, optionally, in some embodiments of the present application, the step of "if the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are available resources, then determining a channel access replacement resource that replaces the target channel access resource from the available resources" includes:
[0186] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the to-be-sent data exists in the cache queue of the first node, adjusting the first node to a silent state;
[0187] After adjusting to the first duration of the silent state, try to occupy the target channel access resource again, and if the target channel access resource still cannot be occupied, mark the target channel access resource as being in an occupied state;
[0188] If after adjusting to the second time length of the silent state, the target negotiation result indicates that there are available target channel access resources, then try to occupy the target channel access resources again. If the target channel access resources are not successfully occupied, then determine a channel access alternative resource to replace the target channel access resource from the target negotiation result.
[0189] For example, distributed access formed through resource negotiation between nodes includes:
[0190] 1. The node waits for the negotiation resource to which the data domain belongs and prepares to access the channel in the negotiation resource;
[0191] 2. The node performs random channel access in the negotiation resource. If the access is successful, the node sends data and enters the busy state (BUSY), updates the target negotiation result, and marks the occupancy of the channel resources. If the access fails, the node enters the quiet state (QUITE). The minimum quiet duration is the service transmission duration of the node that successfully competes (the first duration), and the maximum quiet duration is the duration of the negotiation resource (the second duration).
[0192] 3. Within the current negotiation resource duration, after exceeding the successful contention service transmission duration Duration, continue to listen to the channel, repeat step 2, and try to access. If the negotiated resources are still not successfully occupied, update the target negotiation result, mark the unoccupied status of the negotiation resources, and mark the failure reason value as FAIL_COLLISION in the target negotiation result.
[0193] Among them, after the maximum silence duration timer of the node entering the silent state (QUITE) times out (exceeds the second duration), the node continues to detect whether subsequent resources are negotiated and available resources, and when the subsequent negotiated resources are available, it tries to initiate access again; if there are no negotiated resources, it re-enters the silent state (QUITE), and the silence duration is the duration of the unnegotiated resources.
[0194] Among them, in the data domain time slot, if the node fails to successfully occupy the channel resources within the negotiated target negotiation result, the target negotiation result is updated, the occupation of the channel resources is marked, and the resources are renegotiated in the next situation cycle (ie, negotiation cycle).
[0195] Among them, in an embodiment of the present application, if the adjacent nodes negotiate the same resources, the node with priority access can be selected based on the service priority of the node, that is, optionally, in some embodiments of the present application, the step of "transmitting the data to be sent to the second node through the actual channel access resource" includes:
[0196] If there is a target negotiation result of a fifth node representing that the resource negotiation result is consistent with the actual channel access resource, determining a first service priority from the data transmission request of the first node and determining a second service priority from the data transmission request of the fifth node;
[0197] If the first service priority is higher than the second service priority, transmitting the to-be-sent data to the second node through the actual channel access resource;
[0198] If the first service priority is lower than the second service priority, waiting for the fifth node to complete transmission based on the actual channel access resource, and then transmitting the to-be-sent data to the second node based on the actual channel access resource;
[0199] If the first service priority is equal to the second service priority, the first node accesses the actual channel access resource through a competitive access strategy with the fifth node.
[0200] For example, if the nodes do not reach a completely consistent resource negotiation, that is, if the data domain resource negotiation results conflict, the specific process is as follows:
[0201] 1. If adjacent nodes and different levels of service resources negotiate for the same resource, the nodes will prioritize the access rights of high-priority services, and the transmission of high-priority services will be guaranteed. Nodes that fail to compete for access will enter a short silent state (QUITE), and the silence duration is the transmission duration of the high-priority service.
[0202] 2. If adjacent nodes and services of the same level negotiate for the same resources, the nodes will access each other using competitive access. Nodes that fail to access the contention enter a short silent state (QUITE). The minimum silent duration is the duration of the successful contention service transmission, and the maximum duration is the duration of the negotiated resources.
[0203] 3. After the quiet duration timer of the node entering the quiet state (QUITE) times out, the node continues to detect whether the subsequent resources are negotiated and available resources, and attempts to initiate access again when the subsequent negotiated resources are available; if there are no negotiated resources, the node re-enters the quiet state (QUITE), and the quiet duration is the duration of the unnegotiated resources.
[0204] 4. In the data domain time slot, if the node fails to successfully occupy the channel resources in the negotiated resource list, it updates the resource status table, marks the occupation of the channel resources, and renegotiates the resources in the next status cycle.
[0205] Among them, in the embodiment of the present application, if there is no resource negotiation result within a period of time, the channel access is performed by falling back to the contention mode, that is, optionally, in some embodiments of the present application, after the step of "updating the first current negotiation result according to the first negotiation feedback information to obtain the target negotiation result", the method further includes:
[0206] If the target negotiation result is empty, and the target negotiation results of other nodes except the first node are also empty, the first node and the other nodes use a competitive access strategy to access the target resource to complete the data transmission request.
[0207] Among them, channel access is performed by falling back to competition when there is no resource negotiation result, thereby ensuring that the service transmission can be completed, thereby ensuring normal communication functions in the worst case.
[0208] In summary, the embodiments of the present application retain the guaranteed communication when resource negotiation conflicts or fails, that is, the competitive access within the data frame can cope with the diversity and burstiness of the services.
[0209] In addition, the dynamic resource negotiation and utilization of this solution are more flexible, and in highly dynamic, distributed, large-scale flat self-organizing networks, it can meet the needs of diversified QoS services under large-scale networking. Also, in the embodiment of the present application, nodes synchronize resource negotiation status to adjacent nodes by broadcasting, and no longer need to rely on point-to-point negotiation between nodes, so that resource negotiation status propagates faster. For example, the resource negotiation status between the first node and the second node is synchronized from the first node to the third node during negotiation, and from the second node to the fourth node, and no longer needs to rely on the first node to synchronize to the third node and the fourth node respectively after the negotiation. The entire negotiation process takes up less time slots and has high efficiency, and is more suitable for large-scale networking, especially unmanned swarm self-organizing networks.
[0210] Also, in this solution, by accurately synchronizing the resource negotiation between nodes, some time slots are used as reserved time slots within the periodic frame to dynamically reserve subsequent time slot resources, which can adapt to the dynamic joining or exiting of nodes in the dynamic self-organizing network. Resource allocation needs. Also, in the negotiation of access resources, this solution does not need to divide time slots with precise boundaries, and the negotiated resources are non-fixed durations. Therefore, only coarse synchronization is required, which is suitable for highly dynamic, distributed, large-scale flat self-organizing networks.
[0211] In order to facilitate the understanding of the embodiments of the present application, the embodiments of the present application will be described from the perspective of the second node. Figure 7 As shown, Figure 7 is another flow chart of the channel access method provided in an embodiment of the present application, wherein the channel access method is specifically as follows:
[0212] 201. Receive first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node;
[0213] 202. Generate first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node;
[0214] 203. Return the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0215] 204. Determine channel access resource information based on the first negotiation feedback information, and control channel access of the second node based on the channel access resource information;
[0216] The first node also sends the first resource negotiation information to a third node within the communication range of the first node, and the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0217] In summary, by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate, the resource negotiation status of the first node and the second node is broadcast to other adjacent nodes, so that the other nodes can quickly know the resource negotiation status of the first node and the second node, which helps the other nodes avoid the resources negotiated by the first node and the second node during resource negotiation, improves negotiation efficiency, and reduces the probability of cross-collision of negotiation results.
[0218] Accordingly, in an embodiment of the present application, the second node may also update its own second current negotiation result according to the first negotiation feedback information to obtain a first updated negotiation result, and then, when generating resource negotiation with other nodes, the first updated negotiation result may be updated and sent to the other nodes, that is, optionally, in some embodiments of the present application, the step of "generating first negotiation feedback information for the first resource negotiation information according to the second current negotiation result of the second node" includes:
[0219] updating the second current negotiation result according to the first negotiation feedback information to obtain a first updated negotiation result;
[0220] generating fourth negotiation feedback information in response to a resource negotiation request of a target node in the fourth node;
[0221] Updating the first updated negotiation result according to the fourth negotiation feedback information to obtain a second updated negotiation result;
[0222] The fourth negotiation feedback information is sent to the target node, wherein the target node updates the real-time negotiation result of the target node according to the fourth negotiation feedback information to obtain a final negotiation result.
[0223] For example, see Figure 3 As shown, if node C negotiates with node B based on the negotiation between node A and node B, node C stores not only the target negotiation result from node B to node C, but also the target negotiation result from node A to node B.
[0224] In order to better implement the channel access method of the present application, the present application also provides a channel access device based on the above channel access method. The meanings of the terms are the same as those in the above channel access method, and the specific implementation details can refer to the description in the method embodiment.
[0225] See also Figure 8 , Figure 8 : is a schematic diagram of the structure of a channel access device provided in an embodiment of the present application, wherein the channel access device is applied to a first node in a network, and the device may be specifically as follows:
[0226] A response module 301 is used to determine a second node to be transmitted in response to a data transmission request;
[0227] A sending module 302, configured to generate first resource negotiation information for the second node according to the first current negotiation result of the first node, and send the first resource negotiation information to the second node and a third node within the communication range of the first node;
[0228] A receiving module 303 is configured to receive first negotiation feedback information returned by the second node for the first resource negotiation information, wherein the first negotiation feedback information is generated by the second node according to a second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node;
[0229] An updating module 304 is configured to update the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0230] A first access module 305, configured to determine channel access resource information based on the target negotiation result, and control channel access of the first node based on the channel access resource information;
[0231] The first node, the second node, the third node and the fourth node can all be in the network.
[0232] Optionally, in some embodiments of the present application, the sending module 302 includes:
[0233] A first determining unit, configured to determine data type information of the to-be-sent data corresponding to the data transmission request;
[0234] A second determining unit, configured to determine available resource information according to the first current negotiation result;
[0235] A generating unit is used to generate first resource negotiation information for the second node according to the data type information and the available resource information.
[0236] Optionally, in some embodiments of the present application, the updating module 304 includes:
[0237] a first updating unit, configured to update the first current negotiation result according to the first resource negotiation information to obtain a target negotiation result if the first negotiation feedback information satisfies a first preset condition;
[0238] a second updating unit, configured to extract resource negotiation approval information from the first negotiation feedback information if the first negotiation feedback information satisfies a second preset condition, and generate second resource negotiation information according to the first negotiation feedback information, the resource negotiation approval information, and the first current negotiation result, and perform resource negotiation with the second node through the second resource negotiation information to obtain second negotiation feedback information, and update the first current negotiation result according to the resource negotiation approval information and the second negotiation feedback information to obtain a target negotiation result;
[0239] A third update unit is used to generate third resource negotiation information directly based on the first negotiation feedback information and the first current negotiation result if the first negotiation feedback information meets a third preset condition, and to perform resource negotiation with the second node through the third resource negotiation information to obtain third negotiation feedback information, and to update the first current negotiation result according to the third negotiation feedback information to obtain a target negotiation result.
[0240] In some embodiments of the present application, the device further includes a transmission module, and the transmission module includes:
[0241] An occupying unit, used to occupy the target channel access resource corresponding to the channel access resource information to obtain a resource occupation result;
[0242] A third determining unit, configured to determine, according to the resource occupancy result, an actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request;
[0243] A transmission unit is used to transmit the data to be sent to the second node through the actual channel access resource.
[0244] In some embodiments of the present application, the third determining unit includes:
[0245] A first determining subunit is configured to use the target channel access resource as an actual channel access resource if the resource occupation result indicates that the target channel access resource is successfully occupied;
[0246] A second determining subunit is configured to determine a channel access substitute resource that replaces the target channel access resource from the available resources if the resource occupation result indicates that the target channel access resource has not been successfully occupied and the target negotiation result indicates that available resources exist, and use the channel access substitute resource as the actual channel access resource;
[0247] The third determination subunit is used to determine the actual channel access resource for transmitting the data to be sent according to the new target negotiation result of the next round of resource negotiation if the resource occupation result indicates that the target channel access resource is not successfully occupied and the target negotiation result indicates that there are no available resources.
[0248] In some embodiments of the present application, the third determining unit further includes:
[0249] An occupation marking subunit, used to mark the actual channel access resource by an occupation mark to obtain an updated target negotiation result;
[0250] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are no available resources, a resource negotiation mark is generated, wherein the resource negotiation mark is used to indicate that resource negotiation processing is performed again for the data transmission request in the next round of resource negotiation cycle;
[0251] In the next round of resource negotiation cycle, fourth resource negotiation information is generated according to the data to be sent, the first resource negotiation information and the resource occupation result, and resource negotiation processing is performed on the data transmission request according to the fourth resource negotiation information.
[0252] In some embodiments of the present application, the transmission module further includes a status marking unit, and the status marking unit includes:
[0253] A first state marking subunit, configured to identify the first node by a busy state if the first node successfully occupies the actual channel access resource and is in a state of transmitting the data to be sent based on the actual channel access resource;
[0254] The second status marking subunit is used to determine the target state according to the transmission state of the third node and identify the first node by the target state if the first node fails to successfully occupy the actual channel access resource and there is no data to be sent and no data to be received.
[0255] In some embodiments of the present application, the second state marking subunit is specifically used for:
[0256] If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the to-be-sent data exists in the cache queue of the first node, adjusting the first node to a silent state;
[0257] After adjusting to the first duration of the silent state, try to occupy the target channel access resource again, and if the target channel access resource still cannot be occupied, mark the target channel access resource as being in an occupied state;
[0258] If after adjusting to the second time length of the silent state, the target negotiation result indicates that there are available target channel access resources, then try to occupy the target channel access resources again. If the target channel access resources are not successfully occupied, then determine a channel access alternative resource to replace the target channel access resource from the target negotiation result.
[0259] In some embodiments of the present application, the transmission unit is used to:
[0260] If there is a target negotiation result of a fifth node representing that the resource negotiation result is consistent with the actual channel access resource, determining a first service priority from the data transmission request of the first node and determining a second service priority from the data transmission request of the fifth node;
[0261] If the first service priority is higher than the second service priority, transmitting the to-be-sent data to the second node through the actual channel access resource;
[0262] If the first service priority is lower than the second service priority, waiting for the fifth node to complete transmission based on the actual channel access resource, and then transmitting the to-be-sent data to the second node based on the actual channel access resource;
[0263] If the first service priority is equal to the second service priority, the first node accesses the actual channel access resource through a competitive access strategy with the fifth node.
[0264] In some embodiments of the present application, the device further includes an access module, and the access module includes:
[0265] An access unit is used to, if the target negotiation result is empty and the target negotiation results of other nodes except the first node are also empty, then the first node and the other nodes adopt a competitive access strategy to access the target resource to complete the data transmission request.
[0266] In a third aspect, an embodiment of the present application provides a channel access method, which is applied to a second node in a network, and the method includes:
[0267] Receiving first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node;
[0268] generating first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node;
[0269] Returning the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0270] The first node also sends the first resource negotiation information to a third node within the communication range of the first node, and the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0271] In the embodiment of the present application, the response module 301 first responds to the data transmission request and determines the second node to be transmitted. Then, the sending module 302 generates first resource negotiation information for the second node according to the first current negotiation result of the first node, and sends the first resource negotiation information to the second node and the third node within the communication range of the first node. Subsequently, the receiving module 303 receives the first negotiation feedback information for the first resource negotiation information returned by the second node, wherein the first negotiation feedback information is generated by the second node according to the second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to the fourth node other than the first node within the communication range of the second node. Then, the update module 304 updates the first current negotiation result according to the first negotiation feedback information to obtain the target negotiation result. Subsequently, the first access module 305 determines the channel access resource information based on the target negotiation result, and controls the channel access of the first node based on the channel access resource information, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0272] Among them, the embodiment of the present application realizes broadcasting the resource negotiation status of the first node and the second node to other adjacent nodes by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate, so that the other nodes can quickly know the resource negotiation status of the first node and the second node, which helps the other nodes to avoid the resources negotiated by the first node and the second node during resource negotiation, improves negotiation efficiency, reduces the probability of cross-collision of negotiation results, and thereby reduces the problem of access conflicts.
[0273] In order to better implement the channel access method of the present application, the present application also provides a channel access device based on the above channel access method. The meanings of the terms are the same as those in the above channel access method, and the specific implementation details can refer to the description in the method embodiment.
[0274] See also Fig. 9 , Fig. 9is another structural schematic diagram of a channel access device provided in an embodiment of the present application, wherein the channel access device is applied to a second node in a network, and the device may be specifically as follows:
[0275] A receiving module 311 is configured to receive first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node;
[0276] A generating module 312, configured to generate first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node;
[0277] A returning module 313 is configured to return the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result;
[0278] A second access module 314, configured to determine channel access resource information based on the first negotiation feedback information, and control channel access of the second node based on the channel access resource information;
[0279] The first node also sends the first resource negotiation information to a third node within the communication range of the first node, and the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0280] In some embodiments of the present application, the device further includes a synchronization module, which is specifically used to:
[0281] updating the second current negotiation result according to the first negotiation feedback information to obtain a first updated negotiation result;
[0282] generating fourth negotiation feedback information in response to a resource negotiation request of a target node in the fourth node;
[0283] Updating the first updated negotiation result according to the fourth negotiation feedback information to obtain a second updated negotiation result;
[0284] The fourth negotiation feedback information is sent to the target node, wherein the target node updates the real-time negotiation result of the target node according to the fourth negotiation feedback information to obtain a final negotiation result.
[0285] It can be understood that the embodiment of the present application realizes broadcasting the resource negotiation status of the first node and the second node to other adjacent nodes by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate, so that the other nodes can quickly know the resource negotiation status of the first node and the second node, which helps the other nodes to avoid the resources negotiated by the first node and the second node during resource negotiation, improves negotiation efficiency, reduces the probability of cross-collision of negotiation results, and thereby reduces the problem of access conflicts.
[0286] In addition, the present application also provides an electronic device, such as Fig.10 As shown, it shows a schematic diagram of the structure of the electronic device involved in this application, specifically:
[0287] The electronic device may include components such as a processor 401 with one or more processing cores, a memory 402 with one or more computer-readable storage media, a power supply 403, and an input unit 404. Those skilled in the art will appreciate that Fig.10 The electronic device structure shown in the figure does not constitute a limitation on the electronic device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.
[0288] The processor 401 is the control center of the electronic device, and uses various interfaces and lines to connect various parts of the entire electronic device. By running or executing software programs and / or modules stored in the memory 402, and calling data stored in the memory 402, the processor 401 performs various functions of the electronic device and processes data, thereby monitoring the electronic device as a whole. Optionally, the processor 401 may include one or more processing cores; preferably, the processor 401 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 401.
[0289] The memory 402 can be used to store software programs and modules. The processor 401 executes various functional applications and data processing by running the software programs and modules stored in the memory 402. The memory 402 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data created according to the use of the electronic device, etc. In addition, the memory 402 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 volatile solid-state storage devices. Accordingly, the memory 402 may also include a memory controller to provide the processor 401 with access to the memory 402.
[0290] The electronic device also includes a power supply 403 for supplying power to each component. Preferably, the power supply 403 can be logically connected to the processor 401 through a power management system, so as to manage charging, discharging, and power consumption through the power management system. The power supply 403 can also include one or more DC or AC power supplies, recharging systems, power supply device debugging circuits, power converters or inverters, power status indicators, and other arbitrary components.
[0291] The electronic device may further include an input unit 404, which may be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.
[0292] Although not shown, the electronic device may further include a display unit, etc., which will not be described in detail herein. Specifically in this embodiment, the processor 401 in the electronic device will load the executable file corresponding to the process of one or more application programs into the memory 402 according to the following instructions, and the processor 401 will run the application program stored in the memory 402, thereby implementing the steps in any channel access method provided in the embodiments of the present application.
[0293] In an embodiment of the present application, a first node determines a second node to be transmitted in response to a data transmission request, generates first resource negotiation information for the second node according to a first current negotiation result of the first node, and sends the first resource negotiation information to the second node and a third node within a communication range of the first node, and receives first negotiation feedback information returned by the second node for the first resource negotiation information, wherein the first negotiation feedback information is generated by the second node according to the second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to a fourth node other than the first node within the communication range of the second node, updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result, determines channel access resource information based on the target negotiation result, and controls channel access of the first node based on the channel access resource information, wherein the first node, the second node, the third node and the fourth node can all be in the network.
[0294] Among them, by sending resource negotiation information to a third node within the communication range of the first node and sending negotiation feedback information to a fourth node within the communication range of the second node when the first node and the second node negotiate, the resource negotiation status of the first node and the second node is broadcast to other adjacent nodes, so that the other nodes can quickly know the resource negotiation status of the first node and the second node, which helps the other nodes avoid the resources negotiated by the first node and the second node during resource negotiation, improves negotiation efficiency, and reduces the probability of cross-collision of negotiation results.
[0295] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.
[0296] A person of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by instructions, or by controlling related hardware through instructions. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.
[0297] To this end, the present application provides a computer-readable storage medium, on which a computer program is stored. The computer program can be loaded by a processor to execute the steps in any channel access method provided in the present application.
[0298] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.
[0299] The computer-readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0300] Since the instructions stored in the computer-readable storage medium can execute the steps in any channel access method provided in the present application, the beneficial effects that can be achieved by any channel access method provided in the present application can be achieved. Please refer to the previous embodiments for details and will not be repeated here.
[0301] The above is a detailed introduction to a channel access method, device, electronic device and computer-readable storage medium provided by the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea; at the same time, for technical personnel in this field, according to the idea of the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.
[0302] It should be noted that in the specific implementation of the present application, related data such as the current negotiation results of the node, resource negotiation information, data type information of the data to be sent, cache queue length, service priority, and one-hop, two-hop or three-hop relationship information between nodes, when the above embodiments of the present application are applied to specific products or technologies, user permission or consent is required, and the collection, use and processing of relevant data need to comply with relevant laws, regulations and standards of relevant countries and regions.
Claims
1. A channel access method, characterized in that: Applied to a first node in a network, the method comprises: In response to the data transmission request, determining a second node to be transmitted; Generate first resource negotiation information for the second node according to the first current negotiation result of the first node, and send the first resource negotiation information to the second node and a third node within the communication range of the first node; receiving first negotiation feedback information for the first resource negotiation information returned by the second node, wherein the first negotiation feedback information is generated by the second node according to a second current negotiation result of the second node, wherein the second node also sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node; updating the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result; Determining channel access resource information based on the target negotiation result, and controlling channel access of the first node based on the channel access resource information; Wherein, the first node, the second node, the third node and the fourth node can all be in the network; The third node and the fourth node send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges, wherein if the node receiving the first resource negotiation information or the first negotiation feedback information is still within a preset hopping range for the first node or the second node, each node continues to send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges until the preset hopping range is reached; The third node or the node that receives the first resource negotiation information completes its respective resource negotiation task based on the first resource negotiation information, and the fourth node or the node that receives the first negotiation feedback information completes its respective resource negotiation task based on the first negotiation feedback information; Among them, the process of obtaining the target negotiation result is implemented through a control frame, and the control frame is only used for resource negotiation to determine the target negotiation result, and the process of obtaining the target negotiation result through the control frame does not involve the transmission of the data to be sent corresponding to the data transmission request.
2. The channel access method according to claim 1, characterized in that: The generating first resource negotiation information for the second node according to the first current negotiation result of the first node includes: Determine data type information of the to-be-sent data corresponding to the data transmission request; Determining available resource information according to the first current negotiation result; First resource negotiation information for the second node is generated according to the data type information and the available resource information.
3. The channel access method according to claim 1, characterized in that: The updating the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result includes: If the first negotiation feedback information satisfies a first preset condition, updating the first current negotiation result according to the first resource negotiation information to obtain a target negotiation result; If the first negotiation feedback information satisfies a second preset condition, extracting resource negotiation approval information from the first negotiation feedback information, generating second resource negotiation information according to the first negotiation feedback information, the resource negotiation approval information and the first current negotiation result, performing resource negotiation with the second node through the second resource negotiation information to obtain second negotiation feedback information, and updating the first current negotiation result according to the resource negotiation approval information and the second negotiation feedback information to obtain a target negotiation result; If the first negotiation feedback information meets the third preset condition, the third resource negotiation information is directly generated based on the first negotiation feedback information and the first current negotiation result, and resource negotiation is performed with the second node through the third resource negotiation information to obtain the third negotiation feedback information, and the first current negotiation result is updated according to the third negotiation feedback information to obtain the target negotiation result.
4. The channel access method according to claim 1, characterized in that: After determining the channel access resource information based on the target negotiation result, and controlling the channel access of the first node based on the channel access resource information, the method further includes: Occupying the target channel access resource corresponding to the channel access resource information to obtain a resource occupation result; Determine, according to the resource occupancy result, an actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request; The data to be sent is transmitted to the second node through the actual channel access resource.
5. The channel access method according to claim 4, characterized in that: The determining, according to the resource occupancy result, an actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request comprises: If the resource occupation result indicates that the target channel access resource is successfully occupied, the target channel access resource is used as the actual channel access resource; If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that available resources exist, determining a channel access substitute resource to replace the target channel access resource from the available resources, and using the channel access substitute resource as the actual channel access resource; If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are no available resources, the actual channel access resource for transmitting the data to be sent is determined according to a new target negotiation result of the next round of resource negotiation.
6. The channel access method according to claim 5, characterized in that: After determining the actual channel access resource for transmitting the to-be-sent data corresponding to the data transmission request according to the resource occupancy result, the method further includes: The actual channel access resource is marked by an occupation mark to obtain an updated target negotiation result; If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that there are no available resources, a resource negotiation mark is generated, wherein the resource negotiation mark is used to indicate that resource negotiation processing is performed again for the data transmission request in the next round of resource negotiation cycle; In the next round of resource negotiation cycle, fourth resource negotiation information is generated according to the data to be sent, the first resource negotiation information and the resource occupation result, and resource negotiation processing is performed on the data transmission request according to the fourth resource negotiation information.
7. The channel access method according to claim 4, characterized in that: The method further comprises: If the first node successfully occupies the actual channel access resource and is in a state of transmitting the to-be-sent data based on the actual channel access resource, identifying the first node by a busy state; If the first node fails to successfully occupy the actual channel access resource, and there is no data to be sent and no data to be received, a target state is determined according to the transmission state of the third node, and the first node is identified by the target state.
8. The channel access method according to claim 5, characterized in that: If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the target negotiation result indicates that available resources exist, determining a channel access alternative resource that replaces the target channel access resource from the available resources includes: If the resource occupation result indicates that the target channel access resource is not successfully occupied, and the to-be-sent data exists in the cache queue of the first node, adjusting the first node to a silent state; After adjusting to the first duration of the silent state, try to occupy the target channel access resource again, and if the target channel access resource still cannot be occupied, mark the target channel access resource as being in an occupied state; If after adjusting to the second time length of the silent state, the target negotiation result indicates that there are available target channel access resources, then try to occupy the target channel access resources again. If the target channel access resources are not successfully occupied, then determine a channel access alternative resource to replace the target channel access resource from the target negotiation result.
9. The channel access method according to claim 4, characterized in that: The transmitting the to-be-sent data to the second node through the actual channel access resource comprises: If there is a target negotiation result of a fifth node representing that the resource negotiation result is consistent with the actual channel access resource, determining a first service priority from the data transmission request of the first node and determining a second service priority from the data transmission request of the fifth node; If the first service priority is higher than the second service priority, transmitting the to-be-sent data to the second node through the actual channel access resource; If the first service priority is lower than the second service priority, waiting for the fifth node to complete transmission based on the actual channel access resource, and then transmitting the to-be-sent data to the second node based on the actual channel access resource; If the first service priority is equal to the second service priority, the first node accesses the actual channel access resource through a competitive access strategy with the fifth node.
10. The channel access method according to claim 1, characterized in that: After updating the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result, the method further includes: If the target negotiation result is empty, and the target negotiation results of other nodes except the first node are also empty, the first node and the other nodes use a competitive access strategy to access the target resource to complete the data transmission request.
11. A channel access method, characterized in that: Applied to a second node in a network, the method comprises: Receiving first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node; generating first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node; Returning the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result; determining channel access resource information based on the first negotiation feedback information, and controlling channel access of the second node based on the channel access resource information; The first node further sends the first resource negotiation information to a third node within a communication range of the first node, and the second node further sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network; The third node and the fourth node send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges, wherein if the node receiving the first resource negotiation information or the first negotiation feedback information is still within a preset hopping range for the first node or the second node, each node continues to send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges until the preset hopping range is reached; The third node or the node that receives the first resource negotiation information completes its respective resource negotiation task based on the first resource negotiation information, and the fourth node or the node that receives the first negotiation feedback information completes its respective resource negotiation task based on the first negotiation feedback information; Among them, the process of obtaining the target negotiation result is implemented through a control frame, and the control frame is only used for resource negotiation to determine the target negotiation result, and the process of obtaining the target negotiation result through the control frame does not involve the transmission of the data to be sent corresponding to the data transmission request.
12. The channel access method according to claim 11, characterized in that: After generating first negotiation feedback information for the first resource negotiation information according to the second current negotiation result of the second node, the method further includes: updating the second current negotiation result according to the first negotiation feedback information to obtain a first updated negotiation result; generating fourth negotiation feedback information in response to a resource negotiation request of a target node in the fourth node; Updating the first updated negotiation result according to the fourth negotiation feedback information to obtain a second updated negotiation result; The fourth negotiation feedback information is sent to the target node, wherein the target node updates the real-time negotiation result of the target node according to the fourth negotiation feedback information to obtain a final negotiation result.
13. A channel access device, characterized in that: Applied to a first node in a network, the device comprises: A response module, configured to determine a second node to be transmitted in response to a data transmission request; a sending module, configured to generate first resource negotiation information for the second node according to the first current negotiation result of the first node, and send the first resource negotiation information to the second node and a third node within the communication range of the first node; a receiving module, configured to receive first negotiation feedback information returned by the second node for the first resource negotiation information, wherein the first negotiation feedback information is generated by the second node according to a second current negotiation result of the second node, and wherein the second node further sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node; An updating module, configured to update the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result; A first access module, configured to determine channel access resource information based on the target negotiation result, and control channel access of the first node based on the channel access resource information; Wherein, the first node, the second node, the third node and the fourth node can all be in the network; The third node and the fourth node send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges, wherein if the node receiving the first resource negotiation information or the first negotiation feedback information is still within a preset hopping range for the first node or the second node, each node continues to send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges until the preset hopping range is reached; The third node or the node that receives the first resource negotiation information completes its respective resource negotiation task based on the first resource negotiation information, and the fourth node or the node that receives the first negotiation feedback information completes its respective resource negotiation task based on the first negotiation feedback information; Among them, the process of obtaining the target negotiation result is implemented through a control frame, and the control frame is only used for resource negotiation to determine the target negotiation result, and the process of obtaining the target negotiation result through the control frame does not involve the transmission of the data to be sent corresponding to the data transmission request.
14. A channel access device, characterized in that: Applied to a second node in a network, the device comprises: A receiving module, configured to receive first resource negotiation information sent by a first node, wherein the first resource negotiation information is generated by the first node after responding to a data transmission request based on a first current negotiation result to be transmitted between the second node and the first node; A generating module, configured to generate first negotiation feedback information for the first resource negotiation information according to a second current negotiation result of the second node; a returning module, configured to return the first negotiation feedback information to the first node, wherein the first node updates the first current negotiation result according to the first negotiation feedback information to obtain a target negotiation result; a second access module, configured to determine channel access resource information based on the first negotiation feedback information, and control channel access of the second node based on the channel access resource information; The first node further sends the first resource negotiation information to a third node within a communication range of the first node, and the second node further sends the first negotiation feedback information to a fourth node other than the first node within a communication range of the second node, wherein the first node, the second node, the third node and the fourth node can all be in the network; The third node and the fourth node send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges, wherein if the node receiving the first resource negotiation information or the first negotiation feedback information is still within a preset hopping range for the first node or the second node, each node continues to send the first resource negotiation information or the first negotiation feedback information to nodes within their respective communication ranges until the preset hopping range is reached; The third node or the node that receives the first resource negotiation information completes its respective resource negotiation task based on the first resource negotiation information, and the fourth node or the node that receives the first negotiation feedback information completes its respective resource negotiation task based on the first negotiation feedback information; Among them, the process of obtaining the target negotiation result is implemented through a control frame, and the control frame is only used for resource negotiation to determine the target negotiation result, and the process of obtaining the target negotiation result through the control frame does not involve the transmission of the data to be sent corresponding to the data transmission request.
15. An electronic device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method implements the steps in the channel access method as described in any one of claims 1 to 10, or the steps in the channel access method as described in any one of claims 11 to 12.
16. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by the processor, the steps in the channel access method according to any one of claims 1 to 12 are implemented.
Citation Information
Patent Citations
Method, system and node for channel negotiation
CN102026297A
Method for realizing dynamic channel resource allocation by superframe and allocation of hybrid network
CN103052072A
Wireless channel resource allocation method
CN106936557A
Optimized wireless channel negotiation method
CN107819555A
Multi-channel MAC layer data adaptive transmission method for internet of vehicles, medium and system
CN109688566A
