Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Threshold adaptive adjustment method based on statistical priority multiple access

An adaptive adjustment and threshold technology, applied in the field of communications, can solve the problems of making judgments on access conditions, low channel utilization, and inability to effectively guarantee service access channels, so as to reduce channel load jitter and improve channel utilization.

Active Publication Date: 2020-08-25
XIDIAN UNIV
View PDF4 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although this method makes up for the problem of system capacity change, it still needs to know the proportion of service intensity of each priority. If the service changes or there is a sudden business situation, this method cannot effectively guarantee the access channel of each service
[0006] In summary, these existing methods are only applicable to network scenarios with known service ratios. When the service ratio is unknown or changes, the priority thresholds preset according to the service ratio will not be able to accurately assess the access status of each priority service. Making a decision may lead to more collisions due to the access load exceeding the upper limit of the system throughput, or low channel utilization

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Threshold adaptive adjustment method based on statistical priority multiple access
  • Threshold adaptive adjustment method based on statistical priority multiple access
  • Threshold adaptive adjustment method based on statistical priority multiple access

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0076] Example 1, in Figure 4 Threshold adjustment is performed in the adjustment scenario shown in (a).

[0077] Figure 4 (a) is a scenario where a certain priority has undergone multiple threshold adjustments, and the adjustment process is as follows:

[0078] First, the node detects that the probability of successful frame transmission P is less than P a Finally, according to step (5d), find a certain priority k whose threshold is greater than 0, and adjust its threshold to T k is the threshold before the adjustment of priority k;

[0079] Then, observe the value of P after the Δt time, and find that P is still less than P after the Δt time a , then adjust the threshold again to

[0080] Then, after a further time Δt, it is observed that P is greater than P b , then follow step (5e) to find the priority with the threshold less than T, the priority will still be the k priority, adjust the threshold

[0081] Finally, after multiple adjustments, P∈(P a ,P b ),...

Embodiment 2

[0082] Example 2, in Figure 4 Threshold adjustment is performed under the adjustment scenario shown in (b).

[0083] Figure 4 (b) is that the probability of successful frame transmission P is always less than P a In the scenario where two priorities are used for threshold adjustment, the adjustment process is as follows:

[0084] First, the node detects that the probability of successful frame transmission P is less than P a Finally, according to step (5d), find the priority k-1 whose threshold is greater than 0, and adjust where T k-1 is the threshold value before the adjustment of priority k-1;

[0085] Then, observe the value of P after every Δt time, and find that P is less than P a , then follow step (5d) to continuously lower the threshold of priority k-1 until T k-1 n =0, where T k-1 n is the threshold of k-1 priority adjusted n times;

[0086] Then, after a further time Δt, it is found that P is still less than P a , since the threshold of the current k-...

Embodiment 3

[0088] Example 3, in Figure 4 Threshold adjustment is performed in the adjustment scenario shown in (c).

[0089] Figure 4 (c) is that the probability of successful frame transmission P is always greater than P b In the scenario where two priorities are used for threshold adjustment, the adjustment process is as follows:

[0090] First, the node detects that the frame transmission success probability P is greater than P b Finally, according to step (5e), ​​find the priority k whose threshold value is less than T, and adjust where T k is the threshold size before priority k adjustment;

[0091] Then, observe the value of P after every Δt time, and find that P is greater than P b, at this time follow step (5e) to continuously increase the threshold of priority k until T k n = T, where T k n is the threshold value of k priority adjusted n times.

[0092] Then, after a further time Δt, it is found that P is still greater than P b , since the current k-priority thres...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a threshold adaptive adjustment method based on statistical priority multiple access, and mainly solves the problems that the prior art cannot deal with unknown service proportion or emergency service conditions, the channel utilization rate is low and the high-priority service transmission reliability is poor. According to the scheme, the method comprises the steps of 1) setting an upper bound T of a sending threshold of each priority queue; 2) by a node, counting transceiving information of the frame and periodically broadcasing the transceiving information to a neighbor node; 3) by the node, calculating a frame success transmission probability P according to the received neighbor node statistical information; 4) setting different stable intervals omega accordingto whether the current channel has the highest priority service transmission condition or not; and 5) comparing the omega value with the P value, adjusting the priority threshold value according to acomparison result, and returning to the step 2) to repeat the process. The method can be suitable for the emergency service conditions and unknown service proportion, each service can better access the channel, the channel utilization rate is effectively improved, and the service quality of the service is guaranteed.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a threshold self-adaptive adjustment method, which can be used in a link layer protocol or a MAC layer protocol. Background technique [0002] The multiple access protocol based on statistical priority is a breakthrough improvement on the traditional contention multiple access protocol. In this protocol, the channel no longer only has two states of "busy" or "idle", but divides the channel into multiple states according to the detected channel load. Such as figure 1 As shown, according to the load occupancy statistical value and the comparison result of each priority threshold, it is determined whether each priority service can access the channel: after the data of the node enters different priority data queues A according to the priority, the system starts from Select the first priority queue with data from high to low, compare the channel occupancy statistic...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W28/18H04L1/00
CPCH04W28/18H04L1/0006
Inventor 刘俊宇赵雄旺史琰盛敏朱炜张忠凯史斌
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com