Dynamic multiple access method, system and equipment based on resource pre-allocation

Abstract

The invention belongs to the technical field of communication, and discloses a dynamic multiple access method, system and equipment based on resource pre-allocation, and the method comprises the following steps: dividing a resource allocation period into an odd period and an even period, adopting resource pre-allocation to allocate available time-frequency resource blocks to network nodes in the odd period, and adopting resource pre-allocation to allocate available time-frequency resource blocks to network nodes in the even period. The resource allocation result is consistent with the result of the previous odd allocation period, and one available time-frequency resource block allocation result maintains one resource allocation period; based on the available time-frequency resource block allocation result, if an occupying node applies for long-term occupying of the time-frequency resource block, the occupying node sends a first signaling in an odd-number period and declarates a one-hop neighbor node of the occupying node, and the one-hop neighbor node of the occupying node sends a second signaling to a one-hop neighbor node of the occupying node in an even-number period for declaration; therefore, the occupied node obtains the long-term use right of the time-frequency resource block.

Description

Technical Field

[0001] The present invention belongs to the field of communication technologies, and more specifically, relates to a method, system, and device for dynamic multiple access based on resource pre-allocation. Background Art

[0002] The commonly used channel resource allocation method, that is, multiple access control, can be divided into two categories according to the implementation method: static allocation and dynamic allocation:

[0003] For the static allocation category, since the transmission time is pre-allocated, it is required to take the full network system parameters as input. For example, the typical static multiple access TDMA protocol makes its transmission time arrangement according to the maximum number of users in the network. For a network with N users, the frame length used by this protocol can be N time slots, and each user is assigned a unique time slot. Since each user can uniquely access one time slot in each frame, there is no collision problem for any type of packet, and the channel access delay is affected by the frame length.

[0004] For the dynamic allocation category, the problem of allocating transmission time slots to users is called the transmission time arrangement problem. Its key points and advantages are to improve resource utilization by allocating available channels on demand. In a mobile communication system (cellular network), research is carried out on how the base station coordinates, controls, and allocates available channel resources to support the uplink and downlink communications between the mobile station and the base station, and how to perform resource coordination, control, and allocation between cells to support cell handover, roaming, and inter-cell communications of the mobile station. In a mobile ad hoc network, research is carried out on how to use the multi-hop network topology of the mobile ad hoc network for spatial reuse of bandwidth. Different users can use the same resources simultaneously as long as they are far enough apart and do not interfere with each other. Consider the problem of arranging the transmission time of broadcast transmissions in a single-channel mobile ad hoc network using omnidirectional antennas. At this time, the conflict-free broadcast transmission time arrangement requires that the distance between any two simultaneously transmitting users must be at least equal to three hops.

[0005] As described above, the static allocation category cannot adapt to the dynamic changes in user requirements and cannot make full use of the transmission resources of the system. The dynamic allocation category can adapt to the dynamic changes in user requirements, but it is necessary to solve the problems of resource conflict and resource reuse.

[0006] In view of this, overcoming the technical defects of the above-mentioned existing technologies is an urgent problem to be solved in this technical field. Summary of the Invention

[0007] In view of the above-mentioned defects or improvement requirements of the existing technology, the present invention provides a method, system, and device for dynamic multiple access based on resource pre-allocation, aiming to solve the mismatch between resource allocation and transmission requirements. The data transmission requirements include the transmission requirements of the node itself and the requirements of data forwarding.

[0008] To achieve the above object, according to one aspect of the present invention, there is provided a method for dynamic multiple access based on resource pre-allocation, the method comprising:

[0009] The network node completes network synchronization and establishment of neighbor relationships;

[0010] The resource allocation period is divided into two categories: odd periods and even periods. In odd periods, available time-frequency resource blocks are allocated to the network nodes by means of resource pre-allocation. In even periods, the resource allocation result is the same as that of the previous odd allocation period, and the allocation result of the available time-frequency resource blocks is maintained for one resource allocation period;

[0011] Based on the allocation result of the available time-frequency resource blocks, if an occupying node applies for long-term occupation of a time-frequency resource block, the occupying node sends a first signaling in the odd period to declare to the one-hop neighbor nodes of the occupying node. In the even period, the one-hop neighbor nodes of the occupying node send a second signaling to their own one-hop neighbor nodes for declaration;

[0012] After the one-hop neighbor nodes of the occupying node's own one-hop neighbor nodes receive the second signaling and the even period ends, the occupying node obtains the long-term right to use the time-frequency resource block.

