CN102202348B - Data packet sending method and access point - Google Patents
Data packet sending method and access point Download PDFInfo
- Publication number
- CN102202348B CN102202348B CN201010131299.6A CN201010131299A CN102202348B CN 102202348 B CN102202348 B CN 102202348B CN 201010131299 A CN201010131299 A CN 201010131299A CN 102202348 B CN102202348 B CN 102202348B
- Authority
- CN
- China
- Prior art keywords
- time
- transmitting time
- interframegap
- time section
- length
- 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.)
- Expired - Fee Related
Links
Abstract
The embodiment of the invention provides a data packet sending method and an access point, wherein the data packet sending method comprises the following steps of: at the beginning of a period, setting a local inter-frame spacing interval as a first numerical value by the access point, wherein the first numerical value is less than a preset second numerical value; setting a contention window as zero; calculating at the beginning of the period, during a duration time of a special flow, when the idle time of a channel reaches the preset inter-frame spacing interval, controlling the sending of a data packet of a special type; after the duration time of the special flow from the beginning of the period, setting the inter-frame spacing interval as a preset inter-frame access parameter, wherein the numerical value of the preset inter-frame access parameter is more than or equal to the second numerical value; and modifying the contention window as a preset window parameter value. By using the technical scheme provided by the embodiment of the invention, an AP (Access Point) can be successfully contended and accessed to the channel; and the data packet of the specific type can be sent in time.
Description
Technical field
The present invention relates to communication technical field, particularly a kind of data packet sending method and access point.
Background technology
Along with the development of wireless communication technology, WLAN (wireless local area network) (Wireless Local Area Network, WLAN) technology is more and more subject to people and payes attention to.WLAN generally comprises an access point (AccessPoint, AP) and multiple website (Station, STA), all contention access channels of AP and multiple STA.AP and each STA be meeting monitor channel in the time that needs access channel, if channel idle and duration are greater than distributed inter-frame space (DCF Inter Frame Space, DIFS), this AP or STA just access channel so, if channel busy, this AP or STA continue monitor channel until after the time interval of channel idle DIFS so, start random back off procedure, from 0 to competition window (ContentionWindow, CW) between, choose at random the initial value of a value as fallback counter, and start rollback counting, rollback counting successively decreases taking time slot (Slot) as unit, each time slot in rollback counting process, if it is busy that channel becomes again, fallback counter is suspended so, until after the channel idle DIFS again monitoring, restart fallback counter, in the time that fallback counter is kept to zero, this AP or STA access channel, carry out the transmission of packet.This AP or STA are sending after packet, continue wait receiving terminal reply ACK frame and confirm, if receive ACK frame, represent this data packet transmission success, if also have new packet etc. to be sent in buffer queue, AP or STA start the contention access channel procedure of a new round more so; If do not receive ACK frame, represent that this packet clashes or produced bag mistake with other packet on wireless channel, therefore this STA will carry out the re-transmission of packet, retransmits after the upper limit, just by this data packet discarding until reach.Each re-transmission is also the mode that adopts contention access channel.The value of noting CW comprises CWmin and two values of CWmax, when transmission for the first time, adopt a random value between [0, CWmin], when re-transmission for the second time, adopt [0,2CWmin] between a random value, when re-transmission for the third time, adopt a random value between [0,4CWmin], by that analogy, until choose a random value between [0, CWmax].
Aforementioned AP and each STA adopt DIFS to postpone and the mode of random back window, and with identical probability contention access channel, this contention access mode is also not suitable for the transmission of some specific streams, as media streams such as video/audios.These specific streams need special protection in transmitting procedure, and require to reach certain service quality (Quality of Service, QoS).
For prioritised transmission specific stream, the data stream type that prior art is different brackets provides different access parameters, and access parameter comprises: AIFS[i], CWmin[i] and CWmax[i], { i=0,1,2,3} wherein i represents the index of different pieces of information stream type, and i=0 identifies voice flow; I=1 identifies video flowing; I=2 identifies best effort traffic; I=3 mark background stream; Due to the access parameter difference of different types of data stream, so the access priority of different types of data stream is just different, the sequence of access priority is followed successively by: voice flow, video flowing, best effort traffic, background stream; And when after voice flow and video flowing contention access channel, its can be in time span of send opportunity (Transmission Opportunity, TXOP) restriction continuous multiple packets of transmission and do not need extra competition.
Realizing in process of the present invention, inventor finds that in prior art, at least there are the following problems:
Owing on STA and AP, dissimilar data flow being all provided with to different priority, in the time having the data flow (being voice flow and video flowing) of high priority to send on AP and STA, be difficult to ensure voice flow and the video flowing energy contention access channel on AP, service quality be can not be guaranteed.
Summary of the invention
The embodiment of the present invention provides a kind of data packet sending method and access point, can ensure the smooth contention access channel of AP, sends timely specific type of data bag.
The embodiment of the present invention provides:
A kind of data packet sending method, comprising:
Access point is in the zero hour in cycle, and it is the first numerical value that the local interFrameGap time is set, and described the first numerical value is less than default second value; It is 0 that competition window is set;
Count from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, control the transmission of specific type of data bag;
From the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that the described interFrameGap time is set, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment competition window is default window parameter value.
A kind of access point, comprising: the first timing unit, the second timing unit, parameter adjustment unit and control unit, wherein,
The first timing unit, in the zero hour in cycle, it is the first numerical value that trigger parameter adjustment unit arranges the local interFrameGap time, and described the first numerical value is less than default second value, and it is 0 that competition window is set;
The second timing unit, be used for from the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that trigger parameter adjustment unit arranges the described interFrameGap time, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment competition window is default window parameter value;
Parameter adjustment unit, is the first numerical value for the described interFrameGap time is set under the triggering at the first timing unit, and it is 0 that competition window is set; It is default interFrameGap access parameter that the described interFrameGap time is set under the triggering of the second timing unit, and amendment competition window is default window parameter value;
Control unit, for counting from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, controls the transmission of specific type of data bag.
It is the first numerical value that the embodiment of the present invention arranges the interFrameGap time in the zero hour in cycle, this first numerical value is less than second value, and competition window CW is set is 0, count from the zero hour in cycle like this, in the lasting transmitting time section of specific stream, because the interFrameGap time of each STA is all greater than or equal to second value, the interFrameGap time of AP is less than above-mentioned second value and CW is 0, thereby AP contention access channel smoothly, and send specific type of data bag in the lasting transmitting time section of specific stream, improve service quality.
Brief description of the drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the present invention, to the accompanying drawing of required use in embodiment be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the data packet sending method flow chart that one embodiment of the invention provides;
Fig. 2 is the data packet sending method flow chart that another embodiment of the present invention provides;
Fig. 3 is the sequential chart of the contention free burst duration section that provides of the embodiment of the present invention;
Fig. 4 is the flow chart of definite contention free burst duration section of providing of the embodiment of the present invention;
Fig. 5 is the access point structures figure that the embodiment of the present invention provides;
Fig. 6 is the network architecture figure that the embodiment of the present invention provides.
Embodiment
Consult Fig. 1, the embodiment of the present invention provides a kind of data packet sending method, and the method specifically comprises:
101, access point AP is in the zero hour in cycle, and it is the first numerical value that the local interFrameGap time is set, and described the first numerical value is less than default second value; It is 0 that competition window CW is set.
In WLAN (wireless local area network), AP can periodically send beacon frame (Beacon Frame), and the described cycle can send for beacon frame the whole approximate number in cycle.For example, suppose that the beacon frame transmission cycle is 4ms, 4 whole approximate number is 1 and 2, and it is 2ms that the local interFrameGap time can be set.
Wherein, the second value in this step is distributed inter-frame space (DCF Inter Frame Space, DIFS), and DIFS can be 50us.Concrete, the first numerical value can be some coordination access interFrameGap (PCFInter Frame Space, PIFS) or a short interFrameGap (Short Inter Frame Space, SIFS), or other are less than the numerical value of DIFS, do not affect realization of the present invention.
102, count from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, according to the lasting transmitting time section of described specific stream, control the transmission of specific type of data bag.
Wherein, specific stream refers to the data flow being made up of specific type of data bag.
Wherein, the lasting transmitting time section of specific stream can be a preset value, can be also the value that needs the specific type of data bag of transmission to calculate according to current.
If the lasting transmitting time section of specific stream is a preset value, the transmission of controlling specific type of data bag in this step specifically refers to: in the lasting transmitting time section of specific stream, send specific type of data bag, sending how many specific type of data bags is to be determined by the lasting transmitting time section of specific stream;
If the lasting transmitting time section of specific stream is the value that needs the specific type of data bag of transmission to calculate according to current, the transmission of controlling specific type of data bag in this step specifically refers to: if the lasting transmitting time section of the specific stream calculating is 0, controls and do not send specific type of data bag; Otherwise, in the lasting transmitting time section of specific stream, send specific type of data bag, sending how many specific type of data bags is to be determined by the lasting transmitting time section of specific stream.
103, from the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that the described interFrameGap time is set, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment competition window CW is default window parameter value.
Adopting distributed channel access (the Enhanced Distributed Channel Access strengthening, EDCA) in WLAN (wireless local area network), above-mentioned default interFrameGap access parameter is arbitration interFrameGap (Arbitrary Inter Frame Space, AIFS), AIFS is the function about i, can be: AIFS[i]=AIFSN[i] * slot+DIFS, wherein, slot is the time span of a time slot, i is the index of different pieces of information stream type, AIFSN is space-number between arbitration frame (Arbitrary Inter Frame Space Number), AIFSN[i] for rounding the coefficient of numerical value, can find out from the formula of above-mentioned AIFS, the value of AIFS is greater than or equal to DIFS.
In the WLAN (wireless local area network) of employing distributed coordination function (Distributed Coordination Function, DCF) agreement, above-mentioned default interFrameGap access parameter is exactly DIFS.
Wherein, the specific type of data bag in various embodiments of the present invention refers to needs to meet the packet that special service quality (Quality of Service, QoS) requires in transmitting procedure; Such as, in application scenes, AP has a large amount of video flowings will send to STA, and these video flowings need the guarantee of special QoS conventionally, and under this scene, specific type of data bag refers to these video packets of data.
Wherein, the lasting transmitting time section of specific stream can be a preset value, can be also the value that needs the specific type of data bag of transmission to calculate according to current.
If the lasting transmitting time section of specific stream is the current value that needs the attribute type packet of transmission to calculate, need to deposit specific type of data bag to be sent in independent queue, in the zero hour in cycle, obtain the length Qlength of described queue, according to the length Qlength of described queue, determine the lasting transmitting time section of specific stream.
Concrete, in the time that the length of described queue is greater than the second thresholding, determine that the lasting transmitting time section of specific stream is the longest transmitting time of presetting; In the time that the length of described queue is less than or equal to the first thresholding, determine that the lasting transmitting time section of specific stream is 0; In the time that the length of described queue is less than or equal to the second thresholding and is greater than the first thresholding, determine that the lasting transmitting time section Duration Time of specific stream is:
Duration?Time＝(Qlength×MaxTimeLimit)/Threshold_2
Wherein, the length that Qlength is described queue, MaxTimeLimit is the longest transmitting time, Threshold_2 is the second thresholding;
Or, in the time that the length of described queue is less than or equal to the second thresholding, determine that the lasting transmitting time section Duration Time of specific stream is:
Duration?Time＝(Qlength×MaxTimeLimit)/Threshold_2
Wherein,
Wherein, r is the Mean Speed that sends specific type of data bag, and b is the described cycle; EfficientRate is the effective transmission speed of channel.
The embodiment of the present invention the zero hour in cycle arrange the interFrameGap time be the first numerical value (wherein, the first numerical value is less than second value), and competition window CW is set is 0, count from the zero hour in cycle like this, in the lasting transmitting time section of specific stream, because the interFrameGap time of each STA is all greater than or equal to second value, the interFrameGap time of AP is less than above-mentioned second value and CW is 0, thereby AP contention access channel smoothly, and send specific type of data bag in the lasting transmitting time section of specific stream, improve service quality.And because the moment different arranged interFrameGap time and CW, make to count from the zero hour in cycle, exceed after the lasting transmitting time section of specific stream, the STA in network can access channel and transmit packet.
For the technical scheme that the embodiment of the present invention is provided is clearer, consult Fig. 2, the data packet sending method that following embodiment provides the embodiment of the present invention is described in detail:
201, AP deposits specific type of data bag to be sent in an independent queue.
On AP, have multiple buffer queues, each queue has own corresponding contention parameter, and contention parameter comprises: AIFS[i], CWmin[i], CWmax[i] and, suppose and have 4 queues, i=0,1,2,3.In this step, AP deposits specific type of data bag to be sent in an independent queue, and the call number of supposing this specific type of data bag is 1, is AIFS[1 to access parameter that should queue], CWmin[1], CWmax[1].
202, AP, in the zero hour in cycle, obtains the length Qlength of the queue that is exclusively used in storage specific type of data bag, and access parameter AIFS[1 corresponding to this queue is set]=SIFS, CWmin[1]=0, CWmax[1]=0.
In WLAN (wireless local area network), AP can periodically send beacon frame (Beacon Frame), and the described cycle can send for beacon frame the whole approximate number in cycle.
AIFS[1 also can be set in this step]=PIFS, AIFS[1 also can be set] and be other numerical value, just passable as long as set numerical value is less than DIFS.
203,, according to the length Qlength of described queue, determine the lasting transmitting time section DurationTime of specific stream.
Wherein, the detailed process of determining the lasting transmitting time section Duration Time of specific stream refers to follow-up detailed introduction.
204, count from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches SIFS, AP controls the transmission of specific type of data bag.
Due to now in WLAN (wireless local area network), except AP, the AIFS[i of the access parameter of all STA]=AIFSN[i] * slot+DIFS, wherein, AIFSN[i] for rounding the coefficient of numerical value, slot is the time span of a time slot, DIFS is distributed inter-frame space, and CWmin[i] and CWmax[i] impermanent be 0, so in the time that idle time of channel reaches SIFS, this AP can access channel at once, then controls the specific type of data bag in transmit queue.Often sending after a specific type of data bag, channel all can the idle SIFS period, like this this AP can continue access channel send next specific type of data bag, so count from the zero hour in cycle, in the lasting transmitting time section of specific stream, AP can continue busy channel, continues to send specific type of data bag.
205, from the zero hour in cycle after the lasting transmitting time section of specific stream, AIFS[1 is set]=AIFSN[1] * slot+DIFS, amendment competition window CWmin[1] and CWmax[1] be default window parameter value.
In order to prevent this AP busy channel and cause STA cannot access channel always, from the zero hour in cycle after the lasting transmitting time section of specific stream, recover AIFS[1]=AIFSN[1] * slot+DIFS, amendment competition window CWmin[1] and CWmax[1] be default window parameter value.
It is a numerical value that is less than DIFS that the embodiment of the present invention arranges the interFrameGap time in the zero hour in cycle, and competition window CW is set is 0, count from the zero hour in cycle like this, in the lasting transmitting time section of specific stream, because the interFrameGap time of each STA is all greater than or equal to DIFS, the interFrameGap time of AP is less than above-mentioned DIFS and CW is 0, thereby AP contention access channel smoothly, and send specific type of data bag in the lasting transmitting time section of specific stream, improve service quality.And because the moment different arranged interFrameGap time and CW, make to count from the zero hour in cycle, exceed after the lasting transmitting time section of specific stream, the STA in network can access channel and transmit packet.
In order to determine the process of the lasting transmitting time section Duration Time of specific stream in clearer description step 203, first parameter the first thresholding Threshold_1, the second thresholding Threshold_2 to needs reference, effective transmission speed EfficientRate and the longest transmitting time MaxTimeLimit of channel introduce.
Wherein, the formula of the first thresholding Threshold_1, the second thresholding Threshold_2 is as follows:
Wherein, the Mean Speed that r is this specific stream, has characterized the uninterrupted of this specific type of data bag, and this parameter can be passed over by upper-layer protocol, or obtains by some flow rate test algorithms, or is a fixing system parameters by default.B is the default cycle, it is generally the whole approximate number of beacon frame (Beaconframe) transmission cycle, as shown in Figure 3, b is the beacon frame transmissions Cycle Length of two point, in a beacon frame transmissions cycle, AP or STA calculate the lasting transmitting time section of two specific streams, as shown in dash area in Fig. 3, in dash area, AP or STA continue to send specific type of data bag, specific stream can continue busy channel like this, and other data flow can not access channel.In real system, the beacon frame transmissions cycle is system parameters, and the embodiment of the present invention can, according to the length setting b value size in beacon frame transmissions cycle, once after setting, b value can be a preset parameter, no longer change later.P is the maximum packet length of this specific type of data bag, and this parameter is system parameters, supposes that this parameter is a fixed value in the embodiment of the present invention.
The computing formula of the effective transmission speed EfficientRate of channel and the longest transmitting time MaxTimeLimit is as follows:
Wherein, R is physical layer transmission speed, for system parameters, the expense that O produces for physical layer transmission packet, comprise physical layer preamble code, physical layer frame head, access delay (embodiment of the present invention middle finger SIFS), the turnaround time of acknowledgement frame ACK, can calculate the effective transmission speed EfficientRate value that obtains channel by formula (3), then carry it into formula (4), calculate the longest transmitting time MaxTimeLimit.
Wherein, Threshold_1, Threshold_2, EfficientRate after these four auxiliary parameters of MaxTimeLimit are set up, will remain unchanged in contention free burst mechanism running, calculate unless re-started new initialization.After auxiliary parameter obtains, in the zero hour in cycle, AP will calculate the lasting transmitting time section (being contention free burst duration section) of this specific stream according to auxiliary parameter and current queue length Qlength, and this computational process comprises:
401, judge whether the length Qlength that is exclusively used in the queue of storing specific type of data bag is less than or equal to the first thresholding Threshold_1, if so, carry out 402; If not, carry out 403.
402, the lasting transmitting time Duration Time=0 of specific stream is set, process ends.
Whether the length Qlength that 403, judges this queue is less than or equal to the second thresholding Threshold_2, if so, carries out 404, if not, carries out 405.
404, the lasting transmitting time section Duration Time of specific stream is set as follows, and process ends.
Duration?Time＝(Qlength×MaxTimeLimit)/Threshold_2
Wherein, MaxTimeLimit is the longest transmitting time.
405, the lasting transmitting time section Duration Time that specific stream is set is MaxTimeLimit.
Consult Fig. 5, the embodiment of the present invention provides a kind of access point, and it comprises: the first timing unit 501, the second timing unit 502, parameter adjustment unit 503 and control unit 504,
The first timing unit 501, in the zero hour in cycle, it is the first numerical value that trigger parameter adjustment unit 503 arranges the local interFrameGap time, and described the first numerical value is less than default second value, and it is 0 that competition window CW is set;
The second timing unit 502, be used for from the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that trigger parameter adjustment unit 503 arranges the described interFrameGap time, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment CW is default window parameter value; Wherein, the first timing unit 501 and the second timing unit 502 can be positioned on same device, do not affect realization of the present invention.
Parameter adjustment unit 503, is the first numerical value for the interFrameGap time is set under the triggering at the first timing unit 501, and it is 0 that competition window CW is set; It is described default interFrameGap access parameter that the interFrameGap time is set under the triggering of the second timing unit 502, and amendment CW is default window parameter value;
Control unit 504, for counting from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, according to the lasting transmitting time section of described specific stream, control the transmission of specific type of data bag.
Wherein, the lasting transmitting time section of specific stream can be a preset value, can be also the value that needs the attribute type packet of transmission to calculate according to current.If the lasting transmitting time section of specific stream is the current value that needs the attribute type packet of transmission to calculate, this access point also comprises: memory cell 505 and transmitting time section determining unit 506,
Concrete, memory cell 505, for depositing specific type of data bag to be sent in independent queue;
The first timing unit 501 also, in the zero hour in cycle, triggers transmitting time section determining unit 506 and obtains the length of described queue, and determine the lasting transmitting time section of specific stream according to the length of described queue;
Transmitting time section determining unit 506, under the triggering of the first timing unit 501, is obtained the length of described queue, and determines the lasting transmitting time section of specific stream according to the length of described queue.
Concrete, transmitting time section determining unit 506 comprises: length computation subelement 5061, the first judgment sub-unit 5062, determine subelement 5063 and the second judgment sub-unit 5064, wherein,
Length computation subelement 5061, for obtaining the length of described queue;
Whether the first judgment sub-unit 5062, be less than or equal to the second thresholding for the length that judges described queue;
Whether the second judgment sub-unit 5064, be less than or equal to the first thresholding for the length that judges described queue;
Determine subelement 5063, when being no in the judged result of the first judgment sub-unit 5062, determine that the lasting transmitting time section of specific stream is the longest transmitting time of presetting; When being, determine that the lasting transmitting time section of specific stream is 0 in the judged result of the second judgment sub-unit 5064; The judged result of the second judgment sub-unit 5064 be no and the judged result of the first judging unit 5062 when being, determine that the lasting transmitting time section Duration Time of specific stream is:
Duration?Time＝(Qlength×MaxTimeLimit)/Threshold_2
Wherein, the length that Qlength is described queue, MaxTimeLimit is the longest transmitting time, Threshold_2 is the second thresholding.
Or, in transmitting time section determining unit 506, do not comprise the second judgment sub-unit 5064, determine subelement 5063 in the judged result of the first judgment sub-unit 5062 when being, determine that the lasting transmitting time section Duration Time of specific stream is:
Duration?Time＝(Qlength×MaxTimeLimit)/Threshold_2
Wherein, the length that Qlength is described queue, MaxTimeLimit is the longest transmitting time, Threshold_2 is the second thresholding.
Wherein, the longest transmitting time MaxTimeLimit is:
Wherein, the Mean Speed that r is specific stream, b is the described cycle; EfficientRate is the effective transmission speed of channel.
It is the first numerical value (the first numerical value is less than second value) that the embodiment of the present invention arranges the interFrameGap time in the zero hour in cycle, and competition window CW is set is 0, count from the zero hour in cycle like this, in the lasting transmitting time section of specific stream, because the interFrameGap time of each STA is all greater than or equal to second value, the interFrameGap time of AP is less than above-mentioned second value and CW is 0, thereby AP contention access channel smoothly, and send specific type of data bag in the lasting transmitting time section of specific stream, improve service quality.And because the moment different arranged interFrameGap time and CW, make to count from the zero hour in cycle, exceed after the lasting transmitting time section of specific stream, the STA in network can access channel and transmit packet.
Consult Fig. 6, the embodiment of the present invention provides a kind of network system, and this system comprises: AP 600 and STA, and wherein, this network system can comprise a STA, also can comprise that multiple STA, the present embodiment suppose that it comprises STA 710, STA 720 and STA 730;
In this system, suppose that the technical scheme that AP adopts the embodiment of the present invention to provide starts uncontested access mechanism:
AP 600, in the zero hour in cycle, it is the first numerical value that the local interFrameGap time is set, described the first numerical value is less than default second value; It is 0 that competition window CW is set; Count from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, control the transmission of specific type of data bag; From the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that the described interFrameGap time is set, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment competition window CW is default window parameter value;
STA 710, STA 720 and STA 730, the specific type of data bag sending for receiving AP, and according to default interFrameGap time of this locality and contention window parameter value, contention access channel, sends packet to STA.
In the embodiment of the present invention, in the zero hour in cycle, to be set the interFrameGap time be the first numerical value (the first numerical value is less than second value) to AP, and competition window CW is set is 0, count from the zero hour in cycle like this, in the lasting transmitting time section of specific stream, because the interFrameGap time of each STA is all greater than or equal to second value, the interFrameGap time of AP is less than above-mentioned second value and CW is 0, thereby AP contention access channel smoothly, and send specific type of data bag in the lasting transmitting time section of specific stream, improve service quality.And because the moment different arranged interFrameGap time and CW, make to count from the zero hour in cycle, exceed after the lasting transmitting time section of specific stream, the STA in network can access channel and transmit packet.
It should be noted that, the technical scheme that the various embodiments described above of the present invention provide had both been applicable to adopt distributed channel access (the Enhanced Distributed Channel Access strengthening, EDCA) WLAN (wireless local area network), also be applicable to adopt the WLAN (wireless local area network) of distributed coordination function (Distributed Coordination Function, DCF) agreement.
One of ordinary skill in the art will appreciate that all or part of step realizing in above-described embodiment method is can carry out the hardware that instruction is relevant by program to complete, described program can be stored in a kind of computer-readable recording medium, for example read-only memory, disk or CD etc.
The data packet sending method and the access point that above the embodiment of the present invention are provided are described in detail, applied specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment is just for helping to understand method of the present invention and core concept thereof; , for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention meanwhile.
Claims (4)
1. a data packet sending method, is characterized in that, comprising:
Access point is in the zero hour in cycle, and it is the first numerical value that the local interFrameGap time is set, and described the first numerical value is less than default second value; It is 0 that competition window is set;
Count from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, control the transmission of specific type of data bag;
From the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that the described interFrameGap time is set, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment competition window is default window parameter value;
Described method also comprises: deposit specific type of data bag to be sent in independent queue.
2. method according to claim 1, is characterized in that,
The method also comprises: in the zero hour in cycle, obtain the length of described queue, according to the length of described queue, determine the lasting transmitting time section of specific stream;
According to the length of described queue, the lasting transmitting time section of determining specific stream comprises: in the time that the length of described queue is greater than the second thresholding, the lasting transmitting time section of determining specific stream is the longest transmitting time of presetting, and, in the time that the length of described queue is less than or equal to the second thresholding and is greater than the first thresholding, the lasting transmitting time section Duration Time that determines specific stream is: Duration Time=(Qlength × MaxTimeLimit)/Threshold_2, and, in the time that the length of described queue is less than or equal to the first thresholding, the lasting transmitting time section of determining specific stream is 0, wherein, the first thresholding is less than the second thresholding, or
In the time that the length of described queue is greater than the second thresholding, the lasting transmitting time section of determining specific stream is the longest transmitting time of presetting, and, in the time that the length of described queue is less than or equal to the second thresholding, the lasting transmitting time section Duration Time that determines specific stream is: Duration Time=(Qlength × MaxTimeLimit)/Threshold_2, wherein, Qlength is the length of described queue, MaxTimeLimit is the longest transmitting time, and Threshold_2 is the second thresholding;
Wherein, the longest transmitting time MaxTimeLimit is:
Wherein, the Mean Speed that r is specific stream, b is the described cycle; EfficientRate is the effective transmission speed of channel.
3. an access point, is characterized in that, comprising: the first timing unit, the second timing unit, parameter adjustment unit and control unit, wherein,
The first timing unit, in the zero hour in cycle, it is the first numerical value that trigger parameter adjustment unit arranges the local interFrameGap time, and described the first numerical value is less than default second value, and it is 0 that competition window is set;
The second timing unit, be used for from the zero hour in cycle after the lasting transmitting time section of specific stream, it is default interFrameGap access parameter that trigger parameter adjustment unit arranges the described interFrameGap time, the numerical value of described interFrameGap access parameter is greater than or equal to described second value, and amendment competition window is default window parameter value;
Parameter adjustment unit, is the first numerical value for the described interFrameGap time is set under the triggering at the first timing unit, and it is 0 that competition window is set; It is default interFrameGap access parameter that the described interFrameGap time is set under the triggering of the second timing unit, and amendment competition window is default window parameter value;
Control unit, for counting from the zero hour in cycle, in the lasting transmitting time section of specific stream, in the time that idle time of channel reaches set interFrameGap time, controls the transmission of specific type of data bag;
Wherein, also comprise: memory cell, for depositing specific type of data bag to be sent in independent queue.
4. access point according to claim 3, is characterized in that, also comprises: transmitting time section determining unit,
Described the first timing unit, also, in the zero hour in cycle, triggers transmitting time section determining unit and obtains the length of described queue, and determine the lasting transmitting time section of specific stream according to the length of described queue;
Described transmitting time section determining unit, under the triggering at the first timing unit, obtains the length of described queue, and determines the lasting transmitting time section of specific stream according to the length of described queue;
Described transmitting time section determining unit comprises:
Length computation subelement, for obtaining the length of described queue;
Whether the first judgment sub-unit, be less than or equal to the second thresholding for the length that judges described queue;
Determine subelement, when being no in the judged result of the first judgment sub-unit, determine that the lasting transmitting time section of specific stream is the longest transmitting time of presetting;
Whether the second judgment sub-unit, be less than or equal to the first thresholding for the length that judges described queue;
Described definite subelement, also in the judged result of the second judgment sub-unit when being, determine that the lasting transmitting time section of specific stream is 0; The judged result of the second judgment sub-unit be no and the judged result of the first judgment sub-unit when being, determine that the lasting transmitting time section Duration Time of specific stream is:
Duration?Time=(Qlength×MaxTimeLimit)/Threshold_2；
Or,
Described definite subelement, also in the judged result of the first judgment sub-unit when being, determine that the lasting transmitting time section Duration Time of specific stream is:
Duration?Time=(Qlength×MaxTimeLimit)/Threshold_2
Wherein, the length that Qlength is described queue, MaxTimeLimit is the longest transmitting time, Threshold_2 is the second thresholding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010131299.6A CN102202348B (en) | 2010-03-22 | 2010-03-22 | Data packet sending method and access point |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010131299.6A CN102202348B (en) | 2010-03-22 | 2010-03-22 | Data packet sending method and access point |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102202348A CN102202348A (en) | 2011-09-28 |
| CN102202348B true CN102202348B (en) | 2014-07-30 |
Family
ID=44662659
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010131299.6A Expired - Fee Related CN102202348B (en) | 2010-03-22 | 2010-03-22 | Data packet sending method and access point |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102202348B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103260187B (en) * | 2012-02-20 | 2016-03-02 | 华为技术有限公司 | The method of research content presynchronization, equipment and system |
| CN102932948A (en) * | 2012-11-08 | 2013-02-13 | 东莞宇龙通信科技有限公司 | Data communication device and data communication method |
| CN103813458B (en) * | 2012-11-15 | 2017-05-03 | 大唐电信科技产业控股有限公司 | Time slot distribution method and device |
| CN104902575B (en) * | 2015-05-21 | 2018-06-15 | 重庆邮电大学 | A kind of multimedia sensing network real-time scheduling method |
| US10194364B2 (en) * | 2015-09-23 | 2019-01-29 | Mediatek Inc. | Method of enhancing transmission opportunity and wireless device using the same |
| JP2020504478A (en) * | 2016-11-04 | 2020-02-06 | 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． | Slot scheduling method and apparatus |
| CN109787922B (en) * | 2017-11-13 | 2020-08-21 | 中国移动通信集团公司 | Method and device for acquiring queue length and computer readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1512721A (en) * | 2002-12-26 | 2004-07-14 | �ʼҷ����ֵ��ӹɷ�����˾ | Radio local net work system and method with increased central coordination control |
| US20050100040A1 (en) * | 2003-02-27 | 2005-05-12 | Microsoft Corporation | Quality of service differentiation in wireless networks |
| CN101582837A (en) * | 2008-05-12 | 2009-11-18 | 华为技术有限公司 | Service access control method, wireless access system and access control device |
-
2010
- 2010-03-22 CN CN201010131299.6A patent/CN102202348B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1512721A (en) * | 2002-12-26 | 2004-07-14 | �ʼҷ����ֵ��ӹɷ�����˾ | Radio local net work system and method with increased central coordination control |
| US20050100040A1 (en) * | 2003-02-27 | 2005-05-12 | Microsoft Corporation | Quality of service differentiation in wireless networks |
| CN101582837A (en) * | 2008-05-12 | 2009-11-18 | 华为技术有限公司 | Service access control method, wireless access system and access control device |
Non-Patent Citations (7)
| Title |
|---|
| ANALYSIS OF IEEE 802.11E FOR QOS SUPPORT IN WIRELESS LANS;STEFAN MANGOLD, PHILIPS RESEARCH;《IEEE wireless communication》;20031231;全文 * |
| IEEE 802.11e Wireless LAN for Quality of Service;Stefan Mangold, Sunghyun Choi, Peter May, Ole Klein;《European wireless》;20020228;全文 * |
| STEFAN MANGOLD, PHILIPS RESEARCH.ANALYSIS OF IEEE 802.11E FOR QOS SUPPORT IN WIRELESS LANS.《IEEE wireless communication》.2003,全文. |
| Stefan Mangold, Sunghyun Choi, Peter May, Ole Klein.IEEE 802.11e Wireless LAN for Quality of Service.《European wireless》.2002,全文. |
| 冯正勇，文光俊，张文彬，邓云凯.基于IEEE802.11e EDCA的下行信道动态无竞争接入机制.《计算机应用研究》.2010,第27卷(第8期),全文. * |
| 吴娟,章韵,俞言霞.基于IEEE802.11e HCCA的接入控制方案.《信息技术》.2009,全文. * |
| 陆洋，张超，陆建华，林孝康.IEEE 802.11无线局域网接入环境下语音传输容量.《清华大学学报（自然科学版）》.2008,第48卷(第1期),第40页左侧第2-29行，右侧第1-29行，第41页右侧第20行-第42页左侧倒数第6行. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102202348A (en) | 2011-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102202348B (en) | Data packet sending method and access point | |
| US8199729B2 (en) | Media access control apparatus and method for guaranteeing quality of service in wireless LAN | |
| US7289529B2 (en) | Method and system for optimally serving stations on wireless LANs using a controlled contention/resource reservation protocol of the IEEE 802.11e standard | |
| CN103326913B (en) | Definitiveness back-off method and device for peer-to-peer communications | |
| JP4480563B2 (en) | QoS control method for wireless LAN base station apparatus | |
| Ge et al. | An analytic study of tuning systems parameters in IEEE 802.11 e enhanced distributed channel access | |
| US7738481B2 (en) | Wireless communication device and wireless communication method | |
| Ali et al. | Performance evaluation of heterogeneous IoT nodes with differentiated QoS in IEEE 802.11 ah RAW mechanism | |
| CN105592564B (en) | Adaptive access mechanism based on the estimation of live-vertex number in wireless Mesh netword | |
| CN110381601B (en) | Communication method, communication device, computer readable medium and electronic equipment | |
| US8755281B2 (en) | Constant window back-off method for multiple access in wireless local area networks | |
| CN114641085A (en) | Self-adaptive back-off optimization method of CSMA/CA mechanism based on IEEE802.15.4 | |
| CN102905389A (en) | Access control method and device | |
| US20040196850A1 (en) | WLAN access scheduling control | |
| CN101715241A (en) | Method and device for media access control of distributed wireless local area network | |
| CN104219017A (en) | A method for transmitting a data packet in a physical layer and an access point | |
| Choi et al. | P-DCF: enhanced backoff scheme for the IEEE 802.11 DCF | |
| Jonsson et al. | Increased communication reliability for delay-sensitive platooning applications on top of IEEE 802.11 p | |
| Martorell et al. | Non-saturated IEEE 802.11 networks. A hierarchical 3D Markov model | |
| El Housseini et al. | Adaptive contention-window MAC algorithms for QoS-enabled wireless LANs | |
| Tsai et al. | An analytical model for IEEE 802.11 e EDCA | |
| Zhao | Performance analysis for VoIP traffic with limited retransmissions in IEEE 802.11-based wireless networks | |
| US20040085992A1 (en) | Shared-medium contention algorithm exhibiting fairness | |
| Lim et al. | Throughput model of IEEE 802.11 e EDCF with consideration of delay bound constraint | |
| Madhavi et al. | Analysis of Throughput and Energy Efficiency in the IEEE 802.11 Wireless Local Area Networks using Constant backoff Window Algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140730 Termination date: 20190322 |