This is the published version of a paper presented at The 2013 IEEE International Conference on Internet of Things, Beijing, China, August 2013.

Size: px
Start display at page:

Download "This is the published version of a paper presented at The 2013 IEEE International Conference on Internet of Things, Beijing, China, August 2013."

Transcription

1 hp:// This is he published version of a paper presened a The 2013 IEEE Inernaional Conference on Inerne of Things, Beijing, China, Augus Ciaion for he original published paper: Glaropoulos, I., Mangold, S., Vukadinovic, V. (2013) Enhanced IEEE Power Saving for Muli-Hop Toy-o-Toy Communicaion. In: IEEE Compuer Sociey N.B. When ciing his work, cie he original published paper. Permanen link o his version: hp://urn.kb.se/resolve?urn=urn:nbn:se:kh:diva

2 Enhanced IEEE Power Saving for Muli-Hop Toy-o-Toy Communicaion Ioannis Glaropoulos, Sefan Mangold, Vladimir Vukadinovic Disney Research 8092 Zurich, Swizerland Absrac In he fuure Inerne of Things (IoT), baerypowered devices equipped wih shor range radios may need o communicae wih each oher over muli-hop links. This may significanly increase heir energy consumpion. Whereas mos research on IoT assumes ha he devices use energy-efficien IEEE wireless ransceivers, we focus on IEEE because of is wide peneraion in consumer elecronics such as oys. We exend he IEEE power saving mode (PSM), which allows he devices o ener he low-power doze sae, wih a raffic announcemen scheme ha faciliaes muli-hop communicaion. The scheme propagaes raffic announcemens along muli-hop pahs o ensure ha all inermediae nodes remain awake o forward he pending daa frames wih minimum laency. Simulaion resuls show ha he proposed Muli-Hop PSM (MH-PSM) improves boh end-o-end delay and doze ime compared o he sandard PSM. MH-PSM is pracical and sofware-implemenable since i does no require changes o he pars of he IEEE medium access conrol ha are ypically implemened in hardware. I. INTRODUCTION Many objecs, such as consumer elecronics and oys, are becoming equipped wih sensors and wireless communicaion capabiliies. They will connec o each oher locally using ad hoc neworks and globally using IP infrasrucure o creae he Inerne of Things (IoT). Ad hoc neworks enables wireless devices o exchange daa wih one anoher when a fixed nework infrasrucure (access poins, cellular base saions) is no available. In ad hoc neworks, communicaion beween devices ha are ou of each oher s ransmission range is esablished over muli-hop roues. Hence, each device is no only receiving and ransmiing is own daa, bu i also serves as a muli-hop relay for oher devices. This increases he energy consumpion and decreases he baery lifeime of he devices. Therefore, one of he major challenges for ad hoc neworking of baery-powered devices is he energyefficiency of radio communicaion. Mos of he on-going research on IoT assumes ha he devices are equipped wih low-power IEEE (Zigbee) ransceivers. However, for consumer elecronics, such as radio-enabled oys, he wide peneraion of IEEE (Wi-Fi) dicaes he choice of he wireless echnology. The energy consumpion of is high compared o and oher low-power radios. To alleviae his problem, he sandard [1] already specifies Power-Saving Mode (PSM) ha allows idle saions o ransiion o a low-power doze sae. An saion in PSM mode wakes up periodically from he doze sae, lisens for raffic announcemens coming Fig. 1. Applicaion scenario: Muli-hop communicaion beween oys in an oudoor game. Devices communicae direcly wih each oher, wihou nework infrasrucure. from oher saions ha have daa packes desined for i, and announces is own daa packes desined for oher saions. If a STA does no receive any raffic announcemens and i does no have buffered packes ha can be ransmied, i reurns o he doze sae. The sandard [1] specifies he deails of PSM mechanism for boh infrasrucure/bss mode (Basic Service Se wih an access poin) and ad hoc/ibss mode (Independen Basic Service Se wihou an access poin). In he ad hoc mode, especially in mui-hop neworks, he PSM is known o perform poorly, causing undesirable energy consumpion and/or long packe delivery delays [2, 3, 4]. The reason is because PSM has been originally designed for single-hop communicaion in he infrasrucure mode (from he access poin o a saion and vice versa). When a daa frame is forwarded over muliple hops, sandard PSM may significanly increase is delivery delay because only he nex-hop saion is noified abou he pending frame via raffic announcemens he saions on subsequen hops may remain in he doze sae. Therefore, in each beacon inerval he frame is forwarded over a single hop and has o be buffered before being forwarded furher. In his paper, we propose a mechanism ha wakes up downsream saions so ha daa frames can be forwarded over muliple hops in a single beacon inerval. This is achieved by insrucing each saion along he pah o send a raffic announcemen o is downsream neighbor. The proposed mechanism significanly reduces he end-o-end laency, es-

3 Beacon Beacon inerval Awake or Doze Beacon inerval ATIM window Daa TX/RX window ATIM window Daa TX/RX window Beacon Awake or Doze Fig PSM divides each beacon inerval ino an ATIM window and a daa TX/RX window. pecially for bursy raffic where inermediae saions may move o he doze sae beween wo consecuive raffic burss. The mechanism enhances he sandard PSM o wha we call muli-hop PSM (MH-PSM). MH-PSM does no prevens saions o iner-operae wih hose ha run sandard PSM i does no aler he sae machine, frame formas, and oher imporan elemens of he proocol. MH-PSM is also sofwareimplemenable i does no require modificaions o he pars of he MAC proocol ha are usually implemened in hardware, such as he CSMA/CA and handling of conrol frames (RTS, CTS, ). The res of he paper is organized as follows: Secion II summarizes he sandard PSM. In Secion III we describe MH-PSM and discuss pracical implemenaion issues. The performance of he mechanism is evaluaed in Secion IV using simulaions. In Secion V, we provide an overview of relaed work. Finally, Secion VI concludes he paper. II. POWER-SAVING MODE FOR AD HOC NETWORKS In he sandard PSM for ad hoc/ibss neworks, ime is divided ino periods called beacon inervals. Each saion wakes up a he beginning of each beacon inerval and sars a back-off procedure in an aemp o ransmi a beacon. If a saion receives a beacon from anoher saion before is back-off imer expires, i cancels he pending beacon ransmission. The Timing Synchronizaion Funcion (TSF) uses he ime-samped beacons o synchronize clocks among saions o ensure ha all saions wake up a he same ime. Following he beacon exchange, each saion says awake for an ATIM window inerval, as shown in Fig. 2. During he ATIM window, saions announce pending daa frames o heir neighbors using unicas announcemen raffic indicaion messages (ATIMs). ATIMs are sen using disribued coordinaion funcion (DCF), which implemens CSMA/CA channel access procedure. A saion ha receives an ATIM should respond wih an. Successful exchange of ATIM- packes beween wo saions implies ha hey can now exchange any pending daa frames and hus boh should say awake unil he nex beacon inerval. Saions ha do no send nor receive any ATIM frame during an ATIM window will move o he doze sae for he res of he beacon inerval. Afer he end of ATIM window, all saions ha remain awake will follow he normal DCF procedure o ransmi and receive daa frames. The described PSM proocol has many drawbacks. For example, when a saion successfully ransmis or receives an ATIM frame during an ATIM window, i mus say awake during he enire beacon inerval. A low loads, his approach Beacon resuls in a much higher energy consumpion han necessary. Anoher shorcoming is ha all saions in an IBSS mus use he same fixed ATIM window size, which is se a he ime when he IBSS is creaed, as well as idenical beacon inervals. Since he ATIM window size criically affecs he hroughpu and energy consumpion, he fixed ATIM window does no perform well in all siuaions, as shown in [5]. Some of hese drawbacks have been addressed in previous works, which are menioned in he relaed work secion. This paper, however, addresses he problem of end-of-end delay on muli-hop pahs, which is described in he following. Consider a scenario where saion A needs o send a single frame/message o saion D using inermediae saions B and C as relays (Fig. 3). In he firs beacon inerval, saion A announces he daa frame o saion B using an ATIM frame. Saion B acknowledges he ATIM an remains awake so ha i can receive he daa following he ATIM window. Saion C has no received any ATIMs and, herefore, i eners he doze sae. Since saion B is no able o forward he frame o C in he curren beacon inerval, i has o wai for he sar of he nex beacon inerval o send an ATIM o saion C. Following a successful ATIM- exchange, he frame is forwarded o C. Saion D will receive he frame in he hird beacon inerval. The resuling end-o-end delay may considerably affec nework applicaions wih sric laency consrains. Therefore, enabling PSM in muli-hop ad hoc neworks mus be combined wih effecive mechanisms for miigaing is effec on he resuling packe delays. III. ENHANCED PSM FOR MULTI-HOP COMMUNICATION In he above described scenario, he daa frame sen by A mus be buffered a B before i is relayed o C in he following beacon inerval. This could have been avoided if here was a way for B o, upon receiving he ATIM from A, send an early ATIM o C and D o inform hem abou he pending daa frame a A. This is wha our low-laency muli-hop PSM (MH-PSM) aims o achieve. Before inroducing MH-PSM, we describe he forma of ATIM frames. An ATIM frame includes a MAC header, whose srucure shown in Fig. 4 is common o all managemen frames. The header includes hree address fields: Address 1 conains he MAC address of he ATIM receiver. Address 2 conains he MAC address of he ATIM sender. Address 3 may conain differen informaion depending on he ype of he managemen frame and nework (BSS, IBSS, or mesh). In case of an ATIM frame, Address 3 conains he BSSID (BSS idenifier) of he IBSS, bu his idenifier is no used. The frame body of an ATIM is empy. A. Proposed Exension: Muli-Hop PSM (MH-PSM) We propose ha, in order o inform all saions along he pah o D abou he pending daa frame, he saion A wries he MAC address of D ino he Address 3 field of he ATIM frame ha are sen o B. The mehods ha A can use o resolve he MAC address of D from is IP address are discussed laer

4 Beacon inerval 1 Beacon inerval 2 Beacon inerval 3 A B C A B C ATIM Daa ATIM Daa ATIM Daa D D ATIM window Daa TX/RX window ATIM window Daa TX/RX window ATIM window Daa TX/RX window Fig. 3. Muli-hop forwarding in sandard PSM may cause a delay of several beacon inervals. in his Secion. Upon receiving he ATIM, B inspecs he Address 3 field o derive he final desinaion of he daa frame announced by ha ATIM. I rerieves he MAC address of D from he Address 3 field, resolves i o he IP address of D, and consuls he rouing able o find ou ha C is he nex hop on he pah o D. Then B creaes an ATIM frame for C wih he MAC address of D inside he Address 3 field. When C receives he ATIM from B, i uses he same procedure o creae an ATIM for D. In his way, a wave of ATIMs is creaed along he pah o wake up all relays and he desinaion of he daa frame. Following he end of he ATIM window, he daa frame is forwarded end-o-end since all saions on he pah are in he awake sae. The procedure is illusraed in Fig. 5. The ATIM wave may no reach he end desinaion: i may erminae a he end of he ATIM window or upon reaching a saion ha canno resolve he MAC address of he desinaion. In ha case, he daa frame will be forwarded in he curren beacon inerval as far as he saion ha has received he las ATIM in he sequence. Neverheless, MH-PSM may significanly decrease he end-o-end delay because he probabiliy ha daa frames are forwarded over muliple hops in a single beacon inerval is higher han wih he sandard PSM. B. Address 3 Resoluion The sending saion A needs o sore he MAC address of he desinaion D ino he Address 3 field of ATIMs sen o B. Therefore, A needs o resolve he MAC address of D from is IP address. Since he paper is argeing Inerne of Things (IoT) and smar oy communicaion scenarios, we assume ha IPv6 is used. IPv6 proocol suie uses Neighbor Discovery (ND) proocol [6] for address resoluion, nexhop deerminaion, and duplicae address deecion. Address resoluion enables saions o deermine MAC addresses of heir neighbors given only heir IP addresses. The neighbor soliciaion messages, which are used for address resoluion, are sen via mulicas. The ND proocol is no designed wih muli-hop ad hoc neworks in mind. A node in such nework is able o broadcas o oher nodes wihin is radio range, bu he communicaion is non-ransiive. Therefore, a wireless ad hoc nework is a non-broadcas muli-access (NBMA) srucure wih generally no nework-wide mulicas capabiliies. The nework soliciaion messages are no forwarded in an IBSS. Hence, saion A is only able o resolve MAC addresses of is immediae neighbors, bu no of D, which is muliple hops away. There are several proposals o exend he capabiliies of he ND proocol o muli-hop ad hoc neworks [7] and 6LoWPAN neworks in paricular [8]. These proposals include mechanisms for muli-hop duplicae address deecion (DAD), which allows a saion o check he uniqueness of an IP address in an n-hop neighborhood. The muli-hop DAD can also be used for muli-hop address resoluion: saion A may iniiae muli-hop DAD for he IP address of D. Upon receiving a DAD reques, D will respond wih a DAD confirmaion message ha conains is MAC address. I his way, A can resolve he MAC address of D based on is IP address. Noe ha each saion mainains a cache of resolved addresses, which reduces he need for nework-wide muli-hop address resoluion. A B C D ATIM ATIM D Frame Conrol Duraion Address 1 Address 2 Address 3 Sequence Conrol FCS D Mul67hop*ATIM*forwarding ATIM D Daa Daa Daa ATIM*window Daa*TX/RXwindow Fig. 4. Srucure of he ATIM frame. The Address 3 field can be used for he MAC address of he end desinaion. Fig. 5. The proposed muli-hop forwarding mechanism allows daa frames o be forwarded end-o-end in a single beacon inerval.

5 TABLE I DEFAULT SIMULATION PARAMETERS. Parameer Value Grid size 7 7 saions Grid spacing 50 m Channel model uni disk IEEE PHY mode 11 Mb/s (802.11b) Shor / long rery limi 4 / 7 (Threshold: 500 B) MAC buffer size 100 frames Beacon inerval 50 ms ATIM window 10 ms Traffic model Poisson (λ) Daa frame size Uniform [50,1500] C. Backward-Compaibiliy and Sofware Implemenaion Backward-compaibiliy wih he sandard PSM is ensured since MH-PSM does no violae neiher frame formas nor proocol operaions. Saions ha implemen sandard PSM will no check he Address 3 field of received ATIMs and, herefore, he wave of ATIMs will erminae a such saions. This diminishes some of he delay improvemens, bu oherwise does no preven or impair communicaion. MH- PSM is also sofware-implemenable: Parsing and creaion of ATIM frames are no ime-criical operaions ha have o be implemened in hardware. This enables driver-level implemenaion of MH-PSM wihou modificaions o he lowlevel MAC operaions. We are currenly implemening MH- PSM in an Aheros AR9170 driver. IV. PERFORMANCE EVALUATION We compared he performance of sandard PSM and MH- PSM using simulaions. The performance is measured in erms of end-o-end delay, doze ime raio, ATIM overhead, and packe delivery raio, as defined below: End-o-End Delay is he average ime required o forward a daa frame from a source o is desinaion over muliple hops. I is averaged over all successfully delivered daa frames. Doze Time Raio is he percenage of beacon inervals in which a saion eners doze sae, which closely correlaes wih he energy consumpion. I is averaged over all saions ha paricipae in raffic forwarding. ATIM Overhead is he average number of ATIM frames sen per one successfully delivered daa frame. The relaive ATIM overhead of MH-PSM is he raio of ATIM overheads obained wih MH-PSM and sandard PSM. Packe Delivery Raio (PDR) is he percenage of daa frames ha are successfully delivered o he end desinaion. A saion may drop a daa frame if i exceeds he maximum number of reransmissions. The simulaion seup and he resuls are described in he following: A. Simulaion Seup We implemen and esed MH-PSM in Jemula802 [9], which is a Java-based proocol simulaor developed in our group. We consider a regular 7 7 grid of saic saions. Adjacen nodes are 50 m apar from each oher. We Fig. 6. Simulaed nework opology wih a single flow. The ransmission range is se o 50 m, 100 m, and 150 m o produce pahs wih 2, 3, and 6 hops, respecively. assume a simple uni disk radio propagaion model. We varied he radio range from 50 m o 150 m o influence he number of hops beween source-desinaion pairs. The beacon inerval and ATIM window size are 50 ms and 10 ms, respecively, unless saed oherwise. The daa raffic is Poisson (exponenial inerarrival imes) wih uniformly disribued frame sizes. The number of acive flows and mean frame inerarrival ime are varied o conrol he load in he nework. The raffic is roued over shores pahs; he rouing is saic. We ensured ha he simulaion duraion is sufficien o make he variaions in ime-moving averages insignifican. The defaul simulaion parameers are summarized in Table I. B. Simulaion Resuls Consider firs he simple single-flow scenario shown in Fig. 6, where he saion in he firs column of he grid is sending daa frames o he saion in he las column over muliple hops. Noe ha non-forwarding nodes in he grid affec he performance of forwarding nodes: The sandard mandaes ha a saion ha ransmis a beacon should remain awake for he res of he beacon inerval. As he number of is neighbors decreases, he probabiliy ha a saion ransmis a beacon before i receives one increases. The radio ransmission range is se o 50 m, 100 m, and 150 m in differen simulaion runs, which produces pahs wih 2, 3, and 6 hops, respecively. On average, he sender is generaing λ = 10 frames per second (0.5 frames per beacon inerval). The resuls for he average end-o-end frame delay are shown in Fig. 7 (lef). As expeced, he delay increases wih he number of hops. For he sandard PSM i akes almos N beacon inervals o forward a frame over N hops. I may happen ha a frame is forwarded over muliple hops in a single beacon inerval: if is nex-hop neighbor is awake, a saion may immediaely forward he frame o i, wihou waiing for he nex ATIM window o send a raffic announcemen. In a lighly loaded nework, however, i is likely ha he nex-hop saion is in he doze sae, and herefore, he daa frame has o be announced wih an ATIM in he nex beacon inerval. The resuls show ha he delay is significanly

6 Fig. 7. End-o-end delay, doze ime raio, and ATIM overhead for differen numbers of hops. shorer for MH-PSM. Alhough i slighly increases wih he number of hops (due o processing in inermediae saions and increasing probabiliy of collisions/reransmissions caused by hidden saions) he average delay is well below 50 ms, which is he duraion of he beacon inerval. As he number of hops increases from wo o six, he percenage of frames ha are forwarded end-o-end wihin a single beacon inerval deceases from 88% o 86%, bu sill remains excepionally high compared o sandard PSM (28% and 0%). The average doze ime raio is shown in in Fig. 7 (middle). The resuls show ha MH-PSM significanly increases he energy efficiency by allowing he saions o move o he doze sae more ofen han he sandard PSM. The reason for his is ha MH-PSM prevens excessive buffering of frames in inermediae saions, which effecively decreases he raffic load and he probabiliy of collisions/reransmissions. The sixhop packe delivery raio for MH-PSM is 99.4% versus 91.5% for he sandard PSM. The resuls presened so far show ha MH-PSM provides boh shorer delay and lower energy consumpion, which is a major improvemen over he sandard PSM whose parameric adjusmens/opimizaions may only rade shorer delay for higher energy consumpion and vice versa. In Fig. 7 (righ), we show he ATIM overhead for boh PSM schemes. While he overhead for MH-PSM is slighly higher for pahs wih few hops (i.e. wo or hree), he opposie is rue for he six-hop pah where i resuls in 25% overhead reducion compared o he sandard PSM. To undersand he reasons for he rend reversal, consider a five-hop pah from saion A o saion E via B, C, and D, as shown in Fig. 8. Assume ha one frame is buffered a saion A and one a saion C. In he bes-case scenario, i will ake four beacon inervals and six ATIMs o deliver boh frames o he desinaion wih he sandard PSM. Wih MH-PSM however, i will only one beacon inerval and four ATIMs o achieve he same because i creaes a wave of ATIMs ha flushes all buffered frames o he desinaion, as shown in Fig. 9. There are however scenarios where he ATIM overhead of MH-PSM is higher han ha of he sandard PSM, even for pahs wih many hops. In he sandard PSM, a saion sends a single ATIM o is neighbor o announce all daa frames ha i inends o forward o his neighbor, regardless of heir end desinaions. In MH-PSM, he saion may send muliple ATIMs wih differen Address 3 fields o he neighbor if he pending daa frames have differen end desinaions. For example, consider wo flows whose eigh-hop pahs conain a common subse or relays, as shown in Fig. 10. In MH-PSM, he common relays may need o forward wo ATIMs wih differen Address 3 fields o heir nex-hop neighbors in he same ATIM window. This is no he case in sandard PSM, where only one ATIM is sen. The resuls in Fig. 11 show ha he ATIM overhead of MH-PSM is almos 60% higher in his scenario. However, MH-PSM ouperforms sandard PSM in all oher respecs: he end-o-end delay is close o enfold shorer, he doze ime raio is slighly higher, and he packe delivery raio is significanly improved. Therefore, he relaive ATIM overhead of MH-PSM had no bearing o he key performance merics. Fig. 8. Sandard PSM requires 4 BIs and 6 ATIMs o deliver he frames buffered a A and C. Fig. 9. MH-PSM requires only 1 BI and 5 ATIMs o deliver he frames buffered a A and C.