[0013] Preferably, the method further comprises:

[0014] If the occupying node does not declare to continue occupying the time-frequency resource block before the occupation time ends, the occupied time-frequency resource block is default released after expiration and participates in resource pre-allocation uniformly after release.

[0015] Preferably, the method further comprises:

[0016] The occupied time-frequency resource blocks do not participate in resource pre-allocation during the occupation period;

[0017] The occupied time-frequency resource blocks will not be used by any neighbor nodes within two hops of the occupying node during the occupation period.

[0018] Preferably, the method of allocating available time-frequency resource blocks to the network nodes by means of resource pre-allocation in the odd period comprises:

[0019] Establish a two-hop neighbor list through network node signaling interaction;

[0020] Generate a sorting order including all network nodes for each available time-frequency resource block, indicating the priority order of the right to use;

[0021] Query the sequence numbers of the nodes in the two-hop neighbor list in the sorting order, and the node with the earliest sorting order obtains the right to use the corresponding available time-frequency resource block.

[0022] Preferably, the method for generating a sorting order including all network nodes for each available time-frequency resource block includes:

[0023] Set a random order generator, the output value of the random order generator is related to the identifier or index of the space-reusable time-frequency resource block input, and the output value of the random order generator is used as the priority sorting for network nodes to use the space-reusable time-frequency resource block.

[0024] Preferably, in the first signaling and the second signaling, the declared content at least includes the time-frequency resource block identifier, the occupied host identifier, and the occupied duration information.

[0025] Preferably, the method further includes:

[0026] After the one-hop neighbor nodes of the occupied node itself receive the second signaling and the even cycle ends, each network node updates and maintains the corresponding signaling reception list, and the occupied node continues to obtain the long-term right to use the time-frequency resource block.

[0027] Preferably, the one-hop neighbor nodes of the occupied node do not include the occupied node.

[0028] As a further improvement and supplement to the above solution, the present invention further includes the following additional technical features.

[0029] According to another aspect of the present invention, there is provided a dynamic multiple access system based on resource pre-allocation, the system includes:

[0030] A maintenance module for network nodes to complete network synchronization and establish neighbor relationships;

[0031] An allocation cycle module for dividing the resource allocation cycle into two categories: odd cycles and even cycles. In odd cycles, resource pre-allocation is used to allocate available time-frequency resource blocks to the network nodes. In even cycles, the resource allocation result is the same as that of the previous odd allocation cycle, and the result of one available time-frequency resource block allocation maintains one resource allocation cycle;

[0032] A signaling interaction module, based on the available time-frequency resource block allocation result, if an occupied node applies for long-term occupation of the time-frequency resource block, the occupied node sends the first signaling in the odd cycle to declare to the one-hop neighbor nodes of the occupied node, and in the even cycle, the one-hop neighbor nodes of the occupied node send the second signaling to declare to their own one-hop neighbor nodes;

[0033] A usage module for authorizing the occupied node to obtain the right to use available time-frequency resource blocks.

[0034] According to another aspect of the present invention, there is provided a device for dynamic multiple access based on resource pre-allocation, the device comprising:

[0035] One or more processors;

[0036] A storage device for storing one or more programs, which when executed by the one or more processors cause the one or more processors to implement the method for dynamic multiple access based on resource pre-allocation as described in the first aspect.

[0037] Generally speaking, compared with the prior art by the above technical solution conceived by the present invention, the following beneficial effects are achieved:

[0038] A method, system and device for dynamic multiple access based on resource pre-allocation provided by the present invention, the dynamic multiple access algorithm based on resource pre-allocation is based on distributed adaptive orthogonal resource pre-allocation. While inheriting the advantages of the resource pre-allocation algorithm, the problem of mismatch between resource allocation and transmission requirements is solved through the on-demand resource application mechanism. Therefore, it has the following main advantages:

[0039] (1) Periodic resource pre-allocation, when data needs to be transmitted, data transmission can be directly initiated without going through the process of resource application or competition, and the transmission delay is short;

[0040] (2) Resource pre-allocation realizes reuse beyond two hops, improves resource utilization rate, and the resources are allocated and reused without conflict, and at the same time can well match the transmission requirements of periodic broadcast of network nodes;

[0041] (3) Based on the on-demand application mechanism of resource pre-allocation, the signaling interaction for applying for resources does not need to compete for resources and there is no conflict, which shortens the resource acquisition time and improves the probability of successful resource application;

