[go: up one dir, main page]

CN117528815B - Multi-priority service-based wireless access protocol service scheduling method and device - Google Patents

Multi-priority service-based wireless access protocol service scheduling method and device Download PDF

Info

Publication number
CN117528815B
CN117528815B CN202311529583.2A CN202311529583A CN117528815B CN 117528815 B CN117528815 B CN 117528815B CN 202311529583 A CN202311529583 A CN 202311529583A CN 117528815 B CN117528815 B CN 117528815B
Authority
CN
China
Prior art keywords
service
priority
processed
waiting time
threshold value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202311529583.2A
Other languages
Chinese (zh)
Other versions
CN117528815A (en
Inventor
房亮
陆连伟
杨洋
赵玲
刘洋
徐义
王婷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Tasson Science and Technology Co Ltd
Original Assignee
Beijing Tasson Science and Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Tasson Science and Technology Co Ltd filed Critical Beijing Tasson Science and Technology Co Ltd
Priority to CN202311529583.2A priority Critical patent/CN117528815B/en
Publication of CN117528815A publication Critical patent/CN117528815A/en
Application granted granted Critical
Publication of CN117528815B publication Critical patent/CN117528815B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to the field of wireless self-organizing networks, and provides a wireless access protocol service scheduling method and device based on multi-priority service, wherein the method comprises the following steps: receiving a service to be processed of a user terminal and determining a service priority of the service to be processed; acquiring actual traffic of each node in a wireless self-organizing network in a target channel load statistics period; scheduling the service to be processed according to a threshold value, an actual service volume and a maximum waiting time length corresponding to the service priority; and dynamically adjusting a threshold value corresponding to the service priority in the dispatching process. According to the method, the congestion degree of the channel is quantified by the actual traffic of each node in the network in the target channel load statistics period, and the maximum waiting time is introduced in the service scheduling process, so that the priority of the low-priority service with overlong waiting time in the network operation process is dynamically adjusted, the service quality of the low-priority service under the condition of higher traffic in the network is improved, and the system throughput is improved.

Description

Multi-priority service-based wireless access protocol service scheduling method and device
Technical Field
The present invention relates to the field of wireless ad hoc networks, and in particular, to a method and apparatus for scheduling wireless access protocol service based on multi-priority service.
Background
In recent years, with the vigorous development of aerospace technology, wireless ad hoc networks have also developed rapidly.
The MAC protocol in the wireless self-organizing network is mainly responsible for dividing wireless channel resources and guaranteeing efficient and fair access channels of nodes. The MAC protocols applied to the wireless ad hoc network can be mainly classified into three types, i.e., a fixed allocation MAC protocol, a reservation allocation MAC protocol, and a random contention MAC protocol.
The fixed allocation MAC protocol mainly includes a TDMA protocol and a dynamic TDMA protocol. For such protocols, users may need to wait for multiple time slots before assigning to the time slots, which makes the TDMA-like protocol time delay larger; in addition, TDMA protocols often require precise synchronization and have poor flexibility when new nodes join or original nodes exit. Thus, TDMA-like protocols are difficult to adapt to the requirements of future wireless ad hoc network MAC protocols.
The reserved MAC protocol divides channel resources in a dynamic allocation mode according to the traffic of nodes in the network, and the nodes reserve channels by exchanging control information, but the reserved MAC protocol brings additional expense, has larger time delay and poorer survivability.
Therefore, in wireless ad hoc networks, particularly in military-related application scenarios, random contention-like MAC protocols are more widely used. However, the existing random contention-type MAC protocol lacks QoS (Quality of Service ) guarantees.
For example, common random contention-like MAC protocols include a conventional priority-based multiple access protocol (STATISTICAL PRIORITY-based Multiple Access Protocol, SPMA) in which a queue scheduling algorithm is scheduled based on FIFO (First Input First Output), the core idea being that traffic of high priority has a higher probability of accessing a channel so that packets of high priority can be transmitted at a first time.
However, it is obvious that in the SPMA protocol, the service opportunity is inclined to the data packet in the high priority queue as much as possible, when the traffic in the network is higher, the collision in the channel is aggravated, the transmission success rate of each priority is reduced, in order to ensure the service quality of the high priority service, the data packet in the low priority queue is often queued until the data packet is overtime, and finally discarded, so as to cause the "starvation" phenomenon of the low priority service data packet.
That is, in the SPMA protocol, the success rate of low priority traffic transmission drops too fast when the traffic in the network is high, and the quality of service is too poor, which has serious drawbacks in the actual combat scenario.
For example, in TTNT (TACTICAL TARGETING Network Technolog, tactical targeting network) tactical data chain, battlefield environmental information belongs to lower priority information, which can have serious consequences if transmission conditions deteriorate because of a long backoff state.
Therefore, how to solve the problem that the random contention-type MAC protocol in the existing wireless ad hoc network lacks of QoS guarantee, and the low priority service quality is poor when the network traffic is high is an important issue to be solved in the technical field of wireless ad hoc networks.
Disclosure of Invention
The invention provides a wireless access protocol service scheduling method and device based on multi-priority service, which are used for overcoming the defect that a random competition MAC protocol in the existing wireless self-organizing network lacks QoS guarantee, and the service quality of low-priority service is poor when the network traffic is high, and improving the service quality of the low-priority service under the condition that the traffic is high in the network, and improving the throughput of a system.
In one aspect, the present invention provides a method for scheduling a radio access protocol service based on a multi-priority service, including: receiving a service to be processed of a user terminal, and determining a service priority of the service to be processed, wherein the service priority corresponds to a threshold value; taking actual traffic of each node in the wireless self-organizing network in a target channel load statistics period; scheduling the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length; and dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed.
Further, the scheduling the service to be processed according to the threshold value corresponding to the service priority, the actual service volume and the preset maximum waiting time length includes: when the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is larger than the actual service volume, the service to be processed is accessed to a channel and sent; and executing random back-off operation on the service to be processed under the condition that the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is smaller than or equal to the actual service quantity.
Further, the performing random back-off operation on the service to be processed includes: under the condition that the waiting time of the service to be processed is longer than the first waiting time, the service priority of the service to be processed is improved, and the back-off time is recalculated and inserted into a waiting queue; if the waiting time of the service to be processed is longer than the second waiting time, the service priority of the service to be processed is increased again, and the back-off time is recalculated and inserted into a waiting queue; destroying the service to be processed under the condition that the waiting time of the service to be processed is longer than the maximum waiting time; the first waiting time period is smaller than the second waiting time period, and the second waiting time period is smaller than the maximum waiting time period.
Further, the radio access protocol service scheduling method based on the multi-priority service further comprises the following steps: determining that the waiting time of the service to be processed is not longer than the first waiting time; or determining that the waiting time of the service to be processed is longer than the first waiting time but not longer than the waiting time; or determining that the waiting time of the service to be processed is longer than the second waiting time but not longer than the maximum waiting time; and processing the service to be processed according to the threshold value corresponding to the service priority to which the service to be processed belongs and the actual service volume.
Further, the processing the service to be processed includes: when the threshold value corresponding to the lowest service priority is larger than the actual service volume, partial access priority service does not exist, and each priority service is sent along with the arrival; under the condition that the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is smaller than the actual service volume, no service is allowed to be transmitted in the current wireless self-organizing network; when the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is larger than the actual service volume, partial access priority service exists in the current wireless self-organizing network, all high-priority service and target partial access priority service are selected to be sent in priority, and each priority queue is updated; the high-priority service comprises a first-priority service, a second-priority service and a third-priority service, and the total traffic of the target part after the target part is accessed to the priority service access channel is not higher than the actual throughput.
Further, the actual traffic includes the total number of received data packets of each node in the wireless ad hoc network in the target channel load statistics period; the step of dynamically adjusting the threshold value corresponding to the service priority in the process of scheduling the service to be processed comprises the following steps: calculating the actual throughput of the wireless self-organizing network according to the total number of the received data packets; and dynamically adjusting a threshold value corresponding to the service priority according to the actual throughput of the wireless self-organizing network.
Further, the wireless self-organizing network comprises a random node, and the step of accessing the random node comprises the following steps: based on a network access command broadcasted by a control node in a wireless self-organizing network, receiving a network access application sent by the following node; and under the condition that the control node carries out security authentication on the random node and passes through the random node, distributing resources for the random node, and sending the information of the random node and an updated routing table to other nodes in the wireless self-organizing network, wherein the random node is successful in network access.
In a second aspect, the present invention also provides a radio access protocol service scheduling device based on multi-priority service, including: the system comprises a to-be-processed service receiving module, a service processing module and a service processing module, wherein the to-be-processed service receiving module is used for receiving to-be-processed service of a user terminal and determining service priority of the to-be-processed service, and the service priority corresponds to a threshold value; the actual traffic acquisition module is used for acquiring the actual traffic of each node in the wireless self-organizing network in the target channel load statistics period; the service scheduling module to be processed is used for scheduling the service to be processed according to the threshold value corresponding to the service priority, the actual service volume and the preset maximum waiting time length; and the threshold dynamic adjustment module is used for dynamically adjusting the threshold corresponding to the service priority in the process of scheduling the service to be processed.
In a third aspect, the present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements a multi-priority service-based radio access protocol traffic scheduling method as described in any one of the above when the program is executed.
In a fourth aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a multi-priority service based radio access protocol traffic scheduling method as described in any of the above.
The invention provides a wireless access protocol service scheduling method based on multi-priority service, which is characterized in that a service to be processed of a user terminal is received, the service priority of the service to be processed is determined, and the service priority corresponds to a threshold value; acquiring actual traffic of each node in a wireless self-organizing network in a target channel load statistics period; scheduling the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length; and dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed. The method quantifies the congestion degree of the channel by using the actual traffic of each node in the network in the target channel load statistics period, introduces the maximum waiting time in the service priority scheduling process, dynamically adjusts the priority of the low-priority service with overlong waiting time in the network operation process, overcomes the defects that the random competition MAC protocol in the existing wireless self-organizing network lacks QoS guarantee, and the low-priority service quality is poor when the network traffic is higher, improves the service quality of the low-priority service when the traffic is higher, and improves the throughput of the system.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of a physical layer transmission scheme of a wireless access protocol service scheduling method based on multi-priority service according to the present invention;
fig. 2 is a flow chart of a wireless access protocol service scheduling method based on multi-priority service provided by the invention;
fig. 3 is a schematic diagram of random backoff of a wireless access protocol service scheduling method based on multi-priority service according to the present invention;
fig. 4 is a schematic diagram of service access flow and threshold correction of a wireless access protocol service scheduling method based on multi-priority service provided by the invention;
fig. 5 is a schematic diagram of network entry and exit of a following node according to the wireless access protocol service scheduling method based on multi-priority service provided by the invention;
fig. 6 is a schematic overall flow chart of a wireless access protocol service scheduling method based on multi-priority service provided by the invention;
Fig. 7 is a schematic structural diagram of a wireless access protocol service scheduling device based on multi-priority service according to the present invention;
fig. 8 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that, although the existing random contention-based MAC protocol, such as the multiple access protocol based on the conventional priority, reduces collision and retransmission, and reduces transmission delay, load control of the protocol takes priority as a unit, and adjusts granularity to be larger, when all packets with one priority are blocked, part of channels may be idle, and messages with low priority cannot be transmitted, thereby resulting in channel resource waste.
In view of this, the present invention provides a multi-priority service-based radio access protocol service scheduling method, and before describing in detail the multi-priority service-based radio access protocol service scheduling method provided by the present invention, a description will be given here first of all of the physical layer transmission scheme design for implementing the multi-priority service-based radio access protocol service scheduling method.
Specifically, fig. 1 shows a physical layer transmission scheme design schematic diagram of a wireless access protocol service scheduling method based on multi-priority service provided by the invention.
As shown in fig. 1, the information processing flow of the physical layer is as follows:
step Al: the information sequence is encoded using a CRC (Cyclic Redundancy Check ).
The CRC is used for encoding the transmitted data, and after the receiving end receives the data, the receiving end judges whether the received data is correct or not according to the check code, and if so, the receiving end receives the data.
CRC is a common error check code, which has a relatively wide application range, low complexity and excellent error correction effect on information sequences with smaller burst error lengths.
The invention thus uses the error-checking code to encode the information sequence.
Step A2: and C, carrying out channel coding on the information sequence obtained in the step A1, adopting RS codes for coding, and carrying out code block cascade and rate matching after coding.
Step A3: and interleaving the sequence after rate matching, and carrying out bit scrambling after interleaving.
In this step, interleaving is performed on the rate-matched sequence to avoid continuous errors occurring when information is transmitted in the wireless channel, so as to disperse the information and disperse possible errors.
Bit scrambling is performed after interleaving in order to avoid the occurrence of consecutive 0 or consecutive 1 transmissions.
Step A4: and D, carrying out digital modulation on the result obtained in the step A3, and carrying out direct sequence spread spectrum on the modulated sequence.
Specifically, an MSK (Minimum SHIFT KEYING, minimum frequency shift keying) mode may be adopted for modulation, and the modulated sequence is subjected to direct sequence spread spectrum, so as to improve the anti-interference capability of the system, and the spreading code may adopt the most commonly used m sequence.
Step A5: and C, further framing, digital up-conversion and DAC conversion the sequence obtained in the step A4, and transmitting the sequence through a radio frequency antenna.
Step A6: after receiving the signal, the receiving end performs corresponding processing according to the transmitting procedures A1-A5, as shown in fig. 1, which is not further elaborated here.
Further, fig. 2 shows a flow chart of the wireless access protocol service scheduling method based on the multi-priority service according to the present invention based on the physical layer transmission scheme design.
As shown in fig. 2, the method includes:
s210, receiving the service to be processed of the user terminal, and determining the service priority of the service to be processed, wherein the service priority corresponds to a threshold value.
It can be understood that in the radio access protocol supporting multi-priority service provided in this embodiment, first, network initialization is performed to divide services in the network into a preset number of service priorities, each service priority corresponds to a priority level, and each service priority is set with a corresponding threshold value.
And receiving the service to be processed of the user terminal, and particularly receiving various service data to be sent by the user terminal.
After receiving the service to be processed of the user terminal, the service priority of the service to be processed and the threshold value corresponding to the service priority can be obtained.
The preset number and the threshold value may be set according to practical situations, and are not limited herein.
It should be noted that, the higher the service priority, the higher the corresponding threshold, and the shorter the random back-off time, so as to ensure that the service with high service priority has higher probability of accessing the channel for transmission, and further realize that different priorities have different QoS.
For example, in one particular embodiment, the traffic to be processed is divided into 8 traffic priorities, with priority levels from 0 to 7.
Where 0 represents the highest traffic priority and 7 represents the lowest traffic priority.
The number of the services to be processed may be one or more, and is not particularly limited herein.
S220, obtaining the actual traffic of each node in the wireless self-organizing network in the target channel load statistical period.
It can be understood that, on the basis of receiving the service to be processed at the user end and determining the service priority of the service to be processed in step S210, further, step S220 obtains the actual traffic of each node in the wireless ad hoc network in the target channel load statistics period, which is hereinafter referred to as channel load for short.
It should be noted that, the radio access protocol supporting multi-priority services provided in this embodiment is essentially a random contention MAC protocol, which references the operation mechanism of the CSMA/CA protocol to a certain extent.
In the CSMA/CA protocol, the channel has only two states, busy or idle. When a user has data to send, firstly, monitoring the channel state, and if the channel is idle, immediately sending the data; if the channel is busy, the access to the channel is attempted again after a random backoff period.
The random contention MAC protocol provided in this embodiment also determines whether to send a data packet or random backoff by sensing a channel state, but unlike the CSMA/CA protocol, in this protocol, each node in the wireless ad hoc network periodically counts the actual traffic of each node in a target channel load counting period in a period of time, and uses the actual traffic as a channel load.
That is, the congestion degree of the channel is quantified by the actual traffic of each node in the target channel load statistics period, so as to further judge whether to send the own traffic access channel, and each node in the wireless self-organizing network forms a distributed decision mechanism.
Wherein, the actual traffic can be the transmitted traffic or the received traffic, which is not particularly limited herein
The target channel load statistics period may be set according to actual requirements, which is not specifically limited herein.
For example, in one particular embodiment, the target channel load statistics period is the last channel load statistics period.
For another example, in another specific embodiment, the target channel load statistics period is three consecutive channel load statistics periods including the last channel load statistics period.
Similarly, the channel load statistics period may be set according to the actual requirement, and is not limited herein.
S230, scheduling the service to be processed according to the threshold value corresponding to the service priority, the actual service volume and the preset maximum waiting time.
It can be understood that, based on the actual traffic of each node in the wireless ad hoc network in the target channel load statistics period, the step S220 further schedules all the services to be processed according to the threshold corresponding to the service priority to which the services to be processed belong, the actual traffic of each node in the target channel load statistics period, and the preset maximum waiting duration.
Specifically, in this embodiment, the maximum waiting time is introduced, and in the running process of the network, the priority of the low-priority service with excessively long waiting time is dynamically improved, so as to prevent the problem that the service quality of the low-priority service is excessively poor due to deletion of the low-priority service caused by excessively long waiting time.
Scheduling the service to be processed according to a threshold value corresponding to the service priority, an actual service volume and a preset maximum waiting time length, and comparing the threshold value of the service priority corresponding to the data with the size of a channel load when a user has data (the service to be processed) to be transmitted, and transmitting the service to be processed to an access channel if the threshold value is larger than the channel load; and if the threshold value is not greater than the channel load, executing a back-off algorithm to wait.
In the process of executing the back-off algorithm to wait, the comparison result of the waiting time length of the service to be processed and the maximum waiting time length also needs to be considered so as to dynamically adjust the service priority of the service to be processed, and the specific processing process is expanded in detail in the subsequent embodiment.
The preset maximum waiting time period may be set according to actual situations, and is not specifically limited herein.
In a specific embodiment, the maximum wait time is T.
S240, dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed.
It can be understood that, in step S230, according to the threshold value corresponding to the service priority, the actual service amount, and the preset maximum waiting duration, in the process of scheduling the service to be processed, step S240 dynamically adjusts the threshold value corresponding to the service priority to which the service to be processed belongs.
Specifically, since the network in the wireless ad hoc network is often dynamically changed, for example, the nodes in the network may quickly enter and exit the network, the quality of the high-altitude wireless channel is unstable, the nodes in the network may suffer from malicious electromagnetic interference, the traffic in the network is often bursty, etc., so that the traffic that can be transmitted by the actual network also changes in different network environments, and thus, the threshold value preset by each traffic priority needs to be dynamically adjusted in the running process of the network.
And dynamically adjusting a threshold corresponding to the service priority to which the service to be processed belongs according to the actual traffic of each node in the wireless self-organizing network in the target channel load statistics period.
The process of dynamically adjusting the threshold value is detailed in the following embodiments.
In this embodiment, a service priority of a service to be processed is determined by receiving the service to be processed at a user terminal, where the service priority corresponds to a threshold; acquiring actual traffic of each node in a wireless self-organizing network in a target channel load statistics period; scheduling the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length; and dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed. The method quantifies the congestion degree of the channel by using the actual traffic of each node in the network in the target channel load statistics period, introduces the maximum waiting time in the service priority scheduling process, dynamically adjusts the priority of the low-priority service with overlong waiting time in the network operation process, overcomes the defects that the random competition MAC protocol in the existing wireless self-organizing network lacks QoS guarantee, and the low-priority service quality is poor when the network traffic is higher, improves the service quality of the low-priority service when the traffic is higher, and improves the throughput of the system.
On the basis of the above embodiment, further, according to a threshold value corresponding to the service priority, an actual service volume, and a preset maximum waiting duration, scheduling the service to be processed includes: when the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is greater than the actual service quantity, the service to be processed is accessed to a channel and sent; and executing random back-off operation on the service to be processed under the condition that the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is smaller than or equal to the actual service quantity.
It can be appreciated that the maximum waiting time is introduced in this embodiment, and in the running process of the network, the priority of the low-priority service with excessively long waiting time is dynamically improved, so as to prevent the problem that the service quality of the low-priority service is excessively poor due to deletion of the low-priority service caused by excessively long waiting time.
It should be noted that, in a specific embodiment, for the transmission queues of the first priority, the second priority and the third priority, that is, the transmission queues of the priorities 0, 1 and 2, the embodiment does not perform dynamic priority adjustment, only considers whether it is overtime, and whether the data packet can be accessed to the channel for transmission.
Specifically, if the service to be processed belongs to the first priority, the second priority or the third priority, for the transmission queues of the first priority, the second priority and the third priority, if the waiting time of the service to be processed is longer than the maximum waiting time, the data packet corresponding to the service to be processed is destroyed directly after overtime; and if the waiting time of the service to be processed is not longer than the maximum waiting time, accessing the data packet corresponding to the service to be processed into the channel for data transmission.
In another specific embodiment, if the service to be processed belongs to the transmission queues of other service priorities than the first priority, the second priority and the third priority, then the dynamic priority adjustment is performed for the transmission queues of other service priorities than the first priority, the second priority and the third priority, and two factors need to be considered in the process of performing queue scheduling.
The two factors to be considered are the comparison of the waiting time with the maximum waiting time and the comparison of the threshold with the actual traffic.
That is, if the waiting time of the service to be processed is less than the maximum waiting time and the threshold corresponding to the service priority of the service to be processed is greater than the actual service volume, directly accessing the data packet corresponding to the service to be processed into the channel for data transmission; and if the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is smaller than or equal to the actual service volume, executing random back-off operation on the service to be processed.
Regarding the process of performing the random back-off operation on the traffic to be processed, in still another specific embodiment, performing the random back-off operation on the traffic to be processed includes: under the condition that the waiting time of the service to be processed is longer than the first waiting time, the service priority of the service to be processed is improved, and the back-off time is recalculated and inserted into a waiting queue; if the waiting time of the service to be processed is longer than the second waiting time, the service priority of the service to be processed is increased again, and the back-off time is recalculated and inserted into the waiting queue; destroying the service to be processed under the condition that the waiting time of the service to be processed is longer than the maximum waiting time; the first waiting time is smaller than the second waiting time, and the second waiting time is smaller than the maximum waiting time.
It can be appreciated that fig. 3 shows a schematic random back-off of the wireless access protocol service scheduling method based on multi-priority service provided by the present invention.
As shown in fig. 3, first, the transmission queues of the traffic priorities other than the first priority, the second priority, and the third priority, that is, the transmission queues of the priority level 2 or less are initialized.
Then, the service in the network is divided into a plurality of service priorities, each node maintains a plurality of service priority sub-queues for caching the data packets of each priority, and detects whether each sub-queue is empty, if so, the detection is continued until the data packets arrive.
If the sub-queues are detected not to be empty, selecting the data packet (service to be processed) corresponding to the highest service priority of the queue head, and judging whether the data packet corresponding to the highest service priority is out of date, namely judging whether the waiting time of the data packet corresponding to the highest service priority exceeds the maximum waiting time.
If the data packet is out of date, the high data packet is selected to be removed from the sub-queues, and the step of judging whether each sub-queue is empty is returned.
If the data packet is not expired, continuously judging whether a threshold value corresponding to the highest service priority (namely, a priority threshold value in the figure) is smaller than the channel load, and if so, executing a back-off algorithm; and if the data packet is larger than the data packet, the corresponding data packet is taken out and sent.
In the back-off process, if the waiting time of the service to be processed exceeds the first waiting time T/3, the service priority of the service to be processed is improved, the back-off time is recalculated, a new priority queue is inserted, and the service is waited for processing; if the waiting time of the service to be processed does not exceed the first waiting time T/3, the service to be processed starts to be processed, and whether the service to be processed is allowed to be sent is judged.
If the waiting time of the service to be processed exceeds the second waiting time by 2T/3 (i.e. the waiting time of the service to be processed in the new priority queue reaches T/3 again), the service priority of the service to be processed is promoted again, the back-off time is recalculated, and the new priority queue is inserted for waiting processing; and if the waiting time of the service to be processed does not exceed the second waiting time by 2T/3, starting to process the service to be processed, and judging whether the service to be processed is allowed to be sent or not.
If the waiting time of the service to be processed exceeds the maximum waiting time T (i.e. the waiting time of the service to be processed in the new priority queue reaches T/3 again), destroying the service to be processed; if the waiting time of the service to be processed does not exceed the maximum waiting time T, the service to be processed starts to be processed, and whether the service to be processed is allowed to be sent is judged.
The first waiting time, the second waiting time and the maximum waiting time are sequentially from small to large, and the starting point of the time of the three is the time when the service to be processed is inserted into the transmission queue to wait for transmission.
The first waiting time period, the second waiting time period, and the maximum waiting time period can be set according to actual requirements, the time period difference between the second waiting time period and the first waiting time period, and the time period difference between the maximum waiting time period and the second waiting time period is not particularly limited herein.
In other words, in the process of performing the random backoff operation, there may be a plurality of preset waiting periods from the time when the transmission queue is inserted to wait for transmission until the waiting period reaches the maximum waiting period, which is not particularly limited herein.
In the process of backoff, whether the service is allowed to be sent or not is determined, and specifically, the service to be processed may be processed according to a threshold corresponding to the service priority to which the service to be processed belongs and the actual traffic.
That is, when the threshold corresponding to the service priority to which the service to be processed belongs is greater than the actual traffic, transmission is allowed; otherwise, the random backoff operation provided in the present embodiment is continued.
It should be further noted that, in this embodiment, the priority of the low priority service with too long waiting time is dynamically improved, but the difference between the adjusted priority level and the original priority level must not exceed two levels, which is in line with the above "do not dynamically adjust the priority of the transmission queues of the first priority, the second priority and the third priority".
In this embodiment, by discarding and destroying the data packet when the waiting duration of the to-be-processed service is longer than the maximum waiting duration, when the waiting duration of the to-be-processed service is shorter than the maximum waiting duration and the threshold is longer than the actual service volume, the to-be-processed service is accessed to the channel and transmitted, and when the waiting duration of the to-be-processed service is shorter than the maximum waiting duration and the threshold is shorter than or equal to the actual service volume, the to-be-processed service executes random backoff operation, and in the random backoff process, the priority of other services except the first priority, the second priority and the third priority is dynamically adjusted, thereby overcoming the defect that the existing wireless ad hoc network lacks of QoS guarantee in the random contention type MAC protocol, and the service quality of the low priority service is poor when the network service volume is higher, improving the service quality of the low priority service under the condition that the service volume is higher, and improving the throughput of the system.
On the basis of the above embodiment, further, processing the service to be processed includes: when the threshold value corresponding to the lowest service priority is larger than the actual service volume, partial access priority service does not exist, and each priority service is sent along with arrival; under the condition that the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is smaller than the actual service volume, no service is allowed to be transmitted in the current wireless self-organizing network; when the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is larger than the actual service volume, partial access priority service exists in the current wireless self-organizing network, all high-priority service and target partial access priority service are selected to be sent in priority, and each priority queue is updated; the high priority service comprises a first priority service, a second priority service and a third priority service, and the total traffic after the target part is accessed to the priority service access channel is not higher than the actual throughput.
It can be appreciated that in the process of processing the service to be processed, it is also necessary to determine whether a part of access priority service exists in the current network.
Specifically, the channel load counted in the last channel load counting period (i.e. the actual traffic volume of each node in the wireless ad hoc network in the target channel load counting period) is compared with the threshold value corresponding to the lowest traffic priority.
If the threshold value corresponding to the lowest service priority is larger than the actual service volume, partial access priority service does not exist, and all priority services can be sent along with each other.
If the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is also smaller than the actual service volume, at this time, no priority service is allowed to be transmitted in the current wireless self-organizing network.
If the threshold value corresponding to the lowest service priority is smaller than the actual service volume, but the threshold value corresponding to the highest service priority is larger than the actual service volume, the fact that partial access priority service exists in the current wireless self-organizing network is indicated, all high priority service is selected at the moment, the transmitted partial access priority service is permitted to be transmitted in priority, and then each priority queue is updated.
The high priority service comprises a first priority service, a second priority service and a third priority service, the target part of access priority service is a part of service of a certain priority service, and the total service volume of the part of service after the part of service is accessed to a channel is not higher than the actual throughput of the system.
Then, if judging that partial access priority service does exist, judging whether the service can be sent according to whether the service is overtime or not for the high priority service; for other priority services except the high priority service, firstly judging whether the waiting time is longer than the maximum waiting time, if so, destroying the service; if the traffic priority is smaller than the channel load, comparing the threshold value corresponding to the traffic priority with the channel load, if the threshold value is larger than the channel load, transmitting, otherwise, carrying out random back-off.
In the random back-off procedure, dynamic adjustment of priority is required for low priority traffic with longer latency, see in particular the embodiments above for performing random back-off operations.
In this embodiment, by the fact that the threshold corresponding to the lowest service priority is greater than the actual service volume, there is no part of access priority service, and each priority service is sent along with the arrival; under the condition that the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is smaller than the actual service volume, no service is allowed to be transmitted in the current wireless self-organizing network; and when the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is larger than the actual service volume, partial access priority service exists in the current wireless self-organizing network, all high-priority service and target partial access priority service are selected to be sent in priority, and each priority queue is updated. The method allows the sending part to access the priority service by refining and adjusting granularity, thereby avoiding the waste of channel resources.
Further, based on the above embodiment, the actual traffic includes a total number of received data packets of each node in the wireless ad hoc network in a target channel load statistics period; in the process of scheduling the service to be processed, dynamically adjusting a threshold value corresponding to the service priority, including: calculating the actual throughput of the wireless self-organizing network according to the total number of the received data packets; and dynamically adjusting a threshold corresponding to the service priority according to the actual throughput of the wireless self-organizing network.
It can be appreciated that, because the network in the wireless ad hoc network is often dynamically changed, for example, the nodes in the network may quickly enter and exit the network, the quality of the high-altitude wireless channel is unstable, the nodes in the network may suffer from malicious electromagnetic interference, the traffic in the network is often bursty, etc., so that the traffic that can be transmitted by the actual network also changes in different network environments, and thus, the threshold value preset by each traffic priority needs to be dynamically adjusted during the running process of the network.
Specifically, each node in the network periodically broadcasts the total number of data packets and the total number of received data packets sent by the node in the last channel load statistics period to other nodes.
Assuming that the total number of nodes in the network is N, M times of information is broadcast in each channel load statistics period, and the total number of transmitted data packets and the total number of received data packets of the nodes in the last channel load statistics period are S trans and S receive respectively, so that each node can calculate the transmission success rate of the information in the last channel load statistics period in a distributed manner.
The calculation formula of the transmission success rate is as follows:
the traffic in the network is noted as Load, and the throughput in the current network is:
Throughput＝Ssuccess×Load
According to the method, each node in the network can calculate the actual throughput in the network in a distributed manner, and each node calculates the threshold value of each priority service by taking the actual throughput of the network as a standard, so that the dynamic adjustment of the threshold value of the service priority is realized, the service quality of the low-priority service is improved, and the throughput of the system is improved.
Fig. 4 shows a service access flow and a threshold correction schematic diagram of the wireless access protocol service scheduling method based on multi-priority service provided by the invention.
As shown in fig. 4, the service with high priority may be directly accessed to the channel for transmission, and for the service with low priority, if the total traffic after access is smaller than the actual throughput of the system (i.e. the maximum throughput of the system in fig. 4), the service with the priority is accessed, and whether the service with lower priority can be accessed to the channel for transmission is continuously judged; if the total traffic of a certain traffic priority i after the traffic is accessed is higher than the actual throughput of the system, the priority traffic is not allowed to be accessed completely, otherwise, the service quality of the higher priority traffic is reduced, and the threshold of the priority traffic is set by taking the actual throughput of the system as a boundary so as to ensure that the priority traffic can not access a large number of channels and simultaneously ensure that channel resources are not wasted.
Assuming Threshold i is a Threshold value of service priority i, T is a channel load statistics period, L is a length of a data packet, throughput is when a success rate of channel test information transmission drops to 99%, P rece_ij is a number of data packets received by a node in one channel test information period, and then actual Throughput in a network can be approximately:
the threshold value corresponding to the lowest service priority is calculated as follows:
Thresholdi＝0.99×T×S/L
the threshold values for the other priorities are initially calculated as follows:
Where r j is the duty cycle of the traffic with priority j in the total traffic.
On the basis of the above, the threshold value of each priority of preliminary calculation needs to be corrected.
Specifically, for the service with the priority higher than i, the Threshold value needs to be corrected to be higher than the Threshold value of i (adding a Threshold correction factor K, K may be Threshold N-1/10), and for the service with the priority lower than i, the Threshold value needs to be corrected to be lower than the Threshold value of i (subtracting the Threshold correction factor K), and the principle of Threshold correction is that the Threshold value of the service with the high priority after correction is higher than the Threshold value of the service with the low priority.
In this embodiment, in the process of scheduling the service to be processed, the actual throughput of the wireless ad hoc network is calculated according to the total number of received data packets of each node in the target channel load statistics period, and the threshold value corresponding to the service priority is dynamically adjusted according to the actual throughput of the wireless ad hoc network. The method quantifies the congestion degree of the channel by the actual traffic of each node in the network in the target channel load statistics period, introduces the maximum waiting time in the service priority scheduling process, dynamically adjusts the priority of the low-priority service with overlong waiting time in the network operation process, overcomes the defect that the random competition MAC protocol in the existing wireless self-organizing network lacks QoS guarantee, has poor service quality of the low-priority service when the network traffic is higher, improves the service quality of the low-priority service when the traffic is higher, and improves the throughput of the system.
On the basis of the above embodiment, further, the wireless ad hoc network includes a random node, and the step of accessing the random node includes: based on a network access command broadcasted by a control node in a wireless self-organizing network, receiving a network access application sent by a meeting node; under the condition that the control node carries out security authentication on the encountered node and passes through the security authentication, resources are allocated for the encountered node, information of the encountered node and an updated routing table are sent to other nodes in the wireless self-organizing network, and the network access of the encountered node is successful.
It will be appreciated that in the practical application scenario of a wireless ad hoc network, the number of nodes in the network is not fixed.
For example, in a military operation scenario, some nodes may temporarily join an existing network, while some nodes may exit the network because they have completed tasks or been destroyed, these nodes are referred to as on-demand nodes, whose application scenario is for the nodes to traverse the own network during movement and to communicate with other nodes in the network during this process.
The data link network reserves a short period of time for network entry and exit of the nodes in the working period, and generally, the network entry mode is divided into two modes, namely active network entry and passive network entry, wherein the active network entry refers to that the nodes in the meeting place actively search the working channel and communication behavior of the network so as to send network entry requests to the nodes in the network, and the mode requires the nodes in the meeting place to have stronger perceptibility, so that the implementation provides a passive network entry mode of the nodes in the meeting place.
Specifically, fig. 5 shows a schematic diagram of network entry and exit along with a node of the wireless access protocol service scheduling method based on multi-priority service provided by the invention.
As shown in fig. 5, the control node in the data link network periodically broadcasts an access command by using a reserved time in a working period, and the access command mainly includes necessary information such as a working frequency band, a time stamp of broadcast information, a message format of the information, and the like.
After receiving the network access command, the own following node performs network synchronization by utilizing the timestamp contained in the network access command, and then sends a network access application to the control node, wherein the network access application contains the identity information of the following node.
After receiving the network access application of the following nodes, the control node is responsible for carrying out security authentication on the following nodes, the following nodes join the network after authentication, the control node distributes resources (such as time hopping frequency hopping patterns) for the following nodes, and sends information of the following nodes and updated routing tables to all other nodes in the network, and the following nodes are successful in network access.
When the following nodes need to exit the network, an active network exit mode or a passive network exit mode can be selected according to specific conditions.
Regarding the active network exit mode of the following nodes, when the following nodes have successfully completed tasks and need to exit the network, or the following nodes are about to leave the network coverage of formation flight, the following nodes can actively apply for network exit to the control nodes in the network, the control nodes update the routing tables in the network after passing the control nodes, and send updated results to other nodes in the network, and the following nodes actively exit the network successfully.
Regarding the passive network-quitting mode of the following nodes, when the following nodes destroy or do not inform the control nodes and fly out of the network coverage of the formation by themselves, the control nodes cannot receive the channel load statistical information which needs to be periodically updated by the nodes for a long time, if the control nodes send information to the following nodes twice continuously and do not receive a response, the control nodes delete the relevant information of the following nodes in the network, retrieve the communication resources allocated to the following nodes, update the routing table and send the updated result to other nodes through broadcasting, and the following nodes are successful in passive network-quitting.
In this embodiment, the network access request sent by the following node is received based on the network access command broadcast by the control node in the wireless ad hoc network, and under the condition that the control node performs security authentication on the following node and passes the security authentication, resources are allocated to the following node, information of the following node and the updated routing table are sent to other nodes in the wireless ad hoc network, and the following node is successful in network access, so that the network access method can better adapt to different network application scenarios.
In addition, fig. 6 shows an overall flow diagram of a wireless access protocol service scheduling method based on multi-priority service provided by the present invention.
As shown in fig. 6, the network is initialized first, and each node in the network maintains N service priority sub-queues.
And then, detecting whether each service priority sub-queue is empty, and if so, detecting all the time until the data packet is detected.
And under the condition that the sub-queues of the service priorities are not empty, judging whether a threshold value corresponding to the lowest service priority is smaller than a channel load.
If the threshold value is greater than or equal to the channel load, partial access priority service does not exist in the network, and each priority service is sent along with the arrival; if the threshold is smaller than the channel load, further judging whether partial access priority service exists in the network.
If not, selecting high priority service which can be completely transmitted; if yes, selecting all the high priority service and part of access priority service, and dynamically correcting the threshold according to the actual maximum throughput of the system.
And updating each service priority sub-queue, selecting the service with the highest service priority in each service priority sub-queue, and judging whether the service is overtime.
If the service with the highest service priority is overtime, the service with the highest service priority is directly deleted from the corresponding service priority sub-queue, and the service scheduling flow of the service is ended; if the service with the highest service priority is not overtime, further comparing whether the threshold of the service to be sent is larger than the channel load.
If the threshold value of the service to be transmitted is larger than the channel load, directly transmitting the service; and if the threshold value of the service to be transmitted is smaller than or equal to the channel load, executing random back-off operation, and detecting whether higher priority service arrives.
If the service with higher priority arrives, the threshold value of the service with higher priority is further compared with the size of the channel load, and the subsequent steps are continuously executed.
If there is no higher priority traffic to reach, it is further determined whether the back-off time is complete.
If not, continuing to execute the random back-off operation.
If yes, judging whether the service to be sent is overtime, and under the condition that the service is not overtime, returning to execute the step of selecting the service with the highest service priority and judging whether the service is overtime, and continuing to execute random back-off operation; and deleting the service from the corresponding queue under the condition of overtime, and ending the service scheduling flow of the service.
Fig. 7 is a schematic diagram showing a structure of a radio access protocol service scheduling apparatus based on a multi-priority service according to the present invention.
As shown in fig. 7, the apparatus includes: a service waiting receiving module 710, configured to receive a service waiting for processing at a user terminal, and determine a service priority of the service waiting for processing, where the service priority corresponds to a threshold; an actual traffic obtaining module 720, configured to obtain an actual traffic of each node in the wireless ad hoc network in a target channel load statistics period; a service to be processed scheduling module 730, configured to schedule the service to be processed according to a threshold value corresponding to the service priority, the actual service volume, and a preset maximum waiting duration; and the threshold dynamic adjustment module 740 is configured to dynamically adjust a threshold corresponding to the service priority in the process of scheduling the service to be processed.
In this embodiment, the to-be-processed service receiving module 710 receives a to-be-processed service of the user side, and determines a service priority of the to-be-processed service, where the service priority corresponds to a threshold; the actual traffic obtaining module 720 obtains actual traffic of each node in the wireless ad hoc network in the target channel load statistics period; the service scheduling module 730 to be processed schedules the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length; the threshold dynamic adjustment module 740 dynamically adjusts the threshold corresponding to the service priority in the process of scheduling the service to be processed. The device quantifies the congestion degree of the channel by using the actual traffic of each node in the network in the target channel load statistics period, introduces the maximum waiting time in the service priority scheduling process, dynamically adjusts the priority of the low-priority service with overlong waiting time in the network operation process, overcomes the defect that the random competition MAC protocol in the existing wireless self-organizing network lacks QoS guarantee, has poor service quality of the low-priority service when the network traffic is higher, improves the service quality of the low-priority service when the traffic is higher, and improves the throughput of the system.
It should be noted that, the radio access protocol service scheduling device based on the multi-priority service provided in this embodiment and the radio access protocol service scheduling method based on the multi-priority service described above may be referred to correspondingly, and are not described herein again.
Fig. 8 illustrates a physical structure diagram of an electronic device, as shown in fig. 8, which may include: processor 810, communication interface (communications Interface) 820, memory 830, and communication bus 840, wherein processor 810, communication interface 820, memory 830 accomplish communication with each other through communication bus 840. The processor 810 may invoke logic instructions in the memory 830 to perform a multi-priority service based radio access protocol traffic scheduling method comprising: receiving a service to be processed of a user terminal, and determining a service priority of the service to be processed, wherein the service priority corresponds to a threshold value; acquiring actual traffic of each node in a wireless self-organizing network in a target channel load statistics period; scheduling the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length; and dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed.
Further, the logic instructions in the memory 830 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform a multi-priority service-based radio access protocol traffic scheduling method provided by the above methods, the method comprising: receiving a service to be processed of a user terminal, and determining a service priority of the service to be processed, wherein the service priority corresponds to a threshold value; acquiring actual traffic of each node in a wireless self-organizing network in a target channel load statistics period; scheduling the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length; and dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (9)

1. A multi-priority service-based wireless access protocol service scheduling method, comprising:
receiving a service to be processed of a user terminal, and determining a service priority of the service to be processed, wherein the service priority corresponds to a threshold value;
acquiring actual traffic of each node in a wireless self-organizing network in a target channel load statistics period;
scheduling the service to be processed according to a threshold value corresponding to the service priority, the actual service volume and a preset maximum waiting time length;
Dynamically adjusting a threshold value corresponding to the service priority in the process of scheduling the service to be processed;
The scheduling the service to be processed according to the threshold value corresponding to the service priority, the actual service volume and the preset maximum waiting time length comprises the following steps:
When the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is larger than the actual service volume, the service to be processed is accessed to a channel and sent;
And executing random back-off operation on the service to be processed under the condition that the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is smaller than or equal to the actual service quantity.
2. The multi-priority service-based wireless access protocol traffic scheduling method according to claim 1, wherein the performing a random back-off operation on the pending traffic comprises:
Under the condition that the waiting time of the service to be processed is longer than the first waiting time, the service priority of the service to be processed is improved, and the back-off time is recalculated and inserted into a waiting queue;
If the waiting time of the service to be processed is longer than the second waiting time, the service priority of the service to be processed is increased again, and the back-off time is recalculated and inserted into a waiting queue;
destroying the service to be processed under the condition that the waiting time of the service to be processed is longer than the maximum waiting time;
The first waiting time period is smaller than the second waiting time period, and the second waiting time period is smaller than the maximum waiting time period.
3. The multi-priority service based radio access protocol traffic scheduling method of claim 2, further comprising:
determining that the waiting time of the service to be processed is not longer than the first waiting time;
or determining that the waiting time of the service to be processed is longer than the first waiting time but not longer than the waiting time;
Or determining that the waiting time of the service to be processed is longer than the second waiting time but not longer than the maximum waiting time;
and processing the service to be processed according to the threshold value corresponding to the service priority to which the service to be processed belongs and the actual service volume.
4. The multi-priority service-based wireless access protocol traffic scheduling method according to claim 3, wherein the processing the traffic to be processed comprises:
When the threshold value corresponding to the lowest service priority is larger than the actual service volume, partial access priority service does not exist, and each priority service is sent along with the arrival;
Under the condition that the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is smaller than the actual service volume, no service is allowed to be transmitted in the current wireless self-organizing network;
When the threshold value corresponding to the lowest service priority is smaller than the actual service volume and the threshold value corresponding to the highest service priority is larger than the actual service volume, partial access priority service exists in the current wireless self-organizing network, all high-priority service and target partial access priority service are selected to be sent in priority, and each priority queue is updated;
The high-priority service comprises a first-priority service, a second-priority service and a third-priority service, and the total traffic of the target part after the target part is accessed to the priority service access channel is not higher than the actual throughput.
5. The method for scheduling wireless access protocol traffic based on multi-priority service according to claim 1, wherein the actual traffic comprises a total number of received data packets of each node in the wireless ad hoc network in a target channel load statistics period;
The step of dynamically adjusting the threshold value corresponding to the service priority in the process of scheduling the service to be processed comprises the following steps:
calculating the actual throughput of the wireless self-organizing network according to the total number of the received data packets;
and dynamically adjusting a threshold value corresponding to the service priority according to the actual throughput of the wireless self-organizing network.
6. The method for scheduling wireless access protocol traffic based on multi-priority service according to any one of claims 1 to 5, wherein the wireless ad hoc network includes an on-demand node, and the step of accessing the on-demand node includes:
Based on a network access command broadcasted by a control node in a wireless self-organizing network, receiving a network access application sent by the following node;
And under the condition that the control node carries out security authentication on the random node and passes through the random node, distributing resources for the random node, and sending the information of the random node and an updated routing table to other nodes in the wireless self-organizing network, wherein the random node is successful in network access.
7. A multi-priority service-based wireless access protocol traffic scheduling apparatus, comprising:
the system comprises a to-be-processed service receiving module, a service processing module and a service processing module, wherein the to-be-processed service receiving module is used for receiving to-be-processed service of a user terminal and determining service priority of the to-be-processed service, and the service priority corresponds to a threshold value;
the actual traffic acquisition module is used for acquiring the actual traffic of each node in the wireless self-organizing network in the target channel load statistics period;
The service scheduling module to be processed is used for scheduling the service to be processed according to the threshold value corresponding to the service priority, the actual service volume and the preset maximum waiting time length;
the threshold dynamic adjustment module is used for dynamically adjusting the threshold corresponding to the service priority in the process of scheduling the service to be processed;
The scheduling the service to be processed according to the threshold value corresponding to the service priority, the actual service volume and the preset maximum waiting time length comprises the following steps:
When the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is larger than the actual service volume, the service to be processed is accessed to a channel and sent;
And executing random back-off operation on the service to be processed under the condition that the waiting time of the service to be processed is lower than the maximum waiting time and the threshold value is smaller than or equal to the actual service quantity.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the multi-priority service based radio access protocol traffic scheduling method of any one of claims 1 to 6 when the program is executed.
9. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor implements the multi-priority service based radio access protocol traffic scheduling method according to any of claims 1 to 6.
CN202311529583.2A 2023-11-16 2023-11-16 Multi-priority service-based wireless access protocol service scheduling method and device Active CN117528815B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311529583.2A CN117528815B (en) 2023-11-16 2023-11-16 Multi-priority service-based wireless access protocol service scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311529583.2A CN117528815B (en) 2023-11-16 2023-11-16 Multi-priority service-based wireless access protocol service scheduling method and device

Publications (2)

Publication Number Publication Date
CN117528815A CN117528815A (en) 2024-02-06
CN117528815B true CN117528815B (en) 2024-09-06

Family

ID=89758242

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311529583.2A Active CN117528815B (en) 2023-11-16 2023-11-16 Multi-priority service-based wireless access protocol service scheduling method and device

Country Status (1)

Country Link
CN (1) CN117528815B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN119743837B (en) * 2025-03-05 2025-06-17 沈阳邦粹科技有限公司 Method for transmitting data by TDMA dispatching

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101175064A (en) * 2006-12-18 2008-05-07 中兴通讯股份有限公司 Forwarding periodic line scheduling method based on service quality
CN103974436A (en) * 2014-04-18 2014-08-06 大唐移动通信设备有限公司 Adjustment method and device for dispatching priority

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102387552B (en) * 2011-10-21 2017-07-21 南京中兴新软件有限责任公司 A kind of method of adjustment of service quality QoS, system, equipment and device
US20210152491A1 (en) * 2019-11-14 2021-05-20 International Business Machines Corporation Prioritization and intelligent adjustment of priority of tuples
CN113573419B (en) * 2021-06-10 2024-04-09 杭州电子科技大学 Multi-hop network channel access method considering multi-priority service
CN113630901B (en) * 2021-08-10 2023-08-11 南京工程学院 Dynamic multi-priority self-adaptive back-off algorithm in heterogeneous wireless network
CN113891491B (en) * 2021-11-18 2023-12-22 中国航空无线电电子研究所 Link access method and device
CN113993146A (en) * 2021-12-27 2022-01-28 北京国科天迅科技有限公司 Communication method based on SPMA protocol backoff algorithm

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101175064A (en) * 2006-12-18 2008-05-07 中兴通讯股份有限公司 Forwarding periodic line scheduling method based on service quality
CN103974436A (en) * 2014-04-18 2014-08-06 大唐移动通信设备有限公司 Adjustment method and device for dispatching priority

Also Published As

Publication number Publication date
CN117528815A (en) 2024-02-06

Similar Documents

Publication Publication Date Title
US6404756B1 (en) Methods and apparatus for coordinating channel access to shared parallel data channels
JP5474562B2 (en) Method of congestion management in wireless mesh networks
US7843943B2 (en) Differentiation for bandwidth request contention
CN101018196A (en) Wireless communication device and wireless communication method
US8422450B2 (en) Relaxed deterministic back-off method for medium access control
CN112437498B (en) Data link protocol back-off method based on channel state judgment and priority
CN111163491A (en) A Fine-grained Statistical Priority Multiple Access Method with High Channel Utilization
CN117528815B (en) Multi-priority service-based wireless access protocol service scheduling method and device
CN113993146A (en) Communication method based on SPMA protocol backoff algorithm
US6801537B1 (en) Adaptive contention algorithm based on truncated binary exponential back-off
CN111148270A (en) Long-distance multi-channel communication random access method and system based on service quality
Yang et al. ACK-based adaptive backoff for random access protocols
CN111263463A (en) IEEE802-11ax QoS channel access control method based on service priority
CN109640397B (en) Service quality-based random access method for long-distance multichannel communication
Wang et al. Improving VOIP application's performance over WLAN using a new distributed fair MAC scheme
Li et al. Fixed collision rate back-off algorithm for wireless access networks
Ivanov et al. Analytical model of QoS-aware streaming in Wi-Fi networks via periodic TXOPs
Zhang et al. Performance analysis of reservation and contention-based hybrid MAC for wireless networks
KR101040290B1 (en) Priority-based wireless network system, wireless network communication method
US9197482B1 (en) Optimizing quality of service in wireless networks
Lu et al. Performance of a burst-frame-based CSMA/CA protocol for high data rate ultra-wideband networks: Analysis and enhancement
He et al. On bandwidth request mechanism with piggyback in fixed IEEE 802.16 networks
Cheng et al. Algorithm improvement and modeling analysis for SPMA
KR100369325B1 (en) System of mobile-assisted fuzzy-based framed random access control for integration of voice and data over wired/wireless networks and its method
Foh et al. Improving the Efficiency of CSMA using Reservations by Interruptions

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant