Transmission resource scheduling method of wireless ad hoc network and wireless ad hoc network

Abstract

The invention discloses a transmission resource scheduling method for a wireless ad hoc network and the wireless ad hoc network, and the method comprises the steps: carrying out the message transmission of each original to-be-processed service in a periodic response end-to-end retransmission mode according to the sequence of service priorities from high to low in a public network access stage, and enabling each original to-be-processed service to have a service priority, each level of service priority corresponds to a threshold value; in response to the task subnet establishment request, establishing a task subnet and adjusting the service priority of each target service to be processed in the task subnet; acquiring a system busy degree statistical value; if the threshold value corresponding to the service priority of the target to-be-processed service is greater than the system busy degree statistical value, accessing the target to-be-processed service to a target channel and sending the target to-be-processed service; and if the threshold value corresponding to the service priority of the target to-be-processed service is smaller than or equal to the system busy degree statistical value, executing a random backoff operation on the target to-be-processed service. According to the invention, the transmission success rate of high-priority services can be guaranteed, and the time delay is low.

Description

Technical Field

[0001] The present invention relates to the technical field related to wireless ad hoc networks, and in particular to a transmission resource scheduling method for wireless ad hoc networks and the wireless ad hoc network. Background Art

[0002] A wireless ad hoc network is a temporary network composed of multiple mobile nodes. Node members share network node resources and perform multi-hop data transmission through the same network operating parameters such as frequency, waveform, and encryption. Since each node is non-fixed and constantly moving, there must be factors such as multipath effects and obstructions that affect the communication quality. Therefore, it is necessary to select the corresponding reliable transmission mechanism for messages with reliable transmission requirements according to real-time requirements.

[0003] Existing solution: For messages with high real-time requirements, a continuous multiple retransmission mechanism is adopted; for messages with low real-time requirements but high accuracy requirements, an end-to-end retransmission mechanism that requires a response is adopted: when the sender sends data within the window, it will periodically receive an acknowledgement character (Acknowledge character, ACK) packet from the receiver. When the set time interval has passed and the acknowledgement packet is still not received (Negative Acknowledgment (NACK) packet or the acknowledgement packet is lost), the ACK timeout retransmission is triggered, and a piece of data can be retransmitted up to 3 times after the timeout; when the receiver receives a data packet within the receiving window, it will detect whether there is a packet loss event, mark ACK for correct reception and NACK for packet loss, and periodically transmit packets with the packet loss sequence number NACK and ACK flag to the sender. In order to reduce resource waste, the sender will only retransmit the lost data packet based on the NACK packet.

[0004] Disadvantages of existing solutions: When the network is running, since messages are sent to the wireless channel at any time, in addition to random packet loss in the channel, when a certain antenna is processing a sending task and a received message arrives, the data packet in the time slot may collide and be lost. In this environment, two problems may occur: 1. In some networking stages, high-priority messages need to be allocated more resources to ensure transmission quality.

[0005] 2. The higher the data traffic, the more bandwidth resources will be occupied by unnecessary retransmissions for reliable transmission. Periodic ACK messages increase the probability of packet collisions and are more likely to cause packet loss. Summary of the invention The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention proposes a transmission resource scheduling method for a wireless ad hoc network, which can ensure the transmission success rate of high priority services with low delay.

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

[0007] According to a first aspect of the present invention, a transmission resource scheduling method for a wireless ad hoc network includes: In the public network access stage, each original pending service is transmitted in a periodic response end-to-end retransmission mode in order of service priority from high to low, each of the original pending services has a service priority corresponding to it, and each level of the service priority has a threshold value corresponding to it; In response to a task subnet establishment request, establish a task subnet and adjust the service priority of each target to-be-processed service in the task subnet, wherein the target to-be-processed service is one of the original to-be-processed services; Get system busyness statistics; If the threshold corresponding to the service priority of the target service to be processed is greater than the system busyness statistical value, 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 busyness statistical value, a random backoff operation is performed on the target service to be processed.