[0042] (4) Based on the on-demand application mechanism of resource pre-allocation, the uncertainty in the resource coordination process is reduced. The applied resources do not need to compete and do not need the process of conflict resolution, which improves the probability of successful resource acquisition;

[0043] (5) Based on the on-demand application mechanism of resource pre-allocation, it supports the on-demand acquisition and adjustment of node resources, can well support the resource requirements of large-traffic nodes, and can support the transmission of burst services and large-data-volume services. Description of the Drawings

[0044] To more clearly illustrate the technical solutions of the embodiments of the present invention, the following will briefly introduce the drawings required for use in the embodiments of the present invention. Obviously, the following described drawings are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0045] Figure 1 It is a schematic flow diagram of a method for dynamic multiple access based on resource pre-allocation provided in the first embodiment;

[0046] Figure 2 It is a time-frequency resource numbering rule provided in the first embodiment;

[0047] Figure 3 It is a network topology diagram provided in the first embodiment;

[0048] Figure 4 is Figure 3 a schematic diagram of node A in applying for resource occupation;

[0049] Figure 5 It is a network topology diagram provided in the first embodiment;

[0050] Figure 6 is Figure 5 a schematic diagram of node A and node B in applying for resource occupation;

[0051] Figure 7 It is a network topology diagram provided in the first embodiment;

[0052] Figure 8 is Figure 7 a schematic diagram of node A in applying for resource occupation;

[0053] Figure 9 It is a network topology diagram provided in the first embodiment;

[0054] Figure 10 is Figure 7 a schematic diagram of node A in applying for resource occupation;

[0055] Figure 11 It is a schematic diagram of a system for dynamic multiple access based on resource pre-allocation provided in the second embodiment;

[0056] Figure 12 It is a schematic diagram of a device for dynamic multiple access based on resource pre-allocation provided in the third embodiment. Detailed implementation manners

[0057] To make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely used to explain the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0058] Embodiment 1

[0059] This Embodiment 1 provides a method for dynamic multiple access based on resource pre-allocation. The method includes the following steps, as Figure 1 shown:

[0060] S101: The network node completes network synchronization and establishment of neighbor relationships.

[0061] S102: Divide the resource allocation period into two categories: odd periods and even periods. In odd periods, use resource pre-allocation to allocate available time-frequency resource blocks to the network node. In even periods, the resource allocation result is the same as that of the previous odd allocation period, and the result of one available time-frequency resource block allocation is maintained for one resource allocation period.

[0062] The resource allocation is carried out periodically. Assume that the minimum period is Cmin = 400 ms, and the resource allocation result is adjusted every two minimum periods during the resource allocation process. According to the agreement, the resource allocation result in the even period is the same as that in its previous odd period. Therefore, using the distributed adaptive orthogonal resource pre-allocation algorithm to allocate available resources, the network node needs to determine the available resource allocation result of the current period at the start of the odd period and copy this result to the subsequent even period, that is, calculate once every 800 ms. For the convenience of expression, C O is used to represent the odd period, and C E is used to represent the even period.

[0063] As Figure 2 shown, the available transmission resources have two dimensions: time domain and frequency domain. The frequency domain is configured with two frequency points (two frequency domain channels), the time domain is divided into multiple equal-length time slots, and each 5 time slots are divided into a scheduling period. The nth scheduling period is Cycle n. Figure 2 In the figure, Cycle 1 and Cycle 2 in the middle each have 10 available time-frequency resource blocks. As Figure 3 shown, the number of network nodes in the network is 10, which are represented by capital letters A-J respectively.

[0064] Within a scheduling period, each schedulable time-frequency resource block is numbered in the order of time domain first and then frequency domain. A schedulable period consists of 10 time-frequency resource blocks; according to the distributed adaptive orthogonal resource pre-allocation strategy, it is only executed in odd periods, and the resource allocation in even periods remains the same as that in the previous odd period. The numbering of the time-frequency resource blocks in each resource scheduling period is hidden, and the node identifiers in the time-frequency resource blocks are used to represent the nodes that obtain the right to use the corresponding time-frequency resource blocks. For example, in Figure 4 nodes F, I, C, J, E, A, G, D, H, B obtain the right to use time-frequency resource blocks RB1, RB2, RB3, RB4, RB5, RB6, RB7, RB8, RB9, RB10 in sequence.

[0065] In odd period Cycle 1, node A occupies the right to use RB6. In even period Cycle2, the one-hop neighbor nodes B / C / D / E of node A receive the first signaling and do not occupy the right to use RB6, and notify their other one-hop neighbor nodes except node A, declaring that node A is occupying RB6. In odd period Cycle 3 and even period Cycle4, node A continues to occupy RB6.

[0066] S103: Based on the available time-frequency resource block allocation result, if an occupying node applies for long-term occupation of a time-frequency resource block, the occupying node sends the first signaling in the odd period to declare to its one-hop neighbor nodes, and in the even period, the one-hop neighbor nodes of the occupying node send the second signaling to declare to their own one-hop neighbor nodes.

[0067] In the first embodiment, the first signaling is selected as RTS, and the second signaling is selected as CTS. On the basis of resource pre-allocation, the network nodes use the "RTS-CTS two-way handshake" mechanism for long-term occupation of the allocated available time-frequency resource blocks. It is agreed that the signaling RTS can only be sent in odd period C O and CTS can only be sent in even period C E A node that needs to occupy available transmission resources sends the signaling RTS in odd period C O to its own allocated available time-frequency resource block to notify its one-hop neighbor nodes of the resource occupation request, and this request should at least include information such as time-frequency resource block identifier, occupying host identifier, occupying duration, etc. The network nodes collect and record the resource occupation requests in odd period C O and then spread this type of information through the signaling CTS in even period C E If the network nodes do not have transmission resources to send the signaling CTS in the current resource allocation period, they need to wait until they obtain the transmission resources and then broadcast this CTS.

[0068] Such as Figure 4As shown in the figure, the process of Node A applying for resource occupancy:

[0069] (1) The green time-frequency resource block is the time-frequency resource block pre-allocated for Node A in Cycle 1 and Cycle 2. When Node A needs to occupy the time-frequency resources pre-allocated in this cycle for a long time according to its own service requirements, it sends a signaling RTS in Cycle 1 to notify its one-hop neighbor nodes of this requirement.

[0070] (2) Its one-hop neighbor nodes B, C, D, and E receive and record this signaling, and then send a signaling CTS in the time-frequency resource blocks pre-allocated for themselves in Cycle 2 (the gray time-frequency resource blocks) to notify their neighbor nodes F, G, H, I, and J of the resource occupancy situation of Node A.

[0071] (3) Then, Node A obtains the right to use the applied time-frequency resource blocks (the red time-frequency resource blocks) in the subsequent resource allocation cycles Cycle 3 and Cycle 4, and the occupied time-frequency resource blocks will not be used by any neighbor within two hops of Node A during the declared occupancy period.

[0072] As Figure 5 and Figure 6 shown in the figure, the process of Node A and Node B applying for resource occupancy simultaneously:

[0073] (1) The green time-frequency resource block is for Node A and the blue time-frequency resource block is for Node B, which are the time-frequency resource blocks pre-allocated in Cycle 1 and Cycle 2. When Node A and Node B need to occupy the time-frequency resources pre-allocated in this cycle for a long time according to their own service requirements, they send a signaling RTS in Cycle 1 to notify their one-hop neighbor nodes of this requirement.

[0074] (2) Its one-hop neighbor nodes B, C, D, E, F, and G receive and record this signaling, and then send a signaling CTS in the time-frequency resource blocks pre-allocated for themselves in Cycle 2 (the gray time-frequency resource blocks) to notify their neighbor nodes H, I, and J of the resource occupancy situations of Node A and Node B. At this time, Node C receives the signaling RTS of both Node A and Node B simultaneously, and Node A and Node B respectively receive the signaling RTS sent by each other. Therefore, Node A, B, C, D, E, F, and G all need to send a signaling CTS in Cycle 2.

[0075] (3) Then, Node A and Node B obtain the right to use the applied time-frequency resource blocks (the red time-frequency resource blocks) in the subsequent resource allocation cycles Cycle 3 and Cycle 4, and the occupied time-frequency resource blocks will not be used by any neighbor within two hops of Node A and Node B during the declared occupancy period.

[0076] S104: After the one-hop neighbor node of the occupied node itself receives the second signaling and the even period ends, the occupied node obtains the long-term right to use the time-frequency resource block.

[0077] Combined with this embodiment, there is also a preferred implementation. Specifically, the method further includes:

[0078] If the occupied node does not declare to continue to occupy the time-frequency resource block before the occupancy time ends, the occupied time-frequency resource block is default released after expiration and participates in resource pre-allocation uniformly after release.

[0079] Combined with this embodiment, there is also a preferred implementation. Specifically, the method further includes:

[0080] The occupied time-frequency resource block does not participate in resource pre-allocation during the occupancy period;

[0081] The occupied time-frequency resource block cannot be used by any neighbor node within two hops of the occupied node during the occupancy period.

[0082] Combined with this embodiment, there is also a preferred implementation. Specifically, in the odd period, the method for allocating available time-frequency resource blocks to the network nodes by resource pre-allocation includes:

[0083] Establish a two-hop neighbor list through network node signaling interaction;

[0084] Generate a sorting order including all network nodes for each available time-frequency resource block, indicating the priority order of the right to use;

[0085] Query the serial number of the node in the two-hop neighbor list in the sorting order, and the node with the most forward sorting obtains the right to use the corresponding available time-frequency resource block.

[0086] In the first embodiment, the distributed adaptive orthogonal multiple access is selected for the resource pre-allocation method, and the detailed process is as follows:

[0087] The network node calculates the index of the node and the network according to the node and network identifier unique to the whole network configured by itself according to the agreed mapping rule, which is used for the node and network priority sorting in the resource allocation process.

[0088] The network node establishes local topology information centered on the node through the interaction of the signaling network, mainly referring to the one-hop neighbor and two-hop neighbor list N[2] of the node.

[0089] Given the maximum number of nodes in a known subnet and the host identification ID, each node follows the same rule - for example, a pseudo-random order with a unified seed as the input. The pseudo-random order generates a sorting order Seq(n) containing all the preset node IDs for each available service resource block n, representing the priority order for the corresponding node to use this service resource block.

[0090] The node queries the positions of the nodes in its two-hop neighbor list N[2] in the sorting order Seq(n) and determines that the node with the earliest position (i.e., representing the highest priority) obtains the right to use the service resource block n.

[0091] Here, it is assumed that the entire network can achieve network-wide synchronization through a distributed or centralized synchronization algorithm, and nodes can obtain their two-hop neighbor information through information exchange; all nodes in the network use a unified random order generator, the output of which is uniquely determined by the input, and nodes can use the unified time information as the input of the random order generator; considering the case of multiple frequency-domain channels, any node can send messages on only one frequency-domain channel in the same time slot.

[0092] Any node in the network only needs to perform local operations to obtain the resource allocation situation of the current resource allocation cycle, ensuring the distributed characteristics of the resource pre-allocation method. In addition, the resource allocation is carried out periodically, and nodes update their two-hop neighbor information through the signaling network in each cycle, which can well adapt to the dynamic changes of the network topology and ensure the adaptive characteristics of this algorithm.

[0093] Combined with this embodiment, there is also a preferred implementation scheme. Specifically, the method of generating a sorting order containing all network nodes for each available time-frequency resource block includes:

[0094] Set a random order generator, the output value of which is related to the identifier or index of the time-frequency resource block that can be spatially multiplexed, and the output value of the random order generator is used as the priority sorting for network nodes to use the time-frequency resource block that can be spatially multiplexed.

[0095] Combined with this embodiment, there is also a preferred implementation scheme. Specifically, in the first signaling and the second signaling, the declared content at least includes the time-frequency resource block identifier, the occupied host identifier, and the occupied duration information.

[0096] Combined with this embodiment, there is also a preferred implementation scheme. Specifically, the method further includes:

[0097] After the one-hop neighbor nodes of the occupied node itself receive the second signaling and the even period ends, each network node updates and maintains the corresponding signaling reception list, and the occupied node continues to obtain the long-term right to use the time-frequency resource block.

[0098] Assume that the nodes in the network are all full-duplex nodes. According to the above dynamic occupancy process of pre-allocated resources, both the RTS and CTS signals are sent on the pre-allocated resources of the sending node, and there is no conflict. However, the sending processes of these two signals are different. The RTS signal is sent by the initiating node (node A / B) of the dynamic occupancy of pre-allocated resources, and this message can ensure diffusion to the one-hop neighbor nodes of this node; while the CTS signal is sent by the one-hop neighbor nodes of the initiating node (node A / B), and the purpose of sending this message is to timely spread the information of the long-term occupancy of pre-allocated resources to the one-hop neighbor nodes of the one-hop neighbor nodes of (node A / B), that is, the two-hop neighbor nodes of the initiating node (node A / B). Here, timely means that the information of the long-term occupancy of pre-allocated resources needs to be spread to the two-hop neighbor nodes of the initiating node before the periodic change of the corresponding resource pre-allocation result. However, the diffusion of the CTS signal is affected by various factors such as the topological structure, neighbor relationship, and current cycle resource pre-allocation situation, and there may be a situation where one odd-even resource allocation cycle cannot fully cover the two-hop neighbor nodes of the initiating node.

[0099] Resource pre-allocation determines the right to use each video resource block according to the priority determined by the generated random order. The right of each node to obtain each time-frequency resource block is determined by the random order and two-hop neighbors, which is a probability event. Therefore, there is always a certain probability that a node is not allocated resources within a resource allocation cycle. In a statistical sense, the resources are evenly distributed.

[0100] The network topology relationship is as Figure 7 shown. Figure 8 What is given is the situation where nodes obtain resources within a certain resource allocation cycle. In the process of node A applying for resource occupancy as shown in Figure 7 and Figure 8 Since node E does not obtain the right to use the time-frequency resource block within this resource pre-allocation cycle, it cannot send the corresponding CTS signal in time, so that the information that node A applies to long-term occupy the 6th time-frequency resource block pre-allocated is not timely notified to the two-hop neighbor node H of node A. In the next resource pre-allocation cycle, the information of the available time-frequency resource blocks in the current cycle of node H and other nodes in the network is not unified, that is, node H believes that all time-frequency resource blocks can participate in the resource allocation of this cycle, while other nodes know that the 6th time-frequency resource block is long-term occupied by node A.

[0101] As Figure 9 and Figure 10As shown in the figure, a resource allocation conflict that may occur in the case of inconsistent information is given. At this time, both node A and node H believe that they have obtained the right to use the sixth time-frequency resource block, resulting in a conflict. This resource allocation conflict will affect the data reception of the common one-hop neighbors of node A and node H on the conflicting time-frequency resource block 6, that is, it will cause the failure of unicast transmission that meets the above constraints, and affect the coverage of broadcast transmission of node A and node H. However, node E obtains the right to use the pre-allocated time-frequency resource block RB1 in resource allocation cycles Cycle3 and Cycle4, so it will send out the delayed CTS signaling in this time slot. At this time, node H updates the long-term resource occupancy information, and the resource allocation conflict is eliminated. Figure 10 Cycle3' and Cycle4' in the table represent the resource allocation status considered by node H; Cycle3 and Cycle4 represent the resource allocation status considered by other nodes in the same resource allocation cycle. The two information are inconsistent and may cause conflicts.

[0102] It can be seen that, on the one hand, the impact of this resource allocation conflict on data transmission is limited, affecting only unicast and broadcast on specific links; on the other hand, the impact of resource allocation conflict is limited in time. With the periodic adjustment of resource pre-allocation, the conflict will most likely be eliminated quickly.

[0103] In order to completely eliminate the above conflicts, a measure that can be taken is that each node updates and maintains a receiving list, in which the list records the one-hop neighbor nodes that can be used as the receiving node at the current time.

[0104] In combination with this embodiment, there is also a preferred implementation scheme, specifically, the one-hop neighbor node of the one-hop neighbor node of the occupied node does not include the occupied node.

[0105] Embodiment 2:

[0106] This embodiment 2 provides a system for dynamic multiple access based on resource pre-allocation, such as Figure 11 As shown, the system includes:

[0107] Maintenance module, used for network nodes to complete network synchronization and establish neighbor relationships;

[0108] An allocation cycle module is used to divide the resource allocation cycle into two categories: odd cycles and even cycles. In odd cycles, resource pre-allocation is used to allocate available time-frequency resource blocks to the network nodes. In even cycles, the resource allocation result is consistent with the result of the previous odd allocation cycle. The allocation result of the available time-frequency resource block is maintained for one resource allocation cycle.

[0109] A signaling interaction module, based on the available time-frequency resource block allocation result, if an occupied node applies for long-term occupation of time-frequency resource blocks, the occupied node sends a first signal in the odd cycle to declare to the one-hop neighbor nodes of the occupied node, and in the even cycle, the one-hop neighbor nodes of the occupied node send a second signal to their own one-hop neighbor nodes for declaration;

[0110] A usage module for authorizing the occupied node to obtain the right to use the available time-frequency resource blocks.

[0111] Embodiment 3:

[0112] This Embodiment 3 provides a device for dynamic multiple access based on resource pre-allocation, such as Figure 12 shown. The device includes:

[0113] One or more processors;

[0114] A storage device for storing one or more programs, which when executed by one or more processors, cause the one or more processors to implement the method for dynamic multiple access based on resource pre-allocation according to any one of Embodiment 1.

[0115] Figure 12 This is a schematic structural diagram of the device for dynamic multiple access based on resource pre-allocation provided in Embodiment 3. Figure 12 Shows a block diagram of an exemplary device for dynamic multiple access based on resource pre-allocation suitable for implementing the embodiments of the present invention. Figure 12 The shown device for dynamic multiple access based on resource pre-allocation is only an example and should not impose any limitation on the functions and usage scope of the embodiments of the present invention.

[0116] As Figure 12 shown, the device for dynamic multiple access based on resource pre-allocation is presented in the form of a general device. The components of the device for dynamic multiple access based on resource pre-allocation may include but are not limited to: one or more processors or processing units, a memory, and a bus connecting different system components (including the memory and the processing unit).

[0117] The bus represents one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of the multiple bus structures. For example, these architectures include but are not limited to the Industry Standard Architecture (ISA) bus, the Micro Channel Architecture (MAC) bus, the Enhanced ISA bus, the Video Electronics Standards Association (VESA) local bus, and the Peripheral Component Interconnect (PCI) bus.

[0118] Devices for dynamic multiple access based on resource pre - allocation typically include various computer system - readable media. These media can be any available media accessible by a device that can be modified by an intelligent logging interpretation model, including volatile and non - volatile media, removable and non - removable media.

[0119] The memory can include computer system - readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory. Devices for dynamic multiple access based on resource pre - allocation can further include other removable / non - removable, volatile / non - volatile computer system storage media. By way of example only, a storage system can be used for reading and writing on non - removable, non - volatile magnetic media ( Figure 12 not shown, typically referred to as a "hard disk drive"). Although Figure 12 not shown in, a disk drive can be provided for reading and writing on removable non - volatile disks (such as a "floppy disk"), and an optical disk drive for reading and writing on removable non - volatile optical disks (such as a CD - ROM, DVD - ROM, or other optical media). In these cases, each drive can be connected to the bus through one or more data media interfaces. The memory can include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the embodiments of the present invention.

[0120] A program / utility having a set (at least one) of program modules can be stored, for example, in the memory. Such program modules include, but are not limited to, an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include an implementation of a network environment. Program modules typically perform the functions and / or methods in the embodiments described in the present invention.

[0121] Devices for dynamic multiple access based on resource pre - allocation can also communicate with one or more external devices (such as a keyboard, a pointing device, a display, etc.), and can also communicate with one or more devices that enable a user to interact with the device for dynamic multiple access based on resource pre - allocation, and / or communicate with any device that enables the device for dynamic multiple access based on resource pre - allocation to communicate with one or more other devices (such as a network card, a modem, etc.). Such communication can be carried out through an input / output (I / O) interface. Moreover, the device for intelligent logging interpretation model modification can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter. As Figure 12As shown, the network adapter communicates with other modules of the device for dynamic multiple access based on resource pre-allocation via a bus. It should be understood that although not shown in the figure, other hardware and / or software modules can be used in combination with the device for dynamic multiple access based on resource pre-allocation, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0122] The processing unit executes various functional applications and data processing by running programs stored in the memory, such as implementing the method for dynamic multiple access based on resource pre-allocation provided in any embodiment of the present invention. That is: the network node completes network synchronization and the establishment of neighbor relationships; divides the resource allocation cycle into two categories: odd cycles and even cycles. In odd cycles, available time-frequency resource blocks are allocated to the network node by resource pre-allocation. In even cycles, the resource allocation result is the same as that of the previous odd allocation cycle, and the result of the available time-frequency resource block allocation is maintained for one resource allocation cycle; based on the result of the available time-frequency resource block allocation, if an occupying node applies for long-term occupation of the time-frequency resource block, the occupying node sends a first signaling in the odd cycle to declare to the one-hop neighbor nodes of the occupying node. In the even cycle, the one-hop neighbor nodes of the occupying node send a second signaling to their own one-hop neighbor nodes for declaration; after the one-hop neighbor nodes of the occupying node's own one-hop neighbor nodes receive the second signaling and the even cycle ends, the occupying node obtains the long-term right to use the time-frequency resource block.

