CN107959980B - Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle - Google Patents
Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle Download PDFInfo
- Publication number
- CN107959980B CN107959980B CN201711468581.1A CN201711468581A CN107959980B CN 107959980 B CN107959980 B CN 107959980B CN 201711468581 A CN201711468581 A CN 201711468581A CN 107959980 B CN107959980 B CN 107959980B
- Authority
- CN
- China
- Prior art keywords
- data packet
- website
- latest
- time delay
- rickle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 230000005540 biological transmission Effects 0.000 claims abstract description 14
- 238000012423 maintenance Methods 0.000 claims description 3
- 230000000750 progressive effect Effects 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 2
- 108700026140 MAC combination Proteins 0.000 abstract description 2
- 239000002699 waste material Substances 0.000 abstract description 2
- 238000005259 measurement Methods 0.000 abstract 1
- 231100000773 point of departure Toxicity 0.000 description 5
- 238000004891 communication Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000003750 conditioning effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0866—Non-scheduled access, e.g. ALOHA using a dedicated channel for access
- H04W74/0875—Non-scheduled access, e.g. ALOHA using a dedicated channel for access with assigned priorities based access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/002—Transmission of channel access control information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
Wireless medium cut-in method is coordinated based on the point of departure time the latest and most rickle the invention discloses a kind of, the method is different from traditional MAC protocol, but medium access is controlled according to the urgency level of data packet, the urgency level is using residual time delay as measurement foundation, website where the few data packet of residual time delay, it is preferential to obtain poll chance, to largely avoid because time-out sends the network resources waste of packet discard, simultaneously, single poll can send multiple data frames, the transmission frequency for reducing poll frame, improves the effective rate of utilization of channel.
Description
Technical field
The present invention relates to the wireless mediums in WLAN to access control field, and in particular to one kind is based on leaving the latest
The point of moment and most rickle coordinates wireless medium cut-in method.
Background technique
802.11 WLAN standard of IEEE calculates in environment in building WiMAX and plays very important effect.
Multimedia application in wireless network is usually multi-user, needs the support of QoS, such as bandwidth, time delay, shake and the bit error rate
Guarantee.Since conventional mac layer does not support qos feature and physical layer often to be changed state by the interference of noise,
802.11 WLANs will ensure that the demand of QoS is a very big challenge.Therefore, IEEE802.11MAC layer protocol is improved,
So that it is met QoS demand, there is very big application value.
The basic model of IEEE 802.11 is DCF (Distributed Coordination Function, distribution association
Conditioning function), DCF does not provide QoS support, and in addition there are PCF (Point Coordination Function, points based on poll
Coordination function) mode.DCF is 802.11 basic media access control (MAC) modes used, and DCF is more based on carrier sense
Location access/conflict avoidance (CSMA/CA, Carrier Sense Multiple Access with Collision
Avoidance) mechanism.DCF can only provide (Best-effort) service done one's best, without the guarantee of QoS.There is generation
The time-limited service (such as audio frequency or video of IP phone, video conference) of table needs specific bandwidth, time delay and shake, but
Some losses can be endured.However, all websites remove competitive resource and letter with same priority inside BSS in DCF mode
Road.This indiscriminate mechanism cannot provide bandwidth, time delay and shake to the website or multimedia service stream of high priority
It ensures.The handling capacity or time delay of different business stream are indistinguishable, multiple business stream same queues, so, they
Time delay it is substantially identical.PCF 802.11 networks of permission provide a kind of enforceable " justice " and remove access media.In certain journey
On degree, the media access under PCF in turn gives transmission data power each using the media access control scheme for being similar to poll
Website.Point coordinator control media access, access point have corresponding function to match chalaza coordinator.Only permitting in coordinator
Perhaps under, website could send data.Media access under PCF uses the network protocol of point coordinator poll.
802.11 traditional WLAN standards can only provide the service of " do one's best (Best-effort) ", can not
Meet the QoS of the multimedias real time business such as voice, video.For the support of enhanced quality-of-service, the IEEE committee is proposed
IEEE 802.11e has different transmission priorities according to the difference of class of service.The voice high to requirement of real-time and view
The signals such as frequency have higher priority, and then have lower priority, the industry of high priority to the low data text of requirement of real-time
Business has the chance of more multiple access channel than the business of low priority.Compared to 802.11 traditional WLAN standards, IEEE
The QoS performance of 802.11e has certain promotion.It, should with the QoS wireless MAC protocols ensured but from the point of view of the definition of QoS
More urgent data packet is preferentially allowed to obtain the chance of access channel.The time delay caused by the state variability of Radio Link
The hop count that shake and different transmission path are passed through is different, low priority class defined in IEEE 802.11e
Other data frame is possible to data frame more other than high priority class, has more urgent delay requirement.However, in IEEE
Under 802.11e, the other data frame of high priority class is still preferentially sent, rather than truly more urgent data frame.It is another
Aspect, the other data frame of high priority class are once broken out, by long-term busy channel resource, and the other data of low priority class
Frame is difficult to obtain the chance of access channel.
Summary of the invention
In view of the deficiencies of the prior art, it is an object of the present invention to provide a kind of based on departure time the latest and most rickle
Point coordinates wireless medium cut-in method, and the method improves the service quality of WLAN, the latest departure time small number
According to packet can priority access channel if same website has small data packet of multiple departure times be the latest able to achieve continuous transmission.
The purpose of the present invention can be achieved through the following technical solutions:
Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle, the method includes following steps
It is rapid:
S1, data packet initially enter the queue of common website, calculate local residual time delay and the latest departure time,
In, it when data packet enters queue, is lined up according to the departure time the latest of data packet, so that departure time smaller data the latest
Packet, position in the queue are more forward；
S2, default single poll at most transmit N number of frame, and website sends association request frame to AP (Access Point, center
Dispatching point), and carry the departure time the latest of most top n frames, website voluntarily record sent the latest departure time information to
The queue position of AP carries N number of departure time the latest as website sends association request frame, then record position is N, AP maintenance one
It is a using the departure time the latest as sort by most rickle (the most rickle be it is a kind of by sequence complete binary tree, wherein
Value of the data value of any nonterminal node no more than its left child node and right child node), a node of most rickle includes
The departure time the latest of Site ID and a frame, after AP receives association request frame, by the departure time the latest of most top n frames and
Site ID forms at most N number of node, is sequentially inserted into most rickle, and the process is completed before data start exchange；
S3, circulation execute following steps:
Most rickle heap top node successively goes out heap, until the Site ID of heap top node is different, it is assumed that most rickle pops up k
The Site ID of a node, this k node is identical, then AP sends poll frame and notifies the website, which obtains the power of access channel
Limit, and k number can be sent according to frame；
When the website one data frame of every transmission, frame head can all carry the website queue record position next bit data packet
Departure time the latest, and record position, if the next bit of record position does not have data packet, carries out mark in frame head from increasing 1
Note；
After AP receives data frame, frame head departure time the latest is extracted, node is formed with Site ID, is inserted into most rickle, if
Frame head does not have data packet labeled as the next bit of record position, then marks in the special sign position of current data packet, and AP is received
To after current data packet, by the maximum value of departure time is single plus a system shortest time the latest in the Site ID and most rickle
Position (such as 1 μ s) forms new node, most rickle is inserted into, to the website will not be allowed permanent while making AP elder generation other websites of poll
Lose poll chance.
Further, in step S1, the calculating step of the local residual time delay are as follows:
Global residual time delay is calculated first, i.e., data packet is from current site to the maximum delay of purpose website, for multi-hop
Link, if n is total hop count in path, i is the hop count undergone, and experience i is jumped, and reaches i-th of website, giThe is reached for data packet
Global residual time delay when i website, as i=0, the 0th website is Source Site, global residual time delay gi=g0, g0As
The end-to-end time delay maximum value that the Business Stream is preset, by following formula, progressive alternate finds out global residual time delay when each jump:
Wherein, TAiAt the time of reaching i-th of website for data packet, ATDiFor data packet actually leaving in i-th website
Moment, then ATDi-TAiIt is data packet in the practical residence time of i-th of website, size is the size of data packet, and rate is data
Transmission rate, size/rate are the transmission delay that data packet is sent from i-th of website；
Then local residual time delay is calculated, i.e., the time that data packet allows to stay in current site adopts multi-hop link
Local residual time delay is calculated the average value of remaining hop count with global residual time delay, and data packet is each in remaining path to jump
The local residual time delay of the maximum that single website stays is such as following formula:
Wherein, n-i is residual hop；
For one hop link, residual time delay does not repartition global residual time delay and local residual time delay, maximum residual time delay
The as end-to-end time delay maximum value that presets of Business Stream.
Further, in step S1, the calculation method of the departure time the latest are as follows:
For multi-hop link, by data packet i-th of website the local residual time delay l of maximumi, i.e., the data packet is i-th
The arrival time TA of maximum residence time of a website and the data packet in i-th of websitei, the data packet can be acquired
In the departure time the latest of i-th of website:
Compared with the prior art, the invention has the following advantages and beneficial effects:
The present invention is based on the points of departure time the latest and most rickle to coordinate wireless medium cut-in method, compares IEEE
802.11 " doing one's best " increases QoS performance to MAC layer, also, is different from IEEE 802.11e and is based on " class " realization
Service differentiation considers from single data packet, and really most urgent data packet is allowed to access medium at first, largely avoids because super
When send packet discard network resources waste, meanwhile, single poll can send multiple data frames, reduce the hair of poll frame
Frequency is sent, the effective rate of utilization of channel is improved.
Detailed description of the invention
Fig. 1 is the stream that the embodiment of the present invention coordinates wireless medium cut-in method based on the point of departure time the latest and most rickle
Journey schematic diagram.
Specific embodiment
Present invention will now be described in further detail with reference to the embodiments and the accompanying drawings, but embodiments of the present invention are unlimited
In this.
Embodiment:
It present embodiments provides a kind of based on the point of departure time the latest and most rickle coordination wireless medium cut-in method, institute
The flow chart for stating method is as shown in Figure 1, comprising the following steps:
S1, data packet initially enter the queue of common website, calculate local residual time delay and the latest departure time,
In, it when data packet enters queue, is lined up according to the departure time the latest of data packet, so that departure time smaller data the latest
Packet, position in the queue are more forward；
The data packet of each Business Stream has the maximum value of end-to-end time delay to limit, when data packet it is end-to-end when
When prolonging more than its maximum value, even if after the data packet is received by targeted sites, can also be dropped, so, it can also be end-to-end
The maximum value of time delay is interpreted as the maximum lifetime of data packet, the setting of this end-to-end time delay maximum value is in order to meet business
The QoS demand of stream, such as the Business Stream of real-time voice dialogue, the voice messaging of Party A only within predetermined time interval
It is transmitted to Party B in time, can just enable both sides' normal communication of call, once wherein the information delay of a side is serious, both sides
It will be unable to normal communication, this predetermined time interval is exactly end-to-end time delay maximum value, and end-to-end time delay maximum value is just by industry
Business stream is arranged according to itself actual QoS requirement, and residual time delay is exactly that the end-to-end time delay maximum value of data packet subtracts as its name suggests
The residual time delay of the time for going the data packet to have been subjected to, data packet are fewer, more urgent to be highly necessary sent to purpose website, if super
Shi Liao, even if purpose website receives, data packet can be also dropped, and reduce network performance instead, so, when the residue of data packet
Prolong fewer, the urgency level of the data packet is higher, should with the QoS wireless MAC protocols ensured from the point of view of the definition of QoS
Therefore the chance for preferentially allowing more urgent data packet to obtain access channel is as the parameter of MAC protocol with residual time delay
Most suitable.
For multi-hop link, if n is total hop count in path, i is the hop count undergone, and experience i is jumped, and reaches i-th of website,
giGlobal residual time delay when i-th of website is reached for data packet, as i=0, the 0th website is Source Site, global remaining
Time delay gi=g0, g0The as end-to-end time delay maximum value that presets of the Business Stream, by following formula, progressive alternate finds out each jump
When global residual time delay:
Wherein, TAiAt the time of reaching i-th of website for data packet, ATDiFor data packet actually leaving in i-th website
Moment, then ATDi-TAiIt is data packet in the practical residence time of i-th of website, size is the size of data packet, and rate is data
Transmission rate, size/rate are the transmission delay that data packet is sent from i-th of website；
Then local residual time delay is calculated, i.e., the time that data packet allows to stay in current site adopts multi-hop link
Local residual time delay is calculated the average value of remaining hop count with global residual time delay, and data packet is each in remaining path to jump
The local residual time delay of the maximum that single website stays is such as following formula:
Wherein, n-i is residual hop；
For one hop link, residual time delay does not repartition global residual time delay and local residual time delay, maximum residual time delay
The as end-to-end time delay maximum value that presets of Business Stream；
For multi-hop link, by data packet i-th of website the local residual time delay l of maximumi, i.e., the data packet is i-th
The arrival time TA of maximum residence time of a website and the data packet in i-th of websitei, the data packet can be acquired
In the departure time the latest of i-th of website:
S2, default single poll at most transmit N number of frame, and website sends association request frame to AP (Access Point, center
Dispatching point), and carry the departure time the latest of most top n frames, website voluntarily record sent the latest departure time information to
The queue position of AP carries N number of departure time the latest as website sends association request frame, then record position is N, AP maintenance one
It is a using the departure time the latest as sort by most rickle (the most rickle be it is a kind of by sequence complete binary tree, wherein
Value of the data value of any nonterminal node no more than its left child node and right child node), a node of most rickle includes
The departure time the latest of Site ID and a frame, after AP receives association request frame, by the departure time the latest of most top n frames and
Site ID forms at most N number of node, is sequentially inserted into most rickle, and the process is completed before data start exchange；
S3, circulation execute following steps:
Most rickle heap top node successively goes out heap, until the Site ID of heap top node is different, it is assumed that most rickle pops up k
The Site ID of a node, this k node is identical, then AP sends poll frame and notifies the website, which obtains the power of access channel
Limit, and k number can be sent according to frame；
When the website one data frame of every transmission, frame head can all carry the website queue record position next bit data packet
Departure time the latest, and record position, if the next bit of record position does not have data packet, carries out mark in frame head from increasing 1
Note；
After AP receives data frame, frame head departure time the latest is extracted, node is formed with Site ID, is inserted into most rickle, if
Frame head does not have data packet labeled as the next bit of record position, then marks in the special sign position of current data packet, and AP is received
To after current data packet, by the maximum value of departure time is single plus a system shortest time the latest in the Site ID and most rickle
Position (such as 1 μ s) forms new node, most rickle is inserted into, to the website will not be allowed permanent while making AP elder generation other websites of poll
Lose poll chance.
The above, only the invention patent preferred embodiment, but the scope of protection of the patent of the present invention is not limited to
This, anyone skilled in the art is in the range disclosed in the invention patent, according to the present invention the skill of patent
Art scheme and its patent of invention design are subject to equivalent substitution or change, belong to the scope of protection of the patent of the present invention.
Claims (3)
1. coordinating wireless medium cut-in method based on the point of departure time the latest and most rickle, which is characterized in that the method packet
Include following steps:
S1, data packet initially enter the queue of common website, calculate local residual time delay and the latest departure time, wherein In
It when data packet enters queue, is lined up according to the departure time the latest of data packet, so that departure time smaller data packet the latest, In
Position in queue is more forward；
S2, default single poll at most transmit N number of frame, and website sends association request frame to AP, and carries most top n frames most
Late departure time, website voluntarily record the queue position for having sent departure time information the latest to AP, ask as website sends association
Frame is asked to carry N number of departure time the latest, then record position is N, and AP maintenance one is using the departure time the latest as sort by
Most rickle, a node of most rickle includes the departure time the latest of Site ID and a frame, will after AP receives association request frame
The departure time the latest of most top n frames and Site ID form at most N number of node, are sequentially inserted into most rickle, the step S2 exists
Data start to complete before exchange；
S3, circulation execute following steps:
Most rickle heap top node successively goes out heap, until the Site ID of heap top node is different, it is assumed that most rickle pops up k section
The Site ID of point, this k node is identical, then AP sends poll frame and notifies the website, which obtains the permission of access channel, and
And k number can be sent according to frame；
When the website one data frame of every transmission, frame head can all carry the website queue record position next bit data packet the latest
Departure time, and record position, if the next bit of record position does not have data packet, is marked from increasing 1 in frame head；
After AP receives data frame, frame head departure time the latest is extracted, node is formed with Site ID, is inserted into most rickle, if frame head
There is no data packet labeled as the next bit of record position, then marked in the special sign position of current data packet, AP, which is received, to be worked as
After preceding data packet, by the maximum value of departure time adds a system shortest time unit group the latest in the Site ID and most rickle
At new node, it is inserted into most rickle, to the website will not be allowed permanently to lose poll machine while making AP elder generation other websites of poll
Meeting.
2. according to claim 1 coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle,
It is characterized in that, in step S1, the calculating step of the local residual time delay are as follows:
Calculating global residual time delay first, i.e. data packet is from current site to the maximum delay of purpose website, for multi-hop link,
If n is total hop count in path, i is the hop count undergone, and experience i is jumped, and reaches i-th of website, giI-th of station is reached for data packet
Global residual time delay when point, as i=0, the 0th website is Source Site, global residual time delay gi=g0, g0As business
The end-to-end time delay maximum value that stream is preset, by following formula, progressive alternate finds out global residual time delay when each jump:
Wherein, TAiAt the time of reaching i-th of website for data packet, ATDiIt is data packet in the practical departure time of i-th of website,
Then ATDi-TAiIt is data packet in the practical residence time of i-th of website, size is the size of data packet, and rate is data transmission
Rate, size/rate are the transmission delay that data packet is sent from i-th of website；
Then the time that the local residual time delay of calculating, i.e. data packet allow to stay in current site, for multi-hop link, using complete
Office's residual time delay calculates the average value of remaining hop count local residual time delay, and data packet is each in remaining path to jump single
The local residual time delay of the maximum that website stays is such as following formula:
Wherein, n-i is residual hop；
For one hop link, residual time delay does not repartition global residual time delay and local residual time delay, and maximum residual time delay is
The end-to-end time delay maximum value that Business Stream is preset.
3. according to claim 2 coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle,
It is characterized in that, in step S1, the calculation method of the departure time the latest are as follows:
For multi-hop link, by data packet i-th of website the local residual time delay l of maximumi, i.e., the data packet is in i-th of website
Maximum residence time and the data packet i-th of website arrival time TAi, the data packet can be acquired at i-th
The departure time the latest of website:
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711468581.1A CN107959980B (en) | 2017-12-29 | 2017-12-29 | Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle |
| PCT/CN2018/078950 WO2019127914A1 (en) | 2017-12-29 | 2018-03-14 | Point coordination wireless medium access method based on latest leaving moment and least heap |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711468581.1A CN107959980B (en) | 2017-12-29 | 2017-12-29 | Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107959980A CN107959980A (en) | 2018-04-24 |
| CN107959980B true CN107959980B (en) | 2019-11-15 |
Family
ID=61955658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711468581.1A Active CN107959980B (en) | 2017-12-29 | 2017-12-29 | Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107959980B (en) |
| WO (1) | WO2019127914A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113556825B (en) * | 2021-07-02 | 2023-09-26 | 中国船舶集团有限公司第七二四研究所 | Multi-attribute decision-based polling method in point coordination |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103428772A (en) * | 2013-08-09 | 2013-12-04 | 华南理工大学 | Wireless medium access methods for DCF (distributed coordination function)/PCF (point coordination function) on basis of residual delays |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1338125A2 (en) * | 2000-11-03 | 2003-08-27 | AT & T Corp. | Tiered contention multiple access (tcma): a method for priority-based shared channel access |
| US8687546B2 (en) * | 2009-12-28 | 2014-04-01 | Intel Corporation | Efficient uplink SDMA operation |
| WO2013184889A1 (en) * | 2012-06-08 | 2013-12-12 | Marvell World Trade Ltd. | Method and apparatus for restricting channel access to a wireless station operating in accordance with a power saving scheme |
| US20160014803A1 (en) * | 2014-07-09 | 2016-01-14 | Qualcomm Incorporated | Systems and methods for traffic information signaling in a wireless communications network |
-
2017
- 2017-12-29 CN CN201711468581.1A patent/CN107959980B/en active Active
-
2018
- 2018-03-14 WO PCT/CN2018/078950 patent/WO2019127914A1/en active Application Filing
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103428772A (en) * | 2013-08-09 | 2013-12-04 | 华南理工大学 | Wireless medium access methods for DCF (distributed coordination function)/PCF (point coordination function) on basis of residual delays |
Non-Patent Citations (2)
| Title |
|---|
| Multi-Priority based QoS MAC Protocol for Wireless Sensor Networks;Sohail Sarang,et. al.;《2017 7th IEEE International Conference on System Engineering and Technology (ICSET 2017)》;20171003;54-47 * |
| 无线Mesh网络多媒体传输QoS路由与MAC层策略研究;符琦;《中国博士学位论文全文数据库 信息科技辑》;20141215;1,76-85 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019127914A1 (en) | 2019-07-04 |
| CN107959980A (en) | 2018-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TW201717694A (en) | Quality of service aware access point and device steering | |
| KR101354130B1 (en) | Method for transmitting and receiving the frame in wireless LAN | |
| CN103220726B (en) | A kind of dynamic adjusting method of EDCA parameter value and relevant apparatus | |
| US20110243117A1 (en) | Base station and wireless terminal | |
| JP2007028210A (en) | Wireless lan base station and wireless terminal | |
| Sikdar | An analytic model for the delay in IEEE 802.11 PCF MAC-based wireless networks | |
| WO2016044981A1 (en) | Method and apparatus for transmitting uplink service data | |
| Ahemd et al. | QoS and Admission Controller in IEEE 802.11 e WLAN | |
| CN107959980B (en) | Coordinate wireless medium cut-in method based on the point of departure time the latest and most rickle | |
| US8488607B2 (en) | Method for WLAN link aggregation and system for using the same | |
| CN103152834A (en) | Intelligent allocation method for wireless flow | |
| JP2006067090A (en) | Method, device and program for service quality guarantee and recording medium recording the program | |
| Ju et al. | Dynamic TXOP allocation for multimedia QoS providing over wireless networks | |
| CN102123448B (en) | Channel reservation method based on double busy tone mechanism in wireless self-organizing network | |
| Min et al. | Performance modelling and optimization of integrated wireless LANs and multi‐hop mesh networks | |
| JP2007060365A (en) | Radio communication apparatus and radio communication method | |
| Son et al. | An effective polling scheme for IEEE 802.11 e | |
| Sanguankotchakorn et al. | Adaptive channel access mechanism for real time traffic over IEEE 802.11 e Wi-Fi network | |
| KR101421570B1 (en) | Fairness Enhancement Scheme for Multimedia Traffic in IEEE 802.11e Wireless LANs | |
| Quan | Improving the performance of WLAN to support VoIP application | |
| Gao et al. | Admission control with physical rate measurement for IEEE 802.11 e controlled channel access | |
| Takeuchi et al. | Dynamic Adaptation of Contention Window Sizes in IEEE 802. lie Wireless LAN | |
| Si et al. | IEEE 802.11 DCF PSM model and a novel downlink access scheme | |
| Singh et al. | Performance analysis of extended AODV with IEEE802. 11e HCCA to support QoS in hybrid network | |
| Al-Karaki et al. | EPCF: a lightweight multi-priority PCF for QoS support in IEEE 802.11 wireless LANs |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |