CN116193617A

CN116193617A - Distributed dynamic self-adaptive multiple access method and readable storage medium

Info

Publication number: CN116193617A
Application number: CN202211646859.0A
Authority: CN
Inventors: 王峰; 邹艳芳
Original assignee: Beijing Tongguanglong Electronic Technology Co ltd
Current assignee: Beijing Tongguanglong Electronic Technology Co ltd
Priority date: 2022-12-21
Filing date: 2022-12-21
Publication date: 2023-05-30

Abstract

The invention discloses a distributed dynamic self-adaptive multiple access method and a readable storage medium, wherein the method comprises the following steps: reserving the use right of the first resource block by a plurality of network nodes in a competition mode; if any network node successfully reserves the use right of the first resource block, the network node adopts an exclusive mode to send data without conflict in the first resource block, and other network nodes adopt a competition mode to send data by using a second resource block in the second resource block; and if the use right of the first resource block is not reserved successfully by any network node, the network node adopts a competition mode to send data by using the first resource block in the first resource block. The method disclosed by the invention can effectively improve the resource utilization rate; the method solves the problems of self-adaptive comprehensive use direct competition transmission and reserved transmission, is suitable for comprehensive service transmission with dynamic change of load, and utilizes transmission resources more effectively.

Description

Distributed dynamic self-adaptive multiple access method and readable storage medium

Technical Field

The present invention relates to the field of computer communications, and in particular, to a distributed dynamic adaptive multiple access method and a readable storage medium.

Background

A channel is generally a medium that represents information transmitted in a certain direction. A channel may be a particular frequency region of an electromagnetic signal, referred to as a frequency band; or a particular segment of the signal, called a frame. Channel sharing is to use the same channel for multiple users at the same time and ensure that the users do not interfere with each other. Channel sharing may improve the utilization of channel resources. On the basis of determining the adopted channel sharing basic technology, the problems to be solved in the system design are as follows: how to allocate the divided resource blocks (frequency bands, time slots, code words or areas) to different users for use, and improve the user capacity of the system and the transmission performance of user data on the basis of guaranteeing no conflict or resolving conflict, namely how to meet the user requirements through channel resource allocation, and improve the system performance.

The common channel resource allocation mode is multiple access control, and can be divided into two main types of static allocation and dynamic allocation according to the implementation mode. The existing dynamic allocation classes of the distributed network structure have two ideas for solving the problems of resource conflict and resource multiplexing: one is random competition access, which allows resource conflict to occur, and counteracts the influence caused by the resource conflict through a certain compensation measure; the other is to control access, and resources are pre-allocated in a polling or reservation mode, so that resource conflict is avoided. Regardless of the concept, a special resource coordination process through control signaling is generally required, and in order to ensure the effectiveness and reliability of the resource coordination process, signaling interaction generally adopts a low-speed and high-reliability communication means.

In a mobile ad hoc network, the following problems need to be solved by adopting a distributed multiple access strategy: for a high-speed transmission system, the transmission resources are rich, and a foundation is provided for adopting various multiple access strategies. At this time, firstly, how to comprehensively apply various multiple access strategies is considered, so as to meet the requirements of a high layer and provide services of different grades. For a low-speed transmission system, because the transmission capability is limited, the system is often in a medium-high load working scene, and the multiple access strategy needs to reduce information interaction between nodes and reduce the probability of collision of data transmission, so that the cost is reduced and the resource utilization rate is improved. Therefore, the use of direct contention transmission is limited and the overhead of reserved transmission must be minimized. In a high-speed transmission system, available transmission resources are rich, the use constraint on a multiple access technology is less, and various multiple access strategies can be comprehensively applied to provide needed services for a high layer; for medium and low speed transmission systems, the overhead of the multiple access strategy restricts the use of multiple access technology, restricts the use of direct contention transmission, and must minimize the overhead of reserved transmission.