7 Fig. 10. An example of wo flows whose pahs parially overlap. TABLE II PERFORMANCE OF STANDARD PSM AND MH-PSM FOR DIFFERENT BEACON INTERVALS. THE TRANSMISSION RANGE IS 50 M FRAMES ARE FORWARDED OVER SIX HOPS. Bcn. In. Delay (ms) Doze ime (%) PDR (%) PSM MH-PSM PSM MH-PSM PSM MH-PSM 50 ms ms We nex invesigae he impac of beacon inerval on he performance of sandard PSM and MH-PSM. The resuls presened so far assume a beacon inerval of 50 ms. We increased he beacon inerval o 100 ms and repeaed he simulaions for he basic scenario shown in Fig. 6 wih he ransmission range of 50 m (i.e. six hops). The average frame inerarrival ime is 100 ms. The resuls are summarized in Table II. As expeced, he frame delay for PSM doubles because he ime ha frames say buffered in he inermediae nodes is proporional o he beacon inerval. The delay for MH-PSM also increases, bu he increase is comparably modes. The increase is due o he fac ha MH-PSM does no guaranee ha all frames will be delivered end-o-end in a single beacon inerval. Some of he frames have o be buffered along he pah as in he case of sandard PSM. Anoher observaion is ha wih he sandard PSM packe delivery raio decreases significanly for he longer beacon inerval (from 91.5% o only 85.4%), while wih MH-PSM i decreases only slighly (from 99.4% o 99.2%). Wih he sandard PSM, he number of buffered frames along he pah increases wih he duraion of he beacon inerval, which effecively increases he raffic load in he nework and he probabiliy of collisions. Wih MH-PSM, mos frames are delivered end-o-end wihou buffering in he inermediae nodes. In our final se of simulaions, we consider muliple inersecing flows in he grid. The scenarios wih 2, 4, and 8 flows shown in Fig.12 complemen he single-flow scenario in Fig. 6. The ransmission range is se o 50 m and, herefore, frames are forwarded over six hops. The resuls in Table III show ha he performance deerioraes wih he number of flows. Transmissions of inersecing nodes are especially prone o collisions because hey are surrounded by four acive/forwarding saions ha do no hear each ohers ransmissions ( hidden saions ). The impac of collisions on he performances of he sandard PSM and MH-PSM is somewha differen: While he frame delay for he sandard PSM remains unaffeced by he number of flows, he delay for MH-PSM increases considerably (ye sill remains relaively low). The reason is ha collisions in inersecing nodes may disrup he cu-hrough forwarding of daa frames in MH-PSM. In he single-flow scenario, 88% of frames are forwarded end-o-end in a single beacon inerval. In he eigh-flow scenario, his percenage drops o 79%. The addiional hold-up in inersecing nodes does no affec he frame delay in he sandard PSM so prominenly because mos frames are anyway forwarded only one hop per beacon inerval. C. Ongoing Work and Open Issues We are currenly implemening he proposed MH-PSM on a hardware plaform shown in Fig. 13. The plaform consiss of an Arduino Due board wih ARM Corex-M3 microprocessor and 9 KB of SRAM [10] and an n ransceiver based on Aheros AR9170 chipse [11]. The plaform runs Coniki operaing sysem [12]. MH-PSM will be implemened as a par of a Coniki Wi-Fi driver for AR9170. We are planning o validae he simulaion resuls on a esbed of 25 devices. We will furher invesigae he impac of ATIM window size and beacon inerval on delay and energy consumpion of MH- PSM. According o he sandard, he beacon inerval and ATIM window are deermined a he ime when an IBSS is creaed and shall be saic for he lifeime of he IBSS. A shor ATIM window reduces he energy spen while lisening TABLE III PERFORMANCE OF STANDARD PSM AND MH-PSM FOR DIFFERENT NUMBERS OF FLOWS. THE TRANSMISSION RANGE IS 50 M FRAMES ARE FORWARDED OVER SIX HOPS. Fig. 11. Performance of sandard PSM and MH-PSM for he scenario wih wo flows whose pahs parially overlap. Num. flows Delay (ms) Doze ime (%) PDR (%) PSM MH-PSM PSM MH-PSM PSM MH-PSM

8 Fig. 12. Simulaed nework opology wih 2, 4, and 8 simeric flows. for ATIMs. However, if i is oo shor, i migh no provide enough ime o announce all pending frames, which decreases he hroughpu. If he ATIM window is oo long, here migh be no enough ime o ransmi all announced daa frames in he pos-atim window. The size of he ATIM window can be se based on he expeced raffic load in he nework lower load implies shorer ATIM window o minimize he energy consumpion. MH-PSM inroduces an addiional radeoff: Even a a low raffic load, a longer ATIM window migh be needed in order o propagae he wave of ATIMs end-oend, which means ha he remaining pos-atim window may be oo shor o forward he announced daa frames end-o-end. Hence, some of he downsream saions migh be awaken for no reason. Therefore, in MH-PSM, he choice of he ATIM window size depends no only on he expeced raffic load, bu also on he expeced number of hops o he desinaion. We are also planning o invesigae he ineracions of MH-PSM wih upper layers (rouing, ranspor) and heir join performance under node mobiliy. V. RELATED WORK The IEEE ah proposal [13] defines a low power medium access mehod ha opimizes sandard PSM for baery-powered devices used in smar meering and machine-o-machine communicaion. However, he opimizaion focuses on BSS (infrasrucure) neworks where PSMenabled saions communicae wih an access poin. Opimizaion of PSM for IBSS (ad-hoc) neworks has araced considerable aenion in he research communiy. A number of approaches focuses on minimizing he duraion of idle lisening by inroducing mechanisms for early ransiion o he doze sae [2, 3, 4]. In [2], he explici announcemen of he number of pending frames in ATIMs is proposed in order o allow he receiving saion o move o he doze sae afer i receives he las frame, insead of waiing for he end of he beacon inerval. In [14], he auhors propose a scheme where ATIMs conain informaion abou he naure of he inended raffic, so saions can differeniae beween broadcas and muli-cas raffic; in he laer case hey can immediaely ransi o doze sae if hey are no members of he mulicas group. In various approaches, he early ransiion o he doze sae is combined wih he dynamic adjusmen of he ATIM window duraion, depending on he raffic condiions in he IBSS [15]. In [3] he auhors propose an algorihm for a saion o dynamically adjus he remaining ATIM window duraion as a response o ATIM recepions in order o ransi o sleep earlier in case of low nework raffic.to furher decrease he energy wased for idle lisening, [16] proposes a scheme where ransmiing saions announce heir inenion of sending ATIM frames in a shor ime period a he beginning of he beacon inerval. Saions ha do no send or receive any announcemens do no have o say awake for he enire ATIM window. Considering a similar low-raffic scenario, [17] proposes a scheme where he absence of raffic is declared by ransmiing a delayed beacon, so ha saions can skip idle lisening during he ATIM window. In [18, 19], he auhors propose a opologyaware power-saving algorihm based on he overhearing of he ATIM frames ransmied by he neighbors. By exracing he source addresses from he received ATIM acknowledgmens, a saion can defer from ransmiing ATIMs o saions known o remain awake afer he expiraion of he ATIM window. This scheme can efficienly decrease he required ATIM window size in a fully-conneced IEEE mesh nework, bu i is less effecive in muli-hop IBSS nework opologies. Opimizaions of PSM for muli-hop IBSS neworks have also been proposed in several papers. For example, [4] inroduces an ad-hoc clusering scheme where maser nodes form a backbone ha relays he muli-hop raffic beween PSMenabled slave nodes and proposes a disribued algorihm for dynamical and fair selecion of maser nodes in an IBSS. In [20], saions increase heir energy saving by waking-up a muliples of he beacon period and uilize an adapive nex-hop selecion framework in order o decrease he muli-hop packe delays caused by he longer wake-up duy cycles. Laency opimizaion for non-psm saions was addressed in [21], where waves of RTS/CTS frames are proposed o reserve radio resources along he roue for laency-opimized mulihop communicaion. VI. CONCLUSIONS The Fuure Inerne of Things will connec no only Zigbeeenabled devices, such as sensors, bu also consumer elecronics ha predominanly uses Wi-Fi for nework conneciviy. The power saving mechanisms of he IEEE MAC have o be

9 furher opimized o enable low-cos baery-powered devices, such as elecronic oys, o connec o each oher direcly wihou infrasrucure suppor. In his paper, we proposed MHPSM, an exension of he sandard IEEE PSM ha enables low-laency communicaion over muliple hops. A he same ime, MH-PSM increases he doze ime raio and, herefore, exends he baery lifeime of he devices. Using simulaions, we showed he effeciveness of he proposed scheme. MH-PSM is sofware implemenable since i does no require changes o he lower MAC. I is also backwardcompaible wih he sandard PSM, which guaranees ineroperabiliy wih legacy devices. VII. NOWLEDGEMENT Fig. 13. Hardware plaform for MH-PSM evaluaion consiss of an Arduino Due board and an Aheros AR9170-based Wi-Fi ransceiver. This work was parially funded by he European Union Sevenh Framework Programme (FP7-ICT/ ) under gran agreemen number (Calipso; see hp:// R EFERENCES [1] Par 11: Wireless LAN Medium Access Conrol (MAC) and Physical Layer (PHY) Specificaions, IEEE Sd., Rev. IEEE Sd , [2] D.-Y. Kim and C.-H. Choi, Adapive power managemen for IEEE based ad hoc neworks, in Proc. 5h World Wireless Congress, San Francisco, USA, May [3] E.-S. Jung and N. H. Vaidya, Improving IEEE power saving mechanism, Wireless Neworks, vol. 14, no. 3, pp , [4] S. Yongsheng and T. A. Gulliver, An energy-efficien MAC proocol for ad hoc neworks, Wireless Sensor Nework, vol. 1, no. 5, pp , [5] H. Woesner, J.-P. Eber, M. Schlager, and A. Wolisz, Power-saving mechanisms in emerging sandards for wireless LANs: he MAC level perspecive, IEEE Personal Comm., vol. 5, no. 3, pp , [6] T. Narem, E. Nordmark, W. Simpson, and H. Soliman, Neighbor discovery for IP version 6 (IPv6), RFC 4861, Sep [7] M. Grajzer, Nd++ an exended IPv6 Neighbor Discovery proocol for duplicae address deecion o suppor saeless address auoconfiguraion in IPv6 mobile ad-hoc neworks, Inerne-Draf, March [8] Z. Shelby, S. Chakabari, and E. Nordmark, Neighbor discovery opimizaion for Low Power and Lossy Neworks (6LoWPAN), InerneDraf, Aug [9] S. Mangold, Jemula802, hps://gihub.com/schmis/jemula802. [Apr2013]. [10] Arduino Due, hp://arduino.cc/en/main/arduinoboarddue. [Apr2013]. [11] Aheros AR9001U, hp://wikidevi.com/files/aheros/specshees/ AR9001U.pdf. [Apr-2013]. [12] Coniki OS, hp:// [Apr-2013]. [13] S. Aus, R. Prasad, and I. G. M. M. Niemegeers, IEEE ah: Advanages in sandards and furher challenges for sub 1 GHz Wi-Fi, in Proc. IEEE In. Conf. Comm. (ICC), Oawa, Canada, [14] A. K. Sharma, A. Gupa, and A. Misra, Opimized power saving mechanism for wireless ad hoc neworks, in Proc. 1s In. Conf. Recen Advances in Inf. Tech. (RAIT), Dhanbad, India, Mar [15] E.-S. Jung and N. Vaidya, An energy efficien MAC proocol for wireless LANs, in Proc. IEEE Infocom, New York, USA, [16] N. Rajangopalan and C. Mala, Modified power save model for beer energy efficiency and reduced packe laency, American Journal of Engineering and Applied Sciences, vol. 5, no. 3, pp , [17] J.-M. Choi, Y.-B. Ko, and J.-H. Kim, Enhanced power saving scheme for IEEE DCF based wireless neworks, in Personal Wireless Comm., ser. Lecure Noes in Compuer Science, 2003, vol. 2775, pp [18] W. Akkari, A. Belghih, and A. Ben Mnaouer, Enhancing power saving mechanisms for ad hoc neworks using neighborhood informaion, in Proc. In. Wireless Comm. and Mobile Comp. Conf. (IWCMC), Cree, Greece, Aug [19] A. Belghih and W. Akkari, Neighborhood aware power saving mechanisms for ad hoc neworks, in Proc. IEEE Conf. Local Compuer Neworks (LCN), Monreal, Canada, Oc [20] R.-H. Hwang, C.-Y. Wang, C.-J. Wu, and G.-N. Chen, A novel efficien power-saving MAC proocol for muli-hop MANETs, In. Journal of Comm. Sysems, vol. 26, no. 1, pp , Jan [21] G. Hierz, J. Habeha, E. Weiss, and S. Mangold, A cu-hrough swiching echnology for IEEE , in Proc. IEEE Circuis and Sysems Symp. on Emerging Technologies, Shanghai, China, 2004.

COSC 3213: Computer Networks I Chapter 6 Handout # 7

COSC 3213: Computer Networks I Chapter 6 Handout # 7 COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:

More information

MOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:

MOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi: MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically

More information

MOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018

MOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018 MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically

More information

Wireless LANs: MAC. Wireless LAN: MAC. IEEE protocol stack. Module W.lan MAC

Wireless LANs: MAC. Wireless LAN: MAC. IEEE protocol stack. Module W.lan MAC Wireless LANs: W.lan.3-2 Wireless LAN: 802.11MAC Dr.M.Y.Wu@CSE Shanghai Jiaoong Universiy Shanghai, China Module W.lan.3 Dr.W.Shu@ECE Universiy of New Mexico Albuquerque, NM, USA managemen PANs & Blueooh:

More information

Page 1. Key Points from Last Lecture Frame format. EEC173B/ECS152C, Winter Wireless LANs

Page 1. Key Points from Last Lecture Frame format. EEC173B/ECS152C, Winter Wireless LANs EEC173/ECS152C, Winer 2006 Key Poins from Las Lecure Wireless LANs 802.11 Frame forma 802.11 MAC managemen Synchronizaion, Handoffs, Power MAC mehods: DCF & PCF CSMA/CA wih posiive ACK Exponenial backoff

More information

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012 EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule

More information

Communication Networks

Communication Networks Communicaion Neworks Chaper 10 Wireless Local Area Neworks According o IEEE 802.11 Communicaion Neworks: 10. IEEE 802.11 651 10. WLANs According o IEEE 802.11 Overview Organizaion of a WLAN according o

More information

4 Error Control. 4.1 Issues with Reliable Protocols

4 Error Control. 4.1 Issues with Reliable Protocols 4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can

More information

Video streaming over Vajda Tamás

Video streaming over Vajda Tamás Video sreaming over 802.11 Vajda Tamás Video No all bis are creaed equal Group of Picures (GoP) Video Sequence Slice Macroblock Picure (Frame) Inra (I) frames, Prediced (P) Frames or Bidirecional (B) Frames.

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

Chapter 8 LOCATION SERVICES

Chapter 8 LOCATION SERVICES Disribued Compuing Group Chaper 8 LOCATION SERVICES Mobile Compuing Winer 2005 / 2006 Overview Mobile IP Moivaion Daa ransfer Encapsulaion Locaion Services & Rouing Classificaion of locaion services Home

More information

An efficient approach to improve throughput for TCP vegas in ad hoc network

An efficient approach to improve throughput for TCP vegas in ad hoc network Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc

More information

Evaluation and Improvement of Multicast Service in b

Evaluation and Improvement of Multicast Service in b Evaluaion and Improvemen of Mulicas Service in 802.11b Chrisian Bravo 1 and Agusín González 2 1 Universidad Federico Sana María, Deparmen of Elecronics. Valparaíso, Chile chbravo@elo.ufsm.cl 2 Universidad

More information

Mobile Computing IEEE Standard 9/10/14. CSE 40814/60814 Fall 2014

Mobile Computing IEEE Standard 9/10/14. CSE 40814/60814 Fall 2014 Mobile Compuing CSE 40814/60814 Fall 2014 IEEE IEEE (Ins4ue of Elecrical and Elecronics Engineers) esablished he 802.11 Group in 1990. Specifica4ons for sandard ra4fied in 1997. Ini4al speeds were 1 and

More information

Low-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany

Low-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany Low-Cos WLAN based Time-of-fligh fligh Trilaeraion Precision Indoor Personnel Locaion and Tracking for Emergency Responders Third Annual Technology Workshop, Augus 5, 2008 Worceser Polyechnic Insiue, Worceser,

More information

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research

More information

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585

More information

Voltair Version 2.5 Release Notes (January, 2018)

Voltair Version 2.5 Release Notes (January, 2018) Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For

More information

Simple Network Management Based on PHP and SNMP

Simple Network Management Based on PHP and SNMP Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper

More information

Announcements. TCP Congestion Control. Goals of Today s Lecture. State Diagrams. TCP State Diagram

Announcements. TCP Congestion Control. Goals of Today s Lecture. State Diagrams. TCP State Diagram nnouncemens TCP Congesion Conrol Projec #3 should be ou onigh Can do individual or in a eam of 2 people Firs phase due November 16 - no slip days Exercise good (beer) ime managemen EE 122: Inro o Communicaion

More information

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing

More information

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report) Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,

More information

A time-space consistency solution for hardware-in-the-loop simulation system

A time-space consistency solution for hardware-in-the-loop simulation system Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong

More information

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR . ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral

More information

Chapter 3 MEDIA ACCESS CONTROL

Chapter 3 MEDIA ACCESS CONTROL Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing

More information

Assignment 2. Due Monday Feb. 12, 10:00pm.

Assignment 2. Due Monday Feb. 12, 10:00pm. Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how

More information

A MAC layer protocol for wireless networks with asymmetric links

A MAC layer protocol for wireless networks with asymmetric links A MAC layer proocol for wireless neworks wih asymmeric links Guoqiang Wang, Damla Turgu, Ladislau Bölöni, Yongchang Ji, Dan C. Marinescu School of Elecrical Engineering and Compuer Science, Universiy of

More information

A Scheme to Reduce Packet Loss during PMIPv6 Handover considering Authentication

A Scheme to Reduce Packet Loss during PMIPv6 Handover considering Authentication Inernaional Conference on Compuaional Sciences and Is Applicaions ICCSA 2008 A Scheme o Reduce Loss during P Handover considering Auhenicaion Seonggeun Ryu, Gye-Young Kim, Byunggi Kim, and Youngsong Mun

More information

Modeling of IEEE in a Cluster of Synchronized Sensor Nodes

Modeling of IEEE in a Cluster of Synchronized Sensor Nodes Modeling of IEEE 802.15.4 in a Cluser of Synchronized Sensor Nodes Kenji Leibniz, Naoki Wakamiya, and Masayuki Muraa Graduae School of Informaion Science and Technology, Osaka Universiy, 1-5 Yamadaoka,

More information

Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links

Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links 1 in Low-uy-ycle Wireless Sensor Neworks wih Unreliable Links Shuo uo, Suden Member, IEEE, Liang He, Member, IEEE, Yu u, Member, IEEE, o Jiang, Suden Member, IEEE, and Tian He, Member, IEEE bsrac looding

More information

Delayed reservation decision in optical burst switching networks with optical buffers. Title. Li, GM; Li, VOK; Li, CY; Wai, PKA

Delayed reservation decision in optical burst switching networks with optical buffers. Title. Li, GM; Li, VOK; Li, CY; Wai, PKA Tile Delayed reservaion decision in opical burs swiching neworks wih opical buffers Auhor(s) Li, GM; Li, VOK; Li, CY; Wai, PKA Ciaion The 3rd nernaional Conference on Communicaions and Neworking in China

More information

Exercise 3: Bluetooth BR/EDR

Exercise 3: Bluetooth BR/EDR Wireless Communicaions, M. Rupf. Exercise 3: Blueooh BR/EDR Problem 1: Blueooh Daa Raes. Consider he ACL packe 3-DH5 wih a maximum user payload of 1021 byes. a) Deermine he maximum achievable daa rae in

More information

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:! Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide

More information

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab CMOS INEGRAED CIRCUI DESIGN ECHNIQUES Universiy of Ioannina Clocking Schemes Dep. of Compuer Science and Engineering Y. siaouhas CMOS Inegraed Circui Design echniques Overview 1. Jier Skew hroughpu Laency

More information

Po,,ll. I Appll I APP2 I I App3 I. Illll Illlllll II Illlll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illlll Illl Illl Illl

Po,,ll. I Appll I APP2 I I App3 I. Illll Illlllll II Illlll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illlll Illl Illl Illl Illll Illlllll II Illlll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illlll Illl Illl Illl US 20110153728A1 (19) nied Saes (12) Paen Applicaion Publicaion (10) Pub. No.: S 2011/0153728

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

The Impact of Product Development on the Lifecycle of Defects

The Impact of Product Development on the Lifecycle of Defects The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

Coded Caching with Multiple File Requests

Coded Caching with Multiple File Requests Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a

More information

Packet Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers

Packet Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering

More information

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning in Games via Opponent Strategy Estimation and Policy Search Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen

More information

Mobility Chapter 13. More Car Network Ideas. Rating. Overview. Mobile IP Internet. First steps Text book. GSM Network. No apps Mission critical

Mobility Chapter 13. More Car Network Ideas. Rating. Overview. Mobile IP Internet. First steps Text book. GSM Network. No apps Mission critical More Car Nework Ideas Mobiliy Chaper 13 CAR2CAR Consorium: Audi, BMW, Daimler, Fia, GM, Honda, Renaul, VW 13/1 Raing Overview Area mauriy Firs seps Tex book Pracical imporance No apps Mission criical Mobile

More information

A High Efficiency MAC Protocol for WLANs: Providing Fairness in Dense Scenarios

A High Efficiency MAC Protocol for WLANs: Providing Fairness in Dense Scenarios A High Efficiency MAC Proocol for WLANs: Providing Fairness in Dense Scenarios Luis Sanabria-Russo, Jaume Barcelo, Boris Bellala, Francesco Gringoli arxiv:42.395v2 [cs.ni] Nov 5 Absrac Collisions are a

More information

Connections, displays and operating elements. 3 aux. 5 aux.

Connections, displays and operating elements. 3 aux. 5 aux. Taser PlusKapiel3:Taser3.1Taser Plus Meren2005V6280-561-0001/08 GB Connecions, displays and operaing elemens Taser Plus Arec/Anik/Trancen Operaing insrucions A 1 2 1 2 3 4 5 6 C B A B 3 aux. 7 8 9 aux.

More information

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis REM: A Novel Mulicas Rouing Algorihm - Comprehensive Cos Analysis Yewen Cao and Khalid Al-Begain chool of Compuing, Universiy of Glamorgan, CF37 DL, Wales, U.K E-mail:{ycao,kbegain}@glam.ac.uk Absrac Ever-increasing

More information

A Survey on mobility Models & Its Applications

A Survey on mobility Models & Its Applications A Survey on mobiliy Models & Is Applicaions Prof. Vikas Kumar Jain 1, Prof. Raju Sharma 2, Prof. Bhavana Gupa 3 1,2,3 Compuer Science & Engineering, CIST Absrac In his paper, we survey he curren scenario

More information

Connections, displays and operating elements. Status LEDs (next to the keys)

Connections, displays and operating elements. Status LEDs (next to the keys) GB Connecions, displays and operaing elemens A Push-buon plus Sysem M Operaing insrucions 1 2 1 2 3 4 5 6 7 8 C B A 4 Inser he bus erminal ino he connecion of pushbuon A. 5 Inser he push-buon ino he frame.

More information

PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAGATION MODELS

PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAGATION MODELS PERFORMANCE OF TCP CONGESTION CONTROL IN UAV NETWORKS OF VARIOUS RADIO PROPAGATION MODELS Jun Peng Elecrical Engineering Deparmen, Universiy of Texas Rio Grande Valley, Edinburg, Texas, USA ABSTRACT Unmanned

More information

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple

More information

User Adjustable Process Scheduling Mechanism for a Multiprocessor Embedded System

User Adjustable Process Scheduling Mechanism for a Multiprocessor Embedded System Proceedings of he 6h WSEAS Inernaional Conference on Applied Compuer Science, Tenerife, Canary Islands, Spain, December 16-18, 2006 346 User Adjusable Process Scheduling Mechanism for a Muliprocessor Embedded

More information

Web System for the Remote Control and Execution of an IEC Application

Web System for the Remote Control and Execution of an IEC Application Web Sysem for he Remoe Conrol and Execuion of an IEC 61499 Applicaion Oana ROHAT, Dan POPESCU Faculy of Auomaion and Compuer Science, Poliehnica Universiy, Splaiul Independenței 313, Bucureși, 060042,

More information

NRMI: Natural and Efficient Middleware

NRMI: Natural and Efficient Middleware NRMI: Naural and Efficien Middleware Eli Tilevich and Yannis Smaragdakis Cener for Experimenal Research in Compuer Sysems (CERCS), College of Compuing, Georgia Tech {ilevich, yannis}@cc.gaech.edu Absrac

More information

Delay in Packet Switched Networks

Delay in Packet Switched Networks 1 Delay in Packe Swiched Neworks Required reading: Kurose 1.5 and 1.6 CSE 4213, Fall 2006 Insrucor: N. Vlajic Delay in Packe-Swiched Neworks 2 Link/Nework Performance Measures: hroughpu and delay Link

More information

DCF/DSDMA: Enhanced DCF with SDMA Downlink Transmissions for WLANs

DCF/DSDMA: Enhanced DCF with SDMA Downlink Transmissions for WLANs DCF/DSDMA: Enhanced DCF wih SDMA Downlink Transmissions for WLANs Ruizhi Liao, oris ellala, Crisina Cano and Miquel Oliver NeTS Research Group Deparmen of Informaion and Communicaion Technologies Universia

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

CS422 Computer Networks

CS422 Computer Networks CS422 Compuer Neworks Lecure 2 Physical Layer Dr. Xiaobo Zhou Deparmen of Compuer Science CS422 PhysicalLayer.1 Quesions of Ineress How long will i ake o ransmi a message? How many bis are in he message

More information

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes. 8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged

More information

Improving Explicit Congestion Notification with the Mark-Front Strategy

Improving Explicit Congestion Notification with the Mark-Front Strategy Improving Explici Congesion Noificaion wih he Mark-Fron Sraegy Chunlei Liu Raj Jain Deparmen of Compuer and Informaion Science Chief Technology Officer, Nayna Neworks, Inc. The Ohio Sae Universiy, Columbus,

More information

Distributed Task Negotiation in Modular Robots

Distributed Task Negotiation in Modular Robots Disribued Task Negoiaion in Modular Robos Behnam Salemi, eer Will, and Wei-Min Shen USC Informaion Sciences Insiue and Compuer Science Deparmen Marina del Rey, USA, {salemi, will, shen}@isi.edu Inroducion

More information

Computational Geometry in Wireless Networks - Routing. Presented by Heather M. Michaud

Computational Geometry in Wireless Networks - Routing. Presented by Heather M. Michaud Compaional Geomery in Wireless Neworks - Roing Presened by Heaher M. Michad 1 Ad Hoc Wireless Neworks No fixed pre-exising infrasrcre Nodes can be saic or mobile Assme nodes don move dring roing or opology

More information

STEREO PLANE MATCHING TECHNIQUE

STEREO PLANE MATCHING TECHNIQUE STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo

More information

CS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II

CS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II CS 152 Compuer Archiecure and Engineering Lecure 7 - Memory Hierarchy-II Krse Asanovic Elecrical Engineering and Compuer Sciences Universiy of California a Berkeley hp://www.eecs.berkeley.edu/~krse hp://ins.eecs.berkeley.edu/~cs152

More information

Optimal Crane Scheduling

Optimal Crane Scheduling Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move

More information

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks Journal of Compuer Science 2 (5): 466-472, 2006 ISSN 1549-3636 2006 Science Publicaions Performance Evaluaion of Implemening Calls Prioriizaion wih Differen Queuing Disciplines in Mobile Wireless Neworks

More information

PHY and MAC Performance Evaluation of IEEE a WLAN over Fading Channels

PHY and MAC Performance Evaluation of IEEE a WLAN over Fading Channels PHY and MAC Performance Evaluaion of IEEE 802.11a WLAN over Fading Channels Hiroyuki Yomo, Cong Huan Nguyen, Persefoni Kyrisi, Tien Duc Nguyen, Shyam S. Chakrabory, and Ramjee Prasad Absrac This paper

More information

1. Function 1. Push-button interface 4g.plus. Push-button interface 4-gang plus. 2. Installation. Table of Contents

1. Function 1. Push-button interface 4g.plus. Push-button interface 4-gang plus. 2. Installation. Table of Contents Chaper 4: Binary inpus 4.6 Push-buon inerfaces Push-buon inerface Ar. no. 6708xx Push-buon inerface 2-gang plus Push-buon inerfacechaper 4:Binary inpusar. no.6708xxversion 08/054.6Push-buon inerfaces.

More information

Restorable Dynamic Quality of Service Routing

Restorable Dynamic Quality of Service Routing QOS ROUTING Resorable Dynamic Qualiy of Service Rouing Murali Kodialam and T. V. Lakshman, Lucen Technologies ABSTRACT The focus of qualiy-of-service rouing has been on he rouing of a single pah saisfying

More information

LHP: An end-to-end reliable transport protocol over wireless data networks

LHP: An end-to-end reliable transport protocol over wireless data networks LHP: An end-o-end reliable ranspor proocol over wireless daa neworks Xia Gao, Suhas N. Diggavi, S. Muhukrishnan Absrac The nex generaion wireless neworks are posied o suppor large scale daa applicaions.

More information

An Analytic Study of Tuning Systems Parameters in IEEE e Enhanced Distributed Channel Access

An Analytic Study of Tuning Systems Parameters in IEEE e Enhanced Distributed Channel Access An Analyic Sudy of Tuning Sysems Parameers in IEEE 80.11e Enhanced Disribued Channel Access Ye Ge Dep of Elecrical Engineering Ohio Sae Universiy Columbus, OH 310 Email: ge.1@osu.edu Jennifer C. Hou D

More information

The Effects of Multi-Layer Traffic on the Survivability of IP-over-WDM Networks

The Effects of Multi-Layer Traffic on the Survivability of IP-over-WDM Networks The Effecs of Muli-Layer Traffic on he Survivabiliy of IP-over-WDM Neworks Peera Pacharinanakul and David Tipper Graduae Telecommunicaions and Neworking Program, Universiy of Pisburgh, Pisburgh, PA 15260,

More information

Difficulty-aware Hybrid Search in Peer-to-Peer Networks

Difficulty-aware Hybrid Search in Peer-to-Peer Networks Difficuly-aware Hybrid Search in Peer-o-Peer Neworks Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni School of Compuer Science and Technology Huazhong Univ. of Science and Technology {chenhanhua, hjin}@hus.edu.cn

More information

Performance Characterisation of the MCNS DOCSIS 1.0 CATV Protocol with Prioritised First Come First Served Scheduling

Performance Characterisation of the MCNS DOCSIS 1.0 CATV Protocol with Prioritised First Come First Served Scheduling 1 Performance Characerisaion of he MCNS OCSIS 1.0 CTV Proocol wih Prioriised Firs Come Firs Served Scheduling V.Sdralia, C.Smyhe, P.Tzerefos, S.Cvekovic bsrac The Mulimedia Cable Neworks Sysems (MCNS)

More information

MAXIMIZING LIFETIME OF POWERLIMITED NETWORK WITH ACTIVE MINIMUM SPANNING TREE AGGREGATION

MAXIMIZING LIFETIME OF POWERLIMITED NETWORK WITH ACTIVE MINIMUM SPANNING TREE AGGREGATION Published in he Proceedings of he 7 h Parallel and Disribued Compuing and Sysems, MAXIMIZING LIFETIME OF POWERLIMITED NETWORK WITH ACTIVE MINIMUM SPANNING TREE AGGREGATION Javed I. Khan and Asrar U. Haque

More information

An Efficient Delivery Scheme for Coded Caching

An Efficient Delivery Scheme for Coded Caching 201 27h Inernaional Teleraffic Congress An Efficien Delivery Scheme for Coded Caching Abinesh Ramakrishnan, Cedric Wesphal and Ahina Markopoulou Deparmen of Elecrical Engineering and Compuer Science, Universiy

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

Network Slicing for Ultra-Reliable Low Latency Communication in Industry 4.0 Scenarios

Network Slicing for Ultra-Reliable Low Latency Communication in Industry 4.0 Scenarios 1 Nework Slicing for Ulra-Reliable Low Laency Communicaion in Indusry 4.0 Scenarios Anders Ellersgaard Kalør, René Guillaume, Jimmy Jessen Nielsen, Andreas Mueller, and Pear Popovski arxiv:1708.09132v1

More information

Towards a Realistic Model for Failure Propagation in Interdependent Networks

Towards a Realistic Model for Failure Propagation in Interdependent Networks Towards a Realisic Model for Failure Propagaion in Inerdependen Neworks Agosino Suraro, Simone Silvesri, Mauro Coni, Sajal K. Das Deparmen of Mahemaics, Universiy of Padua, email: agosino.suraro@sudeni.unipd.i,

More information

Lecture 18: Mix net Voting Systems

Lecture 18: Mix net Voting Systems 6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified

More information

Fast Restoration Signaling in Optical Networks

Fast Restoration Signaling in Optical Networks Fas Resoraion Signaling in Opical Neworks Radim Baroš and Swapnil Bhaia Deparmen of Compuer Science Universiy of New Hampshire Durham, NH 84, USA email: rbaros, sbhaia @cs.unh.edu ABSTRACT As WANs coninue

More information

Self-organized mobile networks IEEE Prof. JP Hubaux. Reminder on frequencies and wavelenghts. 1 µm 300 THz. 1 m 300 MHz.

Self-organized mobile networks IEEE Prof. JP Hubaux. Reminder on frequencies and wavelenghts. 1 µm 300 THz. 1 m 300 MHz. Self-organized mobile neworks IEEE 802.11 Prof. JP Hubaux 1 Reminder on frequencies and wavelenghs wised pair coax cable opical ransmission 1 Mm 300 Hz 10 km 30 khz 100 m 3 MHz 1 m 300 MHz 10 mm 30 GHz

More information

Let s get physical - EDA Tools for Mobility

Let s get physical - EDA Tools for Mobility Le s ge physical - EDA Tools for Mobiliy Aging and Reliabiliy Communicaion Mobile and Green Mobiliy - Smar and Safe Frank Oppenheimer OFFIS Insiue for Informaion Technology OFFIS a a glance Applicaion-oriened

More information

MoBAN: A Configurable Mobility Model for Wireless Body Area Networks

MoBAN: A Configurable Mobility Model for Wireless Body Area Networks MoBAN: A Configurable Mobiliy Model for Wireless Body Area Neworks Majid Nabi 1, Marc Geilen 1, Twan Basen 1,2 1 Deparmen of Elecrical Engineering, Eindhoven Universiy of Technology, he Neherlands 2 Embedded

More information

I. INTRODUCTION. Keywords -- Web Server, Perceived User Latency, HTTP, Local Measuring. interchangeably.

I. INTRODUCTION. Keywords -- Web Server, Perceived User Latency, HTTP, Local Measuring. interchangeably. Evaluaing Web User Perceived Laency Using Server Side Measuremens Marik Marshak 1 and Hanoch Levy School of Compuer Science Tel Aviv Universiy, Tel-Aviv, Israel mmarshak@emc.com, hanoch@pos.au.ac.il 1

More information

Dimmer time switch AlphaLux³ D / 27

Dimmer time switch AlphaLux³ D / 27 Dimmer ime swich AlphaLux³ D2 426 26 / 27! Safey noes This produc should be insalled in line wih insallaion rules, preferably by a qualified elecrician. Incorrec insallaion and use can lead o risk of elecric

More information

Location. Electrical. Loads. 2-wire mains-rated. 0.5 mm² to 1.5 mm² Max. length 300 m (with 1.5 mm² cable). Example: Belden 8471

Location. Electrical. Loads. 2-wire mains-rated. 0.5 mm² to 1.5 mm² Max. length 300 m (with 1.5 mm² cable). Example: Belden 8471 Produc Descripion Insallaion and User Guide Transiser Dimmer (454) The DIN rail mouned 454 is a 4channel ransisor dimmer. I can operae in one of wo modes; leading edge or railing edge. All 4 channels operae

More information

An HTTP Web Traffic Model Based on the Top One Million Visited Web Pages

An HTTP Web Traffic Model Based on the Top One Million Visited Web Pages An HTTP Web Traffic Model Based on he Top One Million Visied Web Pages Rasin Pries, Zsol Magyari, Phuoc Tran-Gia Universiy of Würzburg, Insiue of Compuer Science, Germany Email: {pries,rangia}@informaik.uni-wuerzburg.de

More information

MB86297A Carmine Timing Analysis of the DDR Interface

MB86297A Carmine Timing Analysis of the DDR Interface Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl

More information

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate 20 TUTA/IOE/PCU Journal of he Insiue of Engineering, 205, (): 20-27 TUTA/IOE/PCU Prined in Nepal M()/M/ Queueing Sysem wih Sinusoidal Arrival Rae A.P. Pan, R.P. Ghimire 2 Deparmen of Mahemaics, Tri-Chandra

More information

TRIDENT: In-field Connectivity Assessment for Wireless Sensor Networks

TRIDENT: In-field Connectivity Assessment for Wireless Sensor Networks TRIDENT: In-field Conneciviy Assessmen for Wireless Sensor Neworks Timofei Isomin 1, Ramona Marfievici 1, Amy L. Murphy 2, Gian Piero Picco 1 1 Universiy of Treno, Ialy firsname.lasname@unin.i 2 Bruno

More information

Using CANopen Slave Driver

Using CANopen Slave Driver CAN Bus User Manual Using CANopen Slave Driver V1. Table of Conens 1. SDO Communicaion... 1 2. PDO Communicaion... 1 3. TPDO Reading and RPDO Wriing... 2 4. RPDO Reading... 3 5. CANopen Communicaion Parameer

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o

More information

ECO-friendly Distributed Routing Protocol for Reducing Network Energy Consumption

ECO-friendly Distributed Routing Protocol for Reducing Network Energy Consumption ECO-friendly Disribued Rouing Proocol for Reducing Nework Energy Consumpion Daisuke Arai and Kiyohio Yoshihara KDDI R&D Laboraories Inc. 2-1-15 Ohara Fujimino-shi Saiama, Japan Email: {di-arai, yosshy}@kddilabs.jp

More information

Quick Verification of Concurrent Programs by Iteratively Relaxed Scheduling

Quick Verification of Concurrent Programs by Iteratively Relaxed Scheduling Quick Verificaion of Concurren Programs by Ieraively Relaxed Scheduling Parick Mezler, Habib Saissi, Péer Bokor, Neeraj Suri Technische Univerisä Darmsad, Germany {mezler, saissi, pbokor, suri}@deeds.informaik.u-darmsad.de

More information

Accelerating Call Route Query of Multi-domain SIP System via P2P GONG Jing, SHEN Qing-guo, SHEN Huan-sheng

Accelerating Call Route Query of Multi-domain SIP System via P2P GONG Jing, SHEN Qing-guo, SHEN Huan-sheng 3rd Inernaional Conference on Mecharonics and Informaion Technology (ICMIT 2016) Acceleraing Call Roue Query of Muli-domain IP ysem via P2P GONG Jing, HEN Qing-guo, HEN Huan-sheng College of Communicaions

More information

NEWTON S SECOND LAW OF MOTION

NEWTON S SECOND LAW OF MOTION Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during

More information

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog

More information

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2 Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,

More information

PROCESS AUTOMATION MANUAL TIMER RELAY KF**-DU-EX1.D ISO9001

PROCESS AUTOMATION MANUAL TIMER RELAY KF**-DU-EX1.D ISO9001 PROCESS AUTOMATION MANUAL TIMER RELAY KF**-DU-EX1.D ISO9001 Wih regard o he supply of producs, he curren issue of he following documen is applicable: The general erms of delivery for producs and services

More information