CN107659940B - Multi-priority multi-channel media access control method based on channel perception - Google Patents

Multi-priority multi-channel media access control method based on channel perception Download PDF

Info

Publication number
CN107659940B
CN107659940B CN201710978179.1A CN201710978179A CN107659940B CN 107659940 B CN107659940 B CN 107659940B CN 201710978179 A CN201710978179 A CN 201710978179A CN 107659940 B CN107659940 B CN 107659940B
Authority
CN
China
Prior art keywords
packet
channels
priority
state
channel
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
CN201710978179.1A
Other languages
Chinese (zh)
Other versions
CN107659940A (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.)
China Aeronautical Radio Electronics Research Institute
Original Assignee
China Aeronautical Radio Electronics Research Institute
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 China Aeronautical Radio Electronics Research Institute filed Critical China Aeronautical Radio Electronics Research Institute
Priority to CN201710978179.1A priority Critical patent/CN107659940B/en
Publication of CN107659940A publication Critical patent/CN107659940A/en
Application granted granted Critical
Publication of CN107659940B publication Critical patent/CN107659940B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/26—Reselection being triggered by specific parameters by agreed or negotiated communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/12—Fixed resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0011—Control or signalling for completing the hand-off for data sessions of end-to-end connection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/005—Control or signalling for completing the hand-off involving radio access media independent information, e.g. MIH [Media independent Hand-off]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention discloses a multi-priority multi-channel media access control method based on channel perception, which divides N channels into gamma dynamic reserved channels and N-gamma fixed shared channels, wherein the fixed shared channels are equally shared by all groups with different priorities, and the dynamic reserved channels reserve the number of channels for the groups with different priorities according to the following formula:
Figure DDA0002867938940000011
wherein M is the priority level of the current packet, M is the total level of the priority,
Figure DDA0002867938940000012
λTdenotes the arrival rate of the total packet, λmIndicating the arrival rate of the current priority packet. The invention can not only ensure sufficient channel resources for high-priority service, but also effectively improve the utilization rate of the whole channel.

Description

Multi-priority multi-channel media access control method based on channel perception
Technical Field
The invention belongs to the technical field of communication, relates to an unmanned aerial vehicle ad hoc network communication networking method, and provides a Multi-Priority Multi-Channel Media Access Control method (MPMC _ MAC) based on Channel state perception.
Technical Field
The unmanned aerial vehicle Ad Hoc Network adopts a Mobile Ad Hoc Network (MANET) as a main Network system architecture, has the characteristics of flexibility, dynamic state, fast Ad Hoc, large capacity, distribution, high survivability and the like, can greatly improve the networked cooperative combat capability of various aircrafts, and becomes one of the future important development directions of military aviation communication networks. Media Access Control (MAC) protocol is one of the key technologies of an ad hoc network of an unmanned aerial vehicle, mainly solves the problem of how to efficiently share a communication channel among a plurality of unmanned aerial vehicles, is a main factor for determining information transmission delay, and the ad hoc network of the unmanned aerial vehicle has the problems of large transmission delay, unstable channel quality and the like, affects the timeliness and reliability of information transmission, and provides higher requirements for the MAC protocol.
The MAC protocol of the ad hoc network of the unmanned aerial vehicle needs to meet the following requirements: (1) extremely low transmission delay of high-priority service; (2) the success rate of the first sending of the packet reaches 99 percent; (3) different QoS (Quality of Service) of a plurality of services is supported; (4) a large number of users are supported. Therefore, it is very necessary to design an MAC protocol for an ad hoc network of an unmanned aerial vehicle, which has small transmission delay, large network capacity, high flexibility, strong expandability, and supports multi-priority service differentiation service, and aims to ensure that a high-priority service can quickly access a channel, obtain the minimum delay, obtain a fair access opportunity with a priority service, and realize quick, effective and reliable sharing and exchange of information between nodes.
Disclosure of Invention
The invention aims to provide a multi-priority multichannel MAC method based on multichannel state sensing, which can sense the channel occupation situation in real time, realize differentiated services of different priority services for an unmanned aerial vehicle ad hoc network, and provide effective QoS guarantee and full and efficient utilization of network channel resources for various information transmissions. The MPMC _ MAC method is a distributed random competition type MAC method based on channel state perception, and mainly comprises 4 parts, namely a multi-priority multi-queue scheduling mechanism, a call admission control mechanism, a backoff algorithm, a multi-channel dynamic allocation model and the like. The back-off algorithm adopts a Binary Exponential back-off (BEB) mechanism in the IEEE 802.11 protocol, and the details thereof are not discussed in this patent.
The invention aims to be realized by the following technical scheme:
a multi-priority multi-channel medium access control method based on channel perception comprises a multi-channel dynamic allocation model, wherein the multi-channel dynamic allocation model divides N channels into gamma dynamic reserved channels and N-gamma fixed shared channels, the fixed shared channels are equally shared by all groups with different priorities, and the dynamic reserved channels reserve the number of channels for the groups with different priorities according to the following formula:
Figure GDA0002867938930000021
where M is the priority level of the current packet and M is the total level of priorityThe number of the first and second groups is,
Figure GDA0002867938930000022
λTdenotes the arrival rate of the total packet, λmIndicating the arrival rate of the current priority packet.
Preferably, the first and second electrodes are formed of a metal,
Figure GDA0002867938930000023
wherein, gamma is0Representing the initial value, η, of ΓminRepresenting the desired minimum channel utilization, ηpCurrent channel utilization.
Preferably, the first and second electrodes are formed of a metal,
Figure GDA0002867938930000024
wherein the content of the first and second substances,
Figure GDA0002867938930000025
indicating the time interval between the i-1 th and i-th arriving packets in the current priority packet.
Preferably, the arrival of a packet depends on the state of the node;
when the node is in an initialization/idle state, the packet is inserted into the queue;
when the node is in a 'backoff waiting' state, if a new packet arrives, if the queue is not full, the packet is inserted into the queue, otherwise, the packet is discarded;
and when the node is in a state of sending a head packet of the queue, if a new packet arrives, if the corresponding queue is not full, inserting the new packet into the queue, otherwise, discarding the packet.
Preferably, the state of the node is controlled by a call admission control mechanism, which is:
when the node is in an initialization/idle state, after a packet is newly inserted into a queue, calculating the number of occupied channels in the current network, if the number of occupied channels in the network is larger than the number of channels which can be occupied by the packet, the node enters a backoff waiting state, otherwise, the node enters a sending queue head packet state;
when the node is in a 'backoff waiting' state, calculating the number of occupied channels in the current network, and if the number of occupied channels in the network is less than the number of channels which can be occupied by the packets in the queue, the node enters a 'sending head of queue packet' state;
when the node is in a state of sending a head group packet, after the packet is sent, if all queues are empty, the node enters an initialization/idle state; if all queues are not empty, the number of occupied channels in the network is calculated, if the number of occupied channels in the network is less than the number of channels which can be occupied by the packets in the queues, the node enters a state of sending the head packets of the queues, and otherwise, the node enters a state of backoff waiting.
Preferably, there are M queues, and packets are inserted into the corresponding queues according to the priority levels after the packets arrive.
The main innovations of the invention are as follows:
1) aiming at the multi-priority service, a simple and effective multi-priority multi-queue scheduling mechanism is adopted. In view of the problem that the multi-priority single queue adopted by the current research is complex and difficult to realize, the invention adopts a multi-priority multi-queue mechanism, the packet access sequence is controlled by a scheduling algorithm, all packets are served according to the high and low sequence of the priority, the requirement of any priority service category in a network can be met, and simultaneously, the QoS guarantee of low time delay and high reliability of high priority service is ensured.
2) A call admission control mechanism capable of monitoring the traffic flow of each priority level and the occupation condition of a network channel in real time is provided. The mechanism adopts a packet arrival rate estimation algorithm to estimate the arrival rate of each priority service in real time and further senses the occupation condition of each channel, thereby judging whether packets can be accessed into the channel immediately and effectively avoiding network congestion.
3) A multi-channel dynamic allocation model is provided for reasonable and efficient occupation of channel resources by multi-priority services. By dividing the whole bandwidth of the network into two parts, namely a fixed shared channel and a dynamic reserved channel, sufficient channel resources can be ensured for high-priority services, and the whole channel utilization rate can be effectively improved.
The invention has the advantages that the multi-priority multichannel MAC method based on channel state perception can perceive the channel occupation situation in real time, realize differentiated services for different priority services of the unmanned aerial vehicle ad hoc network, provide effective QoS guarantee for various information transmission, fully and efficiently utilize network bandwidth resources, guarantee the coexistence transmission of various services in the unmanned aerial vehicle ad hoc network, and meet the strict requirements of timeliness and reliability of partial information transmission.
Drawings
FIG. 1 is a framework of a multi-priority multi-channel MAC approach based on channel state awareness;
fig. 2 is a state transition diagram of the MAC method;
FIG. 3 is a schematic diagram of a multi-channel dynamic allocation model;
fig. 4 is a flow diagram of a call admission control mechanism;
figure 5 is a state transition diagram for a multi-channel dynamically assigned markov chain model.
Detailed Description
The invention is described in detail below with reference to the drawings and preferred embodiments.
Fig. 1 is a structural framework of a multi-priority multi-channel MAC method based on channel state sensing. The figure comprises 4 parts of a multi-priority multi-queue scheduling mechanism, a call admission control mechanism, a back-off algorithm, a multi-channel dynamic allocation model and the like.
The multi-priority multi-queue scheduling mechanism is characterized in that M queues are arranged in a node, each queue is used for inserting priority packets of one level, namely a queue with the priority of 1 is inserted into a queue with the sequence number of 1, and a queue with the priority of 2 is inserted into a queue with the sequence number of 2.
Fig. 2 is a state transition diagram of the method, according to which all nodes in the network operate. The specific state transition process can be described as:
1) the node starts from an initialization/idle state, and if a packet from an upper layer is received, the node inserts a queue corresponding to the priority according to the priority of the packet;
2) after the newly arrived packet is inserted into the queue, the number of occupied channels in the current network is calculated according to a call admission control mechanism, if the number of occupied channels in the network is more than the number of channels which can be occupied by the packet, the node enters a 'backoff waiting' state, otherwise, the node enters a 'sending queue head packet' state.
3) When the node is in a 'backoff waiting' state, if a new packet arrives, if the corresponding queue is not full, the new packet is inserted into the queue, otherwise, the packet is discarded until a corresponding idle channel exists, and the state of 'sending a head packet' is entered;
4) in the state of sending head group packets, if new packets arrive, if the corresponding queue is not full, inserting the packets into the queue, otherwise, discarding the packets;
5) after the 'sending completion' state, if all queues are empty, the node enters an 'initialization/idle' state; if all queues are not empty, the number of occupied channels in the network is calculated, if the number of occupied channels in the network is less than the number of channels which can be occupied by the packets in the queues, the node enters a state of sending the head packets of the queues, and otherwise, the node enters a state of backoff waiting. .
Fig. 3 is a diagram illustrating a multi-channel dynamic allocation model. The multi-channel dynamic allocation model is a core control mechanism of the MAC method, and let p (p ═ 1,2, …, M, …, M) represent the priority of a packet, where p ═ 1 has the highest priority and p ═ M has the lowest priority. Let lambdaTDenotes the total packet arrival rate, λmIndicates the packet arrival rate of priority p ═ m, and therefore
λT＝λ1+λ2+…+λm+…+λM (1)
Let N denote the total number of channels in the network and Γ be the maximum number of dynamically reserved channels that can be reserved, with the occupancy based on the priority of the packet. The remaining N- Γ fixed shared channels are shared equally by all priority packets. In order to obtain high performance of channel utilization, the value of Γ cannot be set too large.
In this model, the number of dynamically reserved channels reserved for priority p ═ 1 packets can be expressed as:
Figure GDA0002867938930000061
the number of dynamically reserved channels commonly reserved for priority p ═ 1,2 packets can be expressed as:
Figure GDA0002867938930000062
the number of dynamically reserved channels commonly reserved for m packets with priority p equal to 1,2, … can be expressed as:
Figure GDA0002867938930000063
then, Γ may be expressed as:
Figure GDA0002867938930000064
in addition to the N- Γ shared channels,
Figure GDA0002867938930000065
the individual channels are also shared equally by all priority packets. Among the Γ reserved channels, the number of channels available for grouping with priority p ═ m can be expressed as:
Figure GDA0002867938930000066
thus, the total number of channels available for a packet with priority p ═ m is:
Nm＝N-Γ+ym(t) (7)
equations (2) - (7) show that in the assignment model, the number of channels assigned to different priority packets is not fixed, but is determined by a parameter λm、λTN and Γ. Given N and Γ, the total number of channels available for packets with priority p ═ m can be calculated by a method of estimating the packet arrival rate.
There are several methods for the calculation of the optimum value of Γ,the simplest of these is by channel utilization calculation. The value of Γ may be dynamically adjusted by a desired minimum channel utilization, channel congestion conditions, and an initial value of Γ. Let η beminAnd ηpRepresenting the desired minimum channel utilization and the current channel utilization, respectively, the optimum value Γ may be calculated by:
Figure GDA0002867938930000071
wherein, gamma is0Representing the initial value of Γ. Equation (8) gives a simple method to calculate the optimum value of Γ under dynamic network conditions. When the current value of channel utilization is below the desired minimum channel utilization value, the system may adjust by decreasing the value of Γ.
Fig. 4 is a flow chart of a call admission control mechanism. When a packet arrives with priority p ═ m, the mechanism estimates the arrival rate of the priority packet using a packet arrival rate estimation algorithm and calculates the maximum number of available channels Nm. If the number of occupied channels is less than NmThen the packet is accessed to the channel immediately; if the number of occupied channels is greater than or equal to NmThen the packet is subject to a back-off algorithm.
Here, a packet Arrival Rate Estimation Algorithm (packet Arrival Rate Estimation Algorithm, PAREA) is used to estimate the Arrival Rate of each priority packet in the network in real time. In order to estimate the packet arrival rate, it is necessary to observe the latest n +1 arriving packets of each priority. Here, let
Figure GDA0002867938930000072
Indicating the time interval between the i-1 th and ith arriving packets in the m packets. Thus, each priority packet takes n values to calculate the average time interval between two adjacent arriving packets. Wherein the content of the first and second substances,
Figure GDA0002867938930000073
indicating the most recently arrived packet of the priority packets.
In a priority p ═ m packet, the average time interval between two adjacent packets in the last n +1 arriving packets can be expressed as:
Figure GDA0002867938930000074
in the pair formula (9) about
Figure GDA0002867938930000075
To make a desire, can
Figure GDA0002867938930000076
Where Δ tmIs true, this indicates
Figure GDA0002867938930000077
Is an unbiased estimation.
From the last n +1 arriving packets, the average packet arrival rate for priority p ═ m packets can be expressed as:
Figure GDA0002867938930000081
due to the fact that
Figure GDA0002867938930000082
For unbiased estimation, λmAlso an unbiased estimate. Therefore, λ in the formula (11)mIt is the priority p, m, which is an estimate of the packet arrival rate. According to formulae (4) - (6), (9) - (11), formula (7) can be represented as:
Figure GDA0002867938930000083
here, the network real-time traffic condition is obtained only by the last n +1 arriving packets, and the estimated value of the arrival rate of the priority packet is updated when a new packet arrives. Equation (12) indicates that the number of channels available for packets is dependent on the priority packet arrivalRate lambdamN and Γ.
Figure 5 is a state transition diagram of a markov chain model for multi-channel dynamic allocation. Define 1/μ as the average channel occupancy time, which follows an exponential distribution. Let PiRepresenting the probability that the system is in state i. Thus, the system state balance equation is:
Figure GDA0002867938930000084
in this model, for packets with priority p ═ m, if the number of packets being transmitted in the channel is greater than or equal to NmThen the newly arriving packet will perform a back-off algorithm. N is a radical of1Maximum number of available channels for the highest priority (p ═ 1) packet, NmThe maximum number of available channels for the lowest priority (p ═ m) packet. Only if the number of all channels in the network is N (N ═ N)1) The newly arrived highest priority will execute the back-off algorithm when all are occupied.
A mathematical expression of the priority p ═ m packet backoff probability can be derived through queuing theory analysis. Equation (14) gives a mathematical expression of the highest priority (p ═ 1) packet backoff probability, and equation (15) gives a mathematical expression of the packet backoff probability of priority (p ═ 2,3, …, M, …, M).
Figure GDA0002867938930000091
Figure GDA0002867938930000092
Wherein the content of the first and second substances,
Figure GDA0002867938930000093
the invention provides a multi-priority multichannel MAC method based on channel state perception, which combines a multi-priority multi-queue scheduling mechanism, a call admission control mechanism and a multichannel dynamic allocation model and improves the channel utilization rate on the basis of ensuring various priority service QoS differentiation services. The invention is used as an important algorithm of the MAC protocol of the unmanned aerial vehicle ad hoc network, has the capabilities of ensuring the QoS of high-priority services and distinguishing the multi-service priority services, can also be applied to the coexistence transmission of other multi-priority services, and has high requirements on the real-time performance and the reliability of the high-priority services in a wireless communication network.

Claims (6)

1. A multi-priority multi-channel medium access control method based on channel perception comprises a multi-channel dynamic allocation model, and is characterized in that the multi-channel dynamic allocation model divides N channels into gamma dynamic reserved channels and N-gamma fixed shared channels, the fixed shared channels are equally shared by all groups with different priorities, and the dynamic reserved channels reserve the number of channels for the groups with different priorities according to the following formula:
Figure FDA0002867938920000011
wherein M is the priority level of the current packet, M is the total level of the priority,
Figure FDA0002867938920000012
λTdenotes the arrival rate of the total packet, λmIndicating the arrival rate of the current priority packet.
2. The method of claim 1, wherein the method comprises:
Figure FDA0002867938920000013
wherein, gamma is0Representing the initial value, η, of ΓminRepresenting the desired minimum channel utilization, ηpIndicating the current channelUtilization ratio.
3. The method of claim 1, wherein the method comprises:
Figure FDA0002867938920000014
wherein the content of the first and second substances,
Figure FDA0002867938920000015
indicating the time interval between the i-1 th and i-th arriving packets in the current priority packet.
4. The method of claim 1, wherein the method comprises: the arrival of packets depends on the state of the node;
when the node is in an initialization/idle state, the packet is inserted into the queue;
when the node is in a 'backoff waiting' state, if a new packet arrives, if the queue is not full, the packet is inserted into the queue, otherwise, the packet is discarded;
and when the node is in a state of sending a head packet of the queue, if a new packet arrives, if the corresponding queue is not full, inserting the new packet into the queue, otherwise, discarding the packet.
5. The method of claim 4, wherein the state of the node is controlled by a call admission control mechanism, and the call admission control mechanism is:
when the node is in an initialization/idle state, after a packet is newly inserted into a queue, calculating the number of occupied channels in the current network, if the number of occupied channels in the network is larger than the number of channels which can be occupied by the packet, the node enters a backoff waiting state, otherwise, the node enters a sending queue head packet state;
when the node is in a 'backoff waiting' state, calculating the number of occupied channels in the current network, and if the number of occupied channels in the network is less than the number of channels which can be occupied by the packets in the queue, the node enters a 'sending head of queue packet' state;
when the node is in a state of sending a head group packet, after the packet is sent, if all queues are empty, the node enters an initialization/idle state; if all queues are not empty, the number of occupied channels in the network is calculated, if the number of occupied channels in the network is less than the number of channels which can be occupied by the packets in the queues, the node enters a state of sending the head packets of the queues, and otherwise, the node enters a state of backoff waiting.
6. The method of claim 1, wherein there are M queues, and packets are inserted into corresponding queues according to priority levels after arriving.
CN201710978179.1A 2017-10-18 2017-10-18 Multi-priority multi-channel media access control method based on channel perception Active CN107659940B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710978179.1A CN107659940B (en) 2017-10-18 2017-10-18 Multi-priority multi-channel media access control method based on channel perception

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710978179.1A CN107659940B (en) 2017-10-18 2017-10-18 Multi-priority multi-channel media access control method based on channel perception

Publications (2)

Publication Number Publication Date
CN107659940A CN107659940A (en) 2018-02-02
CN107659940B true CN107659940B (en) 2021-04-23

Family

ID=61117984

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710978179.1A Active CN107659940B (en) 2017-10-18 2017-10-18 Multi-priority multi-channel media access control method based on channel perception

Country Status (1)

Country Link
CN (1) CN107659940B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108614577B (en) * 2018-05-30 2021-02-09 中国联合网络通信集团有限公司 Information transmission method and device for unmanned aerial vehicle
CN109640397B (en) * 2019-01-11 2020-11-06 上海微波技术研究所（中国电子科技集团公司第五十研究所） Service quality-based random access method for long-distance multichannel communication
CN110597294A (en) * 2019-10-14 2019-12-20 深圳市元征科技股份有限公司 Unmanned aerial vehicle and cluster system thereof

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI466554B (en) * 2010-03-23 2014-12-21 Acer Inc Method of multichannel media access control of cognitive radio
CN103096483A (en) * 2013-01-04 2013-05-08 大连理工大学 Media access control (MAC) layer channel dynamic distribution method for Ad Hoc network
CN103200623B (en) * 2013-03-29 2015-09-23 北京邮电大学 The decision-making technique of dynamic adjustments channel reservation and implement device in a kind of cognitive radio

Also Published As

Publication number Publication date
CN107659940A (en) 2018-02-02

Similar Documents

Publication Publication Date Title
CN101286949A (en) Wireless Mesh network MAC layer resource scheduling policy based on IEEE802.16d standard
CN101964758A (en) Differentiated service-based queue scheduling method
CN104301933B (en) A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking
CN109618375B (en) UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability
CN107659940B (en) Multi-priority multi-channel media access control method based on channel perception
CN109905330B (en) Dynamic weighted fair queue train network scheduling method based on queue length
US6920120B2 (en) System and method of scheduling radio resources in a wireless communications network
CN111371701B (en) MAC layer queue scheduling method based on TDMA
Xiao QoS guarantee and provisioning at the contention-based wireless MAC layer in the IEEE 802.11 e wireless LANs
Nafaa Provisioning of multimedia services in 802.11-based networks: facts and challenges
CN113573419A (en) Multi-hop network channel access method considering multi-priority service
Zeng et al. A novel scheduling scheme and MAC enhancements for IEEE 802.15. 3 high-rate WPAN
Berrahal et al. A smart QoS-based traffic management for WBANs
Vijay et al. Quality of Service Improvements in IEEE 802.11 AX Wi-Fi
CN103533579B (en) The scheduling processing method and dispatch server of data flow in streaming media service
CN117135693B (en) Real-time service distribution method based on federal learning under multi-AP environment
Ma et al. A three-tier framework and scheduling to support QoS service in WiMAX
Liang et al. A Research on HCCA Mechanism of Wireless LAN Access
Kadoch et al. Courteous algorithm: performance optimization in WiMAX networks
TWI393477B (en) Latency and modulation-aware dynamic bandwidth allocation method for wireless broadband base stations
Ali et al. Performance Analysis of Delay Jitter in Mobile WiMAX Systems
Mokdad et al. Adaptive traffic shaping for WiMAX networks
CN116260769A (en) Time deterministic traffic burst shaping method for distributed network
CN113784390A (en) Wireless communication system for realizing network load dynamic distribution
Bourawy et al. A selectivity function scheduler for IEEE 802.11 e

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