[0008] The transmission resource scheduling method for a wireless ad hoc network according to an embodiment of the present invention has at least the following beneficial effects: In the public network access phase, there are only network access and maintenance messages, and the amount of system information is relatively small. Each original pending service is directly transmitted in the order of service priority from high to low using a periodic response end-to-end retransmission method, which not only ensures the transmission success rate and accuracy of high-priority services, but also has low latency. When a task subnet needs to be established, the amount of system information increases. At this time, the system busyness statistics are obtained to determine the system busyness. If the threshold corresponding to the service priority of the target pending service is greater than the system busyness statistics, the target pending service is connected to the target channel and sent; if the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, a random backoff operation is performed on the target pending service, so that the low-priority service backs off the channel, maintaining the channel load not exceeding the channel carrying capacity while ensuring the transmission success rate and low transmission latency of the high-priority service.

[0009] According to some embodiments of the present invention, the system busyness statistics are obtained by the following steps: Obtaining the actual traffic volume of the wireless ad hoc network within a preset time, the system average response time of interactive messages during data transmission, the sum of the number of continuous packet losses of each node in the wireless ad hoc network, and the total number of packet losses; The system busyness statistic is determined according to the actual business volume, the preset physical channel throughput, the system average response time, the preset maximum delay of the system in processing the current data, the sum of the continuous packet losses and the total number of packet losses.

[0010] According to some embodiments of the present invention, the constraint formula of the system busyness statistical value is: * ; in, H is the system busyness statistics, is the actual business volume, is the preset physical channel throughput, is the average response time of the system, is the maximum delay, is the sum of the number of consecutive packet losses, is the total number of packet losses.

[0011] According to some embodiments of the present invention, the threshold value is within a preset threshold range; after the target to-be-processed service is connected to a target channel and sent, the method further includes: Obtaining the busy / idle status of the target channel; If the busy / idle state indicates that the target channel is in a busy state, the threshold corresponding to at least one of the target to-be-processed services whose service priority is greater than a preset level is adjusted to a maximum value of the preset threshold range.

[0012] According to some embodiments of the present invention, when the target service to be processed is an interactive service, the busy / idle status is obtained by the following steps: Obtaining the message response time of the target pending business; If the message response time is greater than the busy response time, the busy-idle state represents a busy state; the busy response time is equal to the sum of the system average response time of the interactive message during the data transmission process and twice the radio one-way transmission delay.

[0013] According to some embodiments of the present invention, the busy / idle status is further obtained by the following steps: If the target pending service sends a preset number of messages continuously but does not receive a response packet, the busy-idle state represents a busy state.

[0014] According to some embodiments of the present invention, the method further comprises: A continuous multiple retransmission mechanism is used to transmit messages for the target to-be-processed service whose threshold value is the maximum value of the preset threshold range.

[0015] According to some embodiments of the present invention, the adopting a continuous multiple retransmission mechanism to transmit a message for the target to-be-processed service whose threshold value is the maximum value of the preset threshold range includes: Control the sending end of the target service to be processed to send the target message to the receiving end three times in succession; The receiving end is controlled to remove duplicates of the target message received three times and store them in a receiving detection queue.

[0016] According to some embodiments of the present invention, the method further comprises: In response to a task subnet disbanding request, disbanding the task subnet and controlling the recovery of the service priority of each target to-be-processed service in the task subnet; For each of the target services to be processed, message transmission is performed in a descending order of the service priority using an end-to-end retransmission method with periodic response.

[0017] According to the wireless ad hoc network of the second aspect of the present invention, the 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 of the present invention. Since the wireless ad hoc network adopts all the technical solutions of the transmission resource scheduling method of the wireless ad hoc network of the above embodiment, it at least has all the beneficial effects brought by the technical solutions of the above embodiment.

[0018] According to the third aspect of the present invention, the control device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, and the processor implements the transmission resource scheduling method for the wireless ad hoc network as described in the first aspect of the present invention when executing the computer program. Since the control device adopts all the technical solutions of the transmission resource scheduling method for the wireless ad hoc network of the above embodiment, it at least has all the beneficial effects brought by the technical solutions of the above embodiment.

[0019] The computer-readable storage medium according to the fourth aspect of the present invention stores computer-executable instructions, and the computer-executable instructions are used to execute the transmission resource scheduling method for the wireless ad hoc network as described in the first aspect of the present invention. Since the computer-readable storage medium adopts all the technical solutions of the transmission resource scheduling method for the wireless ad hoc network of the above embodiment, it at least has all the beneficial effects brought by the technical solutions of the above embodiment.

[0020] Other features and advantages of the present invention will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The above and / or additional aspects and advantages of the present invention will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which: Figure 1 It is a flow chart of a transmission resource scheduling method for a wireless ad hoc network according to an embodiment of the present invention. DETAILED DESCRIPTION

[0022] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.

[0023] In the description of the present invention, if there is a description of first, second, etc., it is only for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.

[0024] In the description of the present invention, it should be understood that descriptions involving orientation, such as orientation or positional relationship indicated as up, down, etc., are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present invention.

[0025] In the description of the present invention, it should be noted that, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in the present invention in combination with the specific content of the technical solution.

[0026] The following will be combined Figure 1 A transmission resource scheduling method for a wireless ad hoc network according to an embodiment of the present invention is described clearly and completely. Obviously, the embodiment described below is only a part of the embodiments of the present invention, but not all of the embodiments.

[0027] refer to Figure 1 , Figure 1 It is a flow chart of a transmission resource scheduling method for a wireless ad hoc network according to an embodiment of the present invention.

[0028] According to a first aspect of the present invention, a transmission resource scheduling method for a wireless ad hoc network includes: In the public network access stage, each original pending service is transmitted in a periodic response end-to-end retransmission mode in the order of service priority from high to low. Each original pending service has a service priority, and each level of service priority has a threshold value. In response to the task subnet establishment request, establish the task subnet and adjust the service priority of each target pending service in the task subnet, where the target pending service is one of the original pending services; Get system busyness statistics; If the threshold corresponding to the service priority of the target pending service is greater than the system busyness statistical value, the target pending service is connected to the target channel and sent; If the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistical value, a random backoff operation is performed on the target pending service.

[0029] It is understandable that in the public network access stage, the service priority of each original pending service is initialized according to the service type based on the urgency of the data and is divided into N levels. The larger the value, the higher the service priority. The higher the service priority, the higher the corresponding threshold.

[0030] The corresponding table of service type, service priority and threshold value of the service to be processed is shown in Table 1: Table 1

[0031] When the original pending business arrives at the upper layer, it is first added to different priority queues according to its business type. The same priority queue includes the original pending business of the same business priority. Start from the highest priority queue to check whether it is empty. If not empty, the original pending business is sent.

[0032] During the public network access stage, there are only network access and maintenance messages, and the amount of system information is relatively small. The message transmission is carried out directly for each original pending service in the order of service priority from high to low using an end-to-end retransmission method with periodic responses. This not only ensures the transmission success rate and accuracy of high-priority services, but also has low latency.

[0033] The implementation process of the end-to-end retransmission method of periodic response is as follows: 1. The sender maintains a sending window for each service priority message sending queue, which stores W message receiving states, with the initial record sequence number being [0~W]; 2. Once a message is sent, the message status is marked as "pending confirmation" and the number of times it has been sent is recorded; 3. After a message is sent, if no ACK response message is received for more than 100ms (about one-third of the time to send a window of data), the message is resent, up to 3 times (the number corresponds to the one-third above. After waiting for 3 times, the data in a window has basically been transmitted. Waiting further will cause data compression); 4. For messages that have received ACK messages or have been retransmitted three times, move the upper and lower limits of the sending window according to the maximum sequence number of the message. For example, if an ACK message with the maximum sequence number n is received, the sending window is changed to [0+n,W+n], and so on. 5. After receiving the message, the receiving end replies with an ACK response message every 100ms, with the content of the received message sequence number and receiving status; if it is not received, it replies with a NACK response message, with the content of the lost packet sequence number and receiving status.

[0034] During operation, some nodes need to complete specific tasks and establish a task subnet through specific message interaction. At this time, it is necessary to maintain the operation of the public network and the task subnet, and adjust the members in the task subnet to divide the priority of each business (for example, forming a formation and disbanding a formation are business messages of the same business type, but the processing priorities are different at different stages, so the business priority needs to be adjusted according to the task situation).

[0035] When it is necessary to establish a task subnet, the amount of system information increases. At this time, the system busyness statistics are obtained to determine the system busyness. If the threshold corresponding to the service priority of the target pending service is greater than the system busyness statistics, the target pending service is connected to the target channel and sent; if the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, a random backoff operation is performed on the target pending service, so that low-priority services back off and give up the channel, maintaining the channel load not exceeding the channel carrying capacity while ensuring the transmission success rate and low transmission delay of high-priority services.

[0036] The backoff window satisfies the relationship: ;Formula (1) in, C is the channel load, which can be obtained based on the actual traffic volume of the wireless ad hoc network within a preset time. CW is the backoff window size, C is the preset initial window size, e is a constant, n is the business priority of the current target business to be processed, r The ratio of the priority data to the total data sent by the sender.

[0037] It should be noted that the larger the channel load, the larger the backoff window, and the backoff window of the sending window of each priority queue is not the same size.

[0038] The backoff time is: T'=rand ( 0,1 ) CW max ( t,solt ); formula (2) in, T’ For the retreat time, C is the channel load, CW is the backoff window size, t is the radio one-way transmission delay, Solt is the minimum processing time slot.

[0039] When the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, the backoff delay value range is T The time is a random backoff based on the traffic volume.

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

[0041] According to the transmission resource scheduling method of the wireless ad hoc network of the embodiment of the present invention, in the public network access stage, there are only network access and maintenance messages, and the amount of system information is small. Each original pending service is directly transmitted in the order of service priority from high to low using a periodic response end-to-end retransmission method, which can not only ensure the transmission success rate and accuracy of high-priority services, but also have low latency. When it is necessary to establish a task subnet, the amount of system information becomes larger. At this time, the system busyness statistics are obtained to determine the system busyness. If the threshold corresponding to the service priority of the target pending service is greater than the system busyness statistics, the target pending service is connected to the target channel and sent; if the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, a random backoff operation is performed on the target pending service, so that the low-priority service backs off and gives up the channel, maintaining the channel load not exceeding the channel carrying capacity while ensuring the transmission success rate and low transmission delay of the high-priority service.

[0042] In some embodiments of the present invention, the system busyness statistics are obtained by the following steps: Obtain the actual traffic volume of the wireless ad hoc network within a preset time, the system average response time of interactive messages during data 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; The system busyness statistics are determined based on the actual business volume, the preset physical channel throughput, the system average response time, the preset maximum delay of the system processing the current data, the sum of the continuous packet losses and the total number of packet losses.

[0043] In some embodiments of the present invention, the constraint formula of the system busyness statistics is: * ;Formula (3) in, H It is the system busyness statistics. is the actual business volume, is the preset physical channel throughput, is the average system response time, is the maximum delay, is the sum of the number of consecutive packet losses, is the total number of lost packets.

[0044] It is understandable that the system busyness statistics are used to determine the threshold for sending messages at this time. The actual business volume is the total amount of data sent and received by the system within a preset time period, which is obtained by statistics from each sending end. The preset physical channel throughput is the maximum value of the link design sending and receiving number. The actual business 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 system processing maximum delay of the data are used to estimate the software operation logic computing load. The embodiment of the present invention is not a single transmission data, and the business data will undergo certain logical processing and message content calculation. When the amount of calculation is large, it is necessary to reduce a certain amount of messages. Packet loss in the wireless channel is divided into random packet loss and continuous packet loss. The total packet loss is the sum of random packet loss and continuous packet loss. Statistics on continuous packet loss can more accurately determine the actual transmission pressure.

[0045] The system busyness statistics of the embodiment of the present invention comprehensively consider the channel load, the system processing status of the service and the actual continuous packet loss results when the load is high, and can more comprehensively and accurately identify the system busyness, thereby ensuring stable and reliable transmission of the system.

[0046] In some embodiments of the present invention, the threshold value is within a preset threshold range; after the target service to be processed is connected to the target channel and sent, the method further includes: Get the busy / idle status of the target channel; If the busy / idle state represents that the target channel is in a busy state, the threshold corresponding to at least one target to-be-processed service whose service priority is greater than a preset level is adjusted to a maximum value of a preset threshold range.

[0047] In some embodiments, the preset threshold range is 0% to 100%. If the busy-idle status characterizes that the target channel is in a busy state, it means that the system is highly busy, and the threshold of the high-priority target pending service in the target channel may be lower than the system busyness statistical value and cannot be transmitted in time. Therefore, the threshold corresponding to at least one target pending service with a service priority greater than the preset level is adjusted to 100%, which can ensure that the high-priority target pending service in the target channel will not be backed off.

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

[0049] In some embodiments of the present invention, when the target service to be processed is an interactive service, the busy / idle status is obtained by the following steps: Get the message response time of the target pending business; If the message response time is greater than the busy response time, the busy-idle state represents a busy state; the busy response time is equal to the sum of the system average response time of the interactive message during the data transmission process and twice the radio one-way transmission delay.

[0050] In some embodiments, the average system response time is denoted by T , the radio one-way transmission delay is recorded as t , if the message response time is greater than T +2 t (ms), the busy-idle state represents the busy state. It should be noted that the busy response time can also be adjusted according to actual conditions and cannot be regarded as a limitation of the present invention.

[0051] In some embodiments of the present invention, the busy / idle state is also obtained through the following steps: if the target to-be-processed service continuously sends a preset number of messages and does not receive a response packet, the busy / idle state represents a busy state.

[0052] In some embodiments, the preset number of messages is 10, and the response packet is an ACK response packet. It should be noted that the preset number of messages may also be other values, which cannot be regarded as a limitation of the present invention.

[0053] In some embodiments of the present invention, the method further includes: adopting a continuous multiple retransmission mechanism to transmit a message for a target to-be-processed service whose threshold value is a maximum value of a preset threshold range.

[0054] In some embodiments of the present invention, a target to-be-processed service whose threshold value is the maximum value of a preset threshold range is transmitted using a continuous multiple retransmission mechanism, including: Control the sending end of the target service to be processed to send the target message to the receiving end three times in succession; The control receiving end removes duplicates of the target message received three times and stores them in the receiving detection queue.

[0055] It can be understood that when the receiving end receives the target message of the high-priority target service to be processed, it does not need to determine 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 reception quality and reduce the delay of the target message. The absence of the need for ACK response can reduce wireless signal packet collision and loss, as well as the bandwidth occupied by the receiving end retransmission, and also reduces the channel load, thereby ensuring the low latency requirements of high-priority data.

[0056] It should be noted that the retransmission interval for sending the target message three times in a row is 2 t , t It is the radio one-way transmission delay (obtained through the position calculation module). Other lower priority messages are backed off and retransmitted reliably.

[0057] In some embodiments of the present invention, the method further comprises: In response to a task subnet disbanding request, disband the task subnet and control the service priority of each target pending service in the recovery task subnet; For each target pending service, messages are transmitted in descending order of service priority using an end-to-end retransmission method with periodic responses.

[0058] After completing the task, each node exits the task subnet, and the amount of system information decreases again. At this time, the end-to-end retransmission mode with periodic response is restored, which can not only ensure the transmission success rate and accuracy of high-priority services, as well as low latency, but also reduce the amount of system computing.

[0059] In order to better describe the advantages of the transmission resource scheduling method for a wireless ad hoc network according to an embodiment of the present invention, a specific embodiment is used for detailed description.

[0060] Take a 10-node network as an example: (1) During the public network access phase, the service priority of each original pending service is initialized according to the urgency of the data and the service type (the data sent by each node is divided into service priorities according to their functions), and is divided into N levels. The larger the value, the higher the service priority. The higher the service priority, the higher the corresponding threshold.

[0061] Nodes 1 to 10 use the initial service priority to send messages. All nodes enter the public network normally. The amount of network access messages and network maintenance information is sparse, and the channel is relatively idle. Messages are transmitted directly in the order of service priority from high to low using the end-to-end retransmission method with periodic response.

[0062] (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 (based on experience, the channel is prone to congestion after entering the task subnet). Members in the task subnet adjust the priority of each business (based on experience, the importance of the business at the moment is judged and sorted), and nodes 7 to 10 maintain their original state.

[0063] (3) Nodes 1 to 6 calculate the system busyness statistics.

[0064] If the threshold corresponding to the service priority of the target pending service is greater than the system busyness statistics, the target pending service is connected to the target channel and sent; if the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, a random backoff operation is performed on the target pending service.

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

[0066] In the messages of nodes 1 to 6, the target pending services with a priority greater than N-3 are changed to a continuous multiple retransmission mechanism for reliable transmission. Other messages use active backoff reliable transmission by comparing the system busyness statistics and the threshold. That is, when data transmission conflicts, they are sent after a random backoff time calculated according to the algorithm.

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

[0068] It should be noted that the specific service priority and the corresponding threshold value can be determined according to actual conditions, and the values ​​in Table 1 and Table 2 cannot be regarded as limitations on the invention.

[0069] The existing retransmission mechanism does not adjust the transmission mode according to the actual needs of the message, generates a lot of useless retransmissions, cannot cope with the actual transmission conditions, and has low transmission efficiency. The embodiment of the present invention adopts a retransmission mechanism that dynamically adjusts the retransmission mechanism according to the service priority, network status and system busyness, combines ACK retransmission (i.e., end-to-end retransmission mode of periodic response), continuous multiple retransmissions and active backoff, reasonably uses bandwidth, improves transmission efficiency, maintains the channel load not exceeding the channel carrying capacity, and ensures the transmission success rate and low transmission delay of high-priority services.

[0070] According to the wireless ad hoc network of the second aspect of the present invention, the wireless ad hoc network is used to implement the transmission resource scheduling method of the wireless ad hoc network of the first aspect of the present invention.

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

[0072] According to the wireless ad hoc network of the embodiment of the present invention, in the public network access stage, there are only network access and maintenance messages, and the amount of system information is relatively small. Each original pending service is directly transmitted in the order of service priority from high to low using a periodic response end-to-end retransmission method, which can not only ensure the transmission success rate and accuracy of high-priority services, but also have low latency. When a task subnet needs to be established, the amount of system information becomes larger. At this time, the system busyness statistics are obtained to determine the system busyness. If the threshold corresponding to the service priority of the target pending service is greater than the system busyness statistics, the target pending service is connected to the target channel and sent; if the threshold corresponding to the service priority of the target pending service is less than or equal to the system busyness statistics, a random backoff operation is performed on the target pending service, so that the low-priority service backs off and gives up the channel, maintaining the channel load not exceeding the channel carrying capacity while ensuring the transmission success rate and low transmission latency of the high-priority service.

[0073] In addition, an embodiment of the present invention further 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 may be connected via a bus or other means.

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

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

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

[0077] In addition, an embodiment of the present invention also provides a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are executed by a processor or controller, for example, by the processor of the above-mentioned embodiment, so that the above-mentioned processor can execute the transmission resource scheduling method of the wireless ad hoc network in the above-mentioned embodiment.

[0078] It will be appreciated by those skilled in the art that all or some of the steps and systems in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or transient medium). As known to those skilled in the art, the term computer storage medium 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 include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0079] The embodiments of the present invention are described in detail above with reference to the accompanying drawings, but the present invention is not limited to the above embodiments, and various changes can be made within the knowledge scope of ordinary technicians in the relevant technical field without departing from the purpose of the present invention.

Claims

1. A transmission resource scheduling method for a wireless ad hoc network, characterized in that: The method comprises: In the public network access stage, each original pending service is transmitted in a periodic response end-to-end retransmission mode in order of service priority from high to low, each of the original pending services has a service priority corresponding to it, and each level of the service priority has a threshold value corresponding to it; In response to a task subnet establishment request, establish a task subnet and adjust the service priority of each target to-be-processed service in the task subnet, wherein the target to-be-processed service is one of the original to-be-processed services; Get system busyness statistics; If the threshold corresponding to the service priority of the target service to be processed is greater than the system busyness statistical value, 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 busyness statistical value, a random backoff operation is performed on the target service to be processed.

2. The transmission resource scheduling method for a wireless ad hoc network according to claim 1, characterized in that: The system busyness statistics are obtained by following the steps below: Obtaining the actual traffic volume of the wireless ad hoc network within a preset time, the system average response time of interactive messages during data transmission, the sum of the number of continuous packet losses of each node in the wireless ad hoc network, and the total number of packet losses; The system busyness statistic is determined according to the actual business volume, the preset physical channel throughput, the system average response time, the preset maximum delay of the system in processing the current data, the sum of the continuous packet losses and the total number of packet losses.

3. The transmission resource scheduling method for a wireless ad hoc network according to claim 2, characterized in that: The constraint formula of the system busyness statistics is: * ； in, H is the system busyness statistics, is the actual business volume, is the preset physical channel throughput, is the average response time of the system, is the maximum delay, is the sum of the number of consecutive packet losses, is the total number of packet losses.

4. The transmission resource scheduling method for a wireless ad hoc network according to claim 1, characterized in that: The threshold value is within a preset threshold range; After the target to-be-processed service is connected to the target channel and sent, the method further includes: Obtaining the busy / idle status of the target channel; If the busy / idle state indicates that the target channel is in a busy state, the threshold corresponding to at least one of the target to-be-processed services whose service priority is greater than a preset level is adjusted to a maximum value of the preset threshold range.

5. The transmission resource scheduling method for a wireless ad hoc network according to claim 4, characterized in that: When the target service to be processed is an interactive service, the busy / idle status is obtained by the following steps: Obtaining the message response time of the target pending business; If the message response time is greater than the busy response time, the busy-idle state represents a busy state; the busy response time is equal to the sum of the system average response time of interactive messages during data transmission and twice the radio one-way transmission delay.

6. The transmission resource scheduling method for a wireless ad hoc network according to claim 4, characterized in that: The busy / idle status is also obtained by the following steps: If the target pending service sends a preset number of messages continuously but does not receive a response packet, the busy-idle state represents a busy state.

7. The transmission resource scheduling method for a wireless ad hoc network according to claim 4, characterized in that: The method further comprises: A continuous multiple retransmission mechanism is used to transmit messages for the target to-be-processed service whose threshold value is the maximum value of the preset threshold range.

8. The transmission resource scheduling method for a wireless ad hoc network according to claim 7, characterized in that: The adopting a continuous multiple retransmission mechanism to transmit a message for the target to-be-processed service whose threshold value is the maximum value of the preset threshold range includes: Control the sending end of the target service to be processed to send the target message to the receiving end three times in succession; The receiving end is controlled to remove duplicates of the target message received three times and store them in a receiving detection queue.

9. The transmission resource scheduling method for a wireless ad hoc network according to claim 8, characterized in that: The method further comprises: In response to a task subnet disbanding request, disbanding the task subnet and controlling the recovery of the service priority of each target to-be-processed service in the task subnet; For each of the target services to be processed, message transmission is performed in a descending order of the service priority using an end-to-end retransmission method with periodic response.

10. A wireless ad hoc network, characterized in that: The wireless ad hoc network is used to implement the transmission resource scheduling method of the wireless ad hoc network as described in any one of claims 1 to 9.

Images