Therefore, the application of the existing multiple access strategy in a medium-low speed system mainly has the following problems: the direct competition strategy has low cost, but the collision probability of the data is high, so that the resource utilization rate is difficult to improve; the reserved transmission strategy needs information interaction among nodes, so that the cost is high, and the resource utilization rate is reduced; it is difficult for medium and low speed systems to support dynamic changes in traffic type and load using existing single policies.

Disclosure of Invention

The invention provides a distributed dynamic self-adaptive multiple access method and a readable storage medium, which can solve the problem of the cost of reserved transmission, adapt to the condition of a low-speed transmission system or limited transmission capacity, and effectively improve the resource utilization rate; the method solves the problems of self-adaptive comprehensive use direct competition transmission and reserved transmission, is suitable for comprehensive service transmission with dynamic change of load, and utilizes transmission resources more effectively.

The invention discloses a distributed dynamic self-adaptive multiple access method, which comprises the following steps:

reserving the use right of the first resource block by a plurality of network nodes in a competition mode;

if any network node successfully reserves the use right of the first resource block, the network node adopts an exclusive mode to send data without conflict in the first resource block, and other network nodes adopt a competition mode to send data by using a second resource block in the second resource block;

and if the use right of the first resource block is not reserved successfully by any network node, the network node adopts a competition mode to send data by using the first resource block in the first resource block.

Preferably, the method further comprises:

determining the behavior of a competition channel according to the transceiver states of the network node and the neighbor nodes; the transceiver state is a receiving and transmitting state determined by the network node at any time-frequency resource.

Preferably, the method further comprises:

outputting a pseudo-random sequence by a pseudo-random sequence generator according to the seed value; the seed value is a node identifier in the neighbor information, and the pseudo-random sequence is an integer which is more than or equal to 0 and less than or equal to n;

the pseudo-random sequence drives the transfer of a finite state machine of the transceiver;

the pseudo-random sequence is a transition condition of a finite state machine of a transceiver, and the finite state machine of the transceiver is a transceiver state determined by the network node on a stipulated time frequency, and a transition relation and an execution action between the transceiver states.

Preferably, the transceiver status includes: listening status and possible sending status, the method further comprising:

when the pseudo-random sequence is 0, the finite state machine transitions from a listening state or a possible transmission state to a possible transmission state;

when the pseudorandom sequence is not 0, the finite state machine transitions from a listening state or possibly transmit state to a listening state.

Preferably, the method further comprises:

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

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 in a contention mode, including:

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

when the first resource block is not reserved, the receiving node receiving the reservation request sends a reservation response according to the reservation request;

and the sending node sends reservation confirmation to the receiving node after receiving the reservation response so as to obtain the use right of the first resource block.

Preferably, before the network node reserves the usage right of the first resource block in a contention manner, the method further includes:

acquiring the data quantity to be sent in a queue and the transmission capacity of the first resource block;

when the data quantity to be sent in the queue is larger than the product of a resource threshold and the transmission capacity, reserving the use right of a first resource block by the network node in a competition mode;

the network node evaluates the first resource block when the product of the resource threshold and the transmission capability is greater than the amount of data to be transmitted in the queue.

Preferably, evaluating the first resource block includes:

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

Preferably, the method further comprises:

when the network node is in a competition state in the first resource block and does not receive reservation signaling sent by other network nodes, the network node adopts a competition mode in a second resource block to send data by using the second resource block;

and when the network node is in a competition state in the first resource block and receives reservation signaling sent by other network nodes, determining a resource use mode of the first resource block according to the reservation signaling.

A computer readable storage medium storing one or more programs executable by one or more processors to implement the steps for a distributed dynamic adaptive multiple access method as recited in any preceding claim.

The distributed dynamic self-adaptive multiple access method of the invention solves the problems of self-adaptive comprehensive use direct competitive transmission and reserved transmission by reserving the responsive resource blocks in a competitive mode and monitoring the resource blocks in real time, so that the distributed dynamic self-adaptive multiple access method is suitable for the comprehensive service transmission with dynamic change of load and more effectively utilizes transmission resources.

Drawings

Fig. 1 is a schematic diagram of partitioning of resource blocks in an embodiment of the present invention;

