A distributed dynamic adaptive multiple access method and readable storage medium

Abstract

The application discloses a distributed dynamic adaptive multiple access method and a readable storage medium. The method comprises the following steps: a plurality of network nodes reserve the use right of a first resource block by a competitive mode; if any of the network nodes successfully reserves the use right of the first resource block, the network node transmits data in the first resource block by using an exclusive mode without conflict, and other network nodes transmit data in a second resource block by using a competitive mode; if the use right of the first resource block is not successfully reserved by any of the network nodes, the network nodes transmit data in the first resource block by using the competitive mode. The method disclosed by the application can effectively improve the resource utilization rate, solves the problem of adaptive comprehensive use of direct competitive transmission and reservation transmission, and makes the method adapt to the comprehensive service transmission of dynamic load change and more effectively utilize the transmission resource.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of computer communication, and in particular to a distributed dynamic adaptive multiple access method and a readable storage medium. BACKGROUND

[0002] A channel generally refers to a medium for transmitting information in a certain direction. The channel can be a specific frequency range of electromagnetic signals, referred to as a frequency band, or a specific segment of signals, referred to as a frame. Channel sharing refers to the use of the same channel by multiple users at the same time while ensuring that they do not interfere with each other. Channel sharing can improve the utilization of channel resources. Based on the determination of the basic technology of the channel sharing to be used, the key problem that needs to be solved in system design is: how to allocate the divided resource blocks (frequency bands, time slots, code words, or regions) to different users for use, and improve the user capacity and transmission performance of user data of the system on the basis of ensuring no conflict or resolving the conflict, that is, how to meet the user demand and improve the system performance through channel resource allocation.

[0003] A commonly used channel resource allocation method is multiple access control, which can be divided into two categories: static allocation and dynamic allocation. There are two ways to solve the problem of resource conflict and resource reuse in the existing dynamic allocation of distributed mesh structure: one is random contention access, which allows resource conflicts to occur and offsets the impact of resource conflicts through certain compensation measures; the other is controlled access, which pre-allocates resources through polling or reservation to avoid resource conflicts. Regardless of which approach, a special resource coordination process through control signaling is generally required, and in order to ensure the effectiveness and reliability of this resource coordination process, low-speed and high-reliability communication means are generally used for signaling interaction.

[0004] In a mobile ad hoc network, the following problems need to be solved when using a distributed multiple access strategy: for a high-speed transmission system, the transmission resources are abundant, providing a basis for using various multiple access strategies. At this time, the first thing to consider is how to comprehensively apply various multiple access strategies to meet the high-level demand and provide different levels of services. For a low-speed transmission system, due to limited transmission capacity, the system often operates in a medium-high load scenario, and the multiple access strategy needs to reduce information interaction between nodes and the probability of data transmission collision, thereby reducing overhead and improving resource utilization. Therefore, the use of direct contention transmission is limited, and the overhead of reservation transmission must be minimized. In a high-speed transmission system, the available transmission resources are abundant, and the use of multiple access strategies is less restricted, so various multiple access strategies can be used to provide the required services for the high level; for a low-speed transmission system, the overhead of the multiple access strategy restricts the use of multiple access technologies, limiting the use of direct contention transmission, and the overhead of reservation transmission must be minimized.

[0005] Therefore, the application of existing multiple access strategies in low- and medium-speed systems mainly has the following problems: direct contention strategy has low overhead, but the probability of data collision is high, making it difficult to improve resource utilization; reservation transmission strategy requires information exchange between nodes, which has a large overhead and reduces resource utilization; low- and medium-speed systems find it difficult to use existing single strategies to support dynamic changes in service types and loads. Summary of the Invention

[0006] This invention provides a distributed dynamic adaptive multiple access method and a readable storage medium, which can solve the overhead problem of scheduled transmission, making it suitable for low-speed transmission systems or situations with limited transmission capacity, and effectively improving resource utilization; it also solves the problem of adaptive integrated use of direct contention transmission and scheduled transmission, making it suitable for integrated service transmission with dynamically changing load, and more effectively utilizing transmission resources.

[0007] A distributed dynamic adaptive multiple access method according to the present invention includes:

[0008] Multiple network nodes compete to reserve the right to use the first resource block;

[0009] If any of the network nodes successfully reserve the right to use the first resource block, the network node shall send data in the first resource block in an exclusive mode without conflict, while other network nodes shall use the second resource block in a contention mode to send data.

