IEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS
|
|
- Austin McKenzie
- 6 years ago
- Views:
Transcription
1 ACCEPTED FROM O PEN C ALL IEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS ess AIFS[j] AIFS[] PIFS SIFS AIFS[] Content 0 to CW Bac Slot Select s The emergng IEEE e standard provdes QoS features and multmeda support to the exstng b and a wreless standards, whle mantanng full bacward compatblty wth these standards. ABSTRACT Ths artcle ntroduces the emergng IEEE e standard to support qualty of servce at the medum access control layer. Both the contenton-based and contenton-free centrally controlled channel access mechansms are ntroduced by descrbng not only the MAC protocol operatons and parameters, but also the call admsson technques and schedulng algorthm that have been desgned for IEEE e. Fnally, we provde smulaton results amed to hghlght the capablty of the EDCF to dfferentate the traffc classes. INTRODUCTION Net access through hotspots at arports, hotels, and coffee shops, va the hgh-speed wreless Internet access servce nown as WF, s rapdly becomng common. Recently, AT&T, IBM, and Intel joned forces to form Cometa Networs, an ambtous effort to start deployng wreless access ponts n 2003, wth 20,000 WF hot spots set up throughout the country by ths year. It was predcted that the number of hotspots could jump to 80,000 wthn four years. Wreless local area networs (WLANs) are becomng ubqutous and ncreasngly reled on as IEEE products become successful n the maret. In wreless home and offce networs where voce, vdeo, and audo wll be delvered, qualty of servce (QoS) and multmeda support are crtcal, and are essental ngredents to offer customers vdeo on demand, audo on demand, voce over IP, and hgh-speed Internet access. Consumer electroncs companes, such as Panasonc and Sharp, are loong to offer home wreless networng devces n whch QoS s a crtcal element. In the near future, all consumer electronc devces at home, such as VCRs, TVs, and mcrowave ovens, can be equpped for and connected to QoS-enabled wreless networs. One of the most promsng home networng canddates s IEEE WLAN. IEEE medum access control (MAC) employs a mandatory contenton-based channel access functon called the dstrbuted coordnaton functon (DCF)and an optonal centrally controlled channel access functon called the pont coordnaton functon (PCF) [1]. The DCF adopts carrer sense multple access wth collson avodance (CSMA/CA) and bnary exponental bacoff. It s treated as the wreless verson of the most successful LAN, IEEE (Ethernet), whch adopts CSMA wth collson detecton (CSMA/CD) and bnary exponental bacoff. Both IEEE DCF and IEEE enable fast nstallaton wth mnmal management and mantenance costs, and are very robust protocols for best effort servce. However, the current DCF s unsutable for multmeda applcatons wth QoS requrements [2]. Even though the PCF can provde some lmted QoS support, t s barely mplemented n today s products due to ts complexty and neffcency for normal data transmsson. To support MAC-level QoS, the IEEE Worng Group s currently worng on IEEE e [3 7], whch s n the fnal stage. The emergng IEEE e standard provdes QoS features and multmeda support to the exstng b [8] and a [9] wreless standards, whle mantanng full bacward compatblty wth these standards. In order to support multmeda applcatons such as voce and vdeo over the wreless medum, the IEEE e MAC employs a channel access functon called the hybrd coordnaton functon (HCF), whch ncludes contenton-based channel access and a contenton-free centrally controlled channel access mechansm. The contenton-based channel access s also referred to as the enhanced dstrbuted coordnaton functon (EDCF). The EDCF provdes dfferentated and dstrbuted access to the wreless medum for multple user prortes. The centrally controlled channel access of HCF s based on a pollng mechansm wth some enhanced QoS-specfc mechansms and frame subtypes to allow QoS data transfers durng collson-free perods. In ths artcle we frst ntroduce the orgnal IEEE MAC protocol, and then IEEE e. Fnally, we evaluate the EDCF dfferentated mechansm wth smulatons /04/$ IEEE IEEE Wreless Communcatons June 2004
2 IEEE MAC IEEE MAC employs a mandatory DCF and an optonal PCF. These functons determne when a staton (STA), operatng wthn a basc servce set (BSS) or ndependent BSS (IBSS), s permtted to transmt. There are two types of networs: an nfrastructure networ (BSS) n whch an access pont (AP) s present, and an ad hoc networ (IBSS) n whch an AP s not present. In a long run, tme s always dvded nto repetton ntervals called superframes. Each superframe starts wth a beacon frame, and the remanng tme s further dvded nto a contenton-free perod (CFP) and a contenton perod (CP). The DCF wors durng the CP, and the PCF wors durng the CFP. If the PCF s not actve, a superframe wll not nclude the CFP. However, the beacon frame s always sent no matter whether the PCF s actve or not. The beacon frame s a management frame for synchronzatons, power management, and delverng parameters. In a BSS, an AP sends beacon frames. In an IBSS, any moble staton that s confgured to start an IBSS wll begn sendng beacon frames. As other moble statons jon that IBSS, each staton that s a member of the IBSS s randomly chosen for the tas of sendng a beacon frame. Beacon frames are generated at regular ntervals called target beacon transmsson tmes. THE DISTRIBUTED COORDINATION FUNCTION The DCF defnes a basc access mechansm and an optonal request-to-send/clear-to-send (RTS/ CTS) mechansm. In the DCF a staton wth a frame to transmt montors the channel actvtes untl an dle perod equal to a dstrbuted nterframe space (DIFS) s detected. After sensng an dle DIFS, the staton wats for a random bacoff nterval before transmttng. The bacoff tme counter s decremented n terms of slot tme as long as the channel s sensed dle. The counter s stopped when a transmsson s detected on the channel, and reactvated when the channel s sensed dle agan for more than a DIFS. In ths manner, statons deferred from channel access because ther bacoff tme was larger than the bacoff tme of other statons are gven hgher prorty when they resume ther transmsson attempt. The staton transmts ts frame when the bacoff tme reaches zero. At each transmsson, the bacoff tme s unformly chosen n the range (0, CW 1) n terms of tmeslots, where CW s the current bacoff wndow sze. At the very frst transmsson attempt, CW equals the ntal bacoff wndow sze, CW mn. After each unsuccessful transmsson, CW s doubled untl a maxmum bacoff wndow sze value, CW max, s reached. After the destnaton staton successfully receves the frame, t transmts an acnowledgment frame (ACK) followng a short nterframe space (SIFS) tme. If the transmttng staton does not receve the ACK wthn a specfed ACK tmeout, or detects the transmsson of a dfferent frame on the channel, t reschedules the frame transmsson accordng to the prevous bacoff rules. The DCF provdes a channel access mechansm wth equal probabltes to all statons contendng for the same wreless medum. If an AP s present, STAs are not allowed to transmt frames to other STAs that are not APs. The above mechansm s called the basc access mechansm. In such a mechansm, the hdden node problem may happen: transmssons of a staton cannot be detected usng carrer sense by a second staton, but nterfere wth transmsson from the second staton to a thrd staton. To reduce the hdden staton problem, an optonal four-way data transmsson mechansm, RTS/CTS, s also defned n DCF. In RTS/CTS, before transmttng a data frame, a short RTS frame s transmtted. The RTS frame also follows the bacoff rules ntroduced above. If the RTS frame succeeds, the recever staton responds wth a short CTS frame. Then a data frame and an ACK frame wll follow. All four frames (RTS, CTS, data, ACK) are separated by an SIFS tme. In other words, the short RTS and CTS frames reserve the channel for the data frame transmsson that follows. Snce rado transmsson has a range, the range (denoted RA) of the source s RTS transmsson and the range (denoted RB) of the destnaton s CTS transmsson are overlapped but not equal. Therefore, after transmsson of the source s RTS and the destnaton s CTS, the channel s reserved for the data transmsson that follows, and any staton n ether RA or RB wll not transmt. A hdden staton of the source, who s n RB but not n RA, wll not nterfere wth the source data transmsson snce t hears the destnaton s CTS transmsson. THE POINT COORDINATION FUNCTION The PCF s an optonal centrally controlled channel access functon, whch provdes contenton-free (CF) frame transfer. The PCF s desgned to support tme-bounded servces, whch can provde lmted QoS. It logcally sts on top of the DCF and performs pollng, enablng polled statons to transmt wthout contendng for the channel. It has hgher prorty than the DCF by adoptng a shorter nterframe space (IFS) called the pont nterframe space (PIFS): SIFS < PIFS < DIFS. If the PCF s mplemented, a CFP under the PCF and a CP under the DCF alternate over tme. A CFP and a CP form a superframe. The AP where the pont coordnator (PC) s normally located senses the medum dle for a PIFS nterval, and then transmts a beacon frame to ntate a CFP (.e., to ntate a superframe). After a SIFS tme, the PC sends a poll frame to a staton to as to transmt a frame. The poll frame may or may not nclude data to that staton. After recevng the poll frame from the PC, the staton wth a frame to transmt may choose to transmt a frame after a SIFS tme. When the destnaton staton receves the frame, an ACK s returned to the source staton after a SIFS tme. The PC wats a PIFS nterval followng the ACK frame before pollng another staton or termnatng the CFP by transmttng a CF-End frame. If the PC receves no response from the polled staton for a PIFS nterval, the PC can poll the next staton or termnate the CFP by transmttng a CF-End frame. In a long run, tme s always dvded nto repetton ntervals called superframes. Each superframe starts wth a beacon frame, and the remanng tme s further dvded nto a contenton-free perod and a contenton perod. IEEE Wreless Communcatons June
3 The PCF cannot provde good QoS support snce t lacs an admsson functon to control channel access from statons. Therefore, when the traffc load s too hgh, all exstng traffcs may be degraded. 1 In an earler verson of the IEEE e draft, up to eght queues were mplemented nstead of four before the concept of ACs was ntroduced. 0 AIFS[0] BO[0] Access categores 1 AIFS[1] BO[1] Vrtual collson handler Fgure 1. Vrtual transmsson queues, where BO[] stands for the bacoff counter for AC. The PCF cannot provde good QoS support snce t lacs an admsson functon to control channel access from statons. Therefore, when the traffc load s too hgh, all exstng traffc may be degraded. IEEE E IEEE e provdes a channel access functon, the HCF, to support applcatons wth QoS requrements. The HCF ncludes both contenton-based and centrally controlled channel access. Contenton-based access of the HCF s also referred to as the EDCF. In ths artcle we refer to the centrally controlled channel access of the HCF as the controlled HCF. QoS enhancements are avalable to QoS enhanced statons (QSTAs) that can be assocated wth a QoS enhanced access pont (QAP) n a QoS BSS (QBSS) or n a QoS IBSS (QIBSS) wthout a QAP. Snce a QSTA mplements a superset of STA functonalty, the QSTA may assocate wth a non-qos AP n a non-qos BSS to be bacward compatble by provdng non- QoS MAC data servce. Note that the term non- QoS stands for the orgnal MAC ntroduced n the prevous secton. Smlar to the orgnal MAC, a CFP under the controlled-hcf and a CP under the EDCF alternate over tme, and tme s always dvded nto superframes. Each superframe starts wth a beacon frame, and the remanng tme s further dvded nto a CFP and a CP. The EDCF wors durng the CP, and the controlled HCF wors durng CFP. A new concept, transmsson opportunty (), s ntroduced n IEEE e for both the EDCF and controlled HCF. A s a tme perod when a STA has the rght to ntate transmssons onto the wreless medum. It s defned by a startng tme and a maxmum duraton. A STA cannot transmt a frame 2 AIFS[2] BO[2] 3 AIFS[3] BO[3] Prorty AC Desgnaton 1 0 Best effort 2 0 Best effort 0 0 Best effort 3 1 Vdeo probe 4 2 Vdeo 5 2 Vdeo 6 3 Voce 7 3 Voce Table 1. Prorty to access category mappng. that extends beyond a. If a frame s too large to be transmtted n a, t should be fragmented nto smaller frames. A s used by both the EDCF and the controlled HCF, and can be obtaned both when the medum s avalable under the EDCF rules and when the staton receves a poll. Non-AP QSTAs may send requests durng polled s or EDCF s usng the QoS control feld n the frame drected to the QAP, wth the request duraton or queue sze ndcated to the QAP. THE ENHANCED DCF The EDCF s based on dfferentatng prortes at whch traffc s to be delvered and wors wth four access categores (ACs), 1 whch are vrtual DCFs, as shown n Fg. 1, where each AC acheves a dfferentated channel access. Ths dfferentaton s acheved through varyng the amount of tme a STA wll sense the channel to be dle and the length of the contenton wndow durng bacoff. The EDCF supports eght dfferent prortes, whch are further mapped nto four ACs, shown n Table 1. ACs are acheved by dfferentatng the arbtraton nterframe space (AIFS), ntal wndow sze, and maxmum wndow sze. For AC ( = 0, 3), the ntal bacoff wndow sze s CW mn [], the maxmum bacoff wndow sze s CW max [], and the AIFS s AIFS[]. For AC ( = 0, 3), the bacoff mechansm s smlar to the orgnal MAC: after each unsuccessful transmsson, CW[] s doubled untl a maxmum bacoff wndow sze value CW max [] s reached. For 0 < j 3, we have CW mn [] CW mn [j], CW max [] CW max [j], and AIFS[] AIFS[j], and at least one of the above nequaltes must be not equal to. In other words, the EDCF employs AIFS[], CW mn [], and CW max [] (all for = 0,, 3) nstead of DIFS, CW mn, and CW max, respectvely. If one AC has a smaller AIFS or CW mn or CW max, the AC s traffc has a better chance of accessng the wreless medum earler. Fgure 2 shows the EDCF tmng dagram, where three ACs are shown:, j, and. Fgure 1 shows four transmsson queues mplemented n a staton, and each queue supports one AC, behavng roughly as a sngle DCF entty n the orgnal IEEE MAC. It s assumed that a payload from a hgher layer s labeled wth a prorty value and enqueued nto the correspondng 74 IEEE Wreless Communcatons June 2004
4 Immedate access when Medum s free AIFS[]/ AIFS[j]/ AIFS[] AIFS[]/ AIFS[j]/ AIFS[] Busy medum Defer access Fgure 2. The EDCF tmng dagram. AIFS[j] AIFS[] PIFS SIFS AIFS[] queue accordng to the mappng n Table 1. Each queue acts as an ndependent MAC entty and performs the same DCF functon, wth a dfferent nterframe space (AIFS[]), a dfferent ntal wndow sze (CW mn []), and a dfferent maxmum wndow sze (CW max []). Each queue has ts own bacoff counter (BO[]), whch acts ndependently n the same way as the orgnal DCF bacoff counter. If there s more than one queue fnshng the bacoff at the same tme, t s called an nternal collson, whch s resolved as follows. The hghest AC frame s chosen to transmt by the vrtual collson handler. Other lower AC frames whose bacoff counters also reach zero wll ncrease ther bacoff counters wth CW mn [] ( = 0,, 3) accordngly. In other words, other lower AC frames whose bacoff counters also reach zero do not treat ths nternal collson as a real collson after adjustng the bacoff counters. Furthermore, we have AIFS[] PIFS. The values of AIFS[] ( = 0,, 3), CW mn [] ( = 0,, 3), and CW max [] ( = 0,, 3) are referred to as the EDCF parameters, announced by the QAP va perodcally transmtted beacon frames. The QAP can also adaptvely adjust these EDCF parameters based on the networ traffc condtons. DISTRIBUTED ADMISSION CONTROL FOR EDCF The QoS parameter set element (QPSE) provdes nformaton needed by QSTAs for proper operaton of the QoS faclty durng the CP. The QPSE ncludes CW mn [], CW max [], AIFS[], Lmt[], Budget[], Load[], and SurplusFactor[] for ( = 0, 3). For the AC, Lmt[] specfes the tme lmt on s; Budget[] specfes the addtonal amount of tme avalable durng the next beacon nterval; Load[] specfes the amount of tme used durng the prevous beacon nterval; and SurplusFactor[] represents the rato of over-thear bandwdth reserved to the bandwdth of the transported frames requred for successful transmsson. The QPSE s calculated by the QAP for each beacon nterval and embedded nto the next beacon frame transmtted to each QSTA. When the transmsson budget for an AC s depleted, new QSTAs cannot gan transmsson tme, whle exstng QSTAs cannot ncrease the Contenton wndow from 0 to CW mn Bacoff wndow Slot tme Next frame Select slot and decrement bacoff as long as medum s dle transmsson tme they are already usng. Ths mechansm protects exstng flows. The QAP shall measure the amount of tme occuped by transmssons for each AC durng the beacon perod, ncludng assocated SIFS and ACK tmes f applcable. The QAP shall mantan a set of counters TxTme[], whch shall be set to zero mmedately followng transmsson of a beacon. For each data frame transmsson (ether upln or downln), the QAP shall add to the TxTme counter correspondng to the AC of that frame a tme equal to the frame transmsson tme and all overhead nvolved (SIFS tme, MAC and PHY overhead, ACK, etc.). The QAP shall transmt n each beacon the Budget and SurplusFactor for each AC, contaned n QPSE. The QAP wll set - Budget[] to be Budget[] (1) =Max(ATL[] TxTme[]*SurplusFactor[],0). The varable ATL[] s the maxmum amount tme that may be spent on transmssons of AC per beacon nterval. Each QSTA has to mantan the followng varables for each AC: TxCounter[], TxUsed[], TxLmt[], TxRemander[], and TxMemory[]. The varable TxUsed[] counts the amount of tme occuped on ar by transmssons, successful or otherwse, from ths staton for ths AC, ncludng assocated SIFS and ACK tmes f applcable. TxCounter[] counts successful transmssons. The STA shall not transmt a data frame f dong so would result n the value n Txused[] exceedng the value of TxLmt[]. If the QSTA s prevented from sendng a frame for ths reason, t may carry over the partal frame tme remander to the next beacon perod, by storng the remander n TxRemander[]: TxRemander[] = TxLmt[] TxUsed[]; otherwse, TxRemander[] = 0. At each target beacon transmsson tme, the TxMemory, TxLmt, and TxCounter state varables are updated accordng to the followng procedure: If Budget[] = 0 TxMemory[] shall be set to zero for new QSTAs that started transmsson wth ths AC n the last beacon nterval; all other QSTAs TxMemory[] remans unchanged If the Budget[] >0 When the transmsson budget for an AC s depleted, new QSTAs cannot gan transmsson tme, whle exstng QSTAs cannot ncrease the transmsson tme that they are already usng. Ths mechansm protects exstng flows. IEEE Wreless Communcatons June
5 DLP allows QSTAs to transmt frames drectly to another QSTA by settng up such data transfer when a QAP s present. The need for ths protocol s motvated by the fact that the ntended recpent may be n Power Save Mode, n whch case t can only be woen up by the QAP. TxMemory[] = f*txmemory[] + (1 f)* (TxCounter[]*SurplusFactor[] + Budget[]) TxCounter[] = 0 TxLmt[] = TxMemory[] + TxRemander[] where f s the dampng factor, whch does not affect the entrance of a new flow nto the system when enough budget s avalable, because the decreased Budget s offset by an ncreased TxCounter nstantaneously, so TxMemory does not change a lot. The dampng does affect TxMemory when a new flow starts up n another QSTA. In that case, the decreased Budget s not offset by an ncreased TxCounter; consequently, the TxMemory converges to the lower target value. The Budget used n ths calculaton shall be the budget most recently obtaned from the QAP. The TxCounter value shall be the value of the beacon perod before the perod that just ended. Tang the earler value accounts for the delay that occurs between the moment at whch the QAP determnes the Budget and the pont at whch ths budget s used n the above calculatons. The value TxCounter + Budget s the target to whch TxMemory converges. TxLmt s equal to TxMemory plus a possble capped remander. TxMemory memorzes the amount of resources the QSTA has been able to spend n a specfc AC. Once the budget s depleted (.e., Budget hovers around 0), TxMemory converges to TxCounter, whch s the lower lmt. Ths ensures that the QSTA can contnue consumng the same amount of resources n followng beacon perods. Dampng allows for some amount of fluctuaton to occur, but TxMemory cannot grow any further n the saturated state. Ths prevents new flows from enterng the specfc AC when t s saturated. A sutable ntal value for ths varable could be between 0 and Budget[]/SurplusFactor[]. QSTAs shall not ncrease ther TxLmt[] f they dd not transmt traffc wth the AC n the prevous beacon nterval. DIRECT LINK PROTOCOL Drect Ln Protocol (DLP) allows QSTAs to transmt frames drectly to other QSTAs by settng up such data transfer when a QAP s present. The need for ths protocol s motvated by the fact that the ntended recpent may be n power save mode, n whch case t can only be woen up by the QAP. DLP allows the sender and recever to exchange rate set and other nformaton. Furthermore, DLP messages can be used to attach securty nformaton elements. Ths protocol prohbts STAs gong nto power save for the actve duraton of the drect stream. DLP does not apply n an ad hoc networ, where frames are always sent drectly from one QSTA to another. A drect ln can be bult by the followng sequences: QSTA-1 that has data to send nvoes DLP and sends a DLP-request frame to the QAP. Ths request contans the rate set, and (extended) capabltes of QSTA-1, as well as the MAC addresses of QSTA-1 and QSTA-2. If QSTA-2 s assocated n the BSS, the QAP shall forward the DLP-request to the recpent, QSTA-2. If QSTA-2 accepts the drect stream, t shall send a DLP-response frame to the QAP. The QAP shall forward the DLP-response to QSTA-1, after whch the drect ln becomes actve and frames can be sent from QSTA-1 to QSTA-2 and from QSTA-2 to QSTA-1. When the drect ln s actve, QSTA-1 may use DLP probes to gauge the qualty of the ln between QSTA-1 and QSTA-2.The drect ln becomes nactve when no frames have been exchanged as part of the drect ln for the duraton of a DLPIdleTmeout. After the tmeout, frames wth destnaton QSTA-2 shall be sent va the QAP. THE CONTROLLED HCF The controlled HCF, the centrally controlled channel access functon, allows reservaton of transmsson opportuntes (s) wth a hybrd coordnator (HC), a type of PC handlng rules defned by the HCF. The HC, collocated wth a QAP, performs bandwdth management ncludng allocaton of s to QSTAs. Smlar to a PC, an HC can transmt the beacon frame to ntate CFP when t senses the medum dle for a PIFS nterval, and termnate the CFP by transmttng a CF-End frame when t senses the medum dle for a PIFS nterval. A non-ap QSTA, based on ts requrements, requests the HC for s for both ts own transmssons and transmssons from the HC to tself. Non-AP QSTAs may send requests usng the QoS control feld n the frame drected to the QAP, wth the request duraton or queue sze ndcated to the QAP. The HC, based on an admsson control polcy ntroduced n the next subsecton, ether accepts or rejects the request. If the request s accepted, t schedules s for the non-ap QSTA. For transmssons for the STA, HC polls a non- AP QSTA based on the parameters suppled by the non-ap QSTA at the tme of ts request. For transmssons to the non-ap QSTA, the HC queues the frames and delvers them perodcally, agan based on the parameters suppled by the non-ap QSTA. Ths mechansm s expected to be used for applcatons such as voce and vdeo, whch may need perodc servce from the HC. Non-QoS STAs may also assocate n a QBSS. All frames that are sent to non-qos STAs by an AP conform to the orgnal MAC ntroduced earler. ADMISSION CONTROL AND SCHEDULING FOR THE CONTROLLED HCF When the HC provdes controlled channel access to non-ap QSTAs, t s responsble for grantng or denyng pollng servce based on the admtted traffc streams. The behavor of the scheduler s as follows: The scheduler shall be mplemented such that, under the controlled HCF, all statons wth admtted traffc streams are offered s that satsfy the servce schedule. Specfcally, f a traffc stream s admtted by the HC, the scheduler shall send polls any- 76 IEEE Wreless Communcatons June 2004
6 where between the mnmum servce nterval and the maxmum servce nterval wthn the specfcaton nterval. The HC aggregates admtted traffc streams for a sngle QSTA and establshes a servce schedule for the QSTA. Durng any tme nterval [t1, t2], the cumulatve duraton shall be greater than the total tme requred to transmt all frames belongng to all the admtted streams, each arrvng at the mean data rate for the stream, over the perod [t1, t2 D]. The parameter D s set to the specfed maxmum servce nterval. If the maxmum servce nterval s not specfed, D s set to the delay bound. A mnmum set of traffc stream parameters shall be specfed durng the negotaton. The specfcaton of a mnmum set of parameters s requred so that the scheduler can determne a schedule for an admtted stream. These parameters are mean data rate, nomnal MSDU sze, and at least one of maxmum servce nterval and delay bound. Note that IEEE e specfes some mnmum mandatory requrements for admsson control and schedulng for the controlled HCF as dscussed above, and allows vendors to desgn ther own admsson control and scheduler based on some gudelnes. An nformatve example s provded for vendors consderaton n IEEE e as follows. An example of a traffc stream s defned by a set of parameters such as mean data rate, nomnal frame sze, and maxmum servce nterval or delay bound. The maxmum servce nterval s the maxmum nterval between the start of two successve QoS CF polls. All of these crtera affect the admssblty of a gven traffc stream, and any new traffc stream may be rejected. If both maxmum servce nterval and delay bound are specfed, uses the maxmum servce nterval for calculaton of the schedule. The schedule for an admtted stream s calculated n two steps: Calculaton of the scheduled servce nterval (SI) Calculaton of duraton for a gven SI for the stream Frst, calculate the mnmum of all maxmum SIs for all admtted streams. Let ths mnmum be m. Second, the scheduler chooses a number lower than m that s a submultple of the beacon nterval. Ths value s the scheduled SI for all QSTAs wth admtted streams. When a new stream requests admsson, the admsson control process s done n three steps. Frst, calculate the number of frames that arrve at the mean data rate durng the scheduled SI. Second, calculate the duraton that needs to be allocated for the stream. Fnally, the admsson control unt (ACU) determnes that the stream can be admtted when the followng nequalty s satsfed, where s the number of exstng streams and + 1 s used as the ndex for the newly arrvng stream. T ndcates the beacon nterval and T CP s the tme used for EDCF traffc. + 1 j T TCP +. SI j = 1 SI T (2) All admtted streams have guaranteed access to the channel. For the calculaton of the duraton for an admtted stream, the smple scheduler uses the followng parameters: mean data rate (r) and nomnal MSDU sze (L) from the negotated traffc stream, the scheduled SI (SI) calculated above, physcal transmsson rate (R), sze of maxmum frame (2304 bytes, M), and overheads n tme unts (O). The physcal transmsson rate s the mnmum PHY rate negotated n the traffc stream. The overheads n tme ncludes nterframe spaces, ACKs, and CF polls. For the calculaton of the duraton for an admtted stream, the smple scheduler uses the followng parameters. Frst, the scheduler calculates the number of frames that arrved at the mean data rate durng the SI: N ; then the scheduler calculates the duraton as the maxmum of: Tme to transmt N frames at R Tme to transmt one maxmum sze MSDU at R (plus overheads): SI N = *ρ (3) L L * L O M = max( +, + (4) R R O ) An example of the schedulng s shown n Fg. 3. Stream from QSTA s admtted n Fg. 3a. The beacon nterval s 100 ms, and the maxmum SI for the stream s 60 ms. The scheduler calculates a scheduled SI equal to 50 ms usng the steps explaned above. The same process s repeated contnuously whle the maxmum SI for the admtted stream s smaller than current SI. If a new stream s admtted wth a maxmum SI smaller than the current SI, the scheduler needs to change the current SI to a smaller number than the maxmum SI of the newly admtted stream. Therefore, the duraton for the current admtted streams also needs to be recalculated wth the new SI. If a stream s dropped (Fg. 3c), the scheduler mght use the tme avalable to resume contenton. The scheduler mght also choose to move the s for the QSTAs followng the QSTA dropped to use the unused tme. However, ths last opton mght requre the announcement of a new schedule to all QSTAs. Fg. 3c shows the stuaton when a stream for QSTA j s removed. THE GROUP ACKNOWLEDGMENT MECHANISM Snce the wreless medum s error-prone, transmtted frames can easly be corrupted even wthout collsons. In the IEEE MAC protocol, each frame s acnowledged. Ths approach s very natural and robust, but ntroduces a great deal of overhead. In order to reduce the acnowledgment overhead, a new mechansm, called group acnowledgment (GA), s ntroduced n IEEE e. The GA mechansm allows a group of frames to be transmtted before any acnowledgment. After sendng a burst of frames, the sender sends a group acnowledgment request (GroupAcReq) frame, and the recever must respond by sendng the group acnowledgment The specfcaton of a mnmum set of parameters s requred so that the scheduler can determne a schedule for an admtted stream. These parameters are Mean Data Rate, Nomnal MSDU Sze and at least one of Maxmum Servce Interval and Delay Bound. IEEE Wreless Communcatons June
7 The EDCF provdes a prorty scheme by dfferentatng the nter-frame space, the ntal wndow sze, and the maxmum wndow sze. Such a prortzed QoS scheme s smple to mplement and s smlar to the DffServ model. j SI = 50 ms SI = 50 ms SI (a) Schedule for stream from QSTA "I" SI (b) Schedule for streams from QSTAs "I" to "" j SI = 50 ms SI (c) Reallocaton of s when a stream s dropped j Fgure 3. An example of the scheduler. (GroupAc) frame, n whch the correctly receved frames nformaton s ncluded. All the frames, ncludng the GroupAcReq and GroupAc frames, are separated by an SIFS nterval. A typcal GA sequence durng a CF poll) s shown n Fg. 4. The sender should frst wn a usng a channel access mechansm before startng a burst. The burst length s lmted, and the amount of state that must be ept by the recever of the recevng frames s bounded. The GroupAc frame has an Ac btmap feld that can acnowledge the burst of data frames, where each bt acnowledges one potental frame. If the GroupAc ndcates that a frame was not receved correctly, the sender shall retry that frame subject to ts approprate retry lmt. Retransmtted burst data frames shall preserve ther orgnal relatve order. The recever shall mantan a burst acnowledgment record consstng of a transmtter address and a 32-octet btmap of receved frame sequence numbers. These hold the acnowledgment state of the burst data receved from that sender. PRELIMINARY RESULTS We evaluate the EDCF prorty scheme n ths secton va smulatons. The smulaton models had been developed based on the IEEE e draft [3], IEEE a standard [9], and OPNET WLAN smulaton model verson 8.0A. In our smulatons, dstrbuted admsson control s not consdered. A more complete study of prorty schemes can be found n [7]. We smulate three prorty classes n Fg. 5. Both the data rate and control rate are 6 Mb/s. The frame sze s fxed at 1024 bytes. Each staton/queue always has frames ready to send to acheve saturaton performance. The EDCF parameters are: AIFS[0] = PIFS + 1 µs; AIFS[1] = PIFS + 5 µs; AIFS[2] = DIFS; therefore, AIFS[0] < AIFS[1] < AIFS[2]; where PIFS = SIFS + SLOT = 25 µs and DIFS =SIFS + 2*SLOT = 34 µs. CW mn [0] = 16; CW mn [1] = 24; CW mn [2] = 32; therefore, CW mn [0]<CW mn [1]<CW mn [2]. Fgure 5 shows normalzed saturaton throughputs for three prorty classes over the number of actve queues. The number of actve queues n the fgure stands for the number of actve queues for each class. As the number of actve queues ncreases, throughputs for all classes decrease. As llustrated n the fgure, class 0 has a much better throughput than class 1, and class 1 has a much better throughput than class 2. Therefore, the EDCF prorty scheme s qute effectve. CPpoll Burst data Burst data Burst data Burst data Group ACK request Group ACK Fgure 4. A GA sequence. 78 IEEE Wreless Communcatons June 2004
8 CONCLUSIONS AND FUTURE WORK Ths artcle ntroduces the emergng IEEE e MAC, whch employs a contentonbased channel access EDCF and a centrally controlled channel access HCF. The controlled HCF s based on a pollng mechansm wth some enhanced QoS-specfc mechansms and frame subtypes to allow QoS data transfers durng CFP. The EDCF provdes a prorty scheme by dfferentatng the nterframe space, ntal wndow sze, and maxmum wndow sze. Such a prortzed QoS scheme s smple to mplement and s smlar to the dfferentated servces model. Dstrbuted admsson control under the EDCF, centrally controlled admsson control and a smple scheduler under the controlled HCF, the drect ln protocol, and the group acnowledgment mechansm are also ntroduced. Our prelmnary results show that IEEE e provdes very good servce dfferentaton. REFERENCES [1] IEEE WG, Part 11: Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) Specfcaton, Aug [2] Y. Xao, A Smple and Effectve Prorty Scheme for IEEE , IEEE Commun. Lett., vol. 7, no. 2, Feb. 2003, pp [3] IEEE WG, Draft Supplement to Part 11: Wreless Medum Access Control (MAC) and Physcal Layer (PHY) Specfcatons: Medum Access Control (MAC) Enhancements for Qualty of Servce (QoS), IEEE Std e/D3.3.2, Nov. 2002; draft supp. to IEEE Std , 1999 edton. [4] S. Mangold et al., IEEE e Wreless LAN for Qualty of Servce, Proc. Euro. Wreless 02, Florence, Italy, Feb [5] Y. Xao, Enhanced DCF of IEEE e to Support QoS, Proc. IEEE WCNC 03, New Orleans, LA, Mar [6] S. Cho et al., IEEE e Contenton-Based Channel Access (EDCF) Performance Evaluaton, Proc. IEEE ICC 03, Anchorage, AK, May [7] Y. Xao, Performance Analyss of Prorty Schemes for IEEE Wreless LANs, submtted to IEEE Trans. Wreless Commun., Number of actve queues Fgure 5. Normalzed saturaton throughputs of three classes. [8] IEEE b WG, Part 11: Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) Specfcaton: Hgh-Speed Physcal Layer Extenson n the 2.4 GHz Band, Sept [9] IEEE a WG, Part 11: Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) Specfcaton: Hgh-speed Physcal Layer n the 5 GHz Band, Sept BIOGRAPHIES YANG XIAO [M] (yangxao@eee.org) s an assstant professor n the Computer Scence Dvson at the Unversty of Memphs, Tennessee. Before jonng ths school n August 2002, he wored at Mcro Lnear as a MAC archtect nvolvng IEEE standard enhancement wor. He s a votng member of the IEEE Worng Group, and holds a Ph.D. degree n computer scence and engneerng from Wrght State Unversty, Dayton, Oho. Hs current research nterests nclude WLANs, WPANs, and moble cellular networs. Prorty 0 class Prorty 1 class Prorty 2 class IEEE Wreless Communcatons June
Analysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationDepartment of Electrical and Computer Systems Engineering
Department of Electrcal and Computer Systems Engneerng Techncal Report MECSE-5-2004 A Survey of IEEE 802.11 MAC Mechansms for Qualty of Servce (QoS) n Wreless Local Area Networks (WLANs) D. Pham, A. Sekercoglu
More informationA Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks
11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda
More informationInterclass Collision Protection for IEEE e Wireless LANs
Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationTHE IEEE standard for wireless local area networks
IEEE RANSACIONS ON VEHICULAR ECHNOLOGY, VOL. 58, NO. 2, FEBRUARY 2009 855 Determnstc Prorty Channel Access Scheme for QoS Support n IEEE 802.11e Wreless LANs Sunmyeng Km, Rongsheng Huang, Student Member,
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationVoice capacity of IEEE b WLANs
Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local
More informationUSER CLASS BASED QoS DIFFERENTIATION IN e WLAN
USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee
More informationAnalysis of QoS in WLAN
Analyss of QoS n WLAN PAAL E. ENGELSTAD AND OLAV N. ØSTERBØ Paal E. Engelstad s Research Scentst n Telenor R&D An analytcal model s proposed to descrbe the prorty schemes of the EDCA mechansm of the IEEE
More informationPerformance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks
RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationA Free-Collision MAC Proposal for Networks
12th Brazlan Workshop on Real-Tme and Embedded Systems 89 A Free-Collson MAC Proposal for 802.11 Networks Omar Alment 1,2, Gullermo Fredrch 1, Gullermo Reggan 1 1 SITIC Group Unversdad Tecnológca Naconal
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationAdaptive Network Resource Management in IEEE Wireless Random Access MAC
Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract
More informationA Fair MAC Algorithm with Dynamic Priority for e WLANs
29 Internatonal Conference on Communcaton Software and Networks A Far MAC Algorthm wth Dynamc Prorty for 82.e WLANs Rong He, Xumng Fang Provncal Key Lab of Informaton Codng & Transmsson, Southwest Jaotong
More informationEfficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks
Effcent QoS Provsonng at the MAC Layer n Heterogeneous Wreless Sensor Networks M.Soul a,, A.Bouabdallah a, A.E.Kamal b a UMR CNRS 7253 HeuDaSyC, Unversté de Technologe de Compègne, Compègne Cedex F-625,
More informationAchievable Bandwidth Estimation for Stations in Multi-Rate IEEE WLAN Cells
Achevable Bandwdth Estmaton for Statons n Mult-Rate IEEE 802. WLAN Cells Eduard Garca, Davd Vamonte, Rafael Vdal and Josep Paradells Wreless Networks Group - echncal Unversty of Catalona (UPC) {eduardg,
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationEfficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks
1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.
More informationTechnical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks
www.hurray.sep.pp.pt Techncal Report -GAME: An Implct GTS Allocaton Mechansm n IEEE 802.15.4 for Tme- Senstve Wreless Sensor etworks Ans Koubaa Máro Alves Eduardo Tovar TR-060706 Verson: 1.0 Date: Jul
More information136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY Ching-Ling Huang and Wanjiun Liao, Senior Member, IEEE
136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY 2007 Throughput and Delay Performance of IEEE 802.11e Enhanced Dstrbuted Channel Access (EDCA) Under Saturaton Condton Chng-Lng
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationWITH rapid improvements of wireless technologies,
JOURNAL OF SYSTEMS ARCHITECTURE, SPECIAL ISSUE: HIGHLY-RELIABLE CPS, VOL. 00, NO. 0, MONTH 013 1 Adaptve GTS Allocaton n IEEE 80.15.4 for Real-Tme Wreless Sensor Networks Feng Xa, Ruonan Hao, Je L, Naxue
More informationExtension and Comparison of QoS-Enabled Wi-Fi Models in the Presence of Errors
Extenson and Comparson of QoS-Enabled W-F Models n the Presence of Errors Ioanns Papapanagotou, Georgos S. Paschos*, Stavros A. Kotsopoulos** and Mchael Devetskots Electrcal and Computer Engneerng, North
More informationWIRELESS communication technology has gained widespread
616 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 6, NOVEMBER/DECEMBER 2005 Dstrbuted Far Schedulng n a Wreless LAN Ntn Vadya, Senor Member, IEEE, Anurag Dugar, Seema Gupta, and Paramvr Bahl, Senor
More informationUBICC Publishers 2008 Ubiquitous Computing and Communication Journal
UBICC Journal Ubqutous Computng and Communcaton Journal 008 Volume 3. 008-04-30. ISSN 99-844 Specal Issue on Moble Adhoc Networks UBICC ublshers 008 Ubqutous Computng and Communcaton Journal Edted by Usman
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationHIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM *
Copyrght Notce c 1999 IEEE. Personal use of ths materal s permtted. However, permsson to reprnt/republsh ths materal for advertsng or promotonal purposes or for creatng new collectve wors for resale or
More informationTIME-DRIVEN ACCESS AND FORWARDING IN IEEE MESH NETWORKS
1 TIME-DRIVE ACCESS AD FORWARDI I IEEE 8011 MESH ETWORKS Maro Bald and Rccardo acomell Abstract Varous solutons based on both prortzaton and resource allocaton have been proposed n the lterature and standard
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationIEEE n Aggregation Performance Study for the Multicast
IEEE 802.11n Aggregaton Performance Study for the Multcast Yousr Daldoul, Toufk Ahmed, Djamal-Eddne Meddour To cte ths verson: Yousr Daldoul, Toufk Ahmed, Djamal-Eddne Meddour. IEEE 802.11n Aggregaton
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationApplications and Challenges of the e EDCA Mechanism: An Experimental Study
Applcatons and Challenges of the 80.e EDCA Mechansm: An Expermental Study Albert Banchs, Arturo Azcorra, Carlos García, and Rubén Cuevas, Unversty Carlos III of Madrd Abstract In ths artcle we conduct
More informationABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN*
ARC: An End-to-End Rate Adaptaton Scheme for Multmeda Streamng over Wreless LAN We Wang Soung C Lew Jack Y Lee Department of Informaton Engneerng he Chnese Unversty of Hong Kong Shatn N Hong Kong {wwang2
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationDesign of the Application-Level Protocol for Synchronized Multimedia Sessions
Desgn of the Applcaton-Level Protocol for Synchronzed Multmeda Sessons Chun-Chuan Yang Multmeda and Communcatons Laboratory Department of Computer Scence and Informaton Engneerng Natonal Ch Nan Unversty,
More informationFIBARO WALL PLUG OPERATING MANUAL FGBWHWPE-102/FGBWHWPF-102 CONTENTS
OPERATING MANUAL EN FIBARO WALL PLUG FGBWHWPE-102/FGBWHWPF-102 CONTENTS #1: Descrpton and features 3 #2: Parng the accessory 4 #3: Reset 5 #4: Functonalty 6 v1.0 #5: W-F 8 #6: Confgurable parameters 9
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationBANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION
ARPN Journal of Engneerng and Appled Scences 2006-2009 Asan Research Publshng Network (ARPN). All rghts reserved. BANDWIDTH OPTIMIZATION OF INDIVIDUA HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICA APPICATION
More informationTransit Networking in ATM/B-ISDN based on Service Category
Transt Networkng n ATM/B-ISDN based on Servce Category Young-Tak Km Dept. of Informaton and Communcaton Engneerng, College of Engneerng, YeungNam Unv. E-mal : ytkm@ynucc.yeungnam.ac.kr ABSTRACT The ATM
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationAn Analytical Model for IEEE Point-to-Point Link
An Analytcal Model for IEEE 82. Pont-to-Pont Lnk Yong Yan, Xaowen hu Department of omputer cence, Hong Kong Baptst Unversty Emal: {yyan, chxw}@comp.hkbu.edu.hk Abstract - Wreless mesh networks have attracted
More informationPerformance Evaluation of IEEE e based on ON-OFF Traffic Model I. Papapanagiotou PhD. Student
erformance Evaluaton of IEEE 82.e based on ON-OFF Traffc Model I. apapanagotou hd. Student Wreless Telecommuncaton Laboratory Unversty of atras 265 4 atras Greece papapanag@upnet.gr J.S. Vardakas hd. Student
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationRe-routing Instability in IEEE Multi-hop Ad-hoc Networks *
Re-routng Instablty n IEEE 802.11 Mult-hop Ad-hoc Networks * Png Chung Ng and Soung Chang Lew Department of Informaton Engneerng The Chnese Unversty of Hong Kong {pcng3, soung}@e.cuhk.edu.hk Abstract TCP
More informationPricing Network Resources for Adaptive Applications in a Differentiated Services Network
IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationEFT: a high throughput routing metric for IEEE s wireless mesh networks
Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon
More informationComparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet
Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate
More informationAn Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network
Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationIR-HARQ vs. Joint Channel-Network coding for Cooperative Wireless Communication
Cyber Journals: ultdscplnary Journals n Scence and Technology, Journal of Selected Areas n Telecommuncatons (JSAT), August Edton, 2 IR-HARQ vs. Jont Channel-Network codng for Cooperatve Wreless Communcaton
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationAggregated traffic flow weight controlled hierarchical MAC protocol for wireless sensor networks
Ann. Telecommun. (29) 64:75 721 DOI.7/s12243-9-95- Aggregated traffc flow weght controlled herarchcal MAC protocol for wreless sensor networks M. Abdur Razzaque M. Mamun-Or-Rashd Muhammad Mahbub Alam Choong
More informationAn Inter-Piconet Scheduling Algorithm for Bluetooth Scatternets
An Inter-Pconet Schedulng Algorthm for Bluetooth Scatternets Suman Saha, Mtsuj Matsumoto GITS, Waseda Unversty, Tokyo, Japan suman@asag.waseda.jp, mmatsumoto@waseda.jp Abstract Bluetooth s a wreless specfcaton
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationA Sub-Critical Deficit Round-Robin Scheduler
A Sub-Crtcal Defct ound-obn Scheduler Anton Kos, Sašo Tomažč Unversty of Ljubljana, Faculty of Electrcal Engneerng, Ljubljana, Slovena E-mal: anton.kos@fe.un-lj.s Abstract - A scheduler s an essental element
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationQoS Bandwidth Estimation Scheme for Delay Sensitive Applications in MANETs
Communcatons and Network, 2013, 5, 1-8 http://dx.do.org/10.4236/cn.2013.51001 Publshed Onlne February 2013 (http://www.scrp.org/journal/cn) QoS Bandwdth Estmaton Scheme for Delay Senstve Applcatons n MANETs
More informationDynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks
Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,
More informationA General Model of Wireless Interference
A General Model of Wreless Interference Ll Qu Yn Zhang Feng Wang M Kyung Han Ratul Mahajan Unversty of Texas at Austn Mcrosoft Research Austn, TX 7872, USA Redmond, WA 9852, USA {ll,yzhang,wangf,hanm2}@cs.utexas.edu
More informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More informationGateway Algorithm for Fair Bandwidth Sharing
Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca
More informationQuality of Service Provision for IP Traffic over Wireless Local Area Networks
Qualty of Servce Provson for IP Traffc over Wreless Local Area Networks Dmtrs Skyranoglou 1 Natonal and Kapodstran Unversty of Athens Department of Informatcs and Telecommuncatons dmsk@d.uoa.gr Abstract.
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationDelay Analysis and Time-Critical Protocol Design for In-Vehicle Power Line Communication Systems
Delay Analyss and Tme-Crtcal Protocol Desgn for In-Vehcle Power Lne Communcaton Systems Zhengguo Sheng, Daxn Tan, Vctor C.M. Leung and Gaurav Bansal Abstract Wth the emergng automated tasks n vehcle doman,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationInternet Traffic Managers
Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John
More informationEnhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationQoS-aware composite scheduling using fuzzy proactive and reactive controllers
Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve
More informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationShared Running Buffer Based Proxy Caching of Streaming Sessions
Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,
More informationEnhanced Markov Chain Model and Throughput Analysis of the Slotted CSMA/CA for IEEE Under Unsaturated Traffic Conditions
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 1, JANUARY 2009 473 Enhanced Markov Chan Model and Throughput Analyss of the Slotted CSMA/CA for IEEE 802.15.4 Under Unsaturated Traffc Condtons
More informationPerformance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocols with Exponential Backoff Scheduling
Performance Analyss of Markov Modulated -Persstent CSMA/CA Protocols wth ponental Backoff Schedulng Pu ng Wong, Dongje Yn, and Tony T. Lee, Abstract. Ths paper proposes a Markovan model of -persstent CSMA/CA
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationwith `ook-ahead for Broadcast WDM Networks TR May 14, 1996 Abstract
HPeR-`: A Hgh Performance Reservaton Protocol wth `ook-ahead for Broadcast WDM Networks Vjay Svaraman George N. Rouskas TR-96-06 May 14, 1996 Abstract We consder the problem of coordnatng access to the
More informationQoS with TCP/IP and shared media LANs Heikki Kokkinen Nokia Research Center Tel.
QoS wth TCP/IP and shared meda LANs Hekk Kokknen Noka Research Center Hekk.Kokknen@research.noka.com Tel. +358-9-4376-6651 Abstract The QoS over shared meda LANs has three major elements: mprovng the current
More informationOPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET
OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor
More informationImpact of the Parameterization of IEEE Medium Access Layer on the Consumption of ZigBee Sensor Motes
UBICOMM 21 : The Fourth Internatonal Conference on Moble Ubqutous Computng, Systems, Servces and Technologes Impact of the Parameterzaton of IEEE 82.15.4 Medum Access Layer on the Consumpton of ZgBee Sensor
More informationAdvanced Computer Networks
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationCombined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks
Combned SINR Based Vertcal Handoff Algorthm for Next Generaton Heterogeneous Wreless Networks Kemeng Yang, Iqbal Gondal, Bn Qu and Laurence S. Dooley Faculty of Informaton Technology Monash Unversty Melbourne,
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationCS 268: Lecture 8 Router Support for Congestion Control
CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More information