CN107659940A - A kind of multipriority multi-channel medium access control protocol based on channel-aware - Google Patents
A kind of multipriority multi-channel medium access control protocol based on channel-aware Download PDFInfo
- Publication number
- CN107659940A CN107659940A CN201710978179.1A CN201710978179A CN107659940A CN 107659940 A CN107659940 A CN 107659940A CN 201710978179 A CN201710978179 A CN 201710978179A CN 107659940 A CN107659940 A CN 107659940A
- Authority
- CN
- China
- Prior art keywords
- channel
- packet
- mrow
- queue
- msub
- 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.)
- Granted
Links
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 kind of multipriority multi-channel medium access control protocol based on channel-aware, N number of channel is divided into Γ dynamic channel reservation and N Γ fix shared channel, fixed shared channel is shared by the packet equality of all different priorities, and dynamic channel reservation is according to the packet reservation number of channel that below equation is variant priority：Wherein, m is the priority level of current group, and M is total number of degrees of priority,λTRepresent the arrival rate of total packet, λmRepresent the arrival rate of current priority packet.The present invention may be either that high-priority service ensures sufficient channel resource, and and can effectively improves overall channel utilization rate.
Description
Technical field
The invention belongs to communication technical field, is related to a kind of unmanned plane self-organized network communication Networking protocol, it is proposed that Yi Zhongji
In multipriority multi-channel medium access control protocol (the Multi-Priority Multi-Channel that channel status perceives
Media Access Control,MPMC_MAC)。
Technical background
Unmanned plane MANET is used as main net using mobile Ad Hoc networks (Mobile Ad Hoc Network, MANET)
Network architectural framework, there is flexible, dynamic, quickly from group, Large Copacity, distribution, high survivability, can greatly improve each
Kind aircraft networks Cooperative Engagement Capability, it has also become one of military aviation communication network future important development direction.Media connect
It is one of key technology of unmanned plane MANET to enter control (Media Access Control, MAC) agreement, is mainly solved multiple
Between unmanned plane how efficient shared communication channel the problem of, be determine information transfer time delay principal element, and unmanned plane from
There is the problems such as propagation delay time is larger, channel quality is unstable in networking, influence ageing, the reliability of information transfer, and MAC is assisted
View proposes high requirement.
Unmanned plane MANET MAC protocol needs to meet claimed below：(1) the extremely low propagation delay time of high-priority service；(2)
Packet sends success rate and reaches 99% first；(3) support the different service quality of multiple business (Quality of Service,
QoS)；(4) a large number of users is supported.Therefore, it is highly desirable to design that a kind of propagation delay time is small, network capacity for unmanned plane MANET
Greatly, flexibility is high, scalability is strong, and supports the MAC protocol of multipriority traffic differentiation service, it is intended to ensures high priority
Business can quickly access channel, obtain minimum time delay, same priority business obtain fair exchange protocols chance, realize node it
Between information is quick, effectively and reliably shares and exchanges.
The content of the invention
, can it is an object of the invention to provide a kind of multipriority multi-channel MAC protocols based on multichannel state aware
Real-time perception channel occupancy situation, the Differentiated Services of service with different priority levels are realized for unmanned plane MANET, and be various information
Transmission provides effective QoS guarantees and the abundant of network channel resource efficiently utilizes.MPMC_MAC agreements are that one kind is based on channel
The distributed random competition class MAC protocol of state aware, mainly includes multipriority multiqueue dispatching mechanism, Admission Control
Mechanism, back off algorithm, and 4 parts such as multichannel dynamically distributes model.Wherein, back off algorithm uses the agreements of IEEE 802.11
In binary exponential backoff (Binary Exponential Backoff, BEB) mechanism, its particular content this patent no longer begs for
By.
The goal of the invention of the present invention is achieved through the following technical solutions：
A kind of multipriority multi-channel medium access control protocol based on channel-aware, includes multichannel dynamically distributes mould
Type, multichannel dynamically distributes model are that N number of channel is divided into Γ dynamic channel reservation and N- Γ fixation shared channels, Gu
Determine shared channel to be shared by the packet equality of all different priorities, dynamic channel reservation is variant preferential according to below equation
The packet reservation number of channel of level：
Wherein, m is the priority level of current group, and M is total number of degrees of priority,λTRepresent total
The arrival rate of packet, λmRepresent the arrival rate of current priority packet.
Preferably,
Wherein, Γ0Represent Γ initial value, ηminRepresent desired minimum channel utilization rate, ηpCurrent channel utilization.
Preferably,
Wherein,Represent the i-th -1 and i-th time interval reached between packet in current priority packet.
Preferably, state of the arrival of packet depending on node；
Packet is then inserted queue by node in " initialization/free time " state；
Node is in " keeping out of the way wait " state, if there is new be grouped into reach, if queue less than, will packet insertion queue,
Otherwise the packet is abandoned；
Node is in " send head of the queue packet " state, if there is new be grouped into reach, if corresponding queue is less than inserting the queue
In, otherwise abandon the packet.
Preferably, the state of node is by Admission Control mechanism control, Admission Control mechanism：
In " initialization/free time " state, new reach is grouped after insertion queue node, calculates and has been taken in current network
The number of channel, if the number of channel taken in network is more than the number of channel that can take of the packet, node enters " keeping out of the way wait "
State, otherwise node entrance " send head of the queue to be grouped " state；
Node calculates the number of channel taken in current network in " keeping out of the way wait " state, if taken in network
The number of channel is less than the number of channel that is grouped and can take in queue, then node enters " sending head of the queue packet " state；
In " sending head of the queue packet " state, after packet transmission, if all queues are sky, node enters node
" initialization/free time " state；If all queues are non-NULL, the number of channel taken in current network is calculated, if in network
The number of channel of occupancy is less than the number of channel that is grouped and can take in queue, then node enters " sending head of the queue packet " state, otherwise enters
Enter " keeping out of the way wait " state.
Preferably, queue has M, after packet reaches in the queue according to corresponding to inserting priority level.
The principal innovative of the present invention is：
1) a kind of simple, effective multipriority multiqueue dispatching mechanism is employed for multipriority business.In view of mesh
The multipriority list queue of preceding research generally use is complicated and the problem of being not easy to realize, present invention employs a kind of multipriority is more
Queue mechanism, packet access order are controlled by dispatching algorithm, all packets are serviced according to the height order of its priority,
Any priority traffic class demand in network is disclosure satisfy that, while ensures high-priority service low time delay, the QoS of high reliability
Ensure.
2) proposing a kind of can monitor each priority service flow and the call admission of network channel occupancy situation in real time
Controlling mechanism.The mechanism employs a kind of packet arrival rate algorithm for estimating to be estimated in real time to each priority service arrival rate
Meter, and each channel occupancy situation is further perceived, so as to judge that can packet immediately access channel, effectively network can be avoided to gather around
Plug.
3) for multipriority business is reasonable, efficient busy channel resource proposes a kind of multichannel dynamically distributes model.It is logical
Cross and network overall bandwidth is divided into fixed shared channel and dynamic channel reservation two parts, may be either that high-priority service ensures
Sufficient channel resource, and can effectively improve overall channel utilization rate.
The invention has the advantages that it can be felt in real time based on the multipriority multi-channel MAC protocols that channel status perceives
Know channel occupancy situation, Differentiated Services are realized for unmanned plane MANET service with different priority levels, be provided with for various information transmission
The QoS of effect is ensured, and fully efficiently utilizes network bandwidth resources, can be ensured multiple business in unmanned plane MANET and be deposited transmission,
And meet that partial information transmits the ageing and strict demand of reliability.
Brief description of the drawings
Fig. 1 is the composition framework of the multipriority multi-channel MAC protocols perceived based on channel status；
Fig. 2 is the MAC protocol state transition diagram；
Fig. 3 is multichannel dynamically distributes model schematic；
Fig. 4 is Admission Control mechanism flow chart；
Fig. 5 is the state transition diagram of multichannel dynamically distributes Markov chain model.
Embodiment
Below in conjunction with the accompanying drawings with it is good compared with embodiment the present invention is described in detail.
Fig. 1 is the composition framework of the multipriority multi-channel MAC protocols perceived based on channel status.How preferential figure include
Level multiqueue dispatching mechanism, Admission Control mechanism, back off algorithm, and 4 parts such as multichannel dynamically distributes model.
For multipriority multiqueue dispatching mechanism to set M queue in node, each queue supplies the preferred of grade
Level packet insertion, i.e., the queue that priority is 1 are inserted in the queue of serial number 1, and serial number 2 is inserted in the queue that priority is 2
In queue.
Fig. 2 is the state transition diagram of agreement, and all nodes all work according to this state transition strategy in network.Particular state
Transfer process can be described as：
1) node is since " initialization/free time " state, if the packet from upper strata is received, according to the excellent of the packet
First level, insert the queue corresponding to the priority；
2) new arrival packet is inserted after its queue, calculates what is taken in current network according to Admission Control mechanism
The number of channel, if the number of channel taken in network is more than the number of channel that the packet can take, node enters " keeping out of the way wait " shape
State, otherwise node entrance " send head of the queue to be grouped " state.
3) node is in " keeping out of the way wait " state, if there is new be grouped into reach, if corresponding queue is less than inserting the queue
In, the packet is otherwise abandoned, " sending head of the queue packet " state is entered when having respective free channel；
4) in " send head of the queue packet " state, if there is new be grouped into reach, if corresponding queue is less than inserting the queue
In, otherwise abandon the packet；
5) after " being sent " state, if all queues are sky, node enters " initialization/free time " state；If all teams
Non-NULL is classified as, then calculates the number of channel taken in current network, is grouped if the number of channel taken in network is less than in queue
The number of channel that can be taken, then node entrance " sending head of the queue packet " state, otherwise enters " keeping out of the way wait " state..
Fig. 3 is multichannel dynamically distributes model schematic.Multichannel dynamically distributes model is the core control of the MAC protocol
Mechanism, p (p=1,2 ..., m ..., M) is made to represent the priority of packet, wherein p=1 highest priority, p=M priority
It is minimum.Make λTRepresent total packet arrival rate, λmPriority p=m packet arrival rate is represented, therefore
λT=λ1+λ2+…+λm+…+λM (1)
N is made to represent total channel number in network, Γ is the maximum dynamic channel reservation number that can be reserved, and its right to occupation is based on packet
Priority.The fixed shared channels of remaining N- Γ are shared by all priority packet equalitys.In order to obtain channel utilization
High-performance, Γ numerical value can not set excessive.
In the model, it is represented by for the dynamic channel reservation number of priority p=1 packet reservations：
The dynamic channel reservation number reserved jointly for priority p=1,2 packets is represented by：
For priority p=1,2 ..., reserved dynamic channel reservation number is represented by jointly for m packets：
So, Γ is represented by：
In addition to N- Γ shared channels,Individual channel is also shared by all priority packet equalitys.At Γ
In channel reservation, priority p=m packets number of available channels is represented by：
Therefore, the total number of available channels of priority p=m packets is：
Nm=N- Γ+ym(t) (7)
Formula (2)-(7) show in the distribution model, to different priorities be grouped the distributed number of channel be not it is fixed,
But by parameter lambdam、λT, N and Γ together decided on.In the case of given N and Γ, priority p=m is grouped total available channel
Number can be calculated by estimating the method for packet arrival rate.
The calculating of Γ optimal values there is several methods that, wherein most easy method is calculated using channel utilization.Γ's takes
Value can dynamically be adjusted by desired minimum channel utilization rate, channel congestion situation, and Γ initial value.Assuming that ηminWith
ηpDesired minimum channel utilization rate and current channel utilization are represented respectively, and Γ optimal values can be calculated by following formula：
Wherein, Γ0Represent Γ initial value.Formula (8) provides a kind of simplicity that Γ optimal values are calculated under dynamic network condition
Method.When the currency of channel utilization is less than desired minimum channel utilization rate value, system can be by reducing Γ numerical value
To be adjusted.
Fig. 4 is Admission Control mechanism flow chart.When priority p=m be grouped into up to when, the mechanism is reached using being grouped into
Rate algorithm for estimating estimates the arrival rate of the priority packet, and calculates maximum available channel number Nm.If busy channel number is small
In Nm, then immediately by the grouped access channel；If busy channel number is more than or equal to Nm, then the packet is performed and keeps out of the way calculation
Method.
Here a kind of packet arrival rate algorithm for estimating (Packets Arrival Rate Estimation are used
Algorithm, PAREA) each priority packet arrival rate in network estimated in real time.In order to estimate packet arrival rate,
Need to observe the nearest n+1 arrival packet of each priority.Here makeThe i-th -1 and i-th is represented in priority p=m packets
Reach the time interval between packet.Therefore, each priority packet take n value calculate two it is adjacent reach packet between
Average time interval.Wherein,Represent the packet reached recently in the priority packet.
In priority p=m packets, the nearest n+1 average time interval reached in packet between two adjacent packets can table
It is shown as：
To in formula (9) onExpectation is asked, can be obtained
Wherein △ tmFor true value, this showsFor unbiased esti-mator.
Reached and be grouped according to nearest n+1, the average packet arrival rate of priority p=m packets is represented by：
Due toFor unbiased esti-mator, λmAlso it is unbiased esti-mator.Therefore, the λ in formula (11)mIt is exactly priority p=m packets
The estimate of arrival rate.According to formula (4)-(6), (9)-(11), formula (7) is represented by：
Here, packet only is reached to obtain network real-time traffic situation by nearest n+1, when new being grouped into reaches
Afterwards, the estimate of the priority packet arrival rate is just updated.Formula (12) shows that packet number of available channels is to rely on this
Priority packet arrival rate λm, N and Γ and dynamic change.
Fig. 5 is the Markov chain model state transition diagram of multichannel dynamically distributes.Define 1/ μ for average channel take when
Between, it obeys exponential distribution.Make PiExpression system is in state i probability.Therefore, system mode equilibrium equation is：
In the model, for priority p=m packet, if the packet count sent in channel is more than or equal to
Nm, then newly arrived packet will just perform back off algorithm.N1The maximum available channel number being grouped for limit priority (p=1),
NmFor the maximum available channel number of lowest priority (p=m) packet.Only as whole number of channel N (N=N in network1) all by
During occupancy, newly arrived limit priority will just perform back off algorithm.
It can show that the mathematic(al) representation of probability is kept out of the way in priority p=m packets by queueing theory analysis.Formula (14) gives
Limit priority (p=1) is grouped the mathematic(al) representation for keeping out of the way probability, and formula (15) gives priority (p=2,3 ..., m ..., M)
Packet keep out of the way the mathematic(al) representation of probability.
Wherein,
The present invention proposes a kind of multipriority multi-channel MAC protocols perceived based on channel status, and the agreement combines more
Priority multiqueue dispatching mechanism, Admission Control mechanism and multichannel dynamically distributes model, ensureing all kinds of priority industry
Channel utilization is improved on the basis of business QoS Differentiated Services.The present invention is important as one of unmanned plane MANET MAC protocol
Algorithm, there is high-priority service QoS guarantee and multi-priority services service differentiation ability, can also be applied to other multipriority
Business simultaneously deposits transmission, and in the cordless communication network very high to high-priority service real-time and reliability requirement.
Claims (6)
1. a kind of multipriority multi-channel medium access control protocol based on channel-aware, includes multichannel dynamically distributes mould
Type, the multichannel dynamically distributes model are that N number of channel is divided into Γ dynamic channel reservation and the fixed shared letters of N- Γ
Road, fixed shared channel are shared by the packet equality of all different priorities, dynamic channel reservation according to below equation for it is each not
The packet reservation number of channel of same priority：
Wherein, m is the priority level of current group, and M is total number of degrees of priority,λTRepresent total packet
Arrival rate, λmRepresent the arrival rate of current priority packet.
2. a kind of multipriority multi-channel medium access control protocol based on channel-aware according to claim 1, its
It is characterised by：
<mrow>
<mi>&Gamma;</mi>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>&Gamma;</mi>
<mn>0</mn>
</msub>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>&eta;</mi>
<mi>p</mi>
</msub>
<mo>&GreaterEqual;</mo>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>&Gamma;</mi>
<mn>0</mn>
</msub>
<mfrac>
<mrow>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msub>
</mrow>
<mrow>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>&eta;</mi>
<mi>p</mi>
</msub>
</mrow>
</mfrac>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>&eta;</mi>
<mi>p</mi>
</msub>
<mo><</mo>
<msub>
<mi>&eta;</mi>
<mrow>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
Wherein, Γ0Represent Γ initial value, ηminRepresent desired minimum channel utilization rate, ηpCurrent channel utilization.
3. a kind of multipriority multi-channel medium access control protocol based on channel-aware according to claim 1, its
It is characterised by：
<mrow>
<msub>
<mi>&lambda;</mi>
<mi>m</mi>
</msub>
<mo>=</mo>
<mfrac>
<mi>n</mi>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>n</mi>
</munderover>
<msubsup>
<mi>&Delta;t</mi>
<mi>i</mi>
<mi>m</mi>
</msubsup>
</mrow>
</mfrac>
<mo>,</mo>
</mrow>
Wherein,Represent the i-th -1 and i-th time interval reached between packet in current priority packet.
4. a kind of multipriority multi-channel medium access control protocol based on channel-aware according to claim 1, its
It is characterised by：State of the arrival of packet depending on node；
Packet is then inserted queue by node in " initialization/free time " state；
Node is in " keeping out of the way wait " state, if there is new be grouped into reach, if queue less than, will packet insertion queue, otherwise
Abandon the packet；
Node is in " send head of the queue packet " state, if there is new be grouped into reach, if corresponding queue less than, insert in the queue,
Otherwise the packet is abandoned.
5. a kind of multipriority multi-channel medium access control protocol based on channel-aware according to claim 4, its
The state for being characterised by node is by Admission Control mechanism control, the Admission Control mechanism：
In " initialization/free time " state, new reach is grouped after insertion queue node, calculates the letter taken in current network
Road number, if the number of channel taken in network is more than the number of channel that the packet can take, node enters " keeping out of the way wait " state,
Otherwise node enters " sending head of the queue packet " state；
Node calculates the number of channel taken in current network, if the channel taken in network in " keeping out of the way wait " state
Number is less than the number of channel that is grouped and can take in queue, then node enters " sending head of the queue packet " state；
In " sending head of the queue packet " state, after packet transmission, if all queues are sky, node enters " initial node
Change/free time " state；If all queues are non-NULL, the number of channel taken in current network is calculated, if taken in network
The number of channel is less than the number of channel that is grouped and can take in queue, then node enters " sending head of the queue packet " state, otherwise enters and " keeps out of the way
Wait " state.
6. a kind of multipriority multi-channel medium access control protocol based on channel-aware according to claim 1, its
It is characterised by that queue there are M, after packet reaches in the queue according to corresponding to inserting priority level.
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 true CN107659940A (en) | 2018-02-02 |
| CN107659940B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108614577A (en) * | 2018-05-30 | 2018-10-02 | 中国联合网络通信集团有限公司 | The information transferring method and device of unmanned plane |
| CN109640397A (en) * | 2019-01-11 | 2019-04-16 | 上海微波技术研究所（中国电子科技集团公司第五十研究所） | Quality-of-service based long range multichannel communication accidental access method |
| CN110597294A (en) * | 2019-10-14 | 2019-12-20 | 深圳市元征科技股份有限公司 | Unmanned aerial vehicle and cluster system thereof |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2369755A2 (en) * | 2010-03-23 | 2011-09-28 | Acer Incorporated | Method of multichannel media access control |
| CN103096483A (en) * | 2013-01-04 | 2013-05-08 | 大连理工大学 | Media access control (MAC) layer channel dynamic distribution method for Ad Hoc network |
| CN103200623A (en) * | 2013-03-29 | 2013-07-10 | 北京邮电大学 | Decision-making method for regulating reserved channels dynamically in cognitive radio and implementation device |
-
2017
- 2017-10-18 CN CN201710978179.1A patent/CN107659940B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2369755A2 (en) * | 2010-03-23 | 2011-09-28 | Acer Incorporated | Method of multichannel media access control |
| CN103096483A (en) * | 2013-01-04 | 2013-05-08 | 大连理工大学 | Media access control (MAC) layer channel dynamic distribution method for Ad Hoc network |
| CN103200623A (en) * | 2013-03-29 | 2013-07-10 | 北京邮电大学 | Decision-making method for regulating reserved channels dynamically in cognitive radio and implementation device |
Non-Patent Citations (1)
| Title |
|---|
| 高晓琳，晏坚，陆建华: "《一种航空Ad hoc网络优先级权重速率控制算法》", 《清华大学学报（自然科学版）》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108614577A (en) * | 2018-05-30 | 2018-10-02 | 中国联合网络通信集团有限公司 | The information transferring method and device of unmanned plane |
| CN108614577B (en) * | 2018-05-30 | 2021-02-09 | 中国联合网络通信集团有限公司 | Information transmission method and device for unmanned aerial vehicle |
| CN109640397A (en) * | 2019-01-11 | 2019-04-16 | 上海微波技术研究所（中国电子科技集团公司第五十研究所） | Quality-of-service based long range multichannel communication accidental access method |
| CN110597294A (en) * | 2019-10-14 | 2019-12-20 | 深圳市元征科技股份有限公司 | Unmanned aerial vehicle and cluster system thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107659940B (en) | 2021-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ni et al. | Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks | |
| US20070189298A1 (en) | Distributed wireless network with dynamic bandwidth allocation | |
| Cicconetti et al. | Bandwidth balancing in multi-channel IEEE 802.16 wireless mesh networks | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| CN101964758A (en) | Differentiated service-based queue scheduling method | |
| CN101286949A (en) | Wireless Mesh network MAC layer resource scheduling policy based on IEEE802.16d standard | |
| WO2007071198A1 (en) | A distributed wireless network with dynamic bandwidth allocation | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| CN107659940A (en) | A kind of multipriority multi-channel medium access control protocol based on channel-aware | |
| 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 | |
| Goyal et al. | A scheduling and call admission control algorithm for WiMax mesh network with strict QoS guarantee | |
| CN114245424A (en) | Method and apparatus for a communication network | |
| De Moraes et al. | Analysis and evaluation of a new MAC protocol for broadband wireless access | |
| Ma et al. | Hierarchical scheduling framework for QoS service in WiMAX point-to-multi-point networks | |
| Nafaa | Provisioning of multimedia services in 802.11-based networks: facts and challenges | |
| EP1916801B1 (en) | Access point for centralised scheduling in a IEEE 802.11e WLAN | |
| Xiao et al. | Bandwidth sharing schemes for multimedia traffic in the IEEE 802.11 e contention-based WLANs | |
| WO2007051380A1 (en) | A METHOD OF SERVICE STREAM ACCEPTING CONTROL APPLIED IN WIRELESS COMMUNICATION SYSTEM and the system thereof | |
| CN102769914B (en) | Fair scheduling method based on mixed businesses in wireless network | |
| CN115413041A (en) | Centralized wireless ad hoc network resource allocation method and system | |
| Costa et al. | Comparing RT-WiFi and HCCA approaches to handle real-time traffic in open communication environments | |
| Berrahal et al. | A smart QoS-based traffic management for WBANs | |
| Penttinen et al. | Low-complexity distributed fair scheduling for wireless multi-hop networks | |
| Fan et al. | Admission control for variable bit rate traffic using variable service interval in IEEE 802.11 e WLANs |
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 |