Wireless communication node, system and method for multi-channel dynamic resource allocation

Abstract

The invention relates to a wireless communication node, system and method for multi-channel dynamic resource allocation, the communication node comprises a processor and a multi-channel directional antenna coupled to the processor, and the processor completes neighbor interaction in a beacon time slot through an information acquisition module and acquires key information such as geographic position, service load and link quality; calculating a resource demand and applying for a time slot resource according to the information in a signaling time slot through a dynamic resource application module; a resource arbitration and feedback module is used for receiving application information of neighbor nodes in a signaling time slot, and distributed arbitration is quickly completed based on local resource requirements and a greedy algorithm, so that a time slot occupation table is efficiently determined; and transmission is carried out in a data time slot through the data interaction module. According to the method, parallel multiplexing of time slot resources in a one-hop range is realized by combining multiple channels and the directional antennas, the network throughput and the resource utilization rate are greatly improved, and fairness and timeliness of resource allocation are ensured through a greedy arbitration mechanism.

Description

A wireless communication node, system, and method for dynamic resource allocation across multiple channels. Technical Field

[0001] This invention relates to the field of multi-channel communication technology, and in particular to a wireless communication node, system, and method for dynamic resource allocation across multiple channels. Background Technology

[0002] In mobile communication networks, directional antennas have gained widespread attention due to their outstanding advantages of high-gain transmission and reception and directional transmission. Directional antenna communication can be divided into single-channel communication and multi-channel communication. Compared to omnidirectional antennas, single-channel directional antenna communication can achieve higher transmission rates and longer transmission distances. Multi-channel communication utilizes multiple directional antennas to enable multiple channels to operate independently and simultaneously without interference between them. Multi-channel communication also uses spatial multiplexing to allow multiple users in different directions to simultaneously occupy the same time slot resources, further improving time slot utilization and effectively enhancing network performance.

[0003] Achieving multi-channel directional antenna communication presents a significant challenge in terms of resource allocation across multiple channels. Existing resource allocation methods include Carrier Sense Multiple Access (CDMA / CA) and TDMA protocols. CDMA / CA allocates resources through listening and preemption of channels, but collisions due to random contention lead to performance degradation as network size increases. TDMA, through fixed resource allocation, can achieve high link capacity under stable topology conditions, but it results in wasted time slots when no data is transmitted. Multi-channel communication, with its abundant time slot resources compared to single-channel communication, requires a more flexible dynamic resource allocation method. Therefore, the aforementioned mechanisms are no longer suitable.

[0004] Therefore, there is a need to propose a wireless communication node, system, and method for dynamic resource allocation in multiple channels, which can solve problems such as low resource allocation efficiency, waste of time slot resources, and hidden terminal conflicts in high-density, decentralized wireless networks. Summary of the Invention

[0005] In view of this, it is necessary to provide a wireless communication node, system and method for dynamic resource allocation of multiple channels, in order to solve the technical problems that existing resource allocation methods such as random contention and fixed allocation suffer from performance degradation, time slot waste and multiplexing difficulties in multi-channel directional antenna networks, thus failing to meet the requirements of multi-channel resource allocation.

[0006] In a first aspect, the present invention provides a wireless communication node for dynamic resource allocation across multiple channels, comprising a processor and a multi-channel directional antenna coupled to the processor; the processor comprises: an information acquisition module, configured to control the multi-channel directional antenna to perform neighbor interaction in a beacon time slot to acquire geographic location information, service load, and link quality information; a dynamic resource request module, configured to calculate the time slot resource requirements of each channel based on the service load, geographic location information, and link quality information in a signaling time slot, and complete the dynamic resource request through the multi-channel directional antenna; a resource arbitration and feedback module, configured to receive the time slot request information sent by neighboring nodes in a signaling time slot, form local resource information, perform resource arbitration based on the local resource requirements using a greedy algorithm, and send arbitration feedback through the multi-channel directional antenna; and a data interaction module, configured to control the multi-channel directional antenna to transmit data in its occupied time slot based on a time slot occupancy table determined by the arbitration result in a data time slot.

[0007] Furthermore, in the beacon time slot, controlling the multi-channel directional antenna to complete neighbor interaction includes: in the beacon time slot, simultaneously sending neighbor information data packets to multiple neighbor nodes through the directional antenna on multiple channels; completing beam alignment and neighbor awareness based on the interaction of the neighbor information data packets; wherein, the neighbor information data packets include link quality information, geographical location information, current channel traffic load information, and one-hop neighbor information.

[0008] Furthermore, in the signaling time slot, the time slot resource requirements for each channel are calculated based on the service load, geographical location information, and link quality information. Dynamic resource requests are then completed using a multi-channel directional antenna, including: using the multi-channel directional antenna to divide sectors; calculating the sectors to which all neighboring nodes belong based on their geographical location information; statistically analyzing the service load within different sectors; calculating short-term traffic estimates based on the service load within different sectors; and combining the short-term traffic estimates with a time series prediction model to estimate long-term traffic estimates; estimating the time slot requirements for a single sector based on the long-term traffic estimates and channel quality information; generating a time slot request table based on the time slot requirements for each sector; and sending this table to neighboring nodes within the corresponding sector via multi-channel and directional antennas in the signaling time slot to complete the multi-channel dynamic resource request.

[0009] Furthermore, a time slot request table is generated based on the time slot requirements of each sector, including: querying the occupied time slots in its own sector; making a time slot resource request or release decision based on the time slot requirements of a single sector and the number of occupied time slots in a single sector: if the time slot requirements are greater than the number of occupied time slots, then unoccupied time slots are requested first; if the time slot requirements are less than the number of occupied time slots, then occupied time slots are released in reverse order; and a time slot request table is generated based on the time slot resource request or release decision.

[0010] Furthermore, resource arbitration is performed using a greedy algorithm based on the local resource requirements, including: recording time slot request information for different channels according to the geographical location of neighboring nodes to form local resource request information; after receiving the local resource request information of all neighboring nodes, performing time slot conflict judgment on each channel according to the channel order; when multiple nodes in the same sector simultaneously request the same time slot, it is determined that there is a time slot conflict; if there is a time slot conflict, resource arbitration is performed using a greedy algorithm.

[0011] Furthermore, resource arbitration is accomplished through a greedy algorithm, including: if there is a time slot conflict within the same sector, the corresponding decision coefficient is calculated based on the remaining service load, service priority, and neighbor node topology of each conflicting node; based on the decision coefficient, a greedy algorithm is used to calculate the local optimal solution within the same sector to complete the time slot ownership arbitration.

[0012] Furthermore, arbitration feedback is accomplished through a multi-channel directional antenna, including: if there is a time slot conflict in the current channel, an arbitration feedback data packet is generated according to the arbitration result, and the arbitration feedback data packet is sent to the neighboring node of the corresponding sector in the current channel. All received decision results are processed according to the channel order to form a time slot occupancy table.

[0013] Furthermore, channels are selected based on the geographical location information of the nodes, and data interaction is performed simultaneously on each channel. This includes: in the data time slot, the transmission channel is selected based on the geographical location of the destination node of the service load, and data is transmitted in its own occupied time slot according to the time slot occupancy table of the corresponding channel.

[0014] Secondly, the present invention also provides a system for dynamic resource allocation across multiple channels, comprising multiple wireless communication nodes, wherein the wireless communication nodes adopt the communication nodes described in any of the above technical solutions.

[0015] Thirdly, the present invention also provides a multi-channel dynamic resource allocation method, applied to the system described in the above technical solution, comprising: setting a unified multi-channel frame structure, wherein the frame structure includes, in sequence, a beacon time slot, a signaling time slot, and a data time slot; in the beacon time slot, each node completes neighbor interaction through a multi-channel directional antenna to obtain geographical location information, service load, and channel quality information; in the signaling time slot, each node calculates the local resource requirements of each channel based on the geographical location information, service load, and channel quality information, and completes dynamic resource application through the multi-channel directional antenna; simultaneously, the node receives the local resource requirements sent by neighboring nodes, completes resource arbitration based on the local resource requirements using a greedy algorithm, and completes arbitration feedback through the multi-channel directional antenna; in the data time slot, each node selects the corresponding channel based on the geographical location information and channel quality information of the destination node, and performs data interaction simultaneously in each channel.

[0016] Compared with the prior art, the beneficial effects of the present invention include: (1) By setting up a multi-channel frame structure, in the beacon time slot, the multi-channel directional antenna is used to complete the neighbor information interaction and beam alignment; by using the multi-channel directional antenna to divide the sector, the time slot resources are realized to be used in parallel multiplexing within one hop; in the signaling time slot, the node calculates the resource requirements of each channel according to the service load and geographical location information, and completes the dynamic resource application through the multi-channel directional antenna, and further reduces the time slot conflict and end-to-end delay through distributed time slot application; by using the directional antenna to interact with the neighbor information data packets, the efficient use of resources after allocation is ensured.

[0017] (2) The resource application and release process of each node does not depend on instantaneous traffic, but is based on short-term traffic estimates and combined with time series prediction models to estimate long-term traffic, making resource application more stable and accurate, and avoiding frequent resource application and release due to instantaneous business fluctuations. The arbitration process adopts a greedy algorithm. When there is a time slot conflict, the decision coefficient is calculated by comprehensively considering the remaining business load, business priority and the topology of neighboring nodes. The multi-dimensional decision is used to calculate the local optimal solution, ensuring that scarce resources are allocated to the nodes with the most urgent business and the most critical topology, taking into account both efficiency and fairness.

[0018] This invention effectively improves network resource utilization and global network throughput by using simultaneous multi-channel communication and single-hop time slot multiplexing. The larger the network, the higher the time slot utilization. Attached Figure Description

[0019] Figure 1 is a structural schematic diagram of an embodiment of a wireless communication node for multi-channel dynamic resource allocation provided by the present invention; Figure 2 is a frame structure schematic diagram provided by the present invention; Figure 3 is a directional antenna schematic diagram provided by the present invention; Figure 4 is a node model schematic diagram in the simulation provided by the present invention; Figure 5 is a flowchart of the wireless communication method for multi-channel dynamic resource allocation provided by the present invention; Figure 6 is a node topology schematic diagram in the simulation provided by the present invention; Figure 7 is a diagram of the total network throughput of simulated single-channel communication provided by the present invention; Figure 8 is a diagram of the total network throughput of simulated multi-channel communication provided by the present invention; Figure 9a is a single-channel... Figure 9b shows the data transmission volume of single-channel communication provided by the present invention; Figure 10a shows the data transmission volume of multi-channel communication provided by the present invention; Figure 10b shows the data reception volume of multi-channel communication provided by the present invention; Figure 11 shows the time slot occupancy of some nodes in single-channel communication provided by the present invention; Figure 12 shows the time slot occupancy of some nodes in multi-channel communication provided by the present invention; Figure 13 shows the end-to-end delay of single-channel communication provided by the present invention; Figure 14 shows the end-to-end delay of multi-channel communication provided by the present invention. Detailed Implementation

[0020] Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings, which form part of this application and are used together with the embodiments of the present invention to illustrate the principles of the present invention, but are not intended to limit the scope of the present invention.

[0021] This invention provides a wireless communication node 10 for dynamic resource allocation across multiple channels, including a processor 100 and a multi-channel directional antenna 200 coupled to the processor 100. The processor 100 includes: an information acquisition module 101, used to control the multi-channel directional antenna to complete neighbor interaction in a beacon time slot to acquire geographic location information, service load, and link quality information; a dynamic resource request module 102, used to calculate the time slot resource requirements of each channel based on the service load, geographic location information, and link quality information in a signaling time slot, and complete dynamic resource request through the multi-channel directional antenna; a resource arbitration and feedback module 103, used to receive the time slot request information sent by neighboring nodes in a signaling time slot, form local resource information, complete resource arbitration using a greedy algorithm based on the local resource requirements, and send arbitration feedback through the multi-channel directional antenna; and a data interaction module 104, used to control the multi-channel directional antenna to transmit data in its occupied time slot according to the time slot occupancy table determined by the arbitration result in a data time slot.

[0022] The communication node provided in this embodiment achieves efficient, intelligent, and fair allocation of wireless network resources through the fusion application of multi-channel directional antennas. Multi-channel resource scheduling enables parallel multiplexing of time slot resources within a one-hop range, improving network throughput. Simultaneously, by employing long-term traffic estimation based on a time-series prediction model, instantaneous traffic fluctuations are avoided, making resource requests more accurate. Regarding fairness, the time slot conflict arbitration mechanism uses a greedy algorithm. By comprehensively evaluating the decision coefficients based on service load, priority, and topology connectivity, it ensures that resources are preferentially allocated to the most urgent and critical nodes in the event of a conflict, achieving local optimum and fair resource management.

[0023] As a preferred embodiment, the multi-channel dynamic resource allocation method can be applied to mobile ad hoc networks. A schematic diagram of the multi-channel frame structure used by this node is shown in Figure 2, which includes beacon time slots, signaling time slots, and data time slots in sequence. Each node performs neighbor information exchange and beam alignment in the beacon time slot, which contains N time slots, representing the maximum number of nodes supported by the network. The signaling time slot is used for time slot allocation and conflict resolution, and contains 2N time slots. The data time slot is mainly used for data transmission between nodes and contains M time slots.

[0024] Each node in the network uses a multi-channel directional antenna, and the beam formed by each antenna covers a sector. The schematic diagram of the directional antenna is shown in Figure 3. The node model in the OPNET simulation is shown in Figure 4. Each node in Figure 4 contains four antenna elements, and each antenna azimuth plane covers 90°. They can be used independently to realize data transmission and reception.

[0025] In a preferred embodiment, neighbor interaction is completed through a multi-channel directional antenna in the beacon time slot, including: in the beacon time slot, each node simultaneously sends neighbor information data packets to multiple neighbor nodes through the directional antenna on multiple channels; beam alignment and neighbor awareness are completed based on the interaction of the neighbor information data packets; wherein, the one-hop neighbor information includes the geographical location and identification ID of the one-hop neighbor B, service load information, and channel quality information, etc.

[0026] Since the hidden terminal problem is a major challenge in wireless networks, for example, nodes A and C may be neighbors of B, but A and C cannot hear each other. In the system of this solution, nodes A and C are not one-hop neighbors, but are in different sectors (different antennas) of B. So even if A and C send data to node B at the same time, because B's receiving antenna and channel are different, and B's device itself has a certain degree of signal obstruction, there will be no hidden collision problem, and one-hop time slot multiplexing can be achieved.

[0027] The geographic location information is used to calculate the channel used for communication between itself and neighboring nodes, i.e., the antenna sector where the neighboring node is located; the service load information is the service load of the current communication channel of the neighboring node, which serves as an important basis for subsequent time slot conflict judgment; the channel quality information is used to obtain the current channel communication quality of the two nodes, and is used to calculate the communication rate level when the rate is adaptive.

[0028] In a preferred embodiment, during the signaling time slot, the time slot resource requirements for each channel are calculated based on the service load, geographic location information, and link quality information. Dynamic resource requests are then completed using a multi-channel directional antenna. This includes: dividing the network into sectors using the multi-channel directional antenna; calculating the sectors to which all neighboring nodes belong based on their geographic location information; statistically analyzing the service load within different sectors; calculating short-term traffic estimates based on the service load within different sectors; and combining the short-term traffic estimates with a time series prediction model to estimate long-term traffic estimates; estimating the time slot requirements for a single sector based on the long-term traffic estimates and channel quality information; generating a time slot request table based on the time slot requirements for each sector; and sending this table to neighboring nodes within the corresponding sector via multi-channel and directional antennas during the signaling time slot to complete the multi-channel dynamic resource request.

[0029] As a specific implementation, within the beacon time slot, a node has already obtained the geographical coordinates of itself and all neighboring nodes. By calculating the azimuth angle of a neighboring node's geographical location relative to its own coordinates, it determines which sector's beam coverage area the neighboring node falls within. For example, if a neighbor is located within its own azimuth angle of 0 to 90°, then that neighbor belongs to sector 1. The node counts the current volume of service data (i.e., data queue length or cache occupancy) requested by all neighboring nodes within each sector that is destined for or needs to pass through that sector, forming the service load within its different sectors.

[0030] Short-term traffic estimates can be based on the amount of data to be sent accumulated in the node's current buffer, or the data traffic received and generated in a very short time window in the past (such as the previous data slot), reflecting the node's immediate resource needs.

[0031] The time series forecasting model can be one of a moving average (MA) model, an autoregressive (AR) model, an autoregressive moving average (ARMA) model, or a simple linear regression model. This model is used to extract long-term trends from short-term fluctuations. By weighting and smoothing short-term traffic or using it as the latest input to the model, stable traffic demand over a longer future time period (e.g., the next few frame periods) is predicted to obtain a long-term traffic estimate. This approach can make resource allocation more stable and avoid frequent allocation and release caused by instantaneous traffic fluctuations.

[0032] The maximum transmission rate of the channel is determined based on the channel quality information, and the number of time slots required for a single sector (i.e., a single channel direction) is calculated by combining the long-term traffic estimate.

[0033] Furthermore, a time slot request table is generated based on the time slot requirements of each sector, including: querying the occupied time slots in its own sector; making a time slot resource request or release decision based on the time slot requirements of a single sector and the number of occupied time slots in a single sector: if the time slot requirements are greater than the number of occupied time slots, then priority is given to requesting unoccupied time slots; if the time slot requirements are less than the number of occupied time slots, then occupied time slots are released in reverse order; and a time slot request table is generated based on the time slot resource request or release decision.

[0034] Specifically, each node records the time slot requests it has received from neighboring nodes, generates a local time slot table, and queries the occupied time slots for each sector based on the local time slot table. If the current time slot demand exceeds the occupied time slots, it prioritizes requesting unoccupied time slots according to the local time slot table. Each new time slot request should not exceed one-tenth of the total number of data time slots. In order to reduce time slot conflicts and lower end-to-end latency, nodes request time slots in a distributed manner based on address information at certain intervals. If the current time slot demand is less than the occupied time slots, the node releases the excess time slots in reverse order.

[0035] A time slot request table is generated based on the time slot request status and sent to all neighboring nodes of the current sector through the corresponding channel. By utilizing multiple channels, time slot resources are reused within one hop, which greatly improves the utilization rate of time slot resources and network throughput.

[0036] As a preferred embodiment, resource arbitration is performed using a greedy algorithm based on the local resource demand, including: recording time slot request information for different channels according to the geographical location of neighboring nodes to form local resource request information; after receiving the local resource request information of all neighboring nodes, performing time slot conflict judgment on each channel according to the channel order; when multiple nodes in the same sector simultaneously request the same time slot, it is determined that there is a time slot conflict; if there is a time slot conflict, resource arbitration is performed using a greedy algorithm.

[0037] When a node receives a time slot request from a neighboring node, it records it in its local time slot table by sector. After receiving time slot requests from all neighboring nodes, a greedy algorithm is used to determine and arbitrate time slot conflicts. Specifically, if multiple nodes request the same time slot on the same channel, the decision coefficient for each node is calculated according to the following formula. : in, These are the weighting coefficients. For the remaining traffic load, This indicates the current topology connectivity of neighboring nodes or the topology connectivity of the current node. This refers to QoS information for the service load.

[0038] Remaining load traffic This refers to the total traffic load of neighboring nodes on the channel through which this node communicates, or the total traffic load of this node on the current channel minus the traffic load that the allocated time slots can handle. The remaining traffic load information is used to maintain the fairness of time slot allocation and to ensure balanced transmission of traffic as much as possible. It also includes the current topology connectivity of neighboring nodes or the current topology connectivity of this node. QoS information refers to the number of one-hop neighbors of a node. Nodes with more neighbors have a higher probability of slot conflicts, so it can be used as a consideration in slot conflict determination. QoS information is used to ensure the priority order of service transmission.

[0039] right Perform normalization processing and compare the decision coefficients of all conflicting nodes. The time slot is allocated to the node with the highest decision coefficient. After polling all time slots, if a time slot conflict exists, an ACK packet is sent; otherwise, no packet is sent, further reducing network overhead.

[0040] Correspondingly, when each neighboring node receives an ACK packet, it determines whether its own time slot application was successful. If the time slot application fails, it releases the corresponding time slot and updates its own time slot application status. If no ACK packet is received, it occupies a time slot according to the time slot application status and transmits data within the successfully applied data time slot. Distributed time slot application can maximize the success rate of time slot application and reduce the probability of time slot conflicts. Since nodes beyond one hop in multi-channel communication can reuse time slots, the utilization rate of time slots is improved.

[0041] This invention also provides a system for dynamic resource allocation across multiple channels, comprising multiple wireless communication nodes, wherein the wireless communication nodes adopt any of the communication nodes described in the above technical solutions.

[0042] Accordingly, as shown in Figure 5, this embodiment of the invention also provides a multi-channel dynamic resource allocation method applied to the above system, including the following steps: Step S501: Set a unified multi-channel frame structure, wherein the frame structure includes beacon time slots, signaling time slots, and data time slots in sequence; Step S502: In the beacon time slot, each node completes neighbor interaction through a multi-channel directional antenna to obtain geographical location information, service load, and channel quality information; Step S503: In the signaling time slot, each node calculates the local resource requirements of each channel based on the geographical location information, service load, and channel quality information, and completes dynamic resource application through a multi-channel directional antenna; simultaneously, the node receives the local resource requirements sent by neighboring nodes, completes resource arbitration based on the local resource requirements using a greedy algorithm, and completes arbitration feedback through a multi-channel directional antenna; Step S504: In the data time slot, each node selects the corresponding channel based on the geographical location information and channel quality information of the destination node, and performs data interaction simultaneously in each channel.

[0043] To verify the actual effectiveness of the method provided by the present invention, this embodiment compares and analyzes the actual performance of single-channel and multi-channel dynamic resource allocation through simulation experiments.

[0044] The node topology of the simulation scenario is shown in Figure 6. The network has a total of 32 nodes and 16 data streams. Each data stream has a throughput of 16 Mbps. The simulation results of the total network throughput during single-channel communication are shown in Figure 7, and the simulation results of the total network throughput during multi-channel communication are shown in Figure 8.

[0045] It can be seen that the total network throughput is approximately 140 Mbps with single-channel communication and approximately 256 Mbps with multi-channel communication. The total network throughput of multi-channel communication is approximately 1.8 times that of single-channel communication, effectively improving network throughput. The data transmission volume of single-channel communication is shown in Figure 9a and the data reception volume is shown in Figure 9b. The data transmission volume of multi-channel communication is shown in Figure 10a and the data reception volume is shown in Figure 10b. From the above results, it can be seen that the data reception volume of single-channel communication is much smaller than the data transmission volume. This is because the time slot resources are highly competitive and scarce, making it impossible to transmit all the data. In contrast, the data reception volume of multi-channel communication is basically consistent with the data transmission volume and is much larger than the data reception volume of single-channel communication.

[0046] Figure 11 shows the time slot occupancy table for some nodes in single-channel communication, and Figure 12 shows the time slot occupancy table for some nodes in multi-channel communication. It can be seen that in multi-channel communication, nodes occupy more time slots, the time slot reuse rate is greater, the node time slot occupancy is distributed, and data packets can be sent in a timely manner. Figure 13 shows the end-to-end transmission delay in single-channel communication, and Figure 14 shows the end-to-end transmission delay in multi-channel communication. It can be seen that the end-to-end delay in multi-channel communication is much smaller than that in single-channel communication.

[0047] This invention provides a wireless communication node, system, and method for dynamic resource allocation across multiple channels. The method involves setting up a multi-channel frame structure. In the beacon time slot, neighbor interaction is achieved through a multi-channel directional antenna to acquire geographical location information, service load, and channel quality information. In the signaling time slot, the node calculates the resource requirements of each channel based on service load and geographical location information, and dynamically requests resources through the multi-channel directional antenna. Based on local resource information, the node uses a greedy algorithm to arbitrate resources and provides arbitration feedback through the multi-channel directional antenna. In the data time slot, multiple channels operate simultaneously, selecting a channel based on the service load and the destination node's geographical location information, and performing data interaction while occupying channel resources. This solves the problem of dynamic resource allocation across multiple channels and enables multi-channel communication with time slot reuse within one hop.

[0048] The wireless communication system of this invention employs a multi-channel dynamic resource allocation method, enabling multiple channels to operate simultaneously and achieve intra-hop time slot reuse, greatly improving the time slot reuse rate. Furthermore, it enhances the reuse rate in the spatial domain through directional antennas. The time slot allocation uses a distributed time slot allocation method, reducing the possibility of time slot conflicts. Time slots are distributed throughout the time frame, allowing for timely forwarding of data packets and reducing end-to-end latency compared to a centralized distribution. A greedy algorithm is used, combining geographical location information, service load, and QoS for time slot conflict determination, further ensuring fairness in time slot allocation. Sending ACK packets only when there is a time slot conflict reduces network overhead.

[0049] The above description is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention.

Claims

1. A wireless communication node for multi-channel dynamic resource allocation, characterized in that, Includes a processor and a multi-channel directional antenna coupled to the processor; The processor includes: an information acquisition module, used to control the multi-channel directional antenna to complete neighbor interaction in the beacon time slot to acquire geographical location information, service load, and link quality information; a dynamic resource application module, used to calculate the time slot resource requirements of each channel based on the service load, geographical location information, and link quality information in the signaling time slot, and complete dynamic resource application through the multi-channel directional antenna; a resource arbitration and feedback module, used to receive the time slot application information sent by the neighbor node in the signaling time slot, form local resource information, complete resource arbitration based on the local resource requirements using a greedy algorithm, and send arbitration feedback through the multi-channel directional antenna; and a data interaction module, used to control the multi-channel directional antenna to transmit data in its own occupied time slot according to the time slot occupancy table determined by the arbitration result in the data time slot.

2. The wireless communication node according to claim 1, characterized in that, In the beacon time slot, controlling the multi-channel directional antenna to complete neighbor interaction includes: in the beacon time slot, simultaneously sending neighbor information data packets to multiple neighbor nodes through the directional antenna on multiple channels; completing beam alignment and neighbor awareness based on the interaction of the neighbor information data packets; wherein, the neighbor information data packets include link quality information, geographical location information, current channel traffic load information, and one-hop neighbor information.

