CN113556825A - Polling method based on multi-attribute decision in point coordination - Google Patents

Polling method based on multi-attribute decision in point coordination Download PDF

Info

Publication number
CN113556825A
CN113556825A CN202110751915.6A CN202110751915A CN113556825A CN 113556825 A CN113556825 A CN 113556825A CN 202110751915 A CN202110751915 A CN 202110751915A CN 113556825 A CN113556825 A CN 113556825A
Authority
CN
China
Prior art keywords
sta
packet
method comprises
pcf
following
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
Application number
CN202110751915.6A
Other languages
Chinese (zh)
Other versions
CN113556825B (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.)
724th Research Institute of CSIC
Original Assignee
724th Research Institute of CSIC
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 724th Research Institute of CSIC filed Critical 724th Research Institute of CSIC
Priority to CN202110751915.6A priority Critical patent/CN113556825B/en
Publication of CN113556825A publication Critical patent/CN113556825A/en
Application granted granted Critical
Publication of CN113556825B publication Critical patent/CN113556825B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/04Scheduled access
    • H04W74/06Scheduled access using polling

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention provides a polling method based on multi-attribute decision in point coordination, which determines an STA polled by an AP at a specific time in a PCF and a data packet additionally sent when polling the STA. First, the AP calculates the urgency of transmitting a packet to each STA, which is related to the remaining validity period of the packet, the priority of the packet, and the length of the packet. Secondly, the AP calculates how urgent each STA is polled, which is related to the time the STA last polled, the number of data packets the STA sends, and the average snr at which the AP receives the STA signal. The AP solves the two values using a multi-attribute decision method of dynamic weighted summation, where each attribute weight is related to the position of the current time in the PCF period. The AP determines the STA polled at the current time based on the urgency of sending the data packet to each STA and the urgency of each STA being polled, and selects and sends the data packet with the maximum urgency in the corresponding transmission queue as the data packet sent by the current polling.

Description

Polling method based on multi-attribute decision in point coordination
Technical Field
The present invention relates to a scheduling policy in an infrastructure network, and more particularly, to a polling method for an AP in a PCF.
Background
The IEEE Std 802.11-1999 edition proposes two MAC layer channel access modes in the wireless local area network: a Distributed Coordination Function (DCF) and a Point Coordination Function (PCF), a work cycle of a whole Basic Service Set (BSS) may also be divided into two periods: a DCF period and a PCF period. In the DCF period, an Access Point (AP) and a mobile STAtion (STAtion) in the BSS Access a channel in a contention manner using a Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) protocol. In the PCF period, the AP controls the channel access of STAs in the entire BSS in a polling manner, and the non-polled STAs cannot transmit signals. The PCF operating mode avoids delays caused by channel access collisions and helps to guarantee the quality of service for a particular service.
To avoid sending too many frames at the time of polling, the IEEE Std 802.11-1999 standard utilizes an omni-directional antenna feature to combine polling, data transmission, and acknowledgement in one frame for transmission, thereby performing more polling in a limited time. The frames sent by the AP include CF-Poll (no Data), Data + CF-Poll, Data + CF-Ack + CF-Poll, and CF-Ack + CF-Poll (no Data), and the frames sent by the STA include Data, Data + CF-Ack, CF-Ack (no Data), and Null.
One important issue facing APs operating in PCF mode is the rules for polling STAs. The IEEE Std 802.11-1999 standard does not specify AP polling rules. The general approach is to poll the STAs in sequence and send the packets in sequence in the order in which they entered the queuing sequence. Although this method can ensure fairness among STAs (polling is performed every certain period), the impact of the polling sequence on the service quality is ignored. The STA often interacts with the remote server for various different types of services, which also have different requirements for quality of service. For example, the STA may simultaneously run services such as live video, web browsing, online gaming, file downloading, etc. The live video service has high requirements on transmission rate and time delay, but can tolerate a certain packet loss rate, while the online game service has high requirements on packet loss rate and time delay, but has low requirements on transmission rate. In order to ensure the service quality of each service, the AP operating in PCF mode should determine the STA polling at the current time and the data packet sent when polling the STA according to the attributes of each data packet and the service type carried by it.
When performing the polling decision, the AP needs to consider the following two problems in addition to the attribute of the packet itself. On the one hand, the polling rule of the AP should consider the characteristics of the wireless channel. The wireless channel has problems of interference, attenuation, etc., and packet interaction between the AP and the STA is not always successful. Under the condition that other conditions are consistent, the AP should poll the STA with better channel quality preferentially, so as to fully utilize the limited PCF period to transmit more information. On the other hand, the polling rule of the AP should consider the attributes of the STAs. The STA as a user terminal may also generate traffic data, which also has an important impact on the quality of service. Under other conditions, the AP should poll more STAs with more data packets to be sent, and ensure certain polling opportunities for other STAs.
Disclosure of Invention
The invention aims to solve the polling decision problem of the AP working in PCF mode in the wireless local area network, namely determining the STA polled by the AP at a specific moment in PCF time period and transmitting a data packet when polling the STA. The invention adopts a multi-attribute decision-making method of dynamic weighted summation to solve the problem, comprehensively considers the factors of the remaining validity period of the data packet, the priority of the data packet, the length of the data packet, the time from the STA to the last polling, the number of data packets to be sent by the STA, the average signal-to-noise ratio of the AP to receive the STA signal and the like, can effectively improve the service quality, and simultaneously ensures the fairness of the STAs.
In order to solve the technical problems, the invention is realized by the following technical scheme: the AP considers the following factors when determining the STA to be polled and the data packet to be sent: the method comprises the following steps of firstly determining the STA to be polled by adopting a dynamic weighted sum multi-attribute decision method, then determining the data packet sent when polling the STA, wherein the weight of each attribute is related to the position of the current time in a PCF time period, and the specific steps comprise:
step 1: AP calculates to STAiUrgency of transmission of data packet si,t
Step 2: AP computing STAiUrgency to be polled vi,t
And step 3: AP compute poll STAiIntensity w ofi,t=max{si,t,vi,t};
And 4, step 4: AP determines polling STA at current momentj′Wherein i ═ argmaxi=1,2,...,N{wi,t};
And 5: the AP judges whether the AP is to be sent to the STAi′If there is, the AP sends a Data + CF-Poll packet or a Data + CF-Ack + CF-Poll packet to the STAi′Wherein the data part is the destination address of STAi′And sending the data packet with the maximum urgency, otherwise, the AP sends the CF-Poll packet or the CF-Ack + CF-Poll packet to the STAi′
A BSS is provided with 1 AP and N (N is more than or equal to 1) STAs. The set of STAs is denoted as S, S ═ { STAi }, i ═ 1, 2. The AP maintains a transmission queue for each STA, in which data packets to be sent to each STA are stored. At time t, AP maintains STAiThe corresponding transmission queue is marked as
Figure BDA0003145037100000021
Figure BDA0003145037100000022
For a particular STAi
Figure BDA0003145037100000023
Each packet within has corresponding attributes including remaining validity period, priority, length, etc. When the AP polls the STAi, it needs to consider these factors comprehensively and determine the data packet transmission that can improve the service quality most. The problem can be modeled as a multi-attribute decision problem. And (4) aggregating various attributes of the decision-making object into a utility value in the multi-attribute decision-making, wherein the object with the highest utility value is the target of the decision-making. Defining AP to STAiUrgency of transmission of data packet si,tIs composed of
Figure BDA0003145037100000024
Maximum utility value of each data packet in the packet. Also, the AP records the STAiIncluding STAiTime since last polled, STAiNumber of data packets to be transmitted, AP receiving STAiThe average signal-to-noise ratio of the signal, which together determine the STAiUrgency to be polled vi,tThe problem can also be modeled as a multi-attribute decision problem. In summary, the polling decision of the AP is related to two factors: the urgency of the AP to transmit packets to the STAs and the urgency of the STAs to be polled. The AP considers these two factors together to finally determine the STA to be polled and the data packet to be transmitted when polling the STA.
Due to the limited PCF time period, the location of the PCF time period at the current time also affects the polling decision of the AP. When the PCF time period is about to end, the AP should give priority to how to transmit more packets in the remaining time period or to guarantee the transmission quality in the remaining time period when making a decision. Therefore, the polling decision of the AP is a dynamic multi-attribute decision problem, that is, the position of the PCF period at the current time also affects the decision result under the condition that other factors are unchanged.
At time t, the AP operates in PCF mode, and determines the STA to be polled and the data packet sent when polling the STA according to the following steps:
step 1: AP calculates to STAiUrgency of transmission of data packet si,t(i=1,2,...,N):
(1) AP culling
Figure BDA0003145037100000031
And the remaining data packets with the validity period less than or equal to zero. For the
Figure BDA0003145037100000032
Inner data packet
Figure BDA0003145037100000033
Defining a residual validity period ui,j,t=tremove,i,j-t, wherein tremove,i,jIndicating the absolute time at which the packet failed, is specified by the source node when generating the packet. AP computation
Figure BDA0003145037100000034
The remaining validity period of each data packet in the packet sequence, and
Figure BDA0003145037100000035
middle removing ui,j,tData packets less than or equal to 0 to obtain transmission queue
Figure BDA0003145037100000036
j=1,2,...,Ji,t(Ji,t≥0)。
(2) For the
Figure BDA0003145037100000037
Each data packet in
Figure BDA0003145037100000038
Its following three attributes were calculated:
a) residual effective period ui,j,t: some services require that packets be delivered to the destination node within a certain time limit. The source node specifies a validity period when generating the packet, and the service is valid when the packet is delivered to the destination node within the validity period. When the validity period has expired without the packet reaching the destination node, the intermediate node (router, AP, etc.) discards the packet. Definition ui,j,t=tremove,i,j-t, wherein tremove,i,jIndicating the absolute time at which the packet failed, is specified by the source node when generating the packet.
b) Priority pi,j: when the upper layer protocol generates a data packet, the priority p of the data packet is determined according to a certain strategyi,j∈[0,1]0 represents the lowest priority, and 1 represents the highest priority.
c) Length li,j: the packet length refers to the length of an upper layer protocol frame carried by the MAC layer, in bytes. In the IEEE 802.11 standard, this length is referred to as a MAC layer Service Data Unit (MSDU).
(3) Because the dimensions of the three attributes of the data packet and the influence on the urgency of the AP to send each data packet are different, the weighted sum multi-attribute decision needs to be made on the three attributesThe attribute is normalized to obtain normalized value
Figure BDA0003145037100000039
And
Figure BDA00031450371000000310
a) for ui,j,tThe normalization method comprises the following steps: u. ofi,j,tThe smaller the packet size, the closer the current time is to the expiration time of the validity period of the corresponding packet, and the stronger the urgency of transmitting the packet. Meanwhile, the validity period (time from generation to expiration) of each packet is different from one packet to another, and therefore the following normalization method is adopted:
Figure BDA00031450371000000311
wherein
Figure BDA0003145037100000041
It indicates the packet validity length, tgenerate,i,jAs data packets
Figure BDA0003145037100000042
At the absolute time of generation at the source node.
Figure BDA0003145037100000043
Indicating the relative persistence time of the packet. In the case where a packet is not invalidated, the longer the relative persistence time, the higher the urgency of the AP to transmit the packet. f. ofu,n(x) Is defined as
Figure BDA0003145037100000044
b) For pi,jThe normalization method comprises the following steps: the value range of the priority is [0, 1 ]]And the higher the priority, the higher the urgency of the AP to transmit the packet, so the normalized value
Figure BDA0003145037100000045
c) For li,jThe normalization method comprises the following steps: due to the fact that wireless channel loss is large and interference is prone to happen, certain packet loss rate exists in data packet transmission. To increase the transmission success rate, the node should preferentially send a shorter packet. However, the packet length difference of different services is large, and the normalization process needs to be performed by using the average packet length. Note LtIs the average length of the data packets in all transmission queues in the AP, then
Figure BDA0003145037100000046
Indicating the relative length of the data packet. Calculated by the following formula
Figure BDA0003145037100000047
Figure BDA0003145037100000048
wherein
Figure BDA0003145037100000049
(4) Determining the weight omega of the three attributes according to the current time tu,t、ωp,t、ωl,t. Calculating the weight ωu,t、ωp,t、ωl,tFirst determine the boundary value of each attribute weight at the beginning of PCF time interval
Figure BDA00031450371000000410
And boundary value at the end of PCF period
Figure BDA00031450371000000411
Figure BDA00031450371000000412
They firstly satisfy the following requirements for weight:
Figure BDA00031450371000000413
Figure BDA00031450371000000414
at the beginning of the PCF, the AP prioritizes the remaining validity period and priority of the packets, and towards the end of the PCF, the AP prioritizes the packet length to send as many packets as possible during the remaining period. Therefore, the boundary values for the set weights satisfy the following relationship:
Figure BDA00031450371000000415
Figure BDA00031450371000000416
let the starting time of the current PCF time interval be tstartPCF period length of TpcfThen ω is calculated according to the following formulau,t、ωp,t、ωl,t
Figure BDA00031450371000000417
Figure BDA00031450371000000418
Figure BDA00031450371000000419
The above formula defines the change rule of the weights of the three attributes, wherein ω isu,t and ωp,tDecreases linearly with increasing t, and ωl,tThe linear increase with the increase of t reflects the change of the influence degree of different attributes of the AP in decision making over time.
(5) Based on the normalized values
Figure BDA00031450371000000420
And corresponding three attribute weights omegau,t、ωp,t、ωl,tObtaining AP sending data packet by using weighted summation method
Figure BDA00031450371000000421
S degree of urgency ofi,j,tComprises the following steps:
Figure BDA0003145037100000051
(6) by definition, an AP towards an STAiUrgency of transmission of data packet si,tIs composed of
Figure BDA0003145037100000052
Maximum utility value of each data packet therein, i.e.
Figure BDA00031450371000000518
Step 2: AP computing STAiUrgency to be polled vi,t(i=1,2,...,N):
(1) AP calculates corresponding STAiThe following three attributes:
a) time c since last polledi,t:ci,t=t-ti, wherein tiRepresents the absolute time that STAi was last polled, which is recorded by the AP;
b) number of data packets to be transmitted ri,t: at STAiThe corresponding field in the format of the frame (Data + CF-Ack, Data, CF-Ack, Null) sent to the AP records the transmission queue of the STA
Figure BDA0003145037100000053
(
Figure BDA0003145037100000054
Is a transmission queue from which failed packets have been dropped,
Figure BDA0003145037100000055
) Number of data packets contained in (a)Does not contain the currently transmitted data packet), the AP can record the value after receiving the packet;
c) AP receiving STAiAverage signal-to-noise ratio q of signali,t: AP records last M times of receiving STAiThe signal-to-noise ratio of the reply packet is calculated, and the average value is calculated to obtain qi,t
(2) Normalizing the three attributes to obtain normalized values
Figure BDA0003145037100000056
And
Figure BDA0003145037100000057
a) for ci,tThe normalization method comprises the following steps: the longer the time is from the last time of being polled, the higher the urgency is for the corresponding STA to be polled, so that the data packets generated by the STA can be transmitted in time. Remember htFor the average time interval in which the STAs are polled, then
Figure BDA0003145037100000058
Representation of STAiThe relative time interval to be polled is calculated using the following formula
Figure BDA0003145037100000059
Figure BDA00031450371000000510
wherein
Figure BDA00031450371000000511
b) For ri,tThe normalization method comprises the following steps: STA (station)iThe more data packets to be sent, the more STAsiThe higher the urgency to be polled. Note RtThe number of packets waiting to be transmitted is averaged for each STA, i.e.
Figure BDA00031450371000000512
Then
Figure BDA00031450371000000513
Representation of STAiRelative to the number of packets waiting to be sent, the following formula is used to calculate
Figure BDA00031450371000000514
Figure BDA00031450371000000515
wherein fr,n(x)=fc,n(x);
c) For qi,tThe normalization method comprises the following steps: STA received by APiThe larger the average signal-to-noise ratio of the signal, it means that the AP sends to the STAiIs encapsulated by STAiThe greater the probability of correct reception, and thus the AP polls the STAsiThe higher the tendency of (c). Note qmax,t=maxi=1,2,...,N{qi,t},qmin,t=mini=1,2,...,N{qi,tIs calculated according to the following formula
Figure BDA00031450371000000517
Figure BDA00031450371000000516
(3) Determining the weight omega of the three attributes according to the current time tc,t、ωr,t、ωq,t. Calculating the weight ωc,t、ωr,t、ωq,tFirst determine the boundary value of each attribute weight at the beginning of PCF time interval
Figure BDA0003145037100000061
And boundary value at the end of PCF period
Figure BDA0003145037100000062
Figure BDA0003145037100000063
They firstly satisfy the following requirements for weight:
Figure BDA0003145037100000064
Figure BDA0003145037100000065
at the beginning of PCF, the AP prioritizes the time each STA was polled last and the number of data packets to be sent, and towards the end of PCF, the AP prioritizes the average snr of the received STA signals to send as many packets as possible during the remaining time period. Therefore, the boundary values for the set weights satisfy the following relationship:
Figure BDA0003145037100000066
let the starting time of the current PCF time interval be tstartPCF period length of TpcfThen ω is calculated according to the following formulac,t、ωr,t、ωq,t
Figure BDA0003145037100000067
Figure BDA0003145037100000068
Figure BDA0003145037100000069
The above formula defines the change rule of the weights of the three attributes, wherein ω isc,t and ωr,tDecreases linearly with increasing t, and ωq,tThe linear increase with the increase of t reflects the change of the influence degree of different attributes of the AP in decision making over time.
(4) Based on the normalized values
Figure BDA00031450371000000610
And corresponding three attribute weights omegac,t、ωr,t、ωq,tObtaining STA by applying weighted summation methodiUrgency to be polled vi,tComprises the following steps:
Figure BDA00031450371000000611
and step 3: for each STAiAP calculates s corresponding to the APi,t and vi,tWhich respectively characterize the AP-polling STA from different anglesiThe urgency of the application. Defining AP polling STAsiIntensity w ofi,tThe following were used:
wi,t=max{si,t,vi,t} (18)
wi,tcomprehensively reflects AP polling STAiThe urgency of the application.
And 4, step 4: AP determines polling STA at current momenti′Wherein i ═ argmaxi=1,2,...,N{wi,t}。
And 5: after determining the polled STA, the AP needs to determine the data packet sent to the STA. Judgment of
Figure BDA00031450371000000612
Whether or not it is empty, if
Figure BDA00031450371000000613
If null, the AP sends a CF-Poll frame (when the last polled STA returned a frame containing no Data portion) or a CF-Ack + CF-Poll frame (when the last polled STA returned a frame containing a Data portion) to the STAi′Otherwise, the AP sends a Data + CF-Poll frame (when the last frame returned by the polled STA contains no Data portion) or a Data + CF-Ack + CF-Poll frame (when the last frame returned by the polled STA contains a Data portion) to the STAi′The Data part is a Data packet
Figure BDA00031450371000000614
wherein
Figure BDA00031450371000000615
The decision process of the AP is ended up to this point.
The invention has the following beneficial effects:
1. the invention can effectively reduce the service time delay and improve the service quality. The invention comprehensively considers two factors: the attribute of the data packet to be sent cached by the AP and the attribute of each STA in the BSS. The attributes of the data packets include the remaining validity period, priority and length, and the attributes of the STA include the time since the last polling, the number of data packets to be transmitted and the average signal-to-noise ratio of the STA signal received by the AP.
2. The invention dynamically adjusts the weight of each attribute according to the position of the current time in the PCF time period, and reflects the change of the influence degree of different attributes on the decision at different times in the PCF.
3. The method is simple and easy to implement, and a large amount of calculation load can not be introduced.
4. The invention is compatible with IEEE Std 802.11-2016 standard. The MAC frame header defined by the IEEE Std 802.11-2016 standard contains a QoS Control field. When the STA sends Data + CF-Ack, Data, CF-Ack and Null frames, the Data volume of the Data to be sent can be added in the field, and the AP can obtain the information.
Drawings
Fig. 1 is an AP polling decision flow diagram;
FIG. 2 is a diagram of AP calculation si,tA flow chart of (1);
FIG. 3 is AP calculation vi,tIs described.
Detailed Description
The invention discloses a polling method based on multi-attribute decision in point coordination, which determines an STA polled by an AP at a specific time and a data packet additionally transmitted when the STA is polled. The polling decision of the AP is related to two factors: the urgency of the AP to transmit packets to the STAs and the urgency of the STAs to be polled. The whole polling decision problem is modeled as a multi-attribute decision problem, and the factors of the remaining validity period of a data packet, the priority of the data packet, the length of the data packet, the time from the STA to the last polling, the number of data packets to be sent by the STA, the average signal-to-noise ratio of signals of the AP receiving STA and the like are considered. And in consideration of the influence of the position of the PCF time period at the current moment on the decision result, a dynamic weighted summation method is adopted to solve the multi-attribute decision problem. The invention discloses a polling decision execution step of an AP, definition of each attribute, a normalization method, a weight determination method and the like. The invention is further illustrated by the following figures and examples. The embodiments are carried out on the premise of the technical scheme of the invention, and detailed embodiments and processes are given, but the scope of the invention is not limited to the following embodiments.
When the AP executes the polling method of the present invention, the AP, the STA, or the protocol in which they operate need to have the following functions:
1. when an application layer protocol of a source node generates a data packet, the generation time, the failure time and the priority of the data packet need to be added to the data packet;
the AP needs to record the latest polling moment of each STA;
3, the AP needs to record the average time interval of all the polled STAs;
the MAC layer protocol supports the STA to notify the AP of the number of data packets to be sent, and the AP acquires and records the information when receiving the reply frame of the STA;
and 5, the AP needs to record the signal-to-noise ratio of the latest M times of receiving reply packets of each STA, and calculates to obtain the average signal-to-noise ratio.
The AP decision process of the present invention is shown in fig. 1, which includes five steps:
step 1: AP calculates to STAiUrgency of transmission of data packet si,t(i 1, 2.., N), fig. 2 gives a detailed process of the calculation;
step 2: AP computing STAiUrgency to be polled vi,t(i 1, 2.., N), fig. 3 gives a detailed process of the calculation;
and step 3: AP computing polling STAiIntensity w ofi,t=max{si,t,vi,t}(i=1,2,...,N);
And 4, step 4: AP determines polling STA at current momenti′Wherein i ═argmaxi=1,2,...,N{wi,t};
And 5: judgment of
Figure BDA0003145037100000081
Whether or not it is empty, if
Figure BDA0003145037100000082
If null, the AP sends a CF-Poll frame (when the last polled STA returned a frame containing no Data portion) or a CF-Ack + CF-Poll frame (when the last polled STA returned a frame containing a Data portion) to the STAi′Otherwise, the AP sends a Data + CF-Poll frame (when the last frame returned by the polled STA contains no Data portion) or a Data + CF-Ack + CF-Poll frame (when the last frame returned by the polled STA contains a Data portion) to the STAi′Wherein the Data part is a Data packet
Figure BDA0003145037100000083
Figure BDA0003145037100000085
The decision process of the AP is ended up to this point.
Assume that 1 BSS contains 1 AP and 4(N ═ 4) STAs. The whole BSS works in a DCF and PCF alternative mode, the repetition period is 1s, the DCF time interval and the PCF time interval respectively occupy 500ms, namely Tdcf=Tpcf500 ms. Assume that the current time is tcurrent3800ms, the AP operates in PCF mode, and the current PCF period is from tstartStarting at 3500 ms. At tcurrentAt this time, the AP determines the polling STA and the data packet transmitted when polling the STA according to the flow shown in fig. 1. The AP first executes step 1, calculates the direction STAiUrgency of transmission of data packet si,t(i ═ 1, 2, 3, 4). The various attributes of the packets to be sent by the AP to each STA are shown in table 1, where the failed packets have been rejected. The attributes of each normalized packet are shown in table 2.
Table 1 various attributes of data packets to be sent by an AP to each STA
Figure BDA0003145037100000084
Table 2 normalized attributes of each packet
Figure BDA0003145037100000091
The attributes of each STA recorded by the AP are shown in table 3. The normalized class attributes of each STA are shown in Table 4, where ht=245ms。
Table 3 AP recorded various attributes of each STA
Figure BDA0003145037100000092
Table 4 normalized attributes of STAs
Figure BDA0003145037100000093
The boundary values for the weights of the attributes are set as follows:
Figure BDA0003145037100000094
Figure BDA0003145037100000095
at tcurrentAt time 3800ms, the weights of the attributes are calculated according to equations (5) to (7) and (14) to (16)
ωu,t=0.34,ωp,t=0.28,ωl,t=0.38,ωc,t=0.24,ωr,t=0.28,ωq,t=0.48 (21)
According to table 2, table 4 and formula (21), the urgency s of the AP to send the data packet to each STA is calculatedi,tUrgency v of each STA being polledi,tAnd the strength w of AP polling each STAi,tAs shown in table 5. According to the rule described in FIG. 1, at tcurrentAt time 3800ms, the AP decides to poll STA3 and sends the 1 st packet in the STA3 transmission queue at the time of the poll.
TABLE 5 s of STAsi,t、vi,t and wi,tValue of
Figure BDA0003145037100000101

Claims (7)

1. A polling method based on multi-attribute decision in point coordination is characterized in that: the AP considers the following factors when determining the STA to be polled and the data packet to be sent: the method comprises the following steps of firstly determining the STA to be polled by adopting a dynamic weighted sum multi-attribute decision method, then determining the data packet transmitted when polling the STA, wherein the weight of each attribute is related to the position of the current time in a PCF time period, and the steps comprise:
step 1: AP calculates to STAiUrgency of transmission of data packet si,t
Step 2: AP computing STAiUrgency to be polled vi,t
And step 3: AP computing polling STAiIntensity w ofi,t=max{si,t,vi,t};
And 4, step 4: AP determines polling STA at current momenti′Wherein i ═ argmaxi=1,2,...,N{wi,t};
And 5: the AP judges whether the AP is to be sent to the STAi′If there is, the AP sends a Data + CF-Poll packet or a Data + CF-Ack + CF-Poll packet to the STAi′Wherein the data part is the destination address of STAi′And sending the data packet with the maximum urgency, otherwise, the AP sends the CF-Poll packet or the CF-Ack + CF-Poll packet to the STAi′
2. The method according to claim 1, wherein the method comprises: the AP adopts a dynamic weighted sum multi-attribute decision method to calculate the STAiUrgency of transmission of data packet si,tThe method comprises the following steps:
(1) for and STAiCorresponding transmission queue
Figure FDA0003145037090000011
Each data packet in
Figure FDA0003145037090000012
The following three attributes were calculated:
a) residual effective period ui,j,t:ui,j,t=tremove,i,j-t, wherein tremove,i,jIndicating an absolute time of failure of the data packet, as determined by the source node when generating the data packet;
b) priority pi,j: calibrated by upper layer protocol, pi,j∈[0,1]0 represents the lowest priority, 1 represents the highest priority;
c) length li,j: the number of bytes of the MAC layer service data unit;
(2) normalizing the three attributes to obtain normalized values
Figure FDA0003145037090000013
And
Figure FDA0003145037090000014
(3) determining the weight omega of three attributes according to the current timeu,t、ωp,t、ωl,t
(4) Calculating AP sending data packet
Figure FDA0003145037090000015
The urgency of (2):
Figure FDA0003145037090000016
(5) computing AP to STAiUrgency of sending a packet:
Figure FDA0003145037090000017
3. the method according to claim 1, wherein the method comprises: the AP adopts a dynamic weighted sum multi-attribute decision method to calculate the STAiUrgency to be polled vi,tThe method comprises the following steps:
(1) AP calculates corresponding STAiThe following three attributes:
a) time c since last polledi,t:ci,t=t-ti, wherein tiRepresentation of STAiThe absolute time of last polling;
b) number of data packets to be transmitted ri,t: the information is transmitted by STAiProviding the AP;
c) AP receiving STAiAverage signal-to-noise ratio q of signali,t: AP records STA received last M timesiThe signal-to-noise ratio of the reply packet is calculated, and the average value is calculated to obtain qi,t
(2) Normalizing the three attributes to obtain normalized values
Figure FDA0003145037090000021
And
Figure FDA0003145037090000022
(3) determining the weight omega of three attributes according to the current timec,t、ωr,t、ωq,t
(4) Computing STAiUrgency to be polled vi,t
Figure FDA0003145037090000023
4. The method according to claim 2, wherein the method comprises: the remaining effective period ui,j,tPriority pi,jAnd length li,jThe normalization method comprises the following steps:
a) for ui,j,tThe normalization method comprises the following steps: note tgenerate,i,jAs data packets
Figure FDA0003145037090000024
At the absolute time, t, generated by the source nodevalid,i,jFor the length of the validity period of the data packet, tvalid,i,j=tremove,i,j-tgenerate,i,jCalculated according to the following formula
Figure FDA0003145037090000025
Figure FDA0003145037090000026
wherein :
Figure FDA0003145037090000027
b) for pi,jThe normalization method comprises the following steps:
Figure FDA0003145037090000028
c) for li,jThe normalization method comprises the following steps: note LtThe average length of the data packets in all transmission queues in the AP is calculated according to the following formula
Figure FDA0003145037090000029
Figure FDA00031450370900000210
wherein :
Figure FDA00031450370900000211
5. the method according to claim 2, wherein the method comprises: the remaining effective period ui,j,tPriority pi,jAnd length li,jWeight ω of (d)u,t、ωp,t and ωl,tIn relation to the current time t, it includes:
a) let omegau,t、ωp,t、ωl,tThe initial values at the beginning of the PCF period are
Figure FDA00031450370900000212
The value at the end of the PCF period is
Figure FDA00031450370900000213
And satisfy
Figure FDA00031450370900000214
Figure FDA00031450370900000215
b) Let the starting time of the current PCF time interval be tstartPCF period length of Tpcfω is calculated according to the following formulau,t、ωp,t、ωl,t
Figure FDA00031450370900000216
Figure FDA00031450370900000217
Figure FDA00031450370900000218
6. The method of claim 3, wherein the method comprises: the time c since the last pollingi,tNumber r of data packets to be transmittedi,tAnd AP receiving STAiAverage signal-to-noise ratio q of signali,tThe normalization method comprises the following steps:
a) for ci,tThe normalization method comprises the following steps: remember htThe average time interval for which each STA is polled is calculated as follows
Figure FDA0003145037090000031
Figure FDA0003145037090000032
wherein :
Figure FDA0003145037090000033
b) for ri,tThe normalization method comprises the following steps: note RtThe number of packets waiting to be transmitted for each STA on average is calculated as follows
Figure FDA0003145037090000034
Figure FDA0003145037090000035
wherein fr,n(x)=fc,n(x);
c) For qi,tThe normalization method comprises the following steps: note qmax,t=maxi=1,2,...,N{qi,t},qmin,t=mini=1,2,...,N{qi,tIs calculated according to the following formula
Figure FDA0003145037090000036
Figure FDA0003145037090000037
7. The method of claim 3, wherein the method comprises: the time c since the last pollingi,tNumber r of data packets to be transmittedi,tAnd AP receiving STAiAverage signal-to-noise ratio q of signali,tWeight ω of (d)c,t、ωr,t and ωq,tIn relation to the current time t, the calculation method comprises:
a) let omegac,t、ωr,t、ωq,tThe initial values at the beginning of the PCF period are
Figure FDA0003145037090000038
The value at the end of the PCF period is
Figure FDA0003145037090000039
And satisfy
Figure FDA00031450370900000310
Figure FDA00031450370900000311
b) Let the starting time of the current PCF time interval be tstartTotal PCF period length of Tpcfω is calculated according to the following formulac,t、ωr,t、ωq,t
Figure FDA00031450370900000312
Figure FDA00031450370900000313
Figure FDA00031450370900000314
CN202110751915.6A 2021-07-02 2021-07-02 Multi-attribute decision-based polling method in point coordination Active CN113556825B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110751915.6A CN113556825B (en) 2021-07-02 2021-07-02 Multi-attribute decision-based polling method in point coordination

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110751915.6A CN113556825B (en) 2021-07-02 2021-07-02 Multi-attribute decision-based polling method in point coordination

Publications (2)

Publication Number Publication Date
CN113556825A true CN113556825A (en) 2021-10-26
CN113556825B CN113556825B (en) 2023-09-26

Family

ID=78131270

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110751915.6A Active CN113556825B (en) 2021-07-02 2021-07-02 Multi-attribute decision-based polling method in point coordination

Country Status (1)

Country Link
CN (1) CN113556825B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004187021A (en) * 2002-12-04 2004-07-02 Nec Corp Access point device, and pcf control method used for it
US20060062181A1 (en) * 2004-09-23 2006-03-23 Institute For Information Industry Medium access control methods with quality of service and power management for wireless local area networks
CN1791046A (en) * 2004-12-17 2006-06-21 中兴通讯股份有限公司 WLAN subgroup polling method based on self-adaptive service quality assurance
CN101207603A (en) * 2006-12-19 2008-06-25 中兴通讯股份有限公司 Method for ensuring service quality based on user level in network
CN101765227A (en) * 2010-01-15 2010-06-30 南京邮电大学 Method for optimizing 802.11 centralized coordination function
CN102427588A (en) * 2011-11-14 2012-04-25 工业和信息化部电信传输研究所 Method for avoiding network congestion in transmission process of 802.11 polling type data
CN102484607A (en) * 2009-09-29 2012-05-30 西门子公司 Communication method in a profinet communication system
CN104365169A (en) * 2012-06-27 2015-02-18 Lg电子株式会社 Method for indicating channel access type in wireless communication system, and apparatus therefor
CN105163395A (en) * 2015-07-09 2015-12-16 云南大学 Wireless local area network access control method based on radio-on-fiber wireless system
CN106658741A (en) * 2015-11-03 2017-05-10 华为技术有限公司 Method for feeding back channel state information (CSI), access point (AP), and station (STA)
CN107959980A (en) * 2017-12-29 2018-04-24 华南理工大学 Wireless medium cut-in method is coordinated based on the point of departure time the latest and most rickle

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004187021A (en) * 2002-12-04 2004-07-02 Nec Corp Access point device, and pcf control method used for it
US20060062181A1 (en) * 2004-09-23 2006-03-23 Institute For Information Industry Medium access control methods with quality of service and power management for wireless local area networks
CN1791046A (en) * 2004-12-17 2006-06-21 中兴通讯股份有限公司 WLAN subgroup polling method based on self-adaptive service quality assurance
CN101207603A (en) * 2006-12-19 2008-06-25 中兴通讯股份有限公司 Method for ensuring service quality based on user level in network
CN102484607A (en) * 2009-09-29 2012-05-30 西门子公司 Communication method in a profinet communication system
CN101765227A (en) * 2010-01-15 2010-06-30 南京邮电大学 Method for optimizing 802.11 centralized coordination function
CN102427588A (en) * 2011-11-14 2012-04-25 工业和信息化部电信传输研究所 Method for avoiding network congestion in transmission process of 802.11 polling type data
CN104365169A (en) * 2012-06-27 2015-02-18 Lg电子株式会社 Method for indicating channel access type in wireless communication system, and apparatus therefor
CN105163395A (en) * 2015-07-09 2015-12-16 云南大学 Wireless local area network access control method based on radio-on-fiber wireless system
CN106658741A (en) * 2015-11-03 2017-05-10 华为技术有限公司 Method for feeding back channel state information (CSI), access point (AP), and station (STA)
CN107959980A (en) * 2017-12-29 2018-04-24 华南理工大学 Wireless medium cut-in method is coordinated based on the point of departure time the latest and most rickle

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
余德成: "《基于逐跳最晚离开时刻的点协调无线媒介接入控制方法》", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
路秀迎,丁洪伟,杨志军,保利勇,何敏: "《三种策略轮询系统的FPGA 实现及性能分析》", 《现代电子技术》, vol. 42, no. 3 *

Also Published As

Publication number Publication date
CN113556825B (en) 2023-09-26

Similar Documents

Publication Publication Date Title
JP5639470B2 (en) Improved multi-user transmission
US11418999B2 (en) Buffer status report for high priority transmission
WO2017107699A1 (en) Access method and apparatus
US20080165713A1 (en) Wireless communication apparatus and wireless communication method
KR101354130B1 (en) Method for transmitting and receiving the frame in wireless LAN
WO2015199992A1 (en) Dynamic adjustment of a wireless network media access control parameter
KR20070102583A (en) Method and apparatus for controlling wireless medium congestion by adjusting contention window size and disassociating selected mobile stations
KR20050115253A (en) Quality of service differentiation in wireless networks
CN109962760B (en) Service scheduling method suitable for wireless TDMA ad hoc network
US20050141480A1 (en) Apparatus and method for transmitting data between wireless and wired networks
JP4179512B2 (en) Radio base station
WO2020179533A1 (en) Wireless communication system and wireless communication method
CN108632911A (en) Adaptive conflict avoidance real-time media access control method based on overall scheduling
US20210337594A1 (en) Enhanced distributed channel access (edca) queue for real time application (rta) packets
Maqhat et al. Scheduler algorithm for IEEE802. 11n wireless LANs
CN113556825A (en) Polling method based on multi-attribute decision in point coordination
Ahmed et al. Differentiation between different traffic categories using multi-level of priority in DCF-WLAN
KR20230144638A (en) Sharing RTA traffic and EDCA TXOP
US9479351B2 (en) Method and apparatus for providing voice service in communication system
WO2023246596A1 (en) Scheduling method and apparatus, and computer-readable storage medium
US20220322460A1 (en) Sharing an edca txop with rta traffic
Kuo et al. Design and evaluation of a high throughput MAC with QoS guarantee for wireless LANs
He et al. The analysis of IEEE 802.11 PCF protocol based on LEO satellite Wi-Fi
Chang et al. A QoS-guaranteed cooperative MAC protocol for wireless networks
CN114363964A (en) Wireless ultra-long distance transmission method based on 802.11 protocol

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
CB02 Change of applicant information

Address after: 210003 No. 346, Zhongshan North Road, Jiangsu, Nanjing

Applicant after: 724 Research Institute of China Shipbuilding Corp.

Address before: 210003 No. 346, Zhongshan North Road, Jiangsu, Nanjing

Applicant before: 724TH RESEARCH INSTITUTE OF CHINA SHIPBUILDING INDUSTRY Corp.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant