Distributed adaptive multiple access method, system and equipment based on pre-allocation

Abstract

The invention discloses a pre-allocation-based distributed adaptive multiple access method, system and equipment, and the method comprises the steps that network nodes periodically send signaling to a network through static resource allocation and receive periodic signaling sent by other nodes, and establish and maintain a two-hop neighbor list corresponding to each network node; in a resource allocation period, screening time-frequency resource blocks capable of being spatially multiplexed in the current resource allocation period according to the two-hop neighbor list, and generating a sorting sequence containing all preset node identifiers for each time-frequency resource block capable of being spatially multiplexed; and the network node queries the positions of the corresponding two-hop neighbor nodes in the sorting sequence, and determines that the two-hop neighbor nodes at the top position obtain the right to use the time-frequency resource block capable of being spatially multiplexed. The method is suitable for a multi-hop network with periodic data transmission as a main demand, the utilization rate of network resources is improved, and the method can well adapt to rapid change of network topology.

Description

Technical Field

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

[0002] There are two ideas for solving resource conflict and resource reuse problems in existing dynamic allocation classes of distributed mesh structures: 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 idea, generally, there is a dedicated process for resource coordination through control signaling. To ensure the effectiveness and reliability of this resource coordination process, signaling interaction generally uses low-speed and high-reliability communication means.

[0003] Static resource allocation can provide fair transmission opportunities for each node in the network without conflict, with reliable and highly robust transmission. Usually, this type of resource allocation method is used to support the transmission of important data with small data volume and high reliability requirements, such as signaling and control messages. Static resource allocation is more suitable for fully connected or networks with no more than two hops and mainly requiring the transmission of periodic data. For distributed ad hoc networks with more than three hops, the resource utilization rate of this resource allocation method is low and it cannot well adapt to the rapid changes in network topology.

[0004] 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

[0005] In view of the above-mentioned defects or improvement requirements of the existing technologies, the present invention provides a method, system, and device for pre-allocation-based distributed adaptive multiple access, aiming to solve the problems of low resource utilization rate of the static strategy in distributed multi-hop networks and inability to well adapt to the rapid changes in network topology, and to avoid data transmission conflict problems with neighbor nodes.

[0006] To achieve the above object, according to one aspect of the present invention, a method for pre-allocation-based distributed adaptive multiple access is provided, and the method includes:

[0007] Network nodes periodically send signaling to the network through static resource allocation and receive periodic signaling sent by other nodes, and establish and maintain a two-hop neighbor list corresponding to each network node;

[0008] During the resource allocation period, according to the two-hop neighbor list, screen time-frequency resource blocks that can be spatially multiplexed in the current resource allocation period, and generate a sorting order including all preset node identifiers for each of the time-frequency resource blocks that can be spatially multiplexed;

[0009] The network node queries the positions of the corresponding two-hop neighbor nodes in the sorting order, and determines the two-hop neighbor nodes with the most forward positions to obtain the right to use the time-frequency resource blocks that can be spatially multiplexed.

[0010] Preferably, the method further includes:

[0011] If some nodes newly join the network or some nodes rejoin the network after going offline during the stable operation of the network, it indicates that the network enters opportunistic access;

[0012] According to the preset opportunistic access cycle frequency, configure an opportunistic access cycle within a preset number of resource allocation cycles;

[0013] The network node establishes and maintains a list of unconnected nodes according to the known neighbor information, and filters the time-frequency resource blocks that can be spatially multiplexed within the current resource allocation cycle plus the opportunistic access cycle according to the two-hop neighbor list and the list of unconnected nodes.

[0014] Preferably, the method further includes:

[0015] Initialize the maximum number of nodes in the network according to the usage requirements. During the resource allocation cycle, the number of the time-frequency resource blocks that can be coordinated or scheduled is an integer multiple of the maximum number of nodes.

[0016] Preferably, the method for establishing a two-hop neighbor list corresponding to each network node includes:

[0017] Network frame synchronization, periodically determine the statically allocated time-frequency resources in a preset manner, and send its own clock signal and device status information;

[0018] Search for the clock signals and device status information sent by other nodes, adjust the time frame boundary, and complete network synchronization;

[0019] Periodically collect the clock signals and device status information sent by network nodes, maintain network synchronization, establish a neighbor information list;

[0020] Send system information and network signaling as needed to maintain network operation.

[0021] Preferably, the method for filtering the time-frequency resource blocks that can be spatially multiplexed within the current resource allocation cycle according to the two-hop neighbor list includes:

[0022] Periodically collect the clock signals and device status information sent by network nodes, maintain network synchronization, establish a neighbor information list, and extract two-hop neighbor information;

[0023] Divide the available time-frequency resource blocks into reusable time-frequency resources and non-reusable time-frequency resources according to the two-hop neighbor information.

[0024] Preferably, the method further includes:

[0025] During the current resource allocation period plus the opportunistic access period, generate a sorting order including all preset node identifiers for each of the time-frequency resource blocks that can be spatially multiplexed;

[0026] The network node queries the positions of the corresponding two-hop neighbor nodes in the sorting order, and determines that the two-hop neighbor node with the most forward position obtains the right to use the time-frequency resource block.

[0027] Preferably, the method for periodically determining the statically allocated time-frequency resources according to a preset manner includes:

[0028] Periodically determine the statically allocated time-frequency resources in the manner of static time-frequency orthogonal multiple access.

[0029] Preferably, the method for generating a sorting order including all preset node identifiers for the time-frequency resource blocks that can be spatially multiplexed includes:

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

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

[0032] According to another aspect of the present invention, there is provided a system for pre-allocated distributed adaptive multiple access, the system includes:

[0033] A signaling module, configured to send signals and receive periodic signals sent by other nodes;

[0034] A list module, configured to establish and maintain a two-hop neighbor list corresponding to each network node;

[0035] A screening module, configured to screen the time-frequency resource blocks that can be spatially multiplexed during the current resource allocation period according to the two-hop neighbor list;

[0036] A sorting module, configured to generate a sorting order including all preset node identifiers for each of the time-frequency resource blocks that can be spatially multiplexed;

[0037] A query module, configured to query the positions of the corresponding two-hop neighbor nodes in the sorting order, and determine that the two-hop neighbor node with the most forward position obtains the right to use the time-frequency resource block.

[0038] According to another aspect of the present invention, there is provided a device for pre-allocated distributed adaptive multiple access, the device includes:

[0039] One or more processors;

[0040] 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 of pre-allocation based distributed adaptive multiple access as described in the first aspect.

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

[0042] A method, system and device for pre-allocation based distributed adaptive multiple access provided by the present invention. The proposed distributed adaptive orthogonal resource pre-allocation algorithm can, according to the network topology structure, distributively and adaptively achieve two-hop outer space multiplexing of available transmission resources, is suitable for multi-hop networks mainly requiring transmission of periodic data, improves network resource utilization rate, and can well adapt to rapid changes in the network topology. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0044] Figure 1 It is a schematic diagram of the method flow of a pre-allocation based distributed adaptive multiple access provided in the first embodiment;

[0045] Figure 2 It is a schematic diagram of the resource allocation cycle configuration provided in the first embodiment;

[0046] Figure 3 It is a schematic diagram of the work flow of network establishment and maintenance provided in the first embodiment;

[0047] Figure 4 It is a schematic diagram of a wireless network topology provided in the first embodiment;

[0048] Figure 5 It is a schematic diagram of the opportunistic access cycle configuration provided in the second embodiment;

[0049] Figure 6 It is a schematic diagram of the two-hop outer resource multiplexing work flow within the resource allocation cycle provided in the second embodiment;

[0050] Figure 7 It is a schematic diagram of the system of pre-allocation based distributed adaptive multiple access provided in the third embodiment;

[0051] Figure 8 It is a schematic diagram of a device based on pre - allocated distributed adaptive multiple access in the fourth embodiment. Specific implementation manners

[0052] In order to make the objectives, technical solutions and advantages of the present invention clearer and more understandable, 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 only used to explain the present invention and are not used 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.

[0053] Embodiment 1

[0054] Embodiment 1 of the present invention provides a method based on pre - allocated distributed adaptive multiple access. The method includes the following steps, as Figure 1 shown:

[0055] S101: The network node periodically sends signaling to the network through static resource allocation and receives the periodic signaling sent by other nodes, and establishes and maintains a two - hop neighbor list corresponding to each network node.

[0056] Preset the maximum number of nodes Nmax in the network. This number represents the maximum number of nodes that the network can accommodate at most, and may be restricted by various factors such as network scale, usage scenarios, address space, etc. By default, the user can determine the maximum number of nodes in the network before the network runs, and this parameter can be configured or changed according to different usage requirements, and is determined and set as a global parameter before the network runs.

[0057] Determine the resource allocation period PrbAlloc according to the maximum number of nodes Nmax. In principle, it is required that the number of time - frequency resource blocks that can be coordinated and scheduled within one resource allocation period is an integer multiple α of the maximum number of nodes Nmax, that is, the resource allocation period PrbAlloc = α×Nmax, α = 1, 2, 3,....

[0058] According to the determined resource allocation period PrbAlloc and the maximum number of nodes Nmax, use the static time - frequency orthogonal multiple access method to periodically allocate available time - frequency resources to each possible in - network node. Without loss of generality, here, the time - frequency resource blocks of one period are sequentially and periodically allocated to all possible in - network nodes arranged in ascending order of node identifiers in the order of time domain first and then frequency domain.

[0059] Broadcast node identifiers, link status, etc. through signaling information. By periodically sending signaling containing node information on statically allocated resources and receiving periodic signaling sent by other nodes, a network node can establish and maintain its two-hop neighbor information.

[0060] The nodes that have completed network synchronization send signaling information during the signaling time slot period, collect the signaling information sent by other nodes, maintain network synchronization, and establish and maintain a full-network neighbor information list based on the collected device status information. The neighbor information list includes at least the node identifier and the hop count from the node to the local node.

[0061] S102: During the resource allocation period, filter the time-frequency resource blocks that can be spatially multiplexed in the current resource allocation period according to the two-hop neighbor list, and generate a sorting order containing all preset node identifiers for each of the time-frequency resource blocks that can be spatially multiplexed.

[0062] Assume that the maximum number of nodes in a network Nmax = 10, the parameter α = 2, and the resource allocation period is as Figure 2 shown. The resource allocation period PrbAlloc = α × Nmax = 20. Also assume that the number of available frequency domain channels in the network at any time is 1, and the available transmission resources in one period are 20 time slots. At this time, each possible in-network node can be statically allocated two time slot resources periodically within one resource allocation period, and the time length of one resource allocation period is defined as one time frame.

[0063] As Figure 3 shown, static resource allocation coordinates and allocates resources for in-network nodes to ensure that each node can obtain the opportunity to send data within a certain time, guarantee a minimum transmission fairness, so as to ensure that each node can send or broadcast important information at a predefined frequency, such as broadcasting node identifiers, link status, etc. through signaling information. By periodically sending signaling containing node information on statically allocated resources and receiving periodic signaling sent by other nodes, a network node can establish and maintain its two-hop neighbor information.

[0064] The nodes that have completed network synchronization send signaling information during the signaling time slot period, collect the signaling information sent by other nodes, maintain network synchronization, and establish and maintain a full-network neighbor information list based on the collected device status information. The neighbor information list includes at least the node identifier and the hop count from the node to the local node.

[0065] A node can obtain its two-hop neighbors N[2] by querying the neighbor node list. N[2] includes the local node, all one-hop neighbor nodes, and all two-hop neighbor nodes. As Figure 4As shown in the figure, the numbers in the figure represent node identifiers. The connections between nodes indicate the ability to directly communicate between nodes. For example, node 1 and node 3 can directly communicate, but node 1 and node 5 cannot directly communicate and must go through node 3 for relaying. That is to say, node 3 is a one-hop neighbor of node 1, and node 5 is a strict two-hop neighbor of node 1.

[0066] After node synchronization and topology stabilization, network nodes can establish a two-hop neighbor list N[2] as shown in Table 1 locally according to the reception and transmission of signaling information, where the list includes the node itself, the one-hop neighbors of the node, and the strict two-hop neighbors of the node.

[0067] Table 1 Two-hop neighbor list N[2] of nodes

[0068]

[0069]

[0070] After establishing neighbor information, the in-network nodes classify the available time-frequency resource blocks into two categories according to the two-hop neighbor information. One category is the time-frequency resources occupied by two-hop neighbors according to the static allocation strategy, and the other category is the time-frequency resources not statically occupied by two-hop neighbors; then the time-frequency resources not statically occupied by two-hop neighbors are allocated according to the idea of distributed adaptive orthogonal multiple access.

[0071] S103: The network node queries the position of the corresponding two-hop neighbor node in the sorting order and determines that the two-hop neighbor node with the most forward position obtains the right to use the time-frequency resource block that can be spatially multiplexed.

[0072] The working process of the algorithm to achieve resource multiplexing beyond two hops is given:

[0073] (1) As described above, the in-network nodes maintain frame synchronization by periodically sending and collecting clock signals and device status information sent by other nodes, establish and maintain a neighbor information list, and then obtain two-hop neighbor information N[2] from the neighbor information list.

[0074] (2) The in-network nodes classify the available time-frequency resource blocks in the current resource allocation period into time-frequency resources that can be spatially multiplexed and time-frequency resources that cannot be spatially multiplexed according to the two-hop neighbor information N[2]. Among them, the time-frequency resources occupied by the two-hop neighbors of the current node according to the static allocation strategy are defined as time-frequency resources that cannot be spatially multiplexed, and the time-frequency resources not statically occupied by the two-hop neighbors of the current node are defined as time-frequency resources that can be spatially multiplexed.

[0075] (3) Given the maximum number of nodes in the known subnet and the node identifiers, each node generates a sorting order Seq(n) that contains all the preset node identifiers for each reusable time-frequency resource block n according to the same rule: a unified seed as the input for the pseudo-random order, representing the priority order for the corresponding node to use the time-frequency resource block.

[0076] (4) The node queries the positions of the nodes in its two-hop neighbor information 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 time-frequency resource block n.

[0077] The role of the pseudo-random order generator here is to generate a pseudo-random order based on the seed value. The generated order is controllable and predictable, so it is called "pseudo-random". Without loss of generality, this solution assumes that the output of the pseudo-random order generator is only related to the identifier or index of the input time-frequency resource block, and the identifier or index of the time-frequency resource block is unique within a resource allocation period. Therefore, the output value of the pseudo-random order generator can be used as the priority sorting for all nodes in the network to use the time-frequency resource block n.

[0078] Combined with this embodiment, there is also a preferred implementation scheme. Specifically, if some nodes newly join the network or some nodes rejoin the network after leaving the network during the stable operation of the network, it indicates that the network enters opportunistic access;

[0079] According to the preset opportunistic access cycle frequency, configure an opportunistic access cycle within a preset number of resource allocation cycles;

[0080] The network nodes establish and maintain a list of non-networked nodes based on the known neighbor information, and screen the time-frequency resource blocks that can be spatially multiplexed within the current resource allocation cycle plus the opportunistic access cycle according to the two-hop neighbor list and the list of non-networked nodes.

[0081] Combined with this embodiment, there is also a preferred implementation scheme. Specifically, the maximum number of nodes in the network can be initialized according to the usage requirements. During the resource allocation cycle, the number of the time-frequency resource blocks that can be coordinated or scheduled is an integer multiple of the maximum number of nodes.

[0082] Combined with this embodiment, there is also a preferred implementation scheme. Specifically, the method for establishing a two-hop neighbor list corresponding to each network node includes:

[0083] Network frame synchronization, periodically determine the statically allocated time-frequency resources in a preset manner, and send its own clock signal and device status information;

[0084] Search for the clock signals and device status information sent by other nodes, adjust the time frame boundary, and complete network synchronization;

[0085] Periodically collect the clock signals and device status information sent by network nodes, maintain network synchronization, establish a neighbor information list;