[0010] If the right to use the first resource block is not successfully reserved by any of the network nodes, the network node uses the first resource block in a contention mode to send data.

[0011] Preferably, the method further includes:

[0012] The behavior of competing for the channel is determined based on the transceiver states of the network node and its neighboring nodes; wherein, the transceiver state is the receive and transmit state determined by the network node for any time-frequency resource.

[0013] Preferably, the method further includes:

[0014] A pseudo-random sequence generator outputs a pseudo-random sequence based on a seed value; the seed value is the node identifier in the neighbor information, and the pseudo-random sequence is an integer greater than or equal to 0 and less than or equal to n;

[0015] The pseudo-random sequence drives the transitions of the finite state machine of the transceiver;

[0016] The pseudo-random sequence is a transition condition of a finite state machine of the transceiver, and the finite state machine of the transceiver is a transceiver state determined by the network node on the agreed time-frequency and a transition relationship and an execution action between the transceiver states.

[0017] Preferably, the transceiver state includes a listening state and a possible sending state, and the method further includes:

[0018] When the pseudo-random sequence is 0, the finite state machine is transferred from the listening state or the possible sending state to the possible sending state;

[0019] When the pseudo-random sequence is not 0, the finite state machine is transferred from the listening state or the possible sending state to the listening state.

[0020] Preferably, the method further includes:

[0021] The network node obtains node identities of 1-hop neighbor nodes and 2-hop neighbor nodes to generate the seed value.

[0022] Preferably, the network node is divided into a sending node and a receiving node, and the network node reserves the use right of the first resource block by a contention manner, including:

[0023] The sending node sends a reservation request to reserve the use right of the first resource block;

[0024] The receiving node receiving the reservation request sends a reservation response according to the reservation request when the first resource block is not reserved;

[0025] The sending node sends a reservation confirmation to the receiving node to obtain the use right of the first resource block after receiving the reservation response.

[0026] Preferably, before the network node reserves the use right of the first resource block by the contention manner, the method further includes:

[0027] Obtaining an amount of data to be sent in a queue and a transmission capacity of the first resource block;

[0028] When the amount of data to be sent in the queue is greater than a product of a resource threshold and the transmission capacity, the network node reserves the use right of the first resource block by the contention manner;

[0029] When the product of the resource threshold and the transmission capacity is greater than the amount of data to be sent in the queue, the network node evaluates the first resource block.

[0030] Preferably, evaluating the first resource block includes:

[0031] The network node determines a transmission load and a resource reservation according to the monitored reservation signaling to evaluate the first resource block.

[0032] Preferably, the method further comprises:

[0033] When the network node is in a contention state at the first resource block and does not receive reservation signaling from other network nodes, the network node uses the second resource block in a contention mode to transmit data in the second resource block.

[0034] When the network node is in a contention state at the first resource block and receives reservation signaling from other network nodes, the network node determines a resource usage mode of the first resource block according to the reservation signaling.

[0035] A computer readable storage medium storing one or more programs executable by one or more processors to implement the steps of the method for distributed dynamic adaptive multiple access as claimed in any one of the above.

[0036] The method for distributed dynamic adaptive multiple access according to the present application solves the problem of adaptive comprehensive use of direct contention transmission and reservation transmission by reserving a responding resource block in a contention mode and monitoring the resource block in real time, and makes it adapt to comprehensive service transmission with dynamic load change and more effectively utilize transmission resources. BRIEF DESCRIPTION OF DRAWINGS

[0037] Figure 1 is a segmentation diagram of a resource block in an embodiment of the present application;

[0038] Figure 2 is a flowchart of the method for distributed dynamic adaptive multiple access in an embodiment of the present application;

[0039] Figure 3 is a diagram of an information interaction process of a network node in an embodiment of the present application;

[0040] Figure 4 is a diagram of a finite state machine of a transceiver in an embodiment of the present application;

[0041] Figure 5 is a diagram of a state of a transceiver of a network node in a channel evaluation and reservation stage in an embodiment of the present application;

[0042] Figure 6 is a diagram of a signaling interaction process in an embodiment of the present application;

[0043] Figure 7 is a diagram of a finite state machine of a transceiver in an embodiment of the present application. DETAILED DESCRIPTION

[0044] The application will be described in further detail below with reference to the drawings and embodiments. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not to be used to limit the scope of the application. In addition, it should be noted that, for the sake of brevity, only the portions of the drawings that are needed to understand the application have been shown in the drawings.

