Effective resource scheduling method, device, equipment and medium for underwater acoustic wireless communication network

Abstract

The embodiment of the invention discloses an effective resource scheduling method and device for an underwater acoustic wireless communication network, equipment and a medium, and relates to the technical field of underwater acoustic communication resource scheduling. The method comprises the following steps: if a data sending request sent by a node is received, determining a transmission time window of the node based on the data sending request; judging whether a conflict node having a communication conflict with the node exists based on the transmission time window of the node; and if the conflict node having the communication conflict with the node exists, determining the back-off time of the node, and controlling the node to send data after the back-off time. According to the method, the resource utilization rate of the underwater acoustic network is remarkably optimized by dynamically planning the node transmission time window and actively pre-judging the communication conflict. According to the method, data packet conflicts can be avoided, and accuracy, reliability and high efficiency of data transmission in an underwater acoustic communication network are guaranteed.

Description

Technical Field

[0001] This invention relates to the field of underwater acoustic communication resource scheduling technology, and in particular to an effective resource scheduling method, apparatus, equipment and medium for underwater acoustic wireless communication networks. Background Technology

[0002] The ocean holds abundant resources and immense economic and strategic value. As human exploration, development, and utilization of the ocean deepen—in areas such as environmental monitoring, resource exploration, national defense, and underwater operations—stable and efficient underwater information exchange becomes crucial. Against this backdrop, underwater acoustic communication technology, as a primary means of underwater information transmission, is increasingly important. Compared to the rapid attenuation of radio waves or light waves in water, sound waves, with their excellent propagation characteristics in water, have become the only feasible option for achieving medium- and long-distance underwater communication.

[0003] Underwater acoustic communication networks, serving as the infrastructure supporting underwater information interconnection, typically consist of multiple widely distributed nodes responsible for data acquisition, relaying, or receiving. However, constructing an effective underwater acoustic communication network faces a series of inherent challenges arising from the unique underwater physical environment. First, underwater acoustic channels have extremely limited available bandwidth, fundamentally restricting the overall communication capacity of the network. Second, the propagation speed of sound waves in water is much lower than that of electromagnetic waves, resulting in significant signal propagation delays and making real-time coordination between nodes difficult. Furthermore, the complex marine environment (such as surface and seabed reflections, and water inhomogeneity) can induce severe multipath effects and Doppler shifts, leading to signal distortion and inter-symbol interference, significantly reducing communication reliability.

[0004] Under the complex and constrained underwater acoustic channel conditions described above, a core technical challenge becomes particularly prominent when there are a large number of nodes in the network that need to transmit data: packet collisions between transmitting nodes. Due to propagation delays, nodes cannot perceive the channel status in real time as they do in terrestrial wireless networks. Multiple transmitting nodes may initiate data transmission at similar times and on similar frequency resources because they cannot accurately know each other's transmission intentions, leading to signal overlap and collisions in the channel. Once a collision occurs, the receiving end will find it difficult to correctly parse the data packets from either side, resulting in transmission failure. This collision not only directly leads to a sharp decline in the accuracy and reliability of data transmission, but also further exacerbates network congestion, consumes valuable bandwidth resources, and increases end-to-end latency due to packet retransmissions, severely restricting network throughput and efficiency.

[0005] Therefore, designing an efficient and reliable transmission scheduling mechanism to effectively coordinate and manage the access channels of numerous transmitting nodes, minimize data packet collisions, and ensure accurate, reliable, and efficient data transmission in underwater acoustic communication networks has become a key technical problem urgently needing to be solved in the field of underwater acoustic communication technology. Solving this problem is of fundamental significance for improving the overall performance of underwater networks and supporting more complex marine applications. Summary of the Invention

[0006] This invention provides an effective resource scheduling method, apparatus, device, and medium for underwater acoustic wireless communication networks. The technical problem it aims to solve is: how to design an efficient and reliable transmission scheduling mechanism to effectively coordinate and manage the access channels of numerous transmitting nodes, minimize the occurrence of data packet conflicts, and ensure the accuracy, reliability, and efficiency of data transmission in underwater acoustic communication networks.

[0007] In a first aspect, embodiments of the present invention provide an effective resource scheduling method for an underwater acoustic wireless communication network, comprising:

[0008] If a data transmission request is received from a node, the transmission window of the node is determined based on the data transmission request;

[0009] Based on the transmission time window of the node, determine whether there is a conflicting node that has a communication conflict with the node;

[0010] If there is a conflicting node that has a communication conflict with the node, determine the backoff time of the node, and control the node to send data after the backoff time.

[0011] A further technical solution is that the data transmission request includes a data packet length, and determining the transmission window of the node based on the data transmission request includes:

[0012] Through formula Calculate the transmission time window of the node, where T tx For the transmission window, T start This is the planned start date for sending, L p R is the data packet length, PD is the transmission rate, and PD is the data packet length. max It is the preset maximum propagation delay.

[0013] A further technical solution is that determining whether there is a conflicting node that communicates with the node based on the node's transmission time window includes:

[0014] The occupied area of ​​the node is marked in the preset spatiotemporal resource map based on the transmission time window of the node;

[0015] Determine whether the occupied area of ​​the node overlaps with the occupied area already marked in the spatiotemporal resource map;

[0016] If the occupied area of ​​the node overlaps with the marked occupied area in the spatiotemporal resource map, it is determined that there is a conflicting node that has a communication conflict with the node. The node corresponding to the marked occupied area that overlaps with the occupied area of ​​the node is the conflicting node.

[0017] A further technical solution is that determining the backoff time of the node includes:

[0018] Through formula T backoff =rand(0,N)×(T) tx +PD max Calculate the backoff time of the node, where T backoff The backoff time is N, the number of conflicting nodes is T. tx For the transmission time window, PD max It is the preset maximum propagation delay.

[0019] A further technical solution is that the method further includes:

[0020] If multiple data transmission requests are received simultaneously, the target node is selected from the multiple nodes to transmit data with the goal of maximizing channel capacity, wherein the number of the target nodes is less than or equal to a preset number threshold.

[0021] A further technical solution is that the formula for maximizing channel capacity is as follows:

[0022]

[0023] Where maxC is the maximum channel capacity, Λ is the node activation matrix, H is the channel matrix, I is the identity matrix, and N0 is the noise power.

[0024] A further technical solution is that the method further includes:

[0025] Obtain the SNR and determine the target error correction code corresponding to the SNR based on the preset SNR-error correction code mapping relationship;

[0026] The node is controlled to use the target error correction code.

[0027] Secondly, embodiments of the present invention also provide an effective resource scheduling apparatus for an underwater acoustic wireless communication network, which includes a unit for performing the above-described method.

[0028] Thirdly, embodiments of the present invention also provide a computer device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the above-described method.

[0029] Fourthly, embodiments of the present invention also provide a computer-readable storage medium storing a computer program that, when executed by a processor, can implement the above-described method.

[0030] This invention provides an effective resource scheduling method, apparatus, device, and medium for underwater acoustic wireless communication networks. The method includes: upon receiving a data transmission request from a node, determining the node's transmission window based on the data transmission request; determining whether a conflicting node exists based on the node's transmission window; if a conflicting node exists, determining the node's backoff time, and controlling the node to transmit data after the backoff time. This invention significantly optimizes the resource utilization of underwater acoustic networks by dynamically planning node transmission windows and proactively predicting communication conflicts. When a node initiates a data request, the system first defines a precise transmission time range for it, which fully considers the long latency characteristics of the underwater acoustic channel. Based on this range, the system can identify in advance whether there are conflicting nodes causing signal interference due to overlapping spatiotemporal resources. If a conflict exists, the system calculates a backoff time to delay transmission, allowing the conflicting nodes to naturally separate in the time domain. This mechanism transforms the traditional passive conflict retransmission into an active avoidance mode, significantly reducing the probability of data collisions, reducing unnecessary energy consumption, and improving channel throughput efficiency. Attached Figure Description

[0031] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the following description of the embodiments will be briefly introduced. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0032] Figure 1 A flowchart illustrating an effective resource scheduling method for an underwater acoustic wireless communication network provided in an embodiment of the present invention;

[0033] Figure 2 This is a schematic diagram of the structure of a data frame provided in an embodiment of the present invention;

[0034] Figure 3 A schematic block diagram of an effective resource scheduling device for an underwater acoustic wireless communication network provided in an embodiment of the present invention;

[0035] Figure 4 This is a schematic block diagram of a computer device provided in an embodiment of the present invention. Detailed Implementation

[0036] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0037] It should be understood that, when used in this specification and the appended claims, the terms "comprising" and "including" indicate the presence of the described features, integrals, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integrals, steps, operations, elements, components and / or collections thereof.

[0038] It should also be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0039] It should also be further understood that the term "and / or" as used in this specification and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, and includes such combinations.

[0040] As used in this specification and the appended claims, the term "if" may be interpreted, depending on the context, as "when," "once," "in response to determination," or "in response to detection." Similarly, the phrases "if determined" or "if [described condition or event] is detected" may be interpreted, depending on the context, as "once determined," "in response to determination," "once [described condition or event] is detected," or "in response to detection of [described condition or event]."

[0041] Please see Figure 1 This invention provides an effective resource scheduling method for underwater acoustic wireless communication networks, the method comprising the following steps:

[0042] S1, if a data transmission request is received from a node, determine the transmission window of the node based on the data transmission request.

[0043] In practice, the underwater acoustic wireless communication network includes multiple nodes and a scheduler. Before transmitting data, each node sends a data transmission request to the scheduler, which then determines the transmission window for that node based on the data transmission request.

[0044] For example, in some preferred embodiments, the data transmission request includes a data packet length, and the step "determining the transmission window of the node based on the data transmission request" includes:

[0045] Through formula Calculate the transmission time window of the node, where T tx For the transmission window, T start This is the planned start date for sending, L p R is the data packet length, PD is the transmission rate, and PD is the data packet length. max It is the preset maximum propagation delay.

[0046] In this embodiment of the invention, precise control of resource usage is achieved by quantifying the boundary conditions of the transmission window. The calculation of the transmission window includes not only the duration required for data transmission itself, but also the bidirectional delay protection boundary of the signal at the maximum propagation distance. This design ensures that the window covers the complete cycle from the start of transmission to the completion of reception at the farthest point, avoiding data truncation or channel preemption conflicts caused by propagation delay uncertainties. Simultaneously, the window length is dynamically adjusted according to the data packet size: short data packets can quickly release channel resources, while long data packets reserve sufficient transmission time, thus adapting to the dynamic changes in the service load of the underwater acoustic network.

[0047] S2, determine whether there is a conflicting node that has a communication conflict with the node based on the transmission time window of the node.

[0048] In practice, since there are multiple nodes, if multiple nodes send data simultaneously in the same time and space, a conflict may occur.

[0049] In this embodiment of the invention, to avoid conflicts, before a node sends data, it is determined whether there is a conflicting node that has a communication conflict with the node based on the node's transmission time window, thereby effectively avoiding data transmission interference between nodes and improving the reliability of data transmission.

[0050] For example, in some preferred embodiments, the above step "determining whether there is a conflicting node that communicates with the node based on the node's transmission time window" includes: marking the node's occupied area in a preset spatiotemporal resource map based on the node's transmission time window; determining whether the node's occupied area overlaps with the marked occupied area in the spatiotemporal resource map; if the node's occupied area overlaps with the marked occupied area in the spatiotemporal resource map, determining that there is a conflicting node that communicates with the node, wherein the node corresponding to the marked occupied area that overlaps with the node's occupied area is the conflicting node.

[0051] In practice, the spatiotemporal resource map is a dynamically updated three-dimensional resource visualization model used to accurately describe the occupancy status of spatiotemporal channel resources by communication nodes in an underwater acoustic network. The spatiotemporal resource map includes:

[0052] Time axis (T): Based on system time, it covers the current and future scheduling cycles (e.g., from several seconds to several minutes).

[0053] Spatial axis (S): The sea area covered by the network is divided into a geographic coordinate grid (such as longitude / latitude projection). The communication range of each node is centered on its physical location and the maximum communication distance is the radius (determined by the sonar power and underwater acoustic channel attenuation model), forming a circular coverage area.

[0054] When a node requests transmission, this invention will use the node's transmission time window T. tx The communication space range is mapped to the occupied area on the map (with the node as the center and the radius being the communication distance of the node).

[0055] Determine whether the occupied area of ​​the node overlaps with the marked occupied area in the spatiotemporal resource map. The marked occupied area refers to the area occupied by other nodes when sending data.

[0056] If the occupied area of ​​the node overlaps with the marked occupied area in the spatiotemporal resource map, it is determined that there is a conflicting node that has a communication conflict with the node. The node corresponding to the marked occupied area that overlaps with the occupied area of ​​the node is the conflicting node.

[0057] If the occupied area of ​​the node does not overlap with the occupied area already marked in the spatiotemporal resource map, it means that there is no conflicting node that has a communication conflict with the node.

[0058] In this embodiment of the invention, a spatiotemporal resource map is constructed to achieve visualized conflict management, effectively solving the spatiotemporal coupling interference problem unique to underwater acoustic networks. The system maps the transmission window of each node to an occupied area in a spatiotemporal coordinate system. By detecting the overlap between the new node's area and the existing area in real time, conflicting nodes with a risk of signal collision are directly located. Compared with mechanisms that rely on physical layer listening, this map can predict "future conflicts" caused by long propagation delays—for example, when a node's signal has not yet reached the center, its resource occupancy has already been marked, thereby avoiding new nodes misjudging that the channel is idle.

[0059] S3, if there is a conflicting node that has a communication conflict with the node, determine the backoff time of the node, and control the node to send data after the backoff time.

[0060] In practice, if there is a conflicting node that has a communication conflict with the node, the backoff time of the node is determined, and the node is controlled to send data after the backoff time, thereby effectively avoiding data transmission interference and improving the accuracy and reliability of data transmission.

[0061] For example, in some preferred embodiments, the step "determining the backoff time of the node" includes:

[0062] Through formula T backoff =rand(0,N)×(T) tx +PD max Calculate the backoff time of the node, where T backoff The backoff time is N, the number of conflicting nodes is T. tx For the transmission time window, PD max It is the preset maximum propagation delay.

[0063] This invention proposes an effective resource scheduling method for underwater acoustic wireless communication networks, comprising: upon receiving a data transmission request from a node, determining the transmission window of the node based on the data transmission request; determining whether there is a conflicting node with communication conflict with the node based on the transmission window of the node; if there is a conflicting node with communication conflict with the node, determining the backoff time of the node, and controlling the node to transmit data after the backoff time. This invention significantly optimizes the resource utilization of the underwater acoustic network by dynamically planning the node transmission window and actively predicting communication conflicts. When a node initiates a data request, the system first defines a precise transmission time range for it, which fully considers the long delay characteristics of the underwater acoustic channel. Based on this range, the system can identify in advance whether there are conflicting nodes causing signal interference due to overlapping spatiotemporal resources. If a conflict exists, the system calculates the backoff time to delay transmission, allowing the conflicting nodes to naturally separate in the time domain. This mechanism transforms the traditional passive conflict retransmission into an active avoidance mode, significantly reducing the probability of data collisions, reducing ineffective energy consumption, and improving channel throughput efficiency.

[0064] Furthermore, in some preferred embodiments, the method further includes the following steps: if multiple nodes send data requests are received simultaneously, a target node is selected from the multiple nodes with the goal of maximizing channel capacity, wherein the number of the target nodes is less than or equal to a preset number threshold.

[0065] In specific implementation, when multiple data transmission requests are received simultaneously, the received signal matrix Y = HΛX + N is obtained, where Y is the received signal matrix, H is the channel matrix, Λ is the node activation matrix, X is the transmitted signal matrix, and N is the noise matrix. Λ = diag([λ1, λ2, ..., λ...) k]), representing the node's active state (λ). m =1 indicates that node m is scheduled)

[0066] In this embodiment of the invention, when multiple data transmission requests are received simultaneously, meaning data from multiple nodes needs to be transmitted concurrently, the goal is to maximize channel capacity. A target node is selected from the multiple nodes to transmit data, wherein the number of target nodes is less than or equal to a preset threshold. In some preferred embodiments, the formula for maximizing channel capacity is as follows:

[0067]

[0068] Where maxC is the maximum channel capacity, Λ is the node activation matrix, H is the channel matrix, I is the identity matrix, and N0 is the noise power.

[0069] To maximize channel capacity, the problem becomes a mathematical optimization problem:

[0070]

[0071] (Maximum number of concurrent nodes, i.e., quantity threshold)

[0072] λ m ∈{0,1} (0-1 decision)

[0073] Furthermore, a greedy algorithm is used to iteratively select the node (target node) that maximizes the channel capacity increment, i.e., to find the solution to the above optimization problem, obtain the target node, and then select the target node to send data.

[0074] It should be noted that the greedy algorithm is a core decision-making method for solving space-time scheduling optimization problems. Its essence is to approximate the global optimum through locally optimal choices. The problem it addresses is, in space diversity scheduling, selecting the maximum number of nodes (T1, T2) from K candidate nodes. max The goal is to select 1 node (λm = 1) to maximize the channel capacity C. The core idea is to add the node that maximizes the current channel capacity increment (ΔC) to the scheduling set at each step, until the constraint is satisfied or there is no further benefit from the increment.

[0075] In this embodiment of the invention, when faced with concurrent requests, the method overcomes local optimization bottlenecks through multi-node collaborative scheduling. The system aims to maximize channel capacity by selecting the optimal subset of competing nodes for transmission, with the subset size constrained by a preset threshold. This approach balances global resource efficiency and system stability: the capacity maximization model comprehensively evaluates channel conditions and node requirements, preferentially selecting combinations that improve spatial multiplexing gain, avoiding resource waste caused by simple round-robin; while the quantity limit prevents too many nodes from transmitting simultaneously, thus avoiding signal-to-noise ratio degradation and ensuring the transmission quality of the selected node group. This achieves a scheduling upgrade from "avoiding conflicts" to "proactive optimization."

[0076] In some preferred embodiments, the method further includes the following steps: obtaining the SNR, determining the target error correction code corresponding to the SNR based on a preset SNR-error correction code mapping relationship, and controlling the node to adopt the target error correction code.

[0077] In practice, SNR stands for Signal-to-Noise Ratio, which refers to the ratio between signal strength and noise level. It should be noted that SNR can be determined through measurement.

[0078] First, the SNR is obtained. Then, based on the preset SNR-error correction code mapping relationship, the target error correction code corresponding to the SNR is determined, and a control command is sent to the node so that the node uses the target error correction code for data encoding.

[0079] In this embodiment of the invention, the error correction code may specifically include lightweight RS, standard RS, and enhanced RS.

[0080] Furthermore, in this invention, the objective function is set as: maximizing the net load efficiency of the MAC layer:

[0081]

[0082] Among them, f MC For MAC layer net load efficiency (percentage of valid data), L p Data payload length (actual user data volume), L h Frame header length (control information), L f Frame tail length (checksum information), R tx Average number of retransmissions (the number of times a message needs to be retransmitted due to a channel error).

[0083] It should be noted that in communication technology, the MAC layer (Media Access Control Layer) is a core sublayer in the network protocol stack, located above the physical layer (PHY) and below the network layer.

[0084] In some preferred embodiments, the SNR-error correction code mapping relationship can be specifically a decision table, as shown in Table 1 below:

[0085]

[0086]

[0087] Table 1. Decision Table

[0088] Furthermore, the present invention has a retransmission suppression mechanism: if a node fails to transmit twice in a row, the transmit power is dynamically increased by 3dB or the modulation mode is switched (e.g., QPSK is switched to BPSK).

[0089] In this embodiment of the invention, a dynamically adaptable error correction coding strategy is used to achieve precise matching between transmission reliability and time-varying channels. The system matches a preset error correction code scheme according to the real-time signal-to-noise ratio: low-redundancy coding is used to improve the effective data rate when the signal-to-noise ratio is high; high-error-correction-capability coding is enabled to resist deep fading when the signal-to-noise ratio is low. This mechanism overcomes the limitations of fixed coding—avoiding redundant overhead under high-quality channels and preventing frequent retransmissions in poor channels, thereby stably maintaining a "successful first transmission" in fluctuating underwater acoustic environments. Combined with the aforementioned scheduling mechanism, a closed-loop control is formed from macro-level resource allocation to micro-level transmission optimization.

[0090] Furthermore, in some preferred embodiments, see [link to previous document]. Figure 2 The data frames sent by the nodes include: a 32-bit synchronization header, an 8-bit control field (including power level / encoding strength), a 128-512 byte payload, and a 16-bit CRC checksum.

[0091] Furthermore, in some preferred embodiments, the present invention has three levels of power state management, as follows:

[0092] Table 2:

[0093]

[0094]

[0095] Table 2. Level 3 Power Consumption Table

[0096] See Figure 3 , Figure 3This is a schematic block diagram of an underwater acoustic wireless communication network effective resource scheduling device 20 provided in an embodiment of the present invention. Corresponding to the above-described underwater acoustic wireless communication network effective resource scheduling method, the present invention also provides an underwater acoustic wireless communication network effective resource scheduling device 20. The underwater acoustic wireless communication network effective resource scheduling device 20 includes a unit for executing the above-described underwater acoustic wireless communication network effective resource scheduling method, and the underwater acoustic wireless communication network effective resource scheduling device 20 can be configured in a desktop computer, tablet computer, laptop computer, or other terminal. Specifically, the underwater acoustic wireless communication network effective resource scheduling device 20 includes:

[0097] The determining unit 21 is used to determine the transmission time window of the node based on the data transmission request if a data transmission request is received from the node.

[0098] The judgment unit 22 is used to determine whether there is a conflicting node that has a communication conflict with the node based on the transmission time window of the node;

[0099] The conflict detection unit 23 is used to determine the backoff time of a node if there is a conflicting node that has a communication conflict with the node, and to control the node to send data after the backoff time.

[0100] In some preferred embodiments, the data transmission request includes a data packet length, and determining the transmission window of the node based on the data transmission request includes:

[0101] Through formula Calculate the transmission time window of the node, where T tx For the transmission window, T start This is the planned start date for sending, L p R is the data packet length, PD is the transmission rate, and PD is the data packet length. max It is the preset maximum propagation delay.

[0102] In some preferred embodiments, determining whether there is a conflicting node that communicates with the node based on the node's transmission time window includes:

[0103] The occupied area of ​​the node is marked in the preset spatiotemporal resource map based on the transmission time window of the node;

[0104] Determine whether the occupied area of ​​the node overlaps with the occupied area already marked in the spatiotemporal resource map;

[0105] If the occupied area of ​​the node overlaps with the marked occupied area in the spatiotemporal resource map, it is determined that there is a conflicting node that has a communication conflict with the node. The node corresponding to the marked occupied area that overlaps with the occupied area of ​​the node is the conflicting node.

[0106] In some preferred embodiments, determining the backoff time of the node includes:

[0107] Through formula T backoff =rand(0,N)×(T) tx +PD max Calculate the backoff time of the node, where T backoff The backoff time is N, the number of conflicting nodes is T. tx For the transmission time window, PD max It is the preset maximum propagation delay.

[0108] In some preferred embodiments, the underwater acoustic wireless communication network effective resource scheduling device 20 further includes:

[0109] An optimization unit is configured to select a target node to send data from multiple nodes if multiple data transmission requests are received simultaneously, with the goal of maximizing channel capacity, wherein the number of target nodes is less than or equal to a preset number threshold.

[0110] In some preferred embodiments, the formula for maximizing channel capacity is as follows:

[0111]

[0112] Where maxC is the maximum channel capacity, Λ is the node activation matrix, H is the channel matrix, I is the identity matrix, and N0 is the noise power.

[0113] In some preferred embodiments, the underwater acoustic wireless communication network effective resource scheduling device 20 further includes:

[0114] The acquisition unit is used to acquire the SNR and determine the target error correction code corresponding to the SNR based on a preset SNR-error correction code mapping relationship.

[0115] A selection unit is used to control the node to adopt the target error correction code.

[0116] It should be noted that those skilled in the art can clearly understand that the specific implementation process of the above-mentioned underwater acoustic wireless communication network effective resource scheduling device 20 and each unit can be referred to the corresponding description in the foregoing method embodiments. For the sake of convenience and brevity, it will not be repeated here.

[0117] The aforementioned underwater acoustic wireless communication network effective resource scheduling device 20 can be implemented as a computer program, which can, for example... Figure 4 It runs on the computer device shown.

[0118] Please see Figure 4 , Figure 4 This is a schematic block diagram of a computer device provided in an embodiment of this application. The computer device 500 can be a terminal or a server. The terminal can be an electronic device with communication functions, such as a smartphone, tablet, laptop, desktop computer, personal digital assistant, or wearable device. The server can be a standalone server or a server cluster composed of multiple servers.

[0119] The computer device 500 includes a processor 502, a memory, and a network interface 505 connected via a system bus 501. The memory may include a non-volatile storage medium 503 and internal memory 504.

[0120] The non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032. When the computer program 5032 is executed, it causes the processor 502 to execute an efficient resource scheduling method for an underwater acoustic wireless communication network.

[0121] The processor 502 provides computing and control capabilities to support the operation of the entire computer device 500.

[0122] The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, the processor 502 can execute an effective resource scheduling method for underwater acoustic wireless communication networks.

[0123] The network interface 505 is used for network communication with other devices. Those skilled in the art will understand that the above structure is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device 500 to which the present application is applied. A specific computer device 500 may include more or fewer components than shown in the figures, or combine certain components, or have different component arrangements.

[0124] The processor 502 is used to run a computer program 5032 stored in a memory to implement the steps of an effective resource scheduling method for an underwater acoustic wireless communication network provided in any of the above method embodiments.

[0125] It should be understood that in the embodiments of this application, the processor 502 may be a central processing unit (CPU), or it may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0126] It will be understood by those skilled in the art that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program may be stored in a storage medium, which is a computer-readable storage medium. The computer program is executed by at least one processor in the computer system to implement the process steps of the embodiments of the above methods.

[0127] Therefore, the present invention also provides a storage medium. This storage medium can be a computer-readable storage medium. The storage medium stores a computer program. When executed by a processor, the computer program causes the processor to perform the steps of the efficient resource scheduling method for an underwater acoustic wireless communication network provided in any of the above-described method embodiments.

[0128] The storage medium is a physical, non-transient storage medium, such as a USB flash drive, external hard drive, read-only memory (ROM), magnetic disk, or optical disk, or any other physical storage medium capable of storing program code. The computer-readable storage medium can be non-volatile or volatile.

[0129] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0130] In the several embodiments provided by this invention, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For example, the division of each unit is merely a logical functional division, and there may be other division methods in actual implementation. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed.

[0131] The steps in the method of this invention can be adjusted, merged, or reduced in order according to actual needs. The units in the device of this invention can be merged, divided, or reduced according to actual needs. Furthermore, the functional units in the various embodiments of this invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0132] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a terminal, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention.

[0133] In the above embodiments, the descriptions of each embodiment have different focuses. For parts that are not described in detail in a certain embodiment, please refer to the relevant descriptions in other embodiments.

[0134] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Since these modifications and variations fall within the scope of the claims and their equivalents, this invention also intends to include these modifications and variations.

[0135] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in the present invention, and these modifications or substitutions should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. An effective resource scheduling method for underwater acoustic wireless communication networks, characterized in that, include: If a data transmission request is received from a node, the transmission window of the node is determined based on the data transmission request; Based on the transmission time window of the node, determine whether there is a conflicting node that has a communication conflict with the node; If there is a conflicting node that has a communication conflict with the node, determine the backoff time of the node, and control the node to send data after the backoff time.

2. The effective resource scheduling method for underwater acoustic wireless communication networks according to claim 1, characterized in that, The data transmission request includes a data packet length, and determining the transmission window of the node based on the data transmission request includes: Through formula Calculate the transmission time window of the node, where T tx For the transmission window, T start This is the planned start date for sending, L p R is the data packet length, PD is the transmission rate, and PD is the data packet length. max It is the preset maximum propagation delay.

3. The effective resource scheduling method for underwater acoustic wireless communication networks according to claim 2, characterized in that, The determination of whether there is a conflicting node that communicates with the node based on the node's transmission time window includes: The occupied area of ​​the node is marked in the preset spatiotemporal resource map based on the transmission time window of the node; Determine whether the occupied area of ​​the node overlaps with the occupied area already marked in the spatiotemporal resource map; If the occupied area of ​​the node overlaps with the marked occupied area in the spatiotemporal resource map, it is determined that there is a conflicting node that has a communication conflict with the node. The node corresponding to the marked occupied area that overlaps with the occupied area of ​​the node is the conflicting node.

4. The effective resource scheduling method for underwater acoustic wireless communication networks according to claim 3, characterized in that, Determining the backoff time of the node includes: Through formula T backoff =rand(0,N)×(T) tx +PD max Calculate the backoff time of the node, where T backpff The backoff time is N, the number of conflicting nodes is T. tx For the transmission time window, PD max It is the preset maximum propagation delay.

5. The effective resource scheduling method for underwater acoustic wireless communication networks according to claim 1, characterized in that, The method further includes: If multiple data transmission requests are received simultaneously, the target node is selected from the multiple nodes to transmit data with the goal of maximizing channel capacity, wherein the number of the target nodes is less than or equal to a preset number threshold.

6. The effective resource scheduling method for underwater acoustic wireless communication networks according to claim 5, characterized in that, The formula for maximizing channel capacity is as follows: Where maxC is the maximum channel capacity, Λ is the node activation matrix, H is the channel matrix, I is the identity matrix, and N0 is the noise power.

7. The effective resource scheduling method for underwater acoustic wireless communication networks according to claim 1, characterized in that, The method further includes: Obtain the SNR and determine the target error correction code corresponding to the SNR based on the preset SNR-error correction code mapping relationship; The node is controlled to use the target error correction code.

8. An effective resource scheduling device for an underwater acoustic wireless communication network, characterized in that, Includes a unit for performing the method as described in any one of claims 1-7.

9. A computer device, characterized in that, The computer device includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The storage medium stores a computer program that, when executed by a processor, can implement the method as described in any one of claims 1-7.

Images