[0086] Send system information and network signaling on demand to maintain network operation.

[0087] Combined with this embodiment, there is also a preferred implementation solution. Specifically, the method for screening time-frequency resource blocks that can be spatially multiplexed within the current resource allocation period according to the two-hop neighbor list includes:

[0088] Periodically collect the clock signals and device status information sent by network nodes, maintain network synchronization, establish a neighbor information list, and extract two-hop neighbor information;

[0089] Divide the available time-frequency resource blocks into reusable time-frequency resources and non-reusable time-frequency resources according to the two-hop neighbor information.

[0090] Combined with this embodiment, there is also a preferred implementation solution. Specifically, within the current resource allocation period plus the opportunistic access period, generate a sorting order including all preset node identifiers for each of the time-frequency resource blocks that can be spatially multiplexed;

[0091] The network node queries the position of the corresponding two-hop neighbor node in the sorting order and determines that the two-hop neighbor node with the most forward position obtains the right to use the time-frequency resource block.

[0092] Combined with this embodiment, there is also a preferred implementation solution. Specifically, the method for periodically determining the statically allocated time-frequency resources according to a preset manner includes:

[0093] Periodically determine the statically allocated time-frequency resources in the manner of static time-frequency orthogonal multiple access.

[0094] Combined with this embodiment, there is also a preferred implementation solution. Specifically, the method for generating a sorting order including all preset node identifiers for the time-frequency resource blocks that can be spatially multiplexed includes:

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

[0096] The method for distributed adaptive multiple access based on pre-allocation proposed in the first embodiment of this invention uses a distributed adaptive orthogonal resource pre-allocation algorithm, which can adaptively achieve two-hop outer space multiplexing of available transmission resources according to the network topology structure, is suitable for multi-hop networks with the main requirement of transmitting periodic data, improves network resource utilization, and can well adapt to the rapid change of network topology.

[0097] Embodiment 2

[0098] According to the main working process of the above-mentioned pre-allocation-based distributed adaptive multiple access algorithm, after the device is powered on, frame synchronization and neighbor information establishment are completed in sequence, and then the network nodes complete the two-hop external multiplexing of available transmission resources based on the above-known information. However, in the actual working process, there may be a process in which some nodes join the network during the stable operation of the network, or a process in which a node re-enters the network after going offline. In this Embodiment 2, the process of some nodes joining or re-joining the stable operation network is called the opportunistic access process.

[0099] The pre-allocation-based distributed adaptive multiple access algorithm supports the opportunistic access of network nodes through the following process:

[0100] (1) Define the opportunistic access period PrandAccess = β × PrbAlloc, where β = 1, 2, 3,... If β = 1, then PrandAccess = PrbAlloc, that is, each resource allocation period is the opportunistic access period; if β = 2, it means that one opportunistic access period is configured in every two resource allocation periods, that is, the opportunistic access period appears every other resource allocation period; and so on. If β = n, it means that one opportunistic access period is configured in every n resource allocation periods.

[0101] (2) During non-opportunistic access periods, network nodes allocate time-frequency resources that are not statically occupied by two-hop neighbors according to the idea of the aforementioned distributed adaptive orthogonal multiple access to achieve two-hop external multiplexing of available transmission resources.

[0102] (3) During the opportunistic access period, network nodes establish and maintain a list NoffNet of non-connected nodes based on the known neighbor information. Assume that the network is full of users at this time and use the union of the list NoffNet of non-connected nodes and N[2] of the two-hop neighbor list as the new pseudo two-hop neighbor list. Then allocate time-frequency resources that are not statically occupied by the pseudo two-hop neighbors according to the idea of the aforementioned distributed adaptive orthogonal multiple access.

[0103] When the network parameters are Nmax = 10, α = 2, β = 2, a configuration method of the opportunistic access period and the transmission resource spatial multiplexing period is as Figure 5 shown. In the actual system design process, usually, various parameters affect and restrict each other with technical indicators. The specific values of the above parameters need to be carefully determined by comprehensively considering the usage scenario and technical indicators such as network synchronization time, network establishment time, and node access time.

[0104] The network node divides the available time-frequency resource blocks in the current resource allocation period into time-frequency resources that can be spatially multiplexed and time-frequency resources that cannot be spatially multiplexed according to the two-hop neighbor information N[2], and realizes two-hop external multiplexing of the time-frequency resources that can be spatially multiplexed in the manner of distributed adaptive orthogonal multiple access.

[0105] As Figure 6 shown, by defining the opportunistic access period and the transmission resource spatial multiplexing period, it supports the opportunistic access of network nodes and the spatial multiplexing of available transmission resources:

[0106] In the opportunistic access period, the node divides the available time-frequency resources in the current period into two categories: reusable time-frequency resources and non-reusable time-frequency resources according to the pseudo two-hop neighbor list N[2]; in the non-opportunistic access period, the node divides the available time-frequency resources in the current period into two categories: reusable time-frequency resources and non-reusable time-frequency resources according to the two-hop neighbor list N[2].

[0107] In the opportunistic access period, the node queries the position of the nodes in the pseudo two-hop neighbor list N[2] in the sequence Seq(n) to determine the node that obtains the right to use the time-frequency resource block n; in the non-opportunistic access period, the node queries the position of the nodes in the two-hop neighbor list N[2] in the sequence Seq(n) to determine the node that obtains the right to use the time-frequency resource block n.

[0108] The main working process of the pre-allocated distributed adaptive multiple access algorithm is as follows:

[0109] (1) Parameter configuration, the network device initializes parameters such as Nmax, α, β, etc. according to the usage requirements, and determines the frame structure, resource allocation period, opportunistic access period, etc. according to the network parameters.

[0110] (2) Signaling transmission, after the node runs, it performs network frame synchronization, periodically determines the statically allocated time-frequency resources in the manner of static time-frequency resource orthogonal allocation S-TF-OMA, and sends its own clock signal and device status information on the obtained time-frequency resource block. Without loss of generality, the transmission of this information should satisfy the minimum time interval timeSignalminInterval and the maximum time interval constraint timeSignalmaxInterval, that is, the time interval for the node to send its own clock signal and device status information should be greater than timeSignalminInterval and less than timeSignalmaxInterval.

[0111] (3) Network synchronization, the node searches for the clock signals and device status information sent by other nodes, adjusts the frame boundary, and completes network synchronization.

[0112] (4) Neighbor list: Nodes send clock signals and device status information as needed, collect information sent by other nodes, maintain network synchronization, and establish and maintain a neighbor information list, which ultimately contains information about all nodes in the network.

[0113] (5) Two-hop neighbors: Nodes extract the two-hop neighbor list N[2], the list of non-networked nodes NoffNet, and the pseudo two-hop neighbor list N[2] based on the neighbor information list.

[0114] (6) Resource classification: During the opportunistic access period, nodes classify the available time-frequency resources in the current period into reusable and non-reusable time-frequency resources based on the pseudo two-hop neighbor list N[2]; during the non-opportunistic access period, nodes classify the available time-frequency resources in the current period into reusable and non-reusable time-frequency resources based on the two-hop neighbor list N[2].

[0115] (7) Sorting order: Nodes generate a sorting order Seq(n) containing all preset node identifiers for each reusable time-frequency resource block n.

[0116] (8) Resource reuse: During the opportunistic access period, nodes query the positions of the nodes in the pseudo two-hop neighbor list N[2] in the order Seq(n) to determine the nodes that obtain the right to use the time-frequency resource block n; during the non-opportunistic access period, nodes query the positions of the nodes in the two-hop neighbor list N[2] in the order Seq(n) to determine the nodes that obtain the right to use the time-frequency resource block n.

[0117] Embodiment III

[0118] Embodiment III provides a system for pre-allocated distributed adaptive multiple access, as Figure 7 shown. The system includes:

[0119] A signaling module for sending signals and receiving periodic signals sent by other nodes;

[0120] A list module for establishing and maintaining a two-hop neighbor list corresponding to each network node;

[0121] A screening module for screening time-frequency resource blocks that can be spatially reused during the current resource allocation period according to the two-hop neighbor list;

[0122] A sorting module for generating a sorting order containing all preset node identifiers for each of the time-frequency resource blocks that can be spatially reused;

[0123] A query module for querying the positions of the corresponding two-hop neighbor nodes in the sorting order and determining that the two-hop neighbor node with the earliest position obtains the right to use the time-frequency resource block.

[0124] Embodiment IV:

[0125] A device based on pre-allocated distributed adaptive multiple access, such as Figure 8 shown, the device includes:

[0126] One or more processors;

[0127] 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 of pre-allocated distributed adaptive multiple access according to any one of the first embodiment.

[0128] Figure 8 This is a schematic diagram of the structure of the device for pre-allocated distributed adaptive multiple access provided in the third embodiment. Figure 8 Shows a block diagram of an exemplary device for pre-allocated distributed adaptive multiple access suitable for use in implementing the embodiments of the present invention. Figure 8 The shown device for pre-allocated distributed adaptive multiple access is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present invention.

[0129] Such as Figure 8 shown, the device for pre-allocated distributed adaptive multiple access is presented in the form of a general-purpose device. The components of the device for pre-allocated distributed adaptive multiple access 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).

[0130] The bus represents one or more of several types of bus architectures, 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 architectures. For example, these architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

[0131] The device for pre-allocated distributed adaptive multiple access typically includes a variety of computer system-readable media. These media can be any available media that can be accessed by a device capable of being modified by an intelligent logging interpretation model, including volatile and non-volatile media, removable and non-removable media.

[0132] The memory may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory. The device based on pre-allocated distributed adaptive multiple access may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, a storage system may be used for reading and writing on non-removable, non-volatile magnetic media ( Figure 8 not shown, typically referred to as a "hard disk drive"). Although Figure 8 not shown in, a disk drive for reading and writing on removable non-volatile disks (such as a "floppy disk") may be provided, as well as 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 may be connected to the bus through one or more data media interfaces. The memory may include at least one program product having a set (such as at least one) of program modules configured to perform the functions of the embodiments of the present invention.

[0133] A program / utility with a set (at least one) of program modules may be stored in, for example, 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. The implementation of a network environment may be included in each or some combination of these examples. The program modules generally perform the functions and / or methods in the embodiments described in the present invention.

[0134] The device based on pre-allocated distributed adaptive multiple access may also communicate with one or more external devices (such as a keyboard, a pointing device, a display, etc.), and may also communicate with one or more devices that enable a user to interact with the device based on pre-allocated distributed adaptive multiple access, and / or communicate with any device that enables the device based on pre-allocated distributed adaptive multiple access to communicate with one or more other devices (such as a network card, a modem, etc.). Such communication may be carried out through an input / output (I / O) interface. Also, the device for intelligent logging interpretation model correction may further 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 8 shown, the network adapter communicates with other modules of the device based on pre-allocated distributed adaptive multiple access through the bus. It should be understood that although not shown in the figure, other hardware and / or software modules may be used in combination with the device based on pre-allocated distributed adaptive multiple access, 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.

[0135] The processing unit executes various functional applications and data processing by running the programs stored in the memory, such as implementing the method for pre-allocated distributed adaptive multiple access provided in any embodiment of the present invention. That is: the network node periodically sends signaling to the network through static resource allocation and receives the periodic signaling sent by other nodes, and establishes and maintains a two-hop neighbor list corresponding to each network node; within the resource allocation period, according to the two-hop neighbor list, filters the time-frequency resource blocks that can be spatially multiplexed in the current resource allocation period, and generates a sorting order including all preset node identifiers for each of the time-frequency resource blocks that can be spatially multiplexed; the network node queries the position of the corresponding two-hop neighbor node in the sorting order, and determines that the two-hop neighbor node with the earliest position obtains the right to use the time-frequency resource block that can be spatially multiplexed.

[0136] 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 distributed adaptive multiple access based on pre-allocation, characterized in that: Methods include: The network nodes periodically send signaling to the network through static resource allocation and receive periodic signaling sent by other nodes, and establish and maintain a two-hop neighbor list corresponding to each network node; In a resource allocation cycle, the spatially multiplexable time-frequency resource blocks in the current resource allocation cycle are screened according to the two-hop neighbor list, and a sorting order including all preset node identifiers is generated for each of the spatially multiplexable time-frequency resource blocks; The network node queries the position of the corresponding two-hop neighbor node in the sorting order, and determines that the two-hop neighbor node with the most forward position obtains the right to use the spatially multiplexed time-frequency resource block.

2. The method for distributed adaptive multiple access based on pre-allocation according to claim 1, characterized in that: The method also includes: If some nodes are newly added to the network or some nodes are disconnected and then reconnected during the stable operation of the network, it indicates that the network has entered the random access mode. According to a preset random access cycle frequency, configuring a random access cycle within a preset number of resource allocation cycles; The network node establishes and maintains a non-networked node list according to known neighbor information, and screens spatially multiplexed time-frequency resource blocks within the current resource allocation period plus the random access period according to the two-hop neighbor list and the non-networked node list.

3. The method for distributed adaptive multiple access based on pre-allocation according to claim 1, characterized in that: The method also includes: The maximum number of nodes in the network is initialized according to usage requirements, and within the resource allocation period, the number of time-frequency resource blocks that can be coordinated or scheduled is an integer multiple of the maximum number of nodes.

4. The method for distributed adaptive multiple access based on pre-allocation according to claim 1, characterized in that: The method for establishing a two-hop neighbor list corresponding to each network node includes: Network frame synchronization: periodically determine the statically allocated time and frequency resources according to a preset method, and send its own clock signal and device status information; Search for clock signals and device status information sent by other nodes, adjust time frame boundaries, and complete network synchronization; Periodically collect clock signals and device status information sent by network nodes, maintain network synchronization, and establish neighbor information lists; Send system information and network signaling on demand to maintain network operation.

5. The method for distributed adaptive multiple access based on pre-allocation according to claim 1, characterized in that: The method for screening spatially multiplexable time-frequency resource blocks in the current resource allocation period according to the two-hop neighbor list comprises: Periodically collect clock signals and device status information sent by network nodes, maintain network synchronization, establish neighbor information lists, and extract two-hop neighbor information; The available time-frequency resource blocks are divided into reusable time-frequency resources and non-reusable time-frequency resources according to the two-hop neighbor information.

6. The method for distributed adaptive multiple access based on pre-allocation according to claim 2, characterized in that: The method further comprises: Generating a sorting sequence including all preset node identifiers for each of the spatially multiplexed time-frequency resource blocks within the current resource allocation period plus the random access period; The network node queries the position of the corresponding two-hop neighbor node in the sorting order, and determines that the two-hop neighbor node with the most forward position obtains the right to use the time-frequency resource block.

7. The method for distributed adaptive multiple access based on pre-allocation according to claim 4, characterized in that: The method for periodically determining the statically allocated time-frequency resources in a preset manner includes: The statically allocated time-frequency resources are periodically determined in a static time-frequency orthogonal multiple access manner.

8. The method for distributed adaptive multiple access based on pre-allocation according to claim 4, characterized in that: The method for generating a sorting sequence including all preset node identifiers by the spatially multiplexable time-frequency resource blocks includes: A random sequence generator is set, the output value of the random sequence generator is related to the input spatially multiplexed time-frequency resource block identifier or index, and the output value of the random sequence generator is used as the priority ranking of all network nodes.

9. A system for distributed adaptive multiple access based on pre-allocation, characterized in that: The system includes: The signaling module is used to send signaling and receive periodic signaling sent by other nodes; List module, used to establish and maintain the two-hop neighbor list corresponding to each network node; A screening module, used for screening the spatially multiplexed time-frequency resource blocks in the current resource allocation period according to the two-hop neighbor list; A sorting module, used to generate a sorting order including all preset node identifiers for each of the spatially multiplexable time-frequency resource blocks; The query module is used to query the position of the corresponding two-hop neighbor node in the sorting order, and determine that the two-hop neighbor node with the front position obtains the right to use the time-frequency resource block.

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

Images