[0045] The embodiment of the application provides a distributed dynamic adaptive multiple access method, the core idea of which is to divide resource blocks into two stages of channel evaluation and reservation and resource use, as shown in the figure. Figure 1 In the channel evaluation and reservation stage, network nodes reserve the use right of resource blocks by competition and evaluate the resource blocks to determine the resource use mode of the current resource blocks; in the resource use stage, network nodes use resource blocks according to the reservation and decision in the channel evaluation and reservation stage, and nodes successfully reserving the resource blocks use the resource blocks to transmit data without conflict; network nodes detecting that the resource blocks are reserved by other nodes receive data in the resource blocks or are silent.

[0046] As shown in the figure, it is a flow chart of a distributed dynamic adaptive multiple access method of the application, and the method specifically comprises the following steps. Figure 2 As shown in the figure, it is a flow chart of a distributed dynamic adaptive multiple access method of the application, and the method specifically comprises the following steps.

[0047] In step 201, a plurality of network nodes reserve the use right of a first resource block by competition. Specifically, the first resource block is evaluated by detecting the transceiving condition of reservation signaling, so as to adaptively adjust the use mode of the first resource block and determine the use right of the first resource block.

[0048] In step 202, if any of the network nodes successfully reserves the use right of the first resource block, the network node uses an exclusive mode to transmit data in the first resource block without conflict, and other network nodes use a competitive mode to transmit data in a second resource block. Specifically, the network node successfully reserving the use right of the first resource block can transmit, receive or be silent in the current resource block according to the exclusive mode. The network nodes competing for the first resource block can only use the second resource block to transmit data in a competitive mode after failing to compete for the first resource block. The second resource block is not successfully reserved by other network resources, i.e., the second resource block refers to a resource block that is not reserved or is not successfully reserved.

[0049] If the use right of the first resource block is not successfully reserved by any of the network nodes, the network node uses the first resource block to send data in a contention mode, step 203. Specifically, if no network node reserves the use right of the first resource block or fails to reserve, it is equivalent to that the use right of the first resource block is not successfully reserved by any of the network nodes, and the first resource block has no corresponding network node for exclusive use, so the network node needs to send data in a contention mode in the resource use stage.

[0050] The distributed dynamic adaptive multiple access method can solve the problem of adaptive comprehensive use of direct contention transmission and reservation transmission by reserving a responding resource block in a contention mode and monitoring the resource block in real time, and can make the method adapt to comprehensive service transmission with dynamic load change and more effectively utilize transmission resources.

[0051] The distributed dynamic adaptive multiple access method further comprises the following steps:

[0052] The behavior of contending for a channel is determined according to the transceiver state of the network node and the neighbor node, and the transceiver state is the receiving and sending state of the network node at any time-frequency resource. Specifically, the network node completes information interaction between network nodes and information collection of neighbor nodes through the Fan-in and Fan-out processes as shown in the figure. Figure 3 In the Fan-in stage, the network node 0 collects information sent by the neighbor nodes 1 to 8, and updates the neighbor information list of itself; in the Fan-out stage, the network node 0 sends its own state information and the collected neighbor information to the neighbor nodes 1 to 8. Specifically, the neighbor node itself is also one of the network nodes, but when it is regarded as a neighbor node of other network nodes, it is regarded as a neighbor node.

[0053] The distributed dynamic adaptive multiple access method further comprises the following steps:

[0054] The pseudo-random sequence generator outputs a pseudo-random sequence according to a seed value, the seed value is a node identifier in the neighbor information, and the pseudo-random sequence is an integer greater than or equal to 0 and less than or equal to n. Specifically, the pseudo-random sequence generator generates a pseudo-random sequence according to a seed value, and the generated sequence is controllable and predictable, so it is called "pseudo-random". The output of the pseudo-random sequence generator used in the embodiment of the application, that is, the pseudo-random sequence, is only related to the input seed value and position, that is, the output value is a function of the seed value and position, denoted as V_pr=f(seed,pos), and the pseudo-random sequence is limited to an integer greater than or equal to 0 and less than or equal to n.

[0055] The pseudo-random sequence drives the transition of the finite state machine of the transceiver. Wherein, the pseudo-random sequence is the transition condition of the finite state machine of the transceiver, and the finite state machine of the transceiver is the transceiver state determined by the network node on the agreed time-frequency and the transition relationship and executed action between the transceiver states.

[0056] Specifically, the finite state machine is a mathematical model used to represent a finite number of states and the transition and action execution behaviors between the states, which has three components: state, event and action. The event triggers the state transition and also triggers the action execution, while the action execution is not necessary, which can only trigger the state transition without specifying any action. The state of the transceiver is the transmission-reception state determined by the network node on any time-frequency resource, such as the agreed time-frequency resource, and typical states include: transmission, reception, sleep, etc. The finite state machine of the transceiver is the transceiver state determined by the network node on the given time-frequency resource and the transition relationship and executed action between the states.

[0057] Specifically, in the channel assessment and reservation phase, the network node drives the same finite state machine of the transceiver using the same pseudo-random sequence generator, and uses the unique node identification of the node as the seed value of the pseudo-random sequence generator, and uses the network synchronization time as the position information of the pseudo-random sequence. Therefore, given the node identification and network synchronization time of the network node, the output value V_pr of the pseudo-random sequence can be uniquely determined as f(seed, pos).

[0058] The distributed dynamic adaptive multiple access method according to the embodiment of the application, preferably, the transceiver state includes: a listening state and a possible transmission state, and the method further includes:

[0059] When the pseudo-random sequence is 0, the finite state machine is transferred from the listening state or the possible transmission state to the possible transmission state;

[0060] When the pseudo-random sequence is not 0, the finite state machine is transferred from the listening state or the possible transmission state to the listening state.

[0061] Specifically, the two transceiver states in the embodiment of the application are as follows:

[0062] The listening state (L) indicates that the transceiver is in a receiving state and can receive messages sent by other nodes;

[0063] The possible transmission state (PT) indicates that the transceiver transmits messages with a certain probability p.

[0064] For example, Figure 4As shown, the finite state machine of the transceiver is assumed to transfer from the listening state L or the possible transmitting state PT to the possible transmitting state PT when V_pr=0; otherwise, it transfers from the listening state L or the possible transmitting state PT to the listening state L. Since the output value of the pseudo-random sequence is an integer greater than or equal to 0 and less than or equal to n, according to the above finite state machine, the proportion of the transceiver in the listening state L and the possible transmitting state PT is about n.

[0065] In the embodiment of the present application, the first resource block is divided into equal-length time slots slot in the time dimension, but it is not limited to the above-mentioned division of the resource block, for example, the resource block can be divided into equal-width and equal-length resource sub-blocks in the time dimension and the frequency dimension, and applied to a multi-channel time division system. Assuming that the first resource block is time-divisioned into 30 time slots slot, the first 10 time slots are defined as the channel assessment and reservation phase, and the remaining 20 time slots are defined as the resource use phase. In the case where the network node drives the finite state machine of the transceiver as shown in Figure 4 , the state of the transceiver of the network node in the channel assessment and reservation phase is as shown in Figure 5 . In the case where the network nodes 1, 2, and 3 are neighbor nodes and the neighbor information collection is completed, any network node can calculate the transceiver state of the other two neighbor nodes in any time slot, and determine the channel competition behavior according to the state of itself and the neighbor nodes:

[0066] If the state of the network node is L in the time slot i, the reservation signaling is received and the channel state is assessed;

[0067] If the state of the network node is PT in the time slot i and the state of all neighbor nodes is L, the reservation signaling is sent;

[0068] If the state of the network node is PT in the time slot i and the state of m neighbor nodes is also PT, the reservation signaling is sent according to the probability a / m, where a is defined as a signaling sending adjustment coefficient, and the typical value is 1.

[0069] The distributed dynamic adaptive multiple access method described in the embodiment of the present application, preferably, the method further comprises:

[0070] The network node obtains the node identities of the 1-hop neighbor nodes and the 2-hop neighbor nodes to generate the seed value. Specifically, in the present scheme, in order to reduce the overhead, only the node information of the neighbor nodes needs to be collected in the neighbor information collection process, and the node information can be unique identification information representing the neighbor nodes. After the above process, the network node will obtain the set of its own 1-hop neighbor nodes and 2-hop neighbor nodes, denoted as S_N(1) and S_N(2) respectively, and the set including the node itself and the 1-hop neighbor nodes is denoted as S_N[1], and the set including the node itself and the 2-hop neighbor nodes is denoted as S_N[2] and used as the seed value.

[0071] The distributed dynamic adaptive multiple access method according to the embodiments of the present application, preferably, the network nodes are divided into sending nodes and receiving nodes, and the network nodes reserve the use right of the first resource block by a competitive manner, including:

[0072] The sending node sends a reservation request to reserve the use right of the first resource block;

[0073] The receiving node receiving the reservation request sends a reservation response according to the reservation request when the first resource block is not reserved;

[0074] The sending node sends a reservation confirmation to the receiving node to obtain the use right of the first resource block after receiving the reservation response.

[0075] In specific embodiments, the network nodes in the embodiments of the present application are further divided into signaling sending nodes and receiving nodes, as shown in Figure 6 , which are three kinds of signaling and the interaction between the signaling when the network nodes reserve the use right of the first resource block in a competitive manner.

[0076] In the first stage, the sending node competing for the use of the channel sends a reservation request RTS (Require-To-Send) signaling to compete for the channel and reserve the use right of the first resource block, and the sending time of the reservation request RTS is determined by the sending node, for example, the starting time of the time slot n.

[0077] In the second stage, the receiving node receiving the reservation request RTS receives the reservation request RTS containing the address of the receiving node by sending a reservation response CTS (Clear-To-Send) response. The reservation response CTS is sent immediately in the next time slot after receiving the reservation request RTS or is sent when a certain constraint relationship is met, for example, the starting time of the time slot n+1.

[0078] In the third stage, after the sending node sends a reservation request RTS and receives a corresponding reservation response CTS, the sending node sends a confirm-to-send OTS (OTS: Confirm-To-Send) and sends a reservation confirmation OTS to the receiving node to confirm the use of the first resource block. The sending time of the reservation confirmation OTS is immediately after the next time slot in which the reservation response CTS is received or satisfies certain constraint relationships, for example, the start time of the time slot n+2.

[0079] Preferably, before the network node reserves the use of the first resource block by the contention manner, the method further comprises:

[0080] obtaining the amount of data to be sent in the queue and the transmission capacity of the first resource block;

[0081] when the amount of data to be sent in the queue is greater than the product of the resource threshold and the transmission capacity, the network node reserves the use of the first resource block by the contention manner;

[0082] when the product of the resource threshold and the transmission capacity is greater than the amount of data to be sent in the queue, the network node evaluates the first resource block.

[0083] In a specific embodiment, the method comprises a resource threshold RESV_TH1, which represents a threshold for initiating the contention for the use of the first resource block, and the value of the threshold is greater than or equal to 0 and less than 1. In the embodiment, in order to fully utilize the transmission resource, the network node counts the amount of data to be sent in the queue queue_data_size and the transmission capacity tx_data_size of the first resource block at the start time of the first resource block, and determines whether the inequality queue_data_size>RESV_TH1×tx_data_size is established. If the inequality is established, that is, the amount of data to be sent in the queue is greater than the product of the resource threshold and the transmission capacity, the network node needs to contend for the use of the first resource block; if the inequality is not established, that is, the product of the resource threshold and the transmission capacity is greater than the amount of data to be sent in the queue, the network node only evaluates the first resource block in the channel evaluation and reservation stage, and does not participate in the contention for the use of the first resource block.

[0084] Preferably, the evaluation of the first resource block comprises:

[0085] the network node determines the transmission load and resource reservation according to the monitored reservation signaling to evaluate the first resource block.

[0086] In the preferred embodiment, the network node that needs to contend for the first resource block enters the contention state at the beginning of the channel evaluation and reservation phase, and determines the behavior of contending for the channel according to the transceiver state of itself and its neighbor nodes, and its finite state machine for reserving resources is as shown in Fig. 1. Figure 7

[0087] If the network node in the contention state can send the reservation signaling in the current time slot, the network node sends the reservation request RTS at the beginning of the time slot, and enters the "waiting for CTS" state, and waits for the corresponding reservation response CTS in the expected time slot. If the corresponding reservation response CTS is not received in the expected time slot, the timeout returns to the "contention" state; if the corresponding reservation response CTS is received, the network node sends the reservation confirmation OTS, and notifies its neighbor nodes of the right to use the current resource block.

[0088] If the network node in the contention state cannot send the reservation signaling in the current time slot, the network node monitors and evaluates the first resource; if the reservation request RTS with the network node address as the receiving address is received, the network node sends the reservation response CTS at the beginning of the next time slot, and enters the "waiting for OTS" state; if the reservation request RTS with the address of other sending nodes as the receiving address is received, the network node enters the busy state and waits for the reservation confirmation OTS sent by the sending node.

[0089] If the network node in the "waiting for OTS" state receives the reservation confirmation OTS sent by the sending node or the channel evaluation and reservation phase ends, the network node determines that the sending node has the right to use the first resource block, and waits for the data reception; if the OTS sent by the sending node is not received in the expected time slot, the network node judges that the sending node has timed out in the contention, and returns to the contention state.

[0090] If the network node in the "busy" state receives the reservation response CTS or the reservation confirmation OTS sent by other network nodes, the network node determines that the first resource block has been successfully reserved by other nodes, and ends the channel evaluation and reservation phase; if the reservation response CTS or the reservation confirmation OTS sent by other network nodes is not received in the expected time slot, the network node judges that the other network nodes have timed out in the contention, and returns to the "contention" state.

[0091] In the channel evaluation and reservation phase, according to the constraint condition, only the network node that evaluates the channel in the channel evaluation and reservation phase does not enter the contention state at the beginning of the channel evaluation and reservation phase, and does not actively send its own reservation request RTS, but responds to the reservation request RTS or the reservation confirmation OTS sent by other network nodes according to the rules described above.

[0092] ​The network node determines the channel competition result according to the reservation signaling sent and received in the channel evaluation and reservation stage, and determines the mode of using the first resource block, i.e. the exclusive mode or the competition mode, according to the result, so as to organically combine the direct competition transmission and the reservation transmission in an efficient and adaptive manner.

[0093] The distributed dynamic adaptive multiple access method further comprises the following steps:

[0094] When the network node is in the competition state at the first resource block and no reservation signaling is received from other network nodes, the network node uses the second resource block in the competition mode to send data in the second resource block.

[0095] When the network node is in the competition state at the first resource block and receives the reservation signaling from other network nodes, the resource use mode of the first resource block is determined according to the reservation signaling.

[0096] In a specific embodiment, a time threshold RESV_TH2 of channel evaluation is defined as the second time slot, and the time threshold is a positive integer, indicating the number of time slots reaching a certain constraint condition. If the network node is in the competition state in the first time threshold RESV_TH2 time slots, i.e. the second time slot, in the channel evaluation and reservation stage of the first resource block and does not receive any reservation signaling sent by other network nodes, it is considered that the current resource block is expected to work in the low load mode, and the network node needs to use the second resource block in the competition mode to send data. When the network node monitors or initiates the resource reservation behavior in the first time threshold RESV_TH2 time slots in the channel evaluation and reservation stage of the first resource block, the resource use mode of the first resource block needs to be determined according to the reservation result: if a network node successfully reserves the first resource block, the network node that successfully reserves the first resource block sends, receives or is silent in the current resource block in the exclusive mode; if no network node successfully reserves the first resource block, the network node needs to use the competition mode to send data in the resource use stage.

[0097] The distributed dynamic adaptive multiple access method generates a random sequence by combining a random sequence generator and a finite state machine based on neighbor information, solves the overhead problem of the reservation transmission, makes it adapt to the low-speed transmission system or the limited transmission capacity, effectively improves the resource utilization rate, solves the problem of adaptively and comprehensively using the direct competition transmission and the reservation transmission, makes it adapt to the dynamic change of the comprehensive service transmission, and more effectively utilizes the transmission resource.

[0098] Therefore, the strategy reduces the information interaction between nodes, reduces the probability of data transmission collision, thereby reducing the overhead and improving the resource utilization, and directly uses the efficient and adaptive combination of the contention transmission and the reservation transmission to better support the dynamic load change of the comprehensive service transmission of the medium and low speed network.

[0099] The embodiment of the present application further provides a computer readable storage medium, which stores one or more programs, and the one or more programs can be executed by one or more processors to implement the steps of the distributed dynamic adaptive multiple access method.

[0100] It should be understood that the size of the sequence number of the above processes in various embodiments herein does not mean the order of execution, and the execution order of the processes should be determined according to their functions and inherent logic, and should not constitute any limitation on the implementation process of the embodiments herein.

[0101] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can adopt a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) containing computer usable program codes.

[0102] The present application is described with reference to flowcharts and / or block diagrams according to the method, equipment (system), and computer program product of the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment produce a means for implementing the functions specified in the flowcharts and / or block diagrams. Figure 1 The functions specified in one flow or multiple flows and / or blocks Figure 1 The means for implementing the functions specified in one block or multiple blocks.

[0103] These computer program instructions can also be stored in a computer readable memory capable of guiding the computer or other programmable data processing equipment to work in a specific way, so that the instructions stored in the computer readable memory produce a product including instruction means, which implements the functions specified in the flowcharts and / or block diagrams. Figure 1 The functions specified in one flow or multiple flows and / or blocks Figure 1 The means for implementing the functions specified in one block or multiple blocks.

[0104] These computer program instructions can also be loaded into a computer or other programmable data processing devices, so that a series of operational steps are performed on the computer or other programmable devices to generate computer-implemented processes, thus the instructions executed on the computer or other programmable devices provide the function for implementing the processes specified in the flowchart Figure 1 one or more flows and / or blocks Figure 1 one or more blocks or steps of the functions specified in the flowchart

[0105] The foregoing description of specific exemplary embodiments of the application has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the application to the precise form disclosed, and obviously many modifications and variations are possible in light of the above teaching. It is intended that the scope of the application be limited not with this detailed description, but rather by the claims appended hereto.

Claims

1. A distributed dynamic adaptive multiple access method, characterized in that, The method comprises: a plurality of network nodes reserve the use of a first resource block by contention; if any of the network nodes successfully reserves the use of the first resource block, the network node transmits data in the first resource block in an exclusive mode without collision, and other network nodes transmit data in a second resource block in a contention mode; if the use of the first resource block is not successfully reserved by any of the network nodes, the network nodes transmit data in the first resource block in a contention mode; the distributed dynamic adaptive multiple access method further comprises: a pseudo-random sequence generator outputs a pseudo-random sequence according to a seed value; the seed value is a node identifier in neighbor information, and the pseudo-random sequence is an integer greater than or equal to 0 and less than or equal to n; the pseudo-random sequence drives the transition of a finite state machine of a transceiver; wherein the pseudo-random sequence is a transition condition of the finite state machine of the transceiver, and the finite state machine of the transceiver is a transceiver state determined by the network node on an agreed time-frequency and a transition relationship and an execution action between the transceiver states; the transceiver state comprises a listening state and a possible transmission state, and the method further comprises: when the pseudo-random sequence is 0, the finite state machine is transferred from the listening state or the possible transmission state to the possible transmission state; when the pseudo-random sequence is not 0, the finite state machine is transferred from the listening state or the possible transmission state to the listening state; the distributed dynamic adaptive multiple access method further comprises: the network node obtains node identifiers of 1-hop neighbor nodes and 2-hop neighbor nodes to generate the seed value.

2. The method of claim 1, wherein, The method further comprises: determining the behavior of a contention channel according to the transceiver state of the network node and the neighbor node; wherein the transceiver state is a receiving and transmitting state determined by the network node on any time-frequency resource.

3. The method of claim 1, wherein, The network node is divided into a transmitting node and a receiving node, and the network node reserves the use of a first resource block by contention comprises: the transmitting node transmits a reservation request to reserve the use of the first resource block; the receiving node receiving the reservation request sends a reservation response according to the reservation request when the first resource block is not reserved; the transmitting node sends a reservation confirmation to the receiving node to obtain the use of the first resource block after receiving the reservation response.

4. The method of claim 1, wherein, Before the network node reserves the use of a first resource block by contention, the method further comprises: obtaining the amount of data to be transmitted in a queue and the transmission capacity of the first resource block; when the amount of data to be transmitted in the queue is greater than the product of a resource threshold and the transmission capacity, the network node reserves the use of the first resource block by contention; when the product of the resource threshold and the transmission capacity is greater than the amount of data to be transmitted in the queue, the network node evaluates the first resource block.

5. The method of claim 4, wherein, Evaluating the first resource block comprises: the network node determines transmission load and resource reservation according to the monitored reservation signaling to evaluate the first resource block.

6. The method of claim 1, wherein, The method further comprises: when the network node is in the contention state at the first resource block and does not receive the reservation signaling from other network nodes, the network node uses the second resource block in the contention mode to transmit data in the second resource block; when the network node is in the contention state at the first resource block and receives the reservation signaling from other network nodes, the network node determines the resource usage mode of the first resource block according to the reservation signaling.

7. A computer readable storage medium characterized by The computer readable storage medium stores one or more programs, and the one or more programs are executable by one or more processors to implement the steps of the distributed dynamic adaptive multiple access method according to any one of claims 1 to 6.

Images