WO2006026310A1 - Procede et systeme pour mecanisme de qualite de service pour reseau sans fil - Google Patents
Procede et systeme pour mecanisme de qualite de service pour reseau sans fil Download PDFInfo
- Publication number
- WO2006026310A1 WO2006026310A1 PCT/US2005/030144 US2005030144W WO2006026310A1 WO 2006026310 A1 WO2006026310 A1 WO 2006026310A1 US 2005030144 W US2005030144 W US 2005030144W WO 2006026310 A1 WO2006026310 A1 WO 2006026310A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- length
- transmission operation
- service
- expansion
- polling
- Prior art date
Links
- 230000007246 mechanism Effects 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 title claims description 25
- 230000005540 biological transmission Effects 0.000 claims abstract description 65
- 238000010586 diagram Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000008450 motivation Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/04—Scheduled access
- H04W74/06—Scheduled access using polling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/26—Resource reservation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/08—Access point devices
Definitions
- the present invention relates to wireless communication networks, and more particularly to a quality of service mechanism for reducing bandwidth losses and increasing admission capability.
- Wireless communications have grown tremendously over the past few years, becoming widely applied to the realm of personal and business computing. Wireless access is quickly broadening network reach by providing convenient and inexpensive access in hard-to-wire locations. A major motivation and benefit from wireless LANs is increased mobility. Wireless network users are able to access LANs from nearly anywhere without being bounded through a conventional wired network connection.
- IEEE 802.11 standard for wireless LANs stands as a significant milestone in the evolution of wireless network technologies.
- IEEE 802.1 Ie is a set of quality of service (QoS) enhancements to the medium access control (MAC).
- QoS quality of service
- MAC medium access control
- references to the 802.1 Ie specification correspond to IEEE80211 WG, IEEE802.1 le/D8.0, "Draft Amendment to Standard for Information Technology - Telecommunications and Information Exchange between Systems - LAN/MAN Specific Requirements - Part 1 1 : Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Medium Access Control
- MAC Quality of Service
- QoS Quality of Service Enhancements
- HCF hybrid coordination function
- EDCA enhanced distributed channel access
- HCF also implements a contention-free hybrid controlled channel access (HCCA) method, which is based on a polling mechanism between a hybrid coordinator (HC) located within a quality of service access point (QAP) and the pollable quality of service stations (QSTAs).
- HCCA contention-free hybrid controlled channel access
- QAP quality of service access point
- QSTAs pollable quality of service stations
- QBSS quality of service basic service set
- HCCA requires the presence of a contention-based method (e.g., EDCA) at least in order to establish the polling mechanism between the HC and QSTAs.
- EDCA contention-based method
- HC traffic delivery and TXOP allocation may be scheduled during both the CFP (Contention Free Period) and CP (Contention Period) intervals in order to meet the QoS requirements of particular traffic streams (TSs) described in detail by appropriate traffic specification (TSPEC) elements.
- CFP Contention Free Period
- CP Contention Period
- the transfer protocol under HCCA is based on a polling scheme controlled by the HC with each granted TXOP defined by an implicit starting time and a defined maximum length. These parameters are derived by a service scheduler (SeS) of the HC, taking into account the TSPEC values sent to the HC from the requesting QSTAs. The SeS finally follows the calculated service schedule, providing a 'guaranteed channel access 1 to the accepted traffic streams.
- SeS service scheduler
- the SeS 20 is responsible for granting polling service through TXOPs to the QSTAs and their QoS traffic streams. If a TS (and its corresponding TSPEC) is admitted by the admission control unit (ACU), the scheduler is responsible for granting channel access to this TS based on the negotiated TSPEC parameters. This access is offered in terms of TXOPs that satisfy the service schedule.
- the SeS 20 sends polls within specific time interval lengths (also defined in the TSPEC as the maximum service interval value), defining the duration of the allowed TS transmission (i.e., the TXOP duration).
- a minimum set of TSPEC parameters must be defined during TSPEC negotiation: a) the mean data rate b) the nominal MSDU size and c) at least one of the maximum service interval and the delay bound.
- the HC may also admit a TSPEC with an alternative set of TSPEC parameters.
- these parameters are indicated to the destination QSTA.
- the simple scheduler reference design proposed by the 802.1 Ie specification was found to induce significant bandwidth losses, which reduce the overall admission capacity. Thus, a need exists for reducing these losses.
- the present invention addresses such a need.
- aspects for a quality of service mechanism for a wireless network include reserving time for contention-based transmissions of station devices under a polling-based channel access function in an access point. Also included is deriving a scheduled polling service under access rules of the polling-based channel access function, wherein admission capability and bandwidth management of the wireless network are enhanced.
- a scheduling mechanism is provided that significantly reduces the unused TXOPs length in order to increase the admission capacity of the service area by using an improved TXOP calculation formula.
- the scheduling mechanism further expands the length of TXOPs granted to the different traffic streams in order to avoid queue overflows when certain criteria are met or provides extra TXOPs at the end of the schedule, such that the stations may use it for emptying the loaded data queues.
- the maximum service interval traffic stream parameters are preserved, and the scheduling mechanism is transparent to all client devices in a service set area, thus aiding adoption of the mechanism in an interoperable system.
- Figure 1 illustrates a system diagram of a prior art wireless network.
- Figure 2 illustrates hybrid coordinator of the QAP of Figure 1.
- Figure 3 illustrates a typical TXOP schedule timing diagram.
- Figure 4 illustrates a system diagram of a wireless network that includes a scheduling mechanism in accordance with the present invention.
- the present invention relates to quality of service mechanism for reducing bandwidth losses and increasing admission capability.
- the following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements.
- Various modifications to the preferred embodiment and the generic principles and features described herein will be readily apparent to those skilled in the art.
- the present invention is not intended to be limited to the embodiments shown but is to be accorded the widest scope consistent with the principles and features described herein.
- the simple scheduler proposed by the 802.1 Ie specification uses the mandatory set of TSPEC parameters: mean data rate, nominal MSDU size, and maximum service interval, in order to generate a schedule service, while meeting minimum defined performance requirements.
- the simple scheduler calculates the TXOP length corresponding to the i-th QSTA using the following equation:
- TXOP 1 max ⁇ R, + o, * R ⁇ , + o
- p is the TSPEC mean data rate in bits per second
- L and M are the nominal and maximum allowable MDSU size (in bits), respectively
- R is the physical transmission rate negotiated in the TSPEC (in bits per second).
- the overhead, O value (in seconds) represents the overhead introduced by the MAC layer, including interframe spaces, ACKs, and CF-Polls and should be calculated for every TS.
- the parameter SI represent the scheduled service interval calculated as the first sub-multiple of the beacon interval that is less than the minimum of all maximum service interval for all admitted streams.
- the TXOP starting time is constant within each SI, as the polling operation is performed in a serial manner.
- SI In order to derive a service schedule using this described simple scheduler, SI must be calculated as an appropriate sub-multiple of the beacon interval.
- the HCCA access method must interoperate with the contention based EDCA, hence a minimum time-length within each beacon interval must be reserved for EDCA traffic. It should be noted that this time reservation also affects the admission capabilities of the
- the SI is calculated, as follows: Assuming that EDCAInterval is the time duration (in seconds) to reserve within the beacon interval and SImin (in seconds) is the minimum of all the admitted TSs (or TSPECs) maximum service interval values, the following inequalities must apply: (2) EDCAInterval ⁇ SI mm and
- SI (in seconds) is the new service interval calculated as:
- a scheduling mechanism 40 is provided for an SeS 42 of a QAP 44 in a wireless network 46 which also includes QSTAs 48, as shown in Figure 4.
- the scheduling mechanism 40 calculates the TXOPs lengths for every admitted stream based on the TSPEC parameters of each stream using the following equation:
- TXOP P ' xBeaCOnMerml + O R 1 Xn where n is derived by equation (5). .
- the SeS 40 using the scheduling method of the present invention, establishes the service schedule and starts polling the QSTAs, which use the granted TXOP for sending pending data belonging to a specific admitted TS.
- the QSTAs also send information about the pending data in the TS queue. For example, q(k) (in bytes), where k defines a TS within the TXOP owner QSTA with index i using the queue size parameter in the QoS control field of the frame transmitted.
- the scheduling mechanism 40 of the present invention aggregates this information obtained by all the serviced QSTAs (producing an overall value Q) and if the pending queue value q(k) is greater than a programmable threshold value Qthres, it attempts to expand the corresponding TXOP length by TXOPExapansionLength, determined by q(k), Q, and the unallocated channel access time in each SI that is not granted to TXOPs (and thus can be allocated to other requesting TSs.) This procedure is analytically described as :
- TXOPExpansionLength ⁇ - ⁇ SI - ⁇ TXOP 1 ]
- TXOP 1 11 TXOP 1 + TXOPEpansionLength, where TXOPi,e denotes the total new TXOP length after expansion.
- the TXOP expansion method in accordance with the present invention is performed on a predetermined basis, i.e., on a per beacon or per service interval basis.
- the TXOP expansion attempt is performed within every beacon or service interval.
- the expanded TXOP duration is granted by the HC only if it does not violate the maximum service interval of the TSs that are getting polled within the same SI after the time instance ti. In such a case, the TXOP is not expanded
- TXOPi,e TXOPi
- the HC attempts to re-poll the specific QSTA immediately after the end of all the scheduled TXOP within current SI.
- the length of the additional TXOP equals the calculated TXOPExpansionLength.
- the HC re-polling may take place provided that there is enough transmission time prior to the beginning of the next scheduled SI, i.e.:
- a scheduling mechanism is provided that significantly reduces the unused TXOPs length in order to increase the admission capacity of the service area by using an improved TXOP calculation formula.
- the scheduling mechanism further expands the length of TXOPs granted to the different traffic streams in order to avoid queue overflows when certain criteria are met or provides extra TXOPs at the end of the schedule, such that the stations may use it for emptying the loaded data queues.
- the maximum service interval traffic stream parameters are preserved, and the scheduling mechanism is transparent to all client devices in a service set area, thus aiding adoption of the mechanism in an interoperable system.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GR20040100344A GR20040100344A (el) | 2004-08-30 | 2004-08-30 | Μεθοδος και συστημα για ενα μηχανισμο διασφαλισησποιοτητας υπηρεσιας για ασυρματα δικτυα |
GR20040100344 | 2004-08-30 | ||
US10/986,344 | 2004-11-10 | ||
US10/986,344 US20060045051A1 (en) | 2004-08-30 | 2004-11-10 | Method and system for a quality of service mechanism for a wireless network |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006026310A1 true WO2006026310A1 (fr) | 2006-03-09 |
Family
ID=36000385
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2005/030144 WO2006026310A1 (fr) | 2004-08-30 | 2005-08-23 | Procede et systeme pour mecanisme de qualite de service pour reseau sans fil |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2006026310A1 (fr) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007148027A2 (fr) * | 2006-06-23 | 2007-12-27 | France Telecom | Système et procédé de gestion d'accès a un réseau a accès multiple a répartition dans le temps |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5371734A (en) * | 1993-01-29 | 1994-12-06 | Digital Ocean, Inc. | Medium access control protocol for wireless network |
US20020093929A1 (en) * | 2001-01-18 | 2002-07-18 | Koninklijke Philips Electronics N.V. | System and method for sharing bandwidth between co-located 802.11a/e and HIPERLAN/2 systems |
US20030063563A1 (en) * | 2001-09-11 | 2003-04-03 | Sharp Laboratories Of America, Inc. | Class of computationally parsimonious schedulers for enforcing quality of service over packet based AV-centric home networks |
US20030093526A1 (en) * | 2001-11-13 | 2003-05-15 | Koninklijke Philips Electronics N. V. | Apparatus and method for providing quality of service signaling for wireless mac layer |
US20040042435A1 (en) * | 2002-09-04 | 2004-03-04 | Koninklijke Philips Electronics N.V. | Apparatus and method for providing QoS service schedule and bandwidth allocation to a wireless station |
-
2005
- 2005-08-23 WO PCT/US2005/030144 patent/WO2006026310A1/fr active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5371734A (en) * | 1993-01-29 | 1994-12-06 | Digital Ocean, Inc. | Medium access control protocol for wireless network |
US20020093929A1 (en) * | 2001-01-18 | 2002-07-18 | Koninklijke Philips Electronics N.V. | System and method for sharing bandwidth between co-located 802.11a/e and HIPERLAN/2 systems |
US20030063563A1 (en) * | 2001-09-11 | 2003-04-03 | Sharp Laboratories Of America, Inc. | Class of computationally parsimonious schedulers for enforcing quality of service over packet based AV-centric home networks |
US20030093526A1 (en) * | 2001-11-13 | 2003-05-15 | Koninklijke Philips Electronics N. V. | Apparatus and method for providing quality of service signaling for wireless mac layer |
US20040042435A1 (en) * | 2002-09-04 | 2004-03-04 | Koninklijke Philips Electronics N.V. | Apparatus and method for providing QoS service schedule and bandwidth allocation to a wireless station |
Non-Patent Citations (1)
Title |
---|
ANSEL P. ET AL: "An Efficient Scheduling Scheduling Scheme for IEEE 802.11e", PROCEEDINGS OF IEEE WORKSHOP ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS (WIOPT 2004), March 2004 (2004-03-01), CAMBRIDGE, UK, XP002995516 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2007148027A2 (fr) * | 2006-06-23 | 2007-12-27 | France Telecom | Système et procédé de gestion d'accès a un réseau a accès multiple a répartition dans le temps |
WO2007148027A3 (fr) * | 2006-06-23 | 2008-01-31 | France Telecom | Système et procédé de gestion d'accès a un réseau a accès multiple a répartition dans le temps |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Xiao | IEEE 802.11 e: QoS provisioning at the MAC layer | |
JP4401352B2 (ja) | スケジューラ・システム及びその方法 | |
Ni | Performance analysis and enhancements for IEEE 802.11 e wireless networks | |
US7245946B2 (en) | Optimal power saving scheduler for 802.11e APSD | |
US7123627B2 (en) | Class of computationally parsimonious schedulers for enforcing quality of service over packet based AV-centric home networks | |
KR101389680B1 (ko) | 무선 통신 시스템 및 이를 구성하는 단말장치와 베이스스테이션 그리고 이들의 채널 스케줄링 방법 | |
TWI390904B (zh) | 無線區域網路服務管理品質 | |
US20060045050A1 (en) | Method and system for a quality of service mechanism for a wireless network | |
US20060045051A1 (en) | Method and system for a quality of service mechanism for a wireless network | |
KR101353632B1 (ko) | 경쟁 기반의 데이터 송수신용 단말장치 및 베이스 스테이션그리고 이들을 포함한 시스템 및 경쟁 기반의 데이터송수신 방법 | |
Boggia et al. | Feedback-based bandwidth allocation with call admission control for providing delay guarantees in IEEE 802.11 e networks | |
Ni et al. | QoS support for IEEE 802.11 Wireless LAN | |
Skyrianoglou et al. | Traffic scheduling for multimedia QoS over wireless LANs | |
WO2006026310A1 (fr) | Procede et systeme pour mecanisme de qualite de service pour reseau sans fil | |
Fan et al. | Admission control for variable bit rate traffic using variable service interval in IEEE 802.11 e WLANs | |
Huang et al. | Gaussian approximation based admission control for variable bit rate traffic in IEEE 802.11 e WLANs | |
KR101345135B1 (ko) | IEEE 802.11e HCCA 프로토콜의 스케줄링방법 및 시스템 | |
Fan et al. | Timer based scheduling control algorithm in WLAN for real-time services | |
Gavini et al. | PLUS-DAC: a distributed admission control scheme for IEEE 802.11 e WLANs | |
Kuo et al. | Design and evaluation of a high throughput MAC with QoS guarantee for wireless LANs | |
Lee et al. | A QoS provisioning mechanisms based on effective bandwidth for the polling based WLAN system | |
Choi et al. | An adaptive TXOP allocation in IEEE 802.11 e WLANs | |
Chen et al. | HMM: hybrid multipolling mechanism with pre-allocation admission control for real-time transmissions in WLANs | |
Lagkas et al. | AWPP: A new scheme for wireless access control proportional to traffic priority and rate | |
Huang et al. | Flexible TXOP assignments for efficient QoS scheduling in IEEE 802.11 e WLANs |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KM KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NG NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU LV MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |