A transmission resource scheduling method for a wireless ad hoc network and a wireless ad hoc network

Abstract

The application discloses a kind of transmission resource scheduling method of wireless self-organizing network and wireless self-organizing network, method includes: in public network access stage, each original pending service is arranged according to the order of service priority from high to low using the end-to-end retransmission mode of periodic response to carry out message transmission, each original pending service corresponds to service priority, each level of service priority corresponds to threshold value;Response to task subnet establishment request establishes task subnet and adjusts the service priority of each target pending service in task subnet;System busy degree statistical value is obtained;If the threshold value corresponding to the service priority of target pending service is greater than system busy degree statistical value, target channel is accessed to target pending service and is sent;If the threshold value corresponding to the service priority of target pending service is less than or equal to system busy degree statistical value, random backoff operation is executed to target pending service.The application can guarantee the transmission success rate of high priority service, and the time delay is low.

Description

Technical Field

[0001] This invention relates to the field of wireless ad hoc networks, and in particular to a method for scheduling transmission resources in wireless ad hoc networks and a wireless ad hoc network itself. Background Technology

[0002] A wireless ad hoc network is a temporary network composed of multiple mobile nodes. Nodes share network resources and perform multi-hop data transmission by using the same frequency, waveform, encryption, and other network operating parameters. Since each node is not fixed and is constantly moving, factors such as multipath effects and obstruction inevitably exist, affecting communication quality. Therefore, for messages requiring reliable transmission, an appropriate reliable transmission mechanism needs to be selected based on real-time requirements.

[0003] Existing solution: For messages with high real-time requirements, a continuous multiple retransmission mechanism is used; for messages with low real-time requirements but high accuracy requirements, an end-to-end retransmission mechanism requiring acknowledgments is used: When the sender sends data within the window, it periodically receives acknowledgment character (ACK) packets from the receiver. If no acknowledgment packet is received after a set time interval (negative acknowledgment (NACK) packet or the acknowledgment packet is lost), an ACK timeout retransmission is triggered, with a maximum of 3 timeout retransmissions for a single data packet; When the receiver receives data packets within the window, it checks for packet loss events, marking correct reception as ACK and lost packets as NACK, and periodically transmits packets with the sequence number NACK and ACK flags to the sender. To reduce resource waste, the sender will only retransmit lost data packets based on the NACK packet.

[0004] The shortcomings of the existing solution:

[0005] When the network is running, since messages are sent to the wireless channel at any time, in addition to random packet loss due to the channel, when a receiving message arrives while an antenna at one end is processing a transmission task, packet collisions and packet loss will occur in that time slot. In this environment, two problems will arise:

[0006] 1. In the partial networking phase, higher priority messages need to be allocated more resources to ensure transmission quality.

[0007] 2. The higher the data volume, the more bandwidth resources will be consumed by unnecessary retransmissions for reliable transmission. Periodically replying with ACK messages further increases the probability of packet collisions and makes packet loss more likely. Summary of the Invention

[0008] This invention aims to address at least one of the technical problems existing in the prior art. To this end, this invention proposes a transmission resource scheduling method for wireless ad hoc networks, which can guarantee the transmission success rate of high-priority services with low latency.

[0009] The present invention also provides a wireless ad hoc network, a control device for performing the above-described wireless ad hoc network transmission resource scheduling method, and a computer-readable storage medium.

[0010] A method for scheduling transmission resources in a wireless ad hoc network according to a first aspect of the present invention, the method comprising:

[0011] During the public network access phase, each original pending service is transmitted in descending order of service priority using an end-to-end retransmission method with periodic responses. Each original pending service has a corresponding service priority, and each level of service priority has a corresponding threshold.

[0012] In response to the request to establish a task subnet, a task subnet is established and the service priority of each target pending service within the task subnet is adjusted, wherein the target pending service is one of the original pending services.

[0013] Get system busy level statistics;

[0014] If the threshold value corresponding to the service priority of the target pending service is greater than the system busyness statistics value, the target pending service will be accessed through the target channel and sent.

[0015] If the threshold value corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics value, a random backoff operation is performed on the target pending service.

[0016] The wireless ad hoc network transmission resource scheduling method according to embodiments of the present invention has at least the following beneficial effects:

[0017] During the public network access phase, only network access and maintenance messages are received, resulting in a relatively small system information volume. Each original pending service is directly transmitted end-to-end using a periodic acknowledgment retransmission method, prioritizing services from highest to lowest priority. This ensures high success rate and accuracy for high-priority services while maintaining low latency. When a task subnet needs to be established, the system information volume increases. At this point, system busy level statistics are obtained to determine the system's busy level. If the threshold value corresponding to the service priority of the target pending service is greater than the system busy level statistics, the target pending service is accessed and transmitted through the target channel. If the threshold value is less than or equal to the system busy level statistics, a random backoff operation is performed on the target pending service, causing low-priority services to yield the channel. This maintains the channel load within the channel's carrying capacity while ensuring high success rate and low latency for high-priority services.

[0018] According to some embodiments of the present invention, the system busyness statistics are obtained through the following steps:

[0019] The system obtains the actual traffic volume of the wireless ad hoc network within a preset time, the average system response time of data interaction messages during transmission, the sum of the number of consecutive packet losses of each node in the wireless ad hoc network, and the total number of packet losses.

[0020] The system busyness statistics are determined based on the actual traffic volume, the preset physical channel throughput, the system average response time, the preset maximum system processing delay for each data item, the sum of the consecutive packet loss counts, and the total number of packet losses.

[0021] According to some embodiments of the present invention, the constraint formula for the system busyness statistics is as follows:

[0022] * ;

[0023] in, H This refers to the system's busyness statistics. The actual business volume, The preset physical channel throughput, The average response time of the system is [missing information]. The maximum delay is... The sum of the number of consecutive packet losses. The total number of packets lost.

[0024] According to some embodiments of the present invention, the threshold value is within a preset threshold range; after the target service to be processed is accessed and transmitted through the target channel, the method further includes:

[0025] Obtain the busy / idle status of the target channel;

[0026] If the busy / idle state indicates that the target channel is busy, the threshold corresponding to at least one of the target pending services with a service priority greater than a preset level is adjusted to the maximum value of the preset threshold range.

[0027] According to some embodiments of the present invention, when the target service to be processed is an interactive service, the busy / idle state is obtained through the following steps:

[0028] Obtain the message response time of the target pending service;

[0029] If the message response time is greater than the busy response time, the busy / idle state represents the busy state; the busy response time is equal to the sum of the system's average response time for message interaction during data transmission and twice the one-way radio transmission delay.

[0030] According to some embodiments of the present invention, the busy / idle state is further obtained through the following steps:

[0031] If the target pending service sends several preset messages without receiving a response packet, the busy / idle state indicates a busy state.

[0032] According to some embodiments of the present invention, the method further includes:

[0033] For the target pending service whose threshold value is the maximum value of the preset threshold range, a continuous retransmission mechanism is used for message transmission.

[0034] According to some embodiments of the present invention, the method of using a continuous retransmission mechanism to transmit messages for the target pending service whose threshold value is the maximum value of the preset threshold range includes:

[0035] The sending end of the target service to be processed is controlled to send the target message to the receiving end three times consecutively;

[0036] The receiving end is controlled to deduplicate the three received target messages and store them in the receiving detection queue.

[0037] According to some embodiments of the present invention, the method further includes:

[0038] In response to a task subnet disbanding request, the task subnet is disbanded and the service priority of each target pending service within the task subnet is restored.

[0039] For each of the target pending services, message transmission is performed using an end-to-end retransmission method with periodic acknowledgments, arranged in descending order of service priority.

[0040] According to a second aspect embodiment of the present invention, the wireless ad hoc network is used to implement the transmission resource scheduling method for the wireless ad hoc network as described in the first aspect embodiment above. Since the wireless ad hoc network adopts all the technical solutions of the transmission resource scheduling method for the wireless ad hoc network of the above embodiments, it possesses at least all the beneficial effects brought about by the technical solutions of the above embodiments.

[0041] A control device according to a third aspect embodiment of the present invention includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the transmission resource scheduling method for wireless ad hoc networks as described in the first aspect embodiment above. Since the control device employs all the technical solutions of the transmission resource scheduling method for wireless ad hoc networks described in the above embodiments, it possesses at least all the beneficial effects brought about by the technical solutions of the above embodiments.

[0042] According to a fourth aspect embodiment of the present invention, a computer-readable storage medium stores computer-executable instructions for performing the transmission resource scheduling method for a wireless ad hoc network as described in the first aspect embodiment. Since the computer-readable storage medium employs all the technical solutions of the transmission resource scheduling method for a wireless ad hoc network as described in the above embodiments, it possesses at least all the beneficial effects brought about by the technical solutions of the above embodiments.

[0043] Other features and advantages of the invention will be set forth in the description which follows, and will be apparent in part from the description, or may be learned by practicing the invention. Attached Figure Description

[0044] The above and / or additional aspects and advantages of the present invention will become apparent and readily understood from the description of the embodiments taken in conjunction with the following drawings, in which:

[0045] Figure 1 This is a flowchart of a wireless ad hoc network transmission resource scheduling method according to an embodiment of the present invention. Detailed Implementation

[0046] Embodiments of the present invention are described in detail below. Examples of these embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0047] In the description of this invention, the use of terms such as "first," "second," etc., is for the purpose of distinguishing technical features only and should not be construed as indicating or implying relative importance, or implicitly indicating the number of technical features indicated, or implicitly indicating the order of the technical features indicated.

[0048] In the description of this invention, it should be understood that the orientation descriptions, such as up, down, etc., are based on the orientation or positional relationship shown in the drawings and are only for the convenience of describing this invention and simplifying the description, and are not intended to indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this invention.

[0049] In the description of this invention, it should be noted that, unless otherwise explicitly defined, terms such as "setting," "installation," and "connection" should be interpreted broadly, and those skilled in the art can reasonably determine the specific meaning of the above terms in this invention in conjunction with the specific content of the technical solution.

[0050] The following will combine Figure 1 The transmission resource scheduling method for wireless ad hoc networks according to embodiments of the present invention will be clearly and completely described. Obviously, the embodiments described below are some embodiments of the present invention, not all embodiments.

[0051] refer to Figure 1 , Figure 1 This is a flowchart of a wireless ad hoc network transmission resource scheduling method according to an embodiment of the present invention.

[0052] A method for scheduling transmission resources in a wireless ad hoc network according to a first aspect of the present invention, the method comprising:

[0053] During the public network access phase, each original pending service is transmitted in descending order of service priority using an end-to-end retransmission method with periodic responses. Each original pending service has a corresponding service priority, and each level of service priority has a corresponding threshold.

[0054] In response to the request to establish a task subnet, a task subnet is established and the service priorities of each target pending service within the task subnet are adjusted. The target pending service is one of the original pending services.

[0055] Get system busy level statistics;

[0056] If the threshold value corresponding to the service priority of the target pending service is greater than the system busyness statistics value, the target pending service will be accessed through the target channel and sent.

[0057] If the threshold value corresponding to the priority of the target pending business is less than or equal to the system busyness statistics, a random backoff operation is performed on the target pending business.

[0058] Understandably, during the public network access phase, the business priority of each original pending business is initialized according to the urgency of the data and the business type, and is divided into N levels. The larger the value, the higher the business priority. The higher the business priority, the higher the corresponding threshold.

[0059] The table showing the correspondence between the business type, business priority, and threshold for pending transactions is shown in Table 1:

[0060] Table 1

[0061]

[0062] When the original pending services arrive at the upper layer, they are first added to different priority queues according to their service type. The same priority queue includes original pending services with the same service priority. Starting from the highest priority queue, it is checked whether it is empty. If it is not empty, the original pending service is sent.

[0063] During the public network access phase, there are only network access and maintenance messages, and the system information volume is relatively small. The original pending services are directly transmitted in order of service priority from high to low using the end-to-end retransmission method with periodic response. This not only ensures the success rate and accuracy of high-priority service transmission, but also has low latency.

[0064] The implementation process of the end-to-end retransmission method with periodic acknowledgments is as follows:

[0065] 1. The sending end maintains a sending window for each service priority message sending queue, which stores W message receiving statuses, with the initial record sequence number being [0~W];

[0066] 2. Once a message is sent, mark its status as "pending confirmation" and record the number of times it has been sent;

[0067] 3. If no ACK response message is received within 100ms after sending a message (approximately one-third of the time it takes to send a window of data), the message will be retransmitted, up to a maximum of 3 times (the number corresponds to one-third above; after waiting 3 times, the data in a window will have been transmitted, and further waiting will cause data backlog).

[0068] 4. For messages that have received an ACK response message or have been retransmitted 3 times, adjust the upper and lower limits of the sending window according to the maximum sequence number of the message. For example, if an ACK response message with a maximum sequence number of n is received, the sending window is changed to [0+n, W+n], and so on.

[0069] 5. After receiving a message, the receiving end replies with an ACK response message every 100ms, containing the sequence number of the received message and the reception status; if the message is not received, it replies with a NACK response message, containing the lost packet sequence number and the reception status.

[0070] During operation, some nodes need to complete specific tasks and establish task subnets through specific message interactions. At this time, it is necessary to maintain the operation of the public network and the task subnets. The members within the task subnets adjust and divide the priority of each business (for example, establishing a formation and disbanding a formation are business messages of the same business type, but the processing priority is different at different stages, so it is necessary to adjust the business priority according to the task situation).

[0071] When a task subnet needs to be established, the system information volume increases. At this time, the system busy level statistics are obtained to determine the system busy level. If the threshold value corresponding to the service priority of the target service to be processed is greater than the system busy level statistics, the target service to be processed is connected to the target channel and sent. If the threshold value corresponding to the service priority of the target service to be processed is less than or equal to the system busy level statistics, a random backoff operation is performed on the target service to be processed, so that low-priority services back off and give up the channel, maintaining the channel load within the channel carrying capacity while ensuring the transmission success rate and low transmission latency of high-priority services.

[0072] The backoff window satisfies the following relation:

[0073] ;Formula (1)

[0074] in, C Channel load can be obtained based on the actual traffic volume of the wireless ad hoc network within a preset time period. CW To avoid window size, C The preset initial window size, e It is a constant. n The business priority for the current target pending business. r This refers to the proportion of data with this priority level sent by the sender in the total amount of data sent.

[0075] It should be noted that the greater the channel load, the larger the backoff window, and the backoff window size is different for each priority queue.

[0076] The retreat time is:

[0077] T'=rand ( 0,1 ) CW max ( t,solt ); formula (2)

[0078] in, T’ To avoid delay, C For channel load, CW To avoid window size, t For one-way radio transmission delay, soltThis is the minimum processing time slot.

[0079] When the threshold value corresponding to the business priority of the target pending business is less than or equal to the system busyness statistics, the backoff delay value range is as follows: T Time-based random backoff is implemented based on business volume.

[0080] It should be noted that the delay process is repeated a maximum of N+1 times (N is the maximum value of the service priority). If the threshold value corresponding to the service priority of the target service to be processed is still less than or equal to the statistical value of the system busyness, the opportunity to send the data will be discarded in order to reduce the crowding of the target channel by non-important information.

[0081] According to the wireless ad hoc network transmission resource scheduling method of the present invention, during the common network access phase, there are only network access and maintenance messages, and the system information volume is relatively small. Each original pending service is directly transmitted using a periodic acknowledgment end-to-end retransmission method in descending order of service priority. This not only ensures the transmission success rate and accuracy of high-priority services but also maintains low latency. When a task subnet needs to be established, the system information volume increases. At this time, the system busy level statistics are obtained to determine the system busy level. If the threshold value corresponding to the service priority of the target pending service is greater than the system busy level statistics, the target pending service is accessed through the target channel and transmitted. If the threshold value corresponding to the service priority of the target pending service is less than or equal to the system busy level statistics, a random backoff operation is performed on the target pending service, causing low-priority services to back off and relinquish the channel. This maintains the channel load within the channel carrying capacity while ensuring the transmission success rate and low transmission latency of high-priority services.

[0082] In some embodiments of the present invention, the system busyness statistics are obtained through the following steps:

[0083] The system obtains the actual traffic volume of the wireless ad hoc network within a preset time, the average system response time of data exchange messages during transmission, the sum of the number of consecutive packet losses of each node in the wireless ad hoc network, and the total number of packet losses.

[0084] The system busyness statistics are determined based on the actual traffic volume, the preset physical channel throughput, the system average response time, the preset maximum system processing delay for each data item, the sum of consecutive packet losses, and the total number of packet losses.

[0085] In some embodiments of the present invention, the constraint formula for the system busyness statistics is as follows:

[0086] * ;Formula (3)

[0087] in, HThis is a statistical value representing the system's busyness level. This represents the actual business volume. The preset physical channel throughput, The average system response time. For maximum delay, This is the sum of consecutive packet losses. This represents the total number of packets lost.

[0088] Understandably, the system busy level statistics are used to determine the threshold for sending messages at any given time. Actual traffic volume is the total amount of data sent and received by the system within a preset time period, obtained from statistics from each sending end. The preset physical channel throughput is the maximum number of transmit / receive operations designed for the link. The actual traffic volume and the preset physical channel throughput are used to estimate the real-time throughput of the physical channel. The system average response time and the preset maximum system processing delay for each data item are used to estimate the software's logical computation load. In this embodiment of the invention, data transmission is not a single process; the service data undergoes certain logical processing and message content calculations. When the computational load is high, the message volume needs to be reduced. Packet loss in the wireless channel is divided into random packet loss and continuous packet loss. The total number of packet losses is the sum of random and continuous packet loss. Statistical analysis of continuous packet loss provides a more accurate assessment of the actual transmission pressure.

[0089] The system busyness statistics of this invention take into account channel load, system processing status of services, and the actual continuous packet loss results when the load is high. This allows for a more comprehensive and accurate identification of system busyness, thereby ensuring stable and reliable system transmission.

[0090] In some embodiments of the present invention, the threshold value is within a preset threshold range; after the target service to be processed is accessed and transmitted through the target channel, the method further includes:

[0091] Obtain the busy / idle status of the target channel;

[0092] If the busy / idle status indicates that the target channel is busy, the threshold corresponding to at least one target pending service with a service priority greater than the preset level will be adjusted to the maximum value of the preset threshold range.

[0093] In some embodiments, the preset threshold range is 0% to 100%. If the busy / idle state indicates that the target channel is busy, it means that the system is busy. The threshold of the high-priority target pending services in the target channel may be lower than the statistical value of the system busyness and cannot be transmitted in time. Therefore, adjusting the threshold of at least one target pending service with a service priority greater than the preset level to 100% can ensure that the high-priority target pending services in the target channel will not be backed up.

[0094] The preset level can be N-3, and N can be set to 10. It should be noted that N and the preset level can also be other values, and should not be regarded as a limitation of the present invention.

[0095] In some embodiments of the present invention, when the target service to be processed is an interactive service, the busy / idle status is obtained through the following steps:

[0096] Get the message response time of the target pending business;

[0097] If the message response time is greater than the busy response time, the busy-idle state indicates the busy state; the busy response time is equal to the sum of the system's average response time for exchanging messages during data transmission and twice the one-way radio transmission delay.

[0098] In some embodiments, the system average response time is denoted as T The one-way radio transmission delay is denoted as t If the message response time is greater than T +2 t (ms), the busy / idle state indicates the busy state. It should be noted that the busy response time can also be adjusted according to the actual situation and should not be regarded as a limitation of the present invention.

[0099] In some embodiments of the present invention, the busy / idle state is further obtained through the following steps: if the target pending service sends several preset messages without receiving a response packet, the busy / idle state represents a busy state.

[0100] In some embodiments, the preset message count is 10, and the response packet is an ACK response packet. It should be noted that the preset message count can also be other values ​​and should not be regarded as a limitation of the present invention.

[0101] In some embodiments of the present invention, the method further includes: using a continuous retransmission mechanism to transmit messages for target pending services whose threshold is the maximum value of a preset threshold range.

[0102] In some embodiments of the present invention, a continuous retransmission mechanism is used to transmit messages for target pending services whose threshold is the maximum value of a preset threshold range, including:

[0103] The sending end of the target pending service sends the target message to the receiving end three times consecutively;

[0104] The receiving end controls the deduplication of the three received target messages and stores them in the receiving detection queue.

[0105] Understandably, when the receiving end receives the target message of the high-priority target service to be processed, it does not need to judge whether the target message is correct or whether it needs to be retransmitted. Instead, it directly stores the target message in the receiving detection queue, which can improve the receiving quality, reduce the latency of the target message, and reduce the need for ACK response. This can reduce wireless signal collisions and packet loss, as well as the bandwidth occupied by the receiving end retransmission, and also reduce the channel load, thereby ensuring the low latency requirement of high-priority data.

[0106] It should be noted that the retransmission interval for three consecutive transmissions of the target message is 2 seconds. t , t For radio one-way transmission delay (obtained through the location calculation module), other lower priority messages are backed up and retransmitted reliably.

[0107] In some embodiments of the present invention, the method further includes:

[0108] In response to a task subnet disbanding request, disband the task subnet and control the service priority of each target pending service within the task subnet.

[0109] For each target pending service, message transmission is performed using an end-to-end retransmission method with periodic responses, arranged in descending order of service priority.

[0110] After each node completes its task and exits the task subnet, the amount of system information decreases again. At this point, reverting to the end-to-end retransmission mode with periodic responses not only ensures the success rate and accuracy of high-priority services and low latency, but also reduces the amount of system computation.

[0111] To better illustrate the advantages of the wireless ad hoc network transmission resource scheduling method of the present invention, a specific embodiment will be used for detailed explanation below.

[0112] Taking a 10-node network as an example:

[0113] (1) During the public network access phase, the business priority of each original pending business is initialized according to the urgency of the data and the business type (the data sent by each node is divided into business priorities according to the function), which are divided into N levels. The larger the value, the higher the business priority. The higher the business priority, the higher the corresponding threshold.

[0114] Nodes 1-10 send messages using the initial service priority. All nodes enter the public network normally. The amount of network entry messages and network maintenance information is sparse, and the channel is relatively idle. Messages are transmitted directly in descending order of service priority using a periodic acknowledgment end-to-end retransmission method.

[0115] (2) After running for a period of time, nodes 1 to 6 need to complete specific tasks and enter the task subnet state through message interaction (the channel is prone to congestion after entering the task subnet based on experience). Members in the task subnet adjust and divide the priority of each service (based on experience to judge the importance of the service at this moment and sort it). Nodes 7 to 10 maintain the original state.

[0116] (3) Statistics on the busyness of the computing system for nodes 1 to 6.

[0117] If the threshold value corresponding to the service priority of the target pending service is greater than the system busyness statistics, the target pending service will be accessed and transmitted through the target channel; if the threshold value corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, a random backoff operation will be performed on the target pending service.

[0118] (4) Determine the busy / idle status of the target channel. When the target channel is busy, nodes 1 to 6 will adjust the threshold corresponding to the target pending service with a service priority greater than N-3 to 100% and adopt the new corresponding threshold (see Table 2):

[0119] Table 2

[0120]

[0121] In the 1-6 node messages, the target pending business with a priority greater than N-3 is changed to a continuous multiple retransmission mechanism for reliable transmission. Other messages use an active backoff reliable transmission method that compares the system busyness statistics and threshold values. That is, when data transmission conflicts occur, the random backoff time is calculated according to the algorithm before retransmission.

[0122] (5) Nodes 1 to 6 complete their tasks, exit the task subnet, restore service priority, and resume the end-to-end retransmission mode with periodic responses.

[0123] It should be noted that the specific business priority and corresponding threshold values ​​can be determined based on the actual situation. The values ​​in Tables 1 and 2 should not be regarded as limitations on the invention.

[0124] Existing retransmission mechanisms do not adjust the transmission method according to the actual needs of messages, resulting in many useless retransmissions. They cannot cope with actual transmission conditions and have low transmission efficiency. The embodiments of this invention adopt a dynamic adjustment mechanism based on service priority, network status and system busyness. It combines ACK retransmission (i.e., end-to-end retransmission with periodic acknowledgment), continuous retransmission and active backoff, and makes reasonable use of bandwidth, improves transmission efficiency, and ensures the success rate of high-priority services and low transmission latency while keeping the channel load within the channel carrying capacity.

[0125] According to a second aspect embodiment of the present invention, a wireless ad hoc network is used to implement the transmission resource scheduling method of the wireless ad hoc network as described in the first aspect embodiment above.

[0126] It should be noted that each step of the wireless ad hoc network transmission resource scheduling method in the first aspect embodiment is implemented by a corresponding module, which will not be described in detail here.

[0127] According to the wireless ad hoc network of the present invention, during the public network access phase, there are only network access and maintenance messages, and the system information volume is relatively small. Each original pending service is directly transmitted using a periodic acknowledgment end-to-end retransmission method in descending order of service priority. This not only ensures the transmission success rate and accuracy of high-priority services but also maintains low latency. When a task subnet needs to be established, the system information volume increases. At this time, the system busy level statistics are obtained to determine the system busy level. If the threshold value corresponding to the service priority of the target pending service is greater than the system busy level statistics, the target pending service is accessed through the target channel and transmitted. If the threshold value corresponding to the service priority of the target pending service is less than or equal to the system busy level statistics, a random backoff operation is performed on the target pending service, causing low-priority services to back off and relinquish the channel. This maintains the channel load within the channel's carrying capacity while ensuring the transmission success rate and low transmission latency of high-priority services.

[0128] In addition, one embodiment of the present invention provides a control device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor. The processor and the memory can be connected via a bus or other means.

[0129] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0130] The non-transient software program and instructions required to implement the wireless ad hoc network transmission resource scheduling method of the above embodiments are stored in the memory. When executed by the processor, the wireless ad hoc network transmission resource scheduling method of the above embodiments is executed.

[0131] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0132] Furthermore, one embodiment of the present invention provides a computer-readable storage medium storing computer-executable instructions that are executed by a processor or controller, for example, by the processor of the above embodiment, causing the processor to perform the wireless ad hoc network transmission resource scheduling method of the above embodiment.

[0133] It will be understood by those skilled in the art that all or some of the steps and systems in the methods disclosed above can be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0134] The embodiments of the present invention have been described in detail above with reference to the accompanying drawings. However, the present invention is not limited to the above embodiments. Within the scope of knowledge possessed by those skilled in the art, various changes can be made without departing from the spirit of the present invention.

Claims

1. A method for scheduling transmission resources in a wireless ad hoc network, characterized in that, The method includes: During the public network access phase, each original pending service is transmitted in descending order of service priority using an end-to-end retransmission method with periodic responses. Each original pending service corresponds to a service priority, and each level of service priority corresponds to a threshold, which is within a preset threshold range. In response to the request to establish a task subnet, a task subnet is established and the service priority of each target pending service within the task subnet is adjusted, wherein the target pending service is one of the original pending services. Obtain system busy level statistics; the system busy level statistics are obtained through the following steps: obtaining the actual traffic volume of the wireless ad hoc network within a preset time period, the system average response time of data interaction messages during transmission, the sum of consecutive packet loss counts of each node in the wireless ad hoc network, and the total number of packet losses; determining the system busy level statistics based on the actual traffic volume, the preset physical channel throughput, the system average response time, the preset maximum system processing delay for the current data item, the sum of consecutive packet loss counts, and the total number of packet losses; the constraint formula for the system busy level statistics is: * ； in, H This refers to the system's busyness statistics. The actual business volume, The preset physical channel throughput, The average response time of the system is [missing information]. The maximum delay is... The sum of the number of consecutive packet losses. The total number of packets lost; If the threshold value corresponding to the service priority of the target pending service is greater than the system busy level statistics, the target pending service is accessed and sent through the target channel. The busy / idle status of the target channel is obtained. If the busy / idle status indicates that the target channel is busy, the threshold value corresponding to at least one target pending service with a service priority greater than a preset level is adjusted to the maximum value of the preset threshold range. For the target pending service whose threshold value is the maximum value of the preset threshold range, a continuous multiple retransmission mechanism is used for message transmission. If the threshold value corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics value, a random backoff operation is performed on the target pending service.

2. The method for scheduling transmission resources in a wireless ad hoc network according to claim 1, characterized in that, When the target service to be processed is an interactive service, the busy / idle status is obtained through the following steps: Obtain the message response time of the target pending service; If the message response time is greater than the busy response time, the busy / idle state represents the busy state; the busy response time is equal to the sum of the system's average response time for message interaction during data transmission and twice the one-way radio transmission delay.

3. The method for scheduling transmission resources in a wireless ad hoc network according to claim 1, characterized in that, The busy / idle status is also obtained through the following steps: If the target pending service sends several preset messages without receiving a response packet, the busy / idle state indicates a busy state.

4. The method for scheduling transmission resources in a wireless ad hoc network according to claim 1, characterized in that, The method of using a continuous retransmission mechanism to transmit messages for the target pending service whose threshold value is the maximum value of the preset threshold range includes: The sending end of the target service to be processed is controlled to send the target message to the receiving end three times consecutively; The receiving end is controlled to deduplicate the three received target messages and store them in the receiving detection queue.

5. The method for scheduling transmission resources in a wireless ad hoc network according to claim 4, characterized in that, The method further includes: In response to a task subnet disbanding request, the task subnet is disbanded and the service priority of each target pending service within the task subnet is restored. For each of the target pending services, message transmission is performed using an end-to-end retransmission method with periodic acknowledgments, arranged in descending order of service priority.

Images