fig. 2 is a flow chart of a distributed dynamic adaptive multiple access method in an embodiment of the present invention;

fig. 3 is a schematic diagram of an information interaction process of a network node in an embodiment of the present invention;

fig. 4 is a finite state machine diagram of a transceiver in an embodiment of the invention;

fig. 5 is a schematic diagram of a transceiver of a network node in a channel assessment and reservation phase according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of a signaling interaction process in an embodiment of the invention;

fig. 7 is a finite state machine diagram of a transceiver in an embodiment of the invention.

Detailed Description

The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be further noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings.

The embodiment of the invention provides a distributed dynamic self-adaptive multiple access method, the core idea of which is to divide a resource block into two stages of channel assessment, reservation and resource use, as shown in fig. 1. In the channel evaluation and reservation stage, the network node reserves the use right of the resource block in a competition mode and evaluates the resource block to determine the resource use mode of the current resource block; in the resource using stage, the network node uses the resource block according to the channel evaluation and the reservation and decision-making conditions of the reservation stage, and the successfully reserved node uses the resource block to transmit data without conflict; the network node that detects that a resource block is reserved by other nodes receives data or quiesces at the resource block.

As shown in fig. 2, a flow chart of a distributed dynamic adaptive multiple access method according to the present invention is shown, and the method specifically includes:

in step 201, a plurality of network nodes reserve the usage rights of the first resource block in a contention manner. Specifically, the first resource block is evaluated by detecting the transceiving condition of the reservation signaling, so that the use mode of the first resource block is adaptively adjusted, and the use right of the first resource block is determined.

Step 202, if any network node successfully reserves the usage right of the first resource block, the network node adopts an exclusive mode to send data without conflict in the first resource block, and other network nodes adopt a competition mode to send data in a second resource block by using the second resource block. Specifically, the network node that successfully reserves the usage right of the first resource block may send, receive or silence in the current resource block following the exclusive mode. And after the competition of other network nodes competing for the first resource block fails, the data can be sent by adopting a competition mode only in a second resource block which is different from the first resource block. Wherein the second resource block is not reserved successfully by other network resources, i.e. the second resource block refers to a resource block which is not reserved or not reserved successfully.

In step 203, if the usage right of the first resource block is not reserved successfully by any network node, the network node uses the first resource block to send data in a contention mode in the first resource block. Specifically, if no network node reserves the use right of the first resource block or does not reserve successfully, the use right of the first resource block is equivalent to not being reserved successfully by any network node, and the first resource block does not correspond to the exclusively used network node, then the network node needs to adopt a contention mode to send data in a resource use stage.

The distributed dynamic self-adaptive multiple access method provided by the embodiment of the invention solves the problems of self-adaptive comprehensive use direct competitive transmission and reserved transmission by reserving the responsive resource blocks in a competitive mode and monitoring the resource blocks in real time, so that the distributed dynamic self-adaptive multiple access method is suitable for comprehensive service transmission with dynamic change of load, and more effectively utilizes transmission resources.

The embodiment of the invention discloses a distributed dynamic self-adaptive multiple access method, preferably, the method further comprises:

determining the behavior of a competition channel according to the transceiver states of the network node and the neighbor nodes; the transceiver state is a receiving and transmitting state determined by the network node at any time-frequency resource. Specifically, the network nodes complete information interaction between the network nodes and information collection of the neighbor nodes through the Fan-in and Fan-out processes shown in fig. 3. In the Fan-in stage, the network node 0 collects information sent by the neighbor nodes 1 to 8 and updates a neighbor information list of the network node 0; in the Fan-out phase, the network node 0 transmits own state information and collected neighbor information to the neighbor nodes 1 to 8. Specifically, the neighbor node itself is also one of the network nodes, but is considered a neighbor node when it is a neighbor of the other network node.

outputting a pseudo-random sequence by a pseudo-random sequence generator according to the 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 is used for generating a pseudo-random sequence according to the seed value, and the generated sequence is controllable and predictable, so that the pseudo-random sequence generator is called as pseudo-random. The output of the pseudo random sequence generator used in the embodiment of the present invention, that is, the pseudo random sequence is related to only the inputted 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 defined as an integer of 0 or more and n or less.

The pseudo-random sequence drives the transition of the finite state machine of the transceiver. The pseudo-random sequence is a transition condition of a finite state machine of a transceiver, and the finite state machine of the transceiver is a transceiver state determined by the network node on a stipulated time frequency, and a transition relation and an execution action between the transceiver states.

Specifically, a finite state machine is a mathematical model that represents finite states and transitions between these states and execution of actions, etc., and has three components: state (state), event (event), and action (action). The event, namely the transition condition triggers the state transition, or may trigger the execution of the action, but the execution of the action is not necessary, or may trigger only the transition state, and no action is specified. The transceiver status is a transmission/reception status determined by the network node on any one of the time-frequency resources, e.g., on the e.g., time-frequency resources, and typical status includes: transmitting, receiving, dormancy, etc. The finite state machine of a transceiver is the transceiver state determined by the network node on a given time-frequency resource and the transition relationships between these states and actions performed.

Specifically, in the channel estimation and reservation stage, the network node drives the finite state machine of the same transceiver by adopting the same pseudo-random sequence generator, simultaneously 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. Thus, given the node identity of the network node and the network synchronization time, the output value v_pr=f (seed, pos) of the pseudo-random sequence can be uniquely determined.

In the distributed dynamic adaptive multiple access method according to the embodiment of the present invention, preferably, the transceiver state includes: listening status and possible sending status, the method further comprising:

Specifically, the embodiment of the invention includes two transceiver states as follows:

the interception state (L) indicates that the transceiver is in a receiving state, and messages that can be sent by other nodes;

the possible transmission state (PT) indicates that the transceiver transmits a message with a certain probability p.

As shown in fig. 4, for the finite state machine of the transceiver, it is assumed that v_pr=0, the interception state L or the possible transmission state PT is shifted to the possible transmission state PT; in other cases, the interception state L is shifted by the interception state L or the possible transmission state PT. 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, the ratio of the transceiver in the listening state L and the possible transmission state PT is about n according to the finite state machine described above.

In the embodiment of the present invention, the first resource block is divided into equal-length slots in the time dimension, but the method is not limited to the above-mentioned division method of the resource block, for example, the resource block may be divided into equal-width equal-length resource sub-blocks in the time dimension and the frequency dimension, and the method is applied to a multichannel time division system. Assuming that the first resource block is divided into 30 slots, the first 10 slots are defined as channel estimation and reservation phases, and the remaining 20 slots are defined as resource usage phases. In the case where the network node drives the finite state machine of the transceiver as shown in fig. 4 with a pseudorandom sequence generator of n=4, the state of the transceiver of the network node at the channel assessment and reservation stage is as shown in fig. 5. Under the condition that the

network nodes

1, 2 and 3 are neighboring nodes and the neighboring information collection is completed, any network node can calculate the transceiver states of other two neighboring nodes in any time slot, and determine the behavior of competing channels according to the states of the network nodes and the neighboring nodes:

if the state of the network node is L in the time slot i, receiving a reservation signaling and evaluating the channel state;

if the state of the network node is PT and the states of all neighbor nodes are L in the time slot i, a reservation signaling is sent;

if the state of the network node is PT and the states of m neighbor nodes are PT in the time slot i, reservation signaling is transmitted according to the probability a/m, where a is defined as a signaling transmission adjustment coefficient, and the typical value is 1.

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

In the distributed dynamic adaptive multiple access method according to the embodiment of the present invention, preferably, the network node is divided into a transmitting node and a receiving node, and the network node reserves the usage right of the first resource block in a contention manner, including:

In a specific embodiment, in the embodiment of the present invention, the network node is specifically subdivided into a sending node and a receiving node of the signaling, as shown in fig. 6, which is three types of signaling and interaction between the signaling when the network node reserves the right of use of the first resource block in a contention manner in channel assessment and reservation.