[0123] The above are only the preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent replacements, and improvements made within the spirit and principles of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for dynamic multiple access based on resource pre-allocation, characterized in that: The method comprises: Network nodes complete network synchronization and establish neighbor relationships; The resource allocation cycle is divided into two categories: odd cycles and even cycles. In odd cycles, resource pre-allocation is used to allocate available time-frequency resource blocks to the network nodes. In even cycles, the resource allocation result is consistent with the result of the previous odd allocation cycle. The allocation result of the available time-frequency resource block is maintained for one resource allocation cycle. Based on the allocation result of the available time-frequency resource blocks, if an occupied node applies for long-term occupation of the time-frequency resource blocks, the occupied node sends a first signaling in the odd cycle to declare to a one-hop neighbor node of the occupied node, and in the even cycle the one-hop neighbor node of the occupied node sends a second signaling to its own one-hop neighbor node to declare; After a one-hop neighbor node of the occupied node's own one-hop neighbor node receives the second signaling and the even-numbered cycle ends, the occupied node obtains the long-term use right of the time-frequency resource block.

2. The method for dynamic multiple access based on resource pre-allocation according to claim 1, characterized in that: The method further comprises: If the occupying node does not declare to continue to occupy the time-frequency resource block before the occupation time ends, the occupied time-frequency resource block will be released by default after expiration, and will participate in resource pre-allocation after release.

3. The method for dynamic multiple access based on resource pre-allocation according to claim 2, characterized in that: The method further comprises: The occupied time-frequency resource blocks no longer participate in resource pre-allocation during the occupation period; The occupied time-frequency resource block will not be used by any neighboring node within a 2-hop range of the occupying node during the occupation period.

4. The method for dynamic multiple access based on resource pre-allocation according to claim 1, characterized in that: The method for allocating available time-frequency resource blocks to the network node by using resource pre-allocation in odd cycles includes: Establish a two-hop neighbor list through network node signaling interaction; Generate a sorting order including all network nodes for each available time-frequency resource block, indicating the priority of usage rights; The sequence numbers of the nodes in the two-hop neighbor list in the sorting order are queried, and the node with the highest order obtains the right to use the corresponding available time-frequency resource block.

5. The method for dynamic multiple access based on resource pre-allocation according to claim 4, characterized in that: The method for generating a sorting order including all network nodes for each available time-frequency resource block comprises: A random sequence generator is set, and the output value of the random sequence generator is related to the input identifier or index of the spatially multiplexed time-frequency resource block. The output value of the random sequence generator is used as the priority ranking of the spatially multiplexed time-frequency resource blocks used by network nodes.

6. The method for dynamic multiple access based on resource pre-allocation according to claim 5, characterized in that: In the first signaling and the second signaling, the declared content includes at least the time-frequency resource block identifier, the occupied host identifier and the occupied duration information.

7. The method for dynamic multiple access based on resource pre-allocation according to claim 6, characterized in that: The method further comprises: After the one-hop neighbor node of the occupied node receives the second signaling and the even cycle ends, each network node updates and maintains the corresponding signaling reception list, and the occupied node continues to obtain the long-term use right of the time-frequency resource block.

8. The method for dynamic multiple access based on resource pre-allocation according to claim 1, characterized in that: The one-hop neighbor nodes of the occupied node do not include the occupied node.

9. A system for dynamic multiple access based on resource pre-allocation, characterized in that: The system includes: Maintenance module, used for network nodes to complete network synchronization and establish neighbor relationships; An allocation cycle module is used to divide the resource allocation cycle into two categories: odd cycles and even cycles. In odd cycles, resource pre-allocation is used to allocate available time-frequency resource blocks to the network nodes. In even cycles, the resource allocation result is consistent with the result of the previous odd allocation cycle. The allocation result of the available time-frequency resource block is maintained for one resource allocation cycle. A signaling interaction module, based on the allocation result of the available time-frequency resource blocks, if an occupied node applies for long-term occupation of the time-frequency resource blocks, the occupied node sends a first signaling in the odd cycle to declare to a one-hop neighbor node of the occupied node, and in the even cycle the one-hop neighbor node of the occupied node sends a second signaling to its own one-hop neighbor node to declare; The using module is used to authorize the occupying node to obtain the right to use the available time-frequency resource block.

10. A device for dynamic multiple access based on resource pre-allocation, characterized in that the device include: one or more processors; A storage device, used to store one or more programs, when the one or more programs are executed by the one or more processors, so that the one or more processors implement the method for dynamic multiple access based on resource pre-allocation as described in any one of claims 1-8.

Images