3. The wireless communication node according to claim 1, characterized in that, In the signaling time slot, the time slot resource requirements for each channel are calculated based on the service load, geographical location information, and link quality information. Dynamic resource requests are then made using a multi-channel directional antenna, including: dividing the network into sectors using the multi-channel directional antenna; calculating the sectors to which all neighboring nodes belong based on their geographical location information; statistically analyzing the service load within each sector; calculating short-term traffic estimates based on the service load within each sector; and combining the short-term traffic estimates with a time series prediction model to estimate long-term traffic estimates; estimating the time slot requirements for a single sector based on the long-term traffic estimates and channel quality information; generating a time slot request table based on the time slot requirements for each sector; and sending the request to neighboring nodes within the corresponding sector via multi-channel and directional antennas in the signaling time slot to complete the multi-channel dynamic resource request.

4. The wireless communication node according to claim 3, characterized in that, Generate a time slot request table based on the time slot requirements of each sector, including: querying the occupied time slots in the sector itself; making a time slot resource request or release decision based on the time slot requirements of a single sector and the number of occupied time slots in a single sector: if the time slot requirements are greater than the number of occupied time slots, then prioritize requesting unoccupied time slots; if the time slot requirements are less than the number of occupied time slots, then release the occupied time slots in reverse order; and generate a time slot request table based on the time slot resource request or release decision.

5. The wireless communication node according to claim 3, characterized in that, Based on the aforementioned local resource requirements, a greedy algorithm is used to complete resource arbitration, including: recording time slot application information for different channels according to the geographical location of neighboring nodes to form local resource application information; after receiving the local resource application information of all neighboring nodes, performing time slot conflict judgment on each channel according to the channel order; when multiple nodes in the same sector apply for the same time slot at the same time, it is determined that there is a time slot conflict; if there is a time slot conflict, resource arbitration is completed through a greedy algorithm.

6. The wireless communication node according to claim 5, characterized in that, Resource arbitration is accomplished through a greedy algorithm, including: if there is a time slot conflict within the same sector, the corresponding decision coefficient is calculated based on the remaining service load, service priority, and neighbor node topology of each conflicting node; based on the decision coefficient, a greedy algorithm is used to calculate the local optimal solution within the same sector to complete the time slot ownership arbitration.

7. The wireless communication node according to claim 5, characterized in that, Arbitration feedback is accomplished through a multi-channel directional antenna, including: if there is a time slot conflict in the current channel, generating an arbitration feedback data packet based on the arbitration result, sending the arbitration feedback data packet to the neighboring node of the corresponding sector in the current channel, processing all received decision results according to the channel order, and forming a time slot occupancy table.

8. The wireless communication node according to claim 1, characterized in that, Channels are selected based on the geographical location information of the nodes, and data interaction is carried out simultaneously on various channels. This includes: in the data time slot, the transmission channel is selected according to the geographical location of the destination node of the service load, and data is transmitted in its own occupied time slot according to the time slot occupancy table of the corresponding channel.

9. A system for dynamic resource allocation across multiple channels, characterized in that, It includes multiple wireless communication nodes, wherein the wireless communication nodes are the communication nodes described in any one of claims 1-8.

10. A multi-channel dynamic resource allocation method, characterized in that, The system described in claim 9 includes: setting a unified multi-channel frame structure, wherein the frame structure includes, in sequence, a beacon time slot, a signaling time slot, and a data time slot; in the beacon time slot, each node completes neighbor interaction through a multi-channel directional antenna to obtain geographical location information, service load, and channel quality information; in the signaling time slot, each node calculates the local resource requirements of each channel based on the geographical location information, service load, and channel quality information, and completes dynamic resource request through the multi-channel directional antenna; simultaneously, each node receives local resource requirements sent by neighboring nodes, completes resource arbitration based on the local resource requirements using a greedy algorithm, and completes arbitration feedback through the multi-channel directional antenna; in the data time slot, each node selects the corresponding channel based on the geographical location information and channel quality information of the destination node, and performs data interaction simultaneously in each channel.

Images