In the first stage, a transmitting node competing for using a channel transmits a reservation request RTS (request-To-Send) signaling To compete for the channel, reserving the usage right of the first resource block, and the transmitting timing of the reservation request RTS is determined by the transmitting node, for example, the starting time of the slot n.

In the second stage, the receiving node that received the reservation request RTS receives the reservation request RTS including the address of the receiving node by transmitting a reservation response CTS (Clear-To-Send) response. The reservation response CTS is transmitted immediately after the next time slot in which the reservation request RTS is received or when a certain constraint is satisfied, for example, at the start time of the time slot n+1.

And in the third stage, after the sending node sends a reservation request RTS and receives a corresponding reservation response CTS, generating a reservation confirmation OTS (cOnferm-To-Send), and sending the reservation confirmation OTS To the receiving node To cOnfirm that the use right of the first resource block is obtained. The transmission timing of the reservation confirmation OTS is the starting timing of the time slot n+2 or the immediately following time slot when the reservation confirmation CTS is received.

In the distributed dynamic adaptive multiple access method according to the embodiment of the present invention, preferably, before the network node reserves the usage right of the first resource block in a contention manner, the method further includes:

In a specific embodiment, the method in the embodiment of the present invention includes a resource threshold, where the resource threshold resv_th1 represents a threshold for initiating a contention for use right 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 of the invention, in order to fully utilize transmission resources, a network node counts the data quantity request_data_size to be transmitted and the transmission capacity tx_data_size of a first resource block in a starting moment of the first resource block, and judges whether inequality request_data_size > RESV_TH1×tx_data_size is satisfied or not. 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 compete for using the first resource block; if the inequality is not satisfied, that is, the product of the resource threshold and the transmission capability is greater than the amount of data to be transmitted in the queue, the network node only evaluates the first resource block in the channel evaluation and reservation stage and does not participate in competing for the use right of the first resource block.

In the distributed dynamic adaptive multiple access method according to the embodiment of the present invention, preferably, the evaluating the first resource block includes:

In a preferred embodiment, a network node that needs to contend for use of the first resource block enters a contention state at a starting time of channel estimation and reservation, and determines a behavior of contending for the channel according to transceiver states of itself and a neighboring node, and a finite state machine of reserved resources is as shown in fig. 7:

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 starting time of the time slot, enters a state of waiting for the CTS, and waits for receiving the corresponding reservation response CTS in the expected time slot. If the corresponding reservation response CTS is not received in the expected time slot, returning to a 'competing' state in a time-out manner; if the corresponding reservation response CTS is received, the reservation confirmation OTS is sent, and the neighbor node is informed to obtain the use right of the current resource block.

If the network node in the competition state can not send the reservation signaling in the current time slot, monitoring and evaluating the first resource; if a reservation request RTS with a receiving address being a network node address is received, a reservation response CTS is sent at the starting moment of the next time slot, and the state of waiting OTS is entered; if a reservation request RTS with the receiving address of other sending nodes is received, the busy state is entered and reservation confirmation OTS sent by the sending nodes is waited.

If the network node in the 'waiting OTS' state receives the reservation confirmation OTS sent by the sending node or the channel evaluation and reservation stage is finished, the sending node is determined to obtain the use right of the first resource block, and the network node waits for receiving data; if OTS sent by the sending node is not received in the expected time slot, judging that the competition of the sending node is overtime, and returning to the competition state.

If the network node in the busy state receives a reservation response CTS or a reservation confirmation OTS sent by other network nodes, determining that the first resource block is successfully reserved by other nodes, and ending the channel assessment and reservation stage; if the reservation response CTS or the reservation confirmation OTS sent by other network nodes is not received in the expected time slot, judging that the competition of other network nodes is overtime, and returning the node to a competition state.

In the channel assessment and reservation stage, according to the constraint condition, only the network node of the channel assessment channel in the channel assessment and reservation stage does not enter a competition state at the starting moment of channel assessment and reservation, does not actively send own reservation request RTS, but responds to reservation request RTS or reservation confirmation OTS sent by other network nodes according to the rule.

The network node determines a channel competition result through channel evaluation and the condition of the reservation signaling sent and received in the reservation stage, and determines a mode of using the first resource block by itself, namely an exclusive mode or a competition mode according to the result, so that direct competition transmission and reservation transmission are combined in an efficient and self-adaptive mode.

In a specific embodiment, a time threshold resv_th2 for channel estimation is defined as the second time slot, where the time threshold is a positive integer, and indicates the number of time slots that reach a certain constraint condition. If the network node is in the competitive state all the time in the first time slot and does not receive any reservation signaling sent by other network nodes in the previous time threshold resv_th2 time slots of the channel evaluation and reservation stage of the first resource block, the network node considers that the current resource block is expected to work in the low load mode, and the network node needs to use the competition mode to send data by using the second resource block. When the network node monitors or actively initiates the resource reservation behavior in the previous time threshold resv_th2 time slots of the channel evaluation and reservation stage of the first resource block, determining the resource usage mode of the first resource block according to the reservation result: if the network node successfully reserves the first resource block, the successfully reserved network node transmits, receives or quiesces in the current resource block according to an exclusive mode; if no network node successfully reserves the first resource block, the network node needs to adopt a contention mode to send data in a resource using stage.

The distributed dynamic self-adaptive multiple access method provided by the embodiment of the invention adopts a mode of combining a random sequence generator and a finite state machine based on neighbor information, so that the problem of the cost of reserved transmission is solved, the method is suitable for a low-speed transmission system or a condition of limited transmission capacity, and the resource utilization rate is effectively improved; the method solves the problems of self-adaptive comprehensive use direct competition transmission and reserved transmission, is suitable for comprehensive service transmission with dynamic change of load, and utilizes transmission resources more effectively.

Therefore, the strategy reduces information interaction between nodes and reduces the probability of collision of data transmission, thereby reducing expenditure, improving resource utilization rate, and using direct competitive transmission and reserved transmission in an efficient and self-adaptive combination way to better support comprehensive service transmission of dynamic load change of medium-low speed network.

Particular embodiments of the present invention also provide a computer readable storage medium storing one or more programs executable by one or more processors to implement the steps for a distributed dynamic adaptive multiple access method as recited in any of the preceding claims.

It should be understood that, in the various embodiments herein, the sequence number of each process described above does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments herein.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

The foregoing descriptions of specific exemplary embodiments of the present invention are presented for purposes of illustration and description. It is not intended to limit the invention to the precise form disclosed, and obviously many modifications and variations are possible in light of the above teaching. The exemplary embodiments were chosen and described in order to explain the specific principles of the invention and its practical application to thereby enable one skilled in the art to make and utilize the invention in various exemplary embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims and their equivalents.

Claims

1. A distributed dynamic adaptive multiple access method, the method comprising:

2. The distributed dynamic adaptive multiple access method of claim 1, further comprising:

3. The distributed dynamic adaptive multiple access method of claim 2, further comprising:

4. A distributed dynamic adaptive multiple access method according to claim 3, wherein said transceiver state comprises: listening status and possible sending status, the method further comprising:

5. A distributed dynamic adaptive multiple access method according to claim 3, characterized in that the method further comprises:

6. The distributed dynamic adaptive multiple access method according to claim 1, wherein the network node is divided into a transmitting node and a receiving node, and reserving the usage rights of the first resource block by the network node in a contention manner includes:

7. The distributed dynamic adaptive multiple access method of claim 1, wherein before the network node reserves the usage rights of the first resource block by contention, the method further comprises:

8. The distributed dynamic adaptive multiple access method of claim 7, wherein evaluating the first resource block comprises:

9. The distributed dynamic adaptive multiple access method of claim 1, further comprising:

10. A computer readable storage medium storing one or more programs executable by one or more processors to implement the steps for a distributed dynamic adaptive multiple access method of any of claims 1 to 9.