Research Article Delay Analysis of GTS Bridging between IEEE and IEEE Networks for Healthcare Applications

Size: px
Start display at page:

Download "Research Article Delay Analysis of GTS Bridging between IEEE and IEEE Networks for Healthcare Applications"

Transcription

1 Hidawi Publishig Corporatio Iteratioal Joural of Telemedicie ad Applicatios Volume 29, Article ID 98746, 13 pages doi:1.1155/29/98746 Research Article Delay Aalysis of GTS Bridgig betwee IEEE ad IEEE Networks for Healthcare Applicatios Jelea Mišić 1 ad Xuemi Sherma) She 2 1 Departmet of Computer Sciece, Uiversity of Maitoba, Wiipeg, MB, Caada R3T 2N2 2 Departmet of Electrical ad Computer Egieerig, Uiversity of Waterloo, Waterloo, ON, Caada N2L 3G1 Correspodece should be addressed to Jelea Mišić, jmisic@cs.umaitoba.ca Received 16 Jue 28; Accepted 18 September 28 Recommeded by Yag Xiao We cosider itercoectio of IEEE beaco-eabled etwork cluster with IEEE 82.11b etwork. This sceario is importat i healthcare applicatios where IEEE odes comprise patiet s body area etwork BAN) ad are ivolved i sesig some health-related data. BAN odes have very short commuicatio rage i order to avoid harmig patiet s health ad save eergy. Sesed data eeds to be trasmitted to a access poit i the ward room usig wireless techology with higher trasmissio rage ad rate such as IEEE 82.11b. We model the itercoected etwork where IEEE based BAN operates i guarateed time slot GTS) mode, ad IEEE 82.11b part of the bridge coveys GTS superframe to the 82.11b access poit. We the aalyze the etwork delays. Performace aalysis is performed usig EKG traffic from cotiuous telemetry, ad we discuss the delays of commuicatio due the icreasig umber of patiets. Copyright 29 J. Mišić ad X. Sherma) She. This is a ope access article distributed uder the Creative Commos Attributio Licese, which permits urestricted use, distributio, ad reproductio i ay medium, provided the origial work is properly cited. 1. Itroductio Wireless sesor etworks i healthcare applicatios require small lightweight devices with sesig, computatioal, ad commuicatio features to be uobtrusively placed o patiet s body. They eed to commuicate results of sesig of healthcare data periodically over very short rage to the devices which ca be carried by the patiet or mouted o patiet s bed. We refer to the wireless sesor etwork o patiet s body as body area etwork BAN). Low power, that is, short commuicatio rage of wireless sesors is eeded for health, iterferece, ad security reasos. Devices which collect the results of measuremets eed to provide some limited data processig ad aggregatio, add security/privacy fuctios, ad commuicate aggregated data to the LAN access poit i patiet s ward room as show i Figure 1. We refer to this device as bridge. I this paper, we cosider itercoectio of IEEE beaco-eabled etwork cluster with IEEE 82.11b etwork. The IEEE odes comprise patiet s body area etwork BAN) ad are ivolved i sesig some healthrelated data which will be trasmitted to the access poit i the ward room usig wireless techology such as IEEE 82.11b. It is clear that the etwork performace depeds o the characteristics of the itercoectio device. Therefore, we model the itercoected etwork where IEEE based BAN operates i guarateed time slot GTS) mode, ad IEEE 82.11b part of the bridge coveys GTS superframe to the 82.11b access poit. We the aalyze the impact of importat parameters such as acceptable load rages ad the delays of commuicatio due the icreasig umber of patiets. Sice real-time operatio of the bridges is ecessary for may measuremets i hospitals besides itesive care uits ICUs), we will study commuicatios through the bridge for simple case of EKG cotiuous telemetry. The remaider of the paper is orgaized as follows. We review the etworkig aspect of healthcare wireless sesor etworks with the emphasis o cotiuous electrocardiogram telemetry i Sectio 2. ISectio 3, wereview the properties of beaco-eabled MAC ad IEEE 82.11b MAC related to the operatio of bridge. I Sectio 4, we preset the cocepts of bridge desig betwee IEEE BAN ad IEEE 82.11b ward LAN. Aalytical model of bridge where BAN operates i GTS mode is preseted

2 2 Iteratioal Joural of Telemedicie ad Applicatios i Sectio 5. I Sectio 6, we preset performace results for itercoected clusters uder various modes of bridge access. Fially, Sectio 7 cocludes the paper. 2. Wireless Sesor Networks for Healthcare I today s hospitals, there is a urget eed for timely moitorig the health status of may patiets, especially those with respiratory ad cardiac problems. The eed for cotiuous fetal heart rate moitorig as well as moitorig for movemets of patiets suffered from stroke or Parkiso s disease is also high. Although these applicatios require differet kids of sesors to measure levels of oxyge i blood, heart rate, or motio of body parts, there is uified eed for sesors to be uobtrusively attached to the patiet s body ad for measured data to be trasmitted i a reliable ad secure way i order to be recorded o moitorig devices i real time. Most of the health variables are periodic ad have to be periodically sampled ad digitized. The samplig period has to be at least twice as large as the highest frequecy of the healthcare variables. Recetly, several medical telemetry applicatios have bee prototyped so far ad moved to productio phase such as pulse oximeters, EKG devices, ad motio aalysis systems [1]. Wireless trasmissio is curretly implemeted usig Bluetooth IEEE ad IEEE 82.11b techologies although IEEE emerges as most suitable for medical applicatios due to its low-power ad lowbadwidth requiremets. Some iitial work i this area has bee reported i [1 4]. However, curret reports o wireless healthcare products are focused o reliable hardware ad software desigs of sesor modules while the wireless trasmissio has bee cosidered i testig phase ad for sigle device oly. There is a area of research ivolvig coordiatio ad real-time trasmissio of large umber of healthcare measuremets, which has ot attracted sufficiet attetio. I this paper, we will address the followig problems. 1) Itercoectio of low-power IEEE motes which are coveiet for attachmet o patiet s body) with IEEE 82.11b etwork which has larger badwidth ad larger trasmissio rage. We will desig bridge betwee IEEE wireless commuicatio iterfaces) residig at patiet s body ad IEEE 82.11b residig at bedside or carried i patiet s pocket. More specifically, we will use TDMA feature of IEEE called guarateed time slots to fill it with digitized samples ad pass it to the iterface of IEEE 82.11b for further trasmissio to the hospital room s access poit. 2) Aalysis of delay of real-time health measuremet data icurred by trasmissio techologies. We will use measuremet data for electrocardiogram ad aalyze traffic whe the umber of patiets icreases. Security is aother importat issue i wireless healthcare sesor etworks. I this paper, we will also address data itegrity issue by assumig that there is a shared secret key Patiet s body area etwork Room or ward Room/ward WLAN access poit Body area etwork coordiator ad bridge to room/ward WLAN Room/ward etwork wired) Patiet sesor odes Figure 1: Networkig structure of the ward room with BANs, bridges, ad ward LAN. betwee sesor mote ad bridge device. Secret key will be used to provide message autheticatio code i each superframe packet) usig HMAC fuctio [5, 6] EKG Measuremet. Electrocardiogram ECG or EKG) is a surface measuremet of the electrical potetial geerated by the electrical activity, which cotrols pumpig actio of cardiac muscle fibers. These electrical impulses geerate voltage, which further geerates curret flow i the torso ad potetial differeces o the ski. Stadard EKG moitorig ivolves short-term 3 secods) moitorig of heart pulses usig 12 ski electrodes called leads) placed at desigated locatios o the patiet s body icludig chest, arms, ad legs. Each pair of leads measures voltage which gives oe aspect of the heart s activity. A EKG picture produced by 12 leads allows diagosis of wide rage of heart problems. However, this measuremet is short-term ad requires wired coectio betwee the patiet ad electrocardiograph. I may cases, however, it is ecessary to have cotiuous ad tetherless measuremets of heart rate. For such applicatio, oly three leads placed at patiet s upper ad lower chest ca trace a wide rage of cardiac arrhythmias. Oe ode of these three collects sigals, amplifies the sigal differece, samples the amplified aalog sigal, ad digitizes it. Stadard cliical EKG applicatio has the badwidth of.5 Hz to 1 Hz. For pacemaker detectio, upper frequecy ca be up to 1 khz. There are may desig issues out of scope of this work related to oise suppressio ad filterig frequecies from power lie ad respiratio. I this paper, we assume that upper frequecy of the EKG sigal is 1 Hz. EKG sigal is sampled with 2 Hz, ad each sample is digitized with 12 bits [3]. Therefore, basic badwidth of EKG sigal i stadard cotiuous telemetry is oly 24 bps. 3. Basic Properties of IEEE Std ad IEEE 82.11b MACs 3.1. Basic Properties of IEEE Std MAC. I beacoeabled etworks, the persoal area etwork PAN) coordiator divides its chael time ito superframes [7]. Each superframe begis with the trasmissio of a etwork beaco, followed by a active portio ad a optioal iactive

3 Iteratioal Joural of Telemedicie ad Applicatios 3 Beaco Cotetio-access period CAP) Cotetio-free period CFP) Beaco Guarateed time slot GTS GTS) Iactive Superframe duratio SD) Beaco iterval BI) Figure 2: The compositio of the superframe uder IEEE Std adopted from [7]). portio, as show i Figure 2. The coordiator iteracts with its PAN durig the active portio of the superframe, ad may eter a low-power mode durig the iactive portio. Raw data rate i idustrial, scietific, ad m edical ISM) bad is 25 Kbps. Basic time uit i the stadard is backoff period which cotais 1 bytes. Duratio of active ad iactive parts of the superframe is regulated with MAC parameters SO =,..., 14 which is kow as macsuperframeorder ad BO =,..., 14, also called macbeacoorder. Active superframe part is divided ito 16 slots. Each slot cosists of 3 2 SO backoff periods, which gives the shortest active superframe duratio abasesuperframeduratio of 48 backoff periods whe SO =. Duratio of a active superframe part is deoted as SD = abasesuperframeduratio 2 SO superframe duratio). The time iterval betwee successive beacosisequaltobi = abasesuperframeduratio 2 BO. The duratio of the iactive period of the superframe ca be determied as I = abasesuperframeduratio 2 BO 2 SO ). Period betwee the beacos is equal to the active superframe duratio oly if there is o iactive period i the cluster time, ad, otherwise, it is larger tha active superframe part, that is, BO SO. A active superframe part cosists of cotetio part ad TDMA, that is, guarateed time slot GTS) part. GTS badwidth must be requested by the ode usig the MAC commad frame. Coordiator allocates the GTS badwidth i multiples of slots. Oe slot cotais 3 2 SO backoff periods. Data trasfer from a ode to PAN coordiator ca be doe i GTS slots or usig slotted CSMA-CA access described below. Slotted CSMA-CA algorithm cosists of backoff activity, two clear chael assessmets CCAs), packet trasmissio, ad optioally receipt of the ackowledgmet. Backoff value is uiformly chose i the rage, w 15 1) which is called cotetio widow. Durig backoff coutdow ode does ot liste to the medium, ad checks the activity o the medium oly twice whe backoff cout is fiished. By default, the ode ca have m = 5 trasmissio attempts with backoff widow sizes W 15, = 8W 15,1 = 16, W 15,2 = 32, W 15,3 = 32, ad W 15,4 = 32. To avoid cofusio, we will use subscript 15 to label MAC parameters which have their couterparts i the IEEE 82.11b stadard Basic Properties of IEEE 82.11b Needed for Bridgig. IEEE has much more sophisticated CSMA-CA scheme at the MAC layer. I this protocol opposite to IEEE ), a statio havig a packet to trasmit must iitially liste to the chael to check if aother statio is trasmittig. If there is o trasmissio i distributed iterframe space DIFS) time iterval, the trasmissio ca proceed. If medium is busy, the statio has to wait util curret trasmissio has fiished. The, statio will wait for DIFime period ad the geerate a radom backoff time before trasmittig its frame. This backoff time is uiformly chose i the rage, w 11 1). Backoff couter will be decremeted after each slot time give that trasmissio medium is free, otherwise, its value will be froze util medium becomes free agai for DIFime uits slot time is derived from the propagatio delay time to switch from receivig to trasmittig mode ad time to pass the iformatio about the physical chael state to MAC layer. It actually correspods to backoff period from IEEE ). Statio will trasmit whe its backoff couter reaches zero value. Whe the packet is received, receiver replies with ackowledgmet ACK) packet after short iterframe space SIFS) time iterval. Wheever packet collisio occurs, ackowledgmet will ot be received withi SIFS + ACK time, ad trasmissio has to be reattempted with doubled cotetio widow. If startig widow size is w 11 = W 11,mi after m 11 retrasmissios, its maximal value will become W 11,max = 2 m11 W 11,mi i order to distiguish betwee similar variables i two stadards, we use subscript 11). I our model, we assume that if packet experieces more tha m 11 collisios, last backoff stage will be etered for every subsequet retrasmissio util frame is successfully trasmitted. I order to limit packet collisio time, ad guard agaist hidde termial problem, the stadard allows small reservatio packets request to sed RTS) ad clear to sed CTS) set usig CSMA-CA. After trasmissio of RTS packet, receiver replies with CTS after short iterframe spacesifs) time. Due to sesitivity of healthcare applicatios, we will assume that RTS/CTS scheme is used to protect packets with measuremet data of health variables. The IEEE 82.11b stadard is mostly deployed i curret implemetatios of healthcare wireless sesor etworks [1]. The IEEE 82.11b has higher-speed physical layer tha origial IEEE ad allows trasmissios at 1, 2, 5.5, ad 11 Mbps, while IEEE supports trasmissio at 2 Mbps. However, physical layer header is trasmitted at 1 Mbps, MAC layer header ad payload ca be trasmitted

4 4 Iteratioal Joural of Telemedicie ad Applicatios k k = 1) k k = 78) k k = 15) 24 MHz MHz Figure 3: Used spectra of wireless LAN ad PAN techologies i ISM bad. at 1, 2, 5.5, or 11 Mbps while cotrol frames RTS, CTS, ad ACK are trasmitted at 1 or 2 Mbps. It is also worth otig that sice IEEE 82.11b adapters trasmit at a costat power, distaces covered with trasmissio speeds of 1, 2, 5.5, ad 11 Mbps are 12, 9, 7, ad 3 m, respectively [8]. Startig with semial work i [9], performace of IEEE has bee extesively studied first for saturated case ad later for usaturated case [1 13]. Stadard extesio IEEE 82.11e ehaces CSMA-CA access by itroducig differet iterframe spaces ad differet backoff widow rages for differet traffic classes. This scheme has bee modeled usig similar approach although more complex) as basic scheme i [14 16]. However, give the fact that all BANs have the same priority ad short packet sizes with sesig iformatio, we believe that IEEE 82.11b ca serve the purpose ad that deploymet of IEEE 82.11e at this poit may ot be ecessary. 4. GTS Bridge Desig Bridge cosists of IEEE PAN coordiator ad ordiary IEEE 82.11b iterface. These two compoets are itercoected through a buffer which is filled by the PAN coordiator ad emptied by IEEE 82.11b packet trasmissio facility. IEEE PAN coordiator iterface ad IEEE 82.11b iterface have their wireless trasmit/receive ateas. Both etworks operate i ISM bad as show i Figure 3, ad there is a eed to coordiate operatio of bridge s iterfaces either i TDMA or FDMA maer. From Figure 2 ad discussio i Sectio 3.1, we observe that it is possible to achieve TDMA coordiatio betwee the iterfaces usig the fact that WLAN bridge iterface ca operate durig silet BAN periods. However, i the presece of multiple BANs withi WLAN coverage, this approach requires sychroizatio of BAN beacos we assume that iterferece amog BANs is avoided by separatio i space or by allocatig separate chaels as show i Figure 3). Also badwidth allocatio through SO ad BO parameters must be achieved such that bridged traffic fromallbanscabe delivered durig commo) iactive superframe part. It is much more coveiet if operatio of BAN ad WLAN is separated i frequecy domai because BAN beacos do ot eed to be sychroized ad more badwidth is allocated to the bridge. BAN chaels should be chose i such way that they do ot overlap with ward WLAN chael. From Figure 3, we see that each WLAN chael overlaps with four BAN chaels. Therefore, for each ward WLAN chael, 12 out of 16 BAN chaels should be used i order to avoid iterferece. Duratio of beaco iterval BI is tued accordig to period of sesed health variable. Duratio of active period SD is chose i order to 1) achieve data trasmissio with high success probability i the case of CSMA-CA MAC, 2) i case of GTrasmissio of sesed data, GTS badwidth has to match ecessary size of a group of GTS packets ad ackowledgmet laes where group size correspods to the umber of IEEE odes i BAN. However, some small cotetio periods must be reserved i the superframe i order to commuicate commad frames betwee sesig odes ad PAN coordiator. Sice badwidth of IEEE 82.11b is much larger tha the badwidth of IEEE BAN, trasmissio of oe IEEE 82.11b packet will take short time, ad rest of active period ca be used to exchage some commad data betwee the bridge ad access poit of the ward room. Betwee two trasmissio phases, sesig odes ad bridge are idle ad ca turoff their trasmitters ad receivers. Duratio of this sleep time is BI SD. We make a importat remark about time scales i IEEE ad IEEE 82.11b. Duratio of backoff period i is 32 microsecods, ad with raw data rate of 25 Kbps, oe backoff period carries 1 bytes of data. IEEE slot duratio is 3 2 SO backoff periods. O the other had, IEEE 82.11b backoff couter is decremeted after slot time which is equal to 2 microsecods. Therefore, time-scale traslatio is eeded betwee two etworks. We assume that traffic itesity due to sesig of health variables i BAN will be light give that the umber of odes is lower tha 16, ad that offered load per ode is lower tha few Kbps. This is well below the rate of 25 Kbps supported by IEEE Bridge s buffer will be served by IEEE 82.11b CSMA- CA MAC for which the Markov chai model is preseted i Figure 4. I our modelig, we will assume that data buffers at BAN odes ad at the bridge are ifiite. Although, this assumptio may appear urealistic for sesor odes ad we have always modeled small fiite buffers i our work [17]); offered load to the ode is low so that ode s buffer is empty most of the time. Therefore, both the queuig model with fiite ad ifiite buffers will give similar results. Give the lower computatioal complexity of the model with ifiite buffer, we use it i our aalysis although use of fiite buffer model is straightforward. Assumptio of ifiite buffer at

5 Iteratioal Joural of Telemedicie ad Applicatios 5 1 φ 11 φ 11 idle) φ 11 /W φ 11 /W φ 11 /W φ 11 /W 1 P b 1 P b 1 P b γ 11 π 11,, W 1,W 2, 1, P bs P bs P bs 1 γ 11 γ 11 1 π 11, ) C P t bc P bc P bc 1 γ 11 )/W 1 1 γ 11 )/W 1 1 γ 11 )/W 1 1 γ 11 )/W 1 1 P b 1 P b 1 P b γ 11 π 11, 1, W 1 1 1,W 1 2 1,1 1, P bs P bs P bs 1 γ 11 γ 11 1 π 11, ) C P t bc P bc P bc 1 γ 11 )/W i 1 γ 11 )/W i 1 γ 11 )/W i 1 γ 11 )/W i 1 P b 1 P b 1 P b γ 11 π i, W 11, i 1 i, W i 2 i,1 i, S P t bs P bs P bs 1 γ 11 γ 11 1 π 11, ) P bc P bc P bc 1 γ 11 )/W m,11 1 γ 11 )/W m,11 1 γ 11 )/W m,11 1 γ 11 )/W m,11 1 P b 1 P b 1 Pb γ 11 π 11, m 11, W m 1 m 11, W m 2 m 11,1 m 11, 1 γ γ 11 1 π 11, ) S 11 P t bs P bs P bs C P t bc P bc P bc 1 γ 11 )/W m,11 1 γ 11 )/W m,11 1 γ 11 )/W m,11 1 γ 11 )/W m,11 Figure 4: Markov chai for IEEE 82.11b coupled with device s queue. the bridge is reasoable sice it may cotai more complex hardware ad software, ad offeredload per bridge is low-tomoderate, depedig o the umber of patiets i viciity of access poit. 5. Aalytical Model of GTS Bridgig I geeral case of GTS, bridge sesors may report differet medical variables, such as heart rate, level of oxyge i blood, ad temperature. Each sesor is allocated a umber of slots i uplik directio to carry uplik sesig data ad a slot i dowlik directio to carry ackowledgmet. We will refer to the umber of slots i uplik directio as packet lae. PAN coordiator receives data from statios i separate GTS packet laes, geerates ackowledgmets, ad passes aggregated packets to IEEE 82.11b buffer. Assume that each sesor eeds to be served with data rate D s bps. This results i allocatio of d s packet laes such

6 6 Iteratioal Joural of Telemedicie ad Applicatios Table 1: Compariso of MAC parameters betwee beaco-eabled IEEE ad IEEE 82.11b. CSMA-CA parameter IEEE IEEE 82.11b Backoff period size 32 μs 2μs Liste to the medium durig backoff cout o yes Freeze the backoff ctr. whe medium is busy o yes Liste to the medium immediately before the tras. yes o Actio whe medium is sesed busy New backoff phase Freeze the backoff ctr. Typical size of miimum backoff widow 8 32 Typical umber of backoff phases m 5 5 Raw data rate 25 Kbps 1, 2, 5.5 or 11 Mbps Typical physical + MAC layer header size bits bits RTS ad CTS No i beaco eabled versio Yes that D s = d s 3 2 SO BO.32, 1) ad that period betwee the beacos BI= 48 2 BO.32 matches the samplig period of health variable. Assumig that there are 15 < 16 sesors i the BAN, each sesor will have oe GTS slot, ad the last slot will cotai aggregated ackowledgmets for all sesors. For larger umber of sesors where 15k 1) < 15 15k period betwee the beacos has to be decreased k times, such that each superframe carries readigs from at most 15 sesors ad ackowledgmets i the last GTS slot). For simplicity, let 15 < 16 ad the payload of the IEEE superframe becomes payload of IEEE 82.11b frame cosistig of 15 d s 3 2 SO 1 bytes. IEEE 82.11b frame legth i bytes has to be augmeted with headers from physical ad MAC 82.11b layer which is 5 bytes. Fially, we have to fid frame size i 82.11b slots backoff periods), sice each slot carries umber of bits s 11 equal to the product of raw data rate ad slot duratio, ad its value is equal to l 11 = d s 3 2 SO 1)/s 11. Duratio of RTS, CTS, ad ACK frames expressed i slots will be deoted as rts, cts, adack 11,respectivelywewill use subscript 11 to deote IEEE 82.11b wheever potetial ambiguity may arise betwee two stadards). Duratio of DIFS ad SIFS periods i slots will be deoted as difs ad sifs. Probability geeratig fuctio PGF) for the successful packet trasmissio time is equal to [12] Stz) = z rts+cts+l11+3sifs+difs+ack11, 2) with average value St = St 1) = rts + cts + l 11 +3sifs + difs + ack 11. I the case of collisio of RTS packets activity o medium has PGF: Ctz) = z rts+cts+sifs+difs, 3) with average value Ct = Ct 1) = rts + cts + sifs + difs. Assume that there are 11 bridges attached to the IEEE 82.11b access poit. Each bridge commuicates the same kid of sesig traffic towards the access poit. Usig the assumptio from previous work [2 5, 9, 14, 15] that probability of successful trasmissio is idepedet of the backoff stage,wewilldeoteitasγ 11 while collisio probability is 1 γ 11. Access probability is also idepedet of the backoff stage ad is deoted as τ 11. Relatioship betwee these two probabilities is γ 11 = 1 τ 11 ) 11 1). 4) Probability that medium will be active durig the backoff coutdow of oe statio has two compoets. First oe is the probability that statio sesed the medium busy due to successful trasmissio of oe amog 11 1 statios, ad it has the value p bs = 11 1)τ 11 1 τ 11 ) 11 2).The other compoet is the probability that statio seses the medium busy due to collisio amog some of 11 2 other statios ad has the value p bc = 1 1 τ 11 ) 11 1) p bs. Their sum is the probability that medium is busy durig the backoff coutdow, ad that backoff couter is froze p b = p bs + p bc = 1 γ 11. The PGF for the duratio of time betwee two successive backoff coutdows is represeted with the followig equatio [12]: Hdz) = zγ 11 + p bc Ctz)+p bs Stz) ) Hdz). 5) At this poit, we ote that duratio of period betwee two successive decremets of backoff couter is limited to the maximum packet size. After trasmissio is fiished ad DIFS period passes ay statio doig the backoff,coutdow has to decremet its backoff couter at least oce before packet trasmissio: W 11,i 1 B 11,i z) = k= 1 W 11,i H k d z) = HW11,i d z) 1 W 11,i Hd z) 1 ), 6) where W 11,i = 2 i W 11, for i m 11,adW 11,i = 2 m11 W 11, for i>m 11.

7 Iteratioal Joural of Telemedicie ad Applicatios 7 Assumig that packet will be retrasmitted util valid ackowledgemet is received, the PGF for the packet service time becomes T 11 z) = m 11+1 i 1 i=1 j= m11 + j= B 11,j z)) 1 γ11 ) i 1)Ctz) i 1) γ 11 Stz) ) B 11,j z) i=m 11+1 B11,m11 z) ) i m 11) 1 γ 11 ) i 1)Ctz) i 1) γ 11 Stz), ad its average value is obtaied as T 11 = T 111) Markov Chai Model ad Queuig Model for the GTS Bridge s Output. I the derivatios above, we have derived probability of successful trasmissio ad probability of freezig the backoff period usig the variable which represeted access probability per 82.11b slot τ 11. Access probability, o the other had, has to be derived usig two modelig compoets. First oe is the Markov chai which represets coditioal activities withi the CSMA- CA process. Secod compoet idicates the probability that bridge will be idle ad that it will ot perform backoff cout ad attempt trasmissio. This happes oly whe the bridge s packet buffer is empty. I order to fid this probability, we must deploy queuig theory ad we have to kow the arrival process to the bridge s queue, the size of the bridge s queue, ad the probability distributio packet service time by which packets depart from the queue. Therefore, Markov chai model ad queuig model of the bridge are coupled ad have to be modeled ad solved simultaeously. We will first solve the Markov chai for CSMA-CA MAC usig the variable π 11, which represets the probability that bridge s buffer is empty after the packet departure. Sice similar Markov chai models have bee solved with detailed steps of settig trasitio probabilities i the past i [9 12], we will just state the most importat steps i derivatio of access probability. Markov chai {st), bt)} is discrete as trasitios are observed at eds of slot times. It is bidimesioal give that γ 11 ad p b are idepedet of backoff stage) where st) represetsbackoff stage ad bt) represets value of backoff couter. Correspodig states of the Markov chai will have the state probabilities y i,j, i =,..., m 11, j =,..., W 11,i 1. Sice packet sizes i this applicatio are relatively small, we have icluded the states whe trasmissio of RTS/CTS ad data packets is goig o. Access probability is equal to τ 11 = m 11 i= y i,. Probability of idle state whe bridge s buffer is empty is equal to P idle = τ 11γ 11 π 11,, 8) φ 11 where φ 11 deotes average packet arrival rate of the arrival process to the bridge ote that packet arrival process is ot Poisso whe packets arrive from IEEE BAN to the bridge). 7) By isertig all ecessary trasitio probabilities, we obtai m γ11 π 11, 11 ) j τ 11 = + γ 11 1 γ11 φ 11 j= j= m 11 W11,j 1 ) ) j γ 11 1 γ ) pbc Ct + p bs St ) 1 p b + W11,m11 1 ) ) m11+1) 1 γ 11 2 ) pbc Ct + p bs St ) 1 p b +γ 11 St + 1 γ 11 ) Ct ) Derivatio of Probability Distributio of Occupacy of Bridge s Buffer. As we metioed, we will assume that bridge s buffer has a ifiite capacity. Ratioale behid that is that bridge device ideed ca have much larger memory tha sesig device ad that utilizatio of the bridge is expected to be light-to-moderate. Therefore, bridge is ot expected to work i the regime close to its stability limit where it ca reject packets due to fiite buffer. I GTS-based bridge period betwee arrivals of IEEE superframes to the bridge is costat, ad bridge ca be modeled as D/G/1 queuig system modeled at Markov poits of packet departures from the bridge. Let us deote period of arrival of sesig iformatio from all the sesors to bridge as Φ 11 = 1/φ 11. As metioed earlier, if the umber of sesors 15 < 16, the Φ 11 = BI, ad if 15k 1) < 15 15k, the Φ 15 = kbi. Assume that PGF for the bridge s packet service time ca be expressed as the series as T 11 z) = k= t 11,k z k.probabilityofl, l =, 1,... arrivals of GTS superframes durig packet service time of the bridge has the value a 11,l = Prob [ l+1)φ ] 11 1 lφ 11 T 11 < l +1)Φ 11 = t 11,j. j=lφ 11 9) 1) PGF for the probability distributio of the umber of superframe arrivals durig packet service time by the 82.11b iterface is A 11 z) = l= a 11,l z l.aequatio which shows umber of packets i bridge s buffer left after the departure of the packet has the form l+1 π 11,l = π 11, a 11,l + π 11,j a 11,l j+1. 11) By multiplyig both left-had ad right-had side of 11) with z l ad summig over l =,...,, weobtaipgffor the umber of packets left i the bridge s queue after the departig packet Π 11 z) = l= π 11,l z l as Π 11 z) = A 11z) ) 1 ρ 11 1 z), 12) A 11 z) z where ρ 11 = φ 11 T 11 presets offered load to the bridge. j=1

8 8 Iteratioal Joural of Telemedicie ad Applicatios Access probability Backoff freeze probability Number bridges a) Access probability b) Probability of freeze i backoff period Success probability Probability that buffer is empty after packet departure c) Probability of successful trasmissio d) Probability that buffer is empty after departure Figure 5: Access probability, probability that backoff cout will be froze, probability of successful trasmissio, ad probability that buffer is empty after departig packet. Aalytical results are show as lies ad simulatio results are show as poits. Table 2: Tradeoff betwee packetizatio delay ad umber of samples carried i each superframe. BO value Period betwee Number of EKG samples beacos i the superframe 6.983s s s s 24 Table 3: Parameters used i the aalytical modelig. 2 2 SO ) BO ) 3 Raw data rate ) 25 Kbps Superframe size ) 48 bytes MAC ad payload data rate for 82.11b 2 Mbps Payload size of 82.11b packet 1 slots at 2 Mbps IEEE physical + MAC header size 16.4 slots 5.3. Output Process ad Throughput. Output process from bridge has the PGF for packet iterdeparture times as Δ 11 z) = 1 π 11, ) T11 z)+π 11, z Φ11 T 11 z). 13) Assumig that there are 11 bridges commuicatig with access poit throughput i 82.11b LAN ca be the preseted with expressio Θ 11 = 11 l 11 2 Δ 11, 14) where 2 slots correspod to header iformatio Distributio of Packet Waitig Time i Bridge s Buffer. Assumig FIFO service disciplie, packet arrivig at the bridge has to wait for the curretly trasmitted packet to depart ad for complete service time of all packets already queued. Accordig to reewal theory, remaiig service time of the packet has PGF [18] T + 11z) = 1 T11 z) ) T 11 1 z). 15)

9 Iteratioal Joural of Telemedicie ad Applicatios Average umber of packets left after departig packet a) Mea umber of packets behid departig packet Average packet iterdeparture time b) Mea packet iterdeparture time Offered load Throughput c) Offered load for oe bridge d) Throughput Figure 6: Mea umber of packets left i the bridge s queue after departig packet, mea packet iterdeparture time, bridge offered load, ad throughput. Aalytical results are show as lies, ad simulatio results are show as poits. The, PGF for the waitig time of the packet has the form W 11 z) = π 11, + π 11,1 T + 11z)+π 11,2 T + 11z)T 11 z) + π 11,3 T 11z) + T 11 z) ) 2 = π 11, + T 11z) + π 11,1 + π 11,2 T 11 z)+π 11,3 T11 z) ) 2 + ) = π 11, + T 11z) + Π 11 T11 z) ) π 11, T 11 z) = π 11, 1+T 11z) + 1 A 11 T11 z) ) ) A 11 T11 z) ). T 11 z) 16) Average delay ca be obtaied by differetiatig 16)ad applyig L Hospital s rule: W 11 = φ 11T 2) 11 2 ), 17) 1 ρ 11 where T 2) 11 deotes secod momet of packet service time. This result matches Pollaczek-Khichi mea value formula [19]. The complete access time which icludes waitig time ad service time of the target packet is the equal to S 11 = W 11 + T Performace Evaluatio of GTS Bridge i Cotiuous EKG Telemetry I this sectio, we preset performace results for GTS bridge betwee IEEE ad IEEE 82.11b deployed i cotiuous EKG telemetry. I desig of GTS bridge for EKG telemetry, we assume that superframe will cotai oly three GTS parts. First oe is maagemet slot used for cotrol commuicatio betwee IEEE mote ad the bridge. Secod part is used to carry digitized EKG samples, ad the third part should cotai ackowledgmet from bridge to mote. Duratio of these parts depeds o the duratio of superframe ad time distace betwee the beacos. For example, if SO =, the superframe icludig the beaco frame cotais 16 slots with three backoff periods each. Duratio of beaco frame is 3 bytes 3 backoff periods) sice beaco ca carry ackowledgmet iformatio for previous superframe. Miimal duratio of maagemet slot is three backoff periods 3 bytes). However, 14 slots are the left to carry samples ad packet autheticatio code.

10 1 Iteratioal Joural of Telemedicie ad Applicatios Average value of packet service time Stadard deviatio of packet service time Skewess of packet service time a) Mea packet service time b) Stadard deviatio of packet service time c) Coefficietofskewessofpacketservicetime Figure 7: Momets of packet service time. Aalytical results are show as lies ad simulatio results are show as poits Average value of access time Stadard deviatio of access time Skewess of access time a) Mea system time b) Stadard deviatio of system time c) Coefficietofskewessofsystemtime Figure 8: Momets of system access) time. Aalytical results are show as lies, ad simulatio results are show as poits. We assume that HMAC fuctio adopted is costructed from secure hash algorithm SHA-1 hash [6, 2]) which is a widely used cryptographic hash fuctio with a message digest output of 16 bits. Therefore, 4 bytes are left i the superframe which covers at least 2 digitized samples, that is, measuremet period of 1 secod. This cofirms that SO = is a correct choice as log as the superframes are set with the period less tha a secod. Choice of the BO parameter, that is, the period betwee the beacos is result of cotradictig requiremets Table 2 outlies our desig optios). First requiremet is related to low power cosumptio ad asks that BO is chose to be as large as possible, but still able to carry all the samples geerated durig beaco iterval preferably close to 1 secod). Secod requiremet is related to the packetizatio delay ad reliability. Low packetizatio delay requires small amout of data i the packet. Secod, both IEEE ad IEEE 82.11b ad eve IEEE Bluetooth if it happes to operate i viciity) operate i ISM bad ad cause iterferece to each other. Iterferece ca corrupt the whole superframe, ad, therefore, shorter superframe sizes are preferable. We cosider a ideal wireless chael without oise ad fadig). MAC ad physical layer parameters are give i Table 3 resultig i a period betwee the superframes of.123 secods. We have umerically solved the overall system of equatios uder varyig umber of bridge devices. Aalytical processig was doe usig Maple 11 from Maplesoft. We have also implemeted the simulatio model usig Petri Net simulatio egie Artifex [21]. Figures 5 ad 6 show values of basic etwork parameters whe the umber of bridges is varyig betwee 1 ad 19. Delays are show i umbers of IEEE 82.11b slots 2 microsecods). Although total etwork load is light, we observe that a icrease of the umber of devices uder costat load per device causes liear icrease of access probability, freeze probability, ad throughput; while at the same time, trasmissio success probability, probability that buffer is empty after departure experieces liear decrease. We also observe that aalytical show as lie) ad simulatio results show as poits) are close. Figures 7 ad 8 show first three momets of the packet service time ad packet access time which icludes waitig time i the queue ad packet service time. We observe that for a icrease of the average packet service time of 3%, stadard deviatio has icreased three times. We preset coefficiet of skewess which is derived as the ratio of the third momet of the probability distributio ad third power of stadard deviatio [22] which idicates symmetry of the probability distributio aroud the mea value. This coefficiet is close to zero for distributios

11 Iteratioal Joural of Telemedicie ad Applicatios a) Probability distributio of packet service time, 1 bridges b) Probability distributio of packet service time, 3 bridges c) Probability distributio of packet service time, 5 bridges d) Probability distributio of packet service time, 7 bridges g) Probability distributio of packet service time, 13 bridges e) Probability distributio of packet service time, 9 bridges h) Probability distributio of packet service time, 15 bridges j) Probability distributio of packet service time, 19 bridges f) Probability distributio of packet service time, 11 bridges i) Probability distributio of packet service time, 17 bridges Figure 9: Probability distributio of packet service time. which are symmetric aroud their mea values. However, calculated values of skewess parameter idicate high level of asymmetry, ad we have bee motivated to calculate complete probability distributios ad discuss them. Figures 9 ad 1 show probability distributios of packet service time ad packet waitig time obtaied aalytically for cases whe the umber of bridges icreases from 1 to 19 i steps of 2. For packet service time, each peak o the graph correspods to oe backoff attempt. We otice that for small umber of bridges, almost all packets are served i first backoff attempt. The begiig of the first peak is determied by the time to complete sigle packet

12 12 Iteratioal Joural of Telemedicie ad Applicatios e 5 6e 5 4e 5 2e 5 a) Probability distributio of packet waitig time, 1 bridges e 5 6e 5 4e 5 2e 5 b) Probability distributio of packet waitig time, 3 bridges e 5 6e 5 4e 5 2e 5 c) Probability distributio of packet waitig time, 5 bridges e 5 6e 5 4e 5 2e 5 d) Probability distributio of packet waitig time, 7 bridges e 5 6e 5 4e 5 2e 5 e) Probability distributio of packet waitig time, 9 bridges e 5 6e 5 4e 5 2e 5 f) Probability distributio of packet waitig time, 11 bridges e 5 6e 5 4e 5 2e 5 g) Probability distributio of packet waitig time, 13 bridges e 5 6e 5 4e 5 2e 5 h) Probability distributio of packet waitig time, 15 bridges e 5 6e 5 4e 5 2e 5 i) Probability distributio of packet waitig time, 17 bridges e 5 6e 5 4e 5 2e 5 j) Probability distributio of packet waitig time, 19 bridges Figure 1: Probability distributio of packet waitig time i bridges buffer. trasmissio without the backoff cout St = 69 slots. The width of the first peak correspods to the size of iitial backoff widow elarged by freezig. After first backoff, trasmissio is either successful or collided where collisio lasts for Ct = 29 slots which correspods to the distace betwee the peaks). As the umber of bridges icreases, the umber ad itesity of higher-order backoff attempts icreases ad higher-order peaks become more proouced. Situatio is similar with packet waitig time i the sese that its distributio becomes wider as the umber of bridges icreases. The first peak of this distributio comes from the residual packet service time of the packet curretly beig

13 Iteratioal Joural of Telemedicie ad Applicatios 13 trasmitted) without the collisio, ad it further wides with icreasig umber of backoff phases. Flat parts after the first oe are due to packet retrasmissios after collisio. Both distributios show that packet delay i ward etwork is radom with large variace as the umber of bridges icreases. This is bad ews for real-time payload trasmitted i the IEEE packets sice EKG samples have to be displayed i costat time periods. The results show are useful to determie the amout of playback bufferig for EKG data i order to esure itelligible display of data. 7. Coclusio I this paper, we have preseted the desig issues ad performace evaluatio of the bridge betwee the BAN implemeted usig beaco-eabled IEEE etwork ad IEEE 82.11b wireless LAN. Bridge has bee implemeted usig GTS feature of IEEE Performace results show that for small offered load ad very small packet sizes which carry EKG data with basic badwidth of 24 bps), large umber of devices geerates very wide probability distributio of the packet access time. Give that EKG data has to be displayed i real time, accurate estimatio of access delay is ecessary i order to dimesio bufferig at the receiver. We have show that probability distributios of packet service time ad packet waitig time caot be characterized usig first two momets, istead the whole probability distributios are eeded i order to accurately estimate bufferig delays at the receiver. Ackowledgmet This research is supported by the NSERC Strategic grat. Refereces [8] G. Aastasi, E. Borgia, M. Coti, ad E. Gregori, IEEE 82.11b ad hoc etworks: performace measuremets, Cluster Computig, vol. 8, o. 2-3, pp , 25. [9] G. Biachi, Performace aalysis of the IEEE distributed coordiatio fuctio, IEEE Joural o Selected Areas i Commuicatios, vol. 18, o. 3, pp , 2. [1] E. Ziouva ad T. Atoakopoulos, CSMA/CA performace uder high traffic coditios: throughput ad delay aalysis, Computer Commuicatios, vol. 25, o. 3, pp , 22. [11] Y. Xiao ad J. Rosdahl, Throughput ad delay limits of IEEE 82.11, IEEE Commuicatios Letters, vol. 6, o. 8, pp , 22. [12] H. Zhai, Y. Kwo, ad Y. Fag, Performace aalysis of IEEE MAC protocols i wireless LANs, Wireless Commuicatios ad Mobile Computig, vol. 4, o. 8, pp , 24. [13] H. Zhai, X. Che, ad Y. Fag, How well ca the IEEE wireless LAN support quality of service? IEEE Trasactios o Wireless Commuicatios, vol. 4, o. 6, pp , 25. [14] J. Hui ad M. Devetsikiotis, A uified model for the performace aalysis of IEEE 82.11e EDCA, IEEE Trasactios o Commuicatios, vol. 53, o. 9, pp , 25. [15] X. Che, H. Zhai, X. Tia, ad Y. Fag, Supportig QoS i IEEE 82.11e wireless LANs, IEEE Trasactios o Wireless Commuicatios, vol. 5, o. 8, pp , 26. [16] Y. Xiao, Performace aalysis of priority schemes for IEEE ad IEEE 82.11e wireless LANs, IEEE Trasactios o Wireless Commuicatios, vol. 4, o. 4, pp , 25. [17] J. Mišić ad V. B. Mišić, Wireles Persoal Area Networks: Performace Itercoectios ad Security with IEEE , Joh Wiley & Sos, New York, NY, USA, 28. [18] H. Takagi, Queueig Aalysis. Volume 1: Vacatio ad Priority Systems, North-Hollad, Amsterdam, The Netherlads, [19] L. J. Kleirock, Queueig Systems. Volume 1: Theory, Joh Wiley & Sos, New York, NY, USA, [2] B. Scheier, Applied Cryptography, Joh Wiley & Sos, New York, NY, USA, 2d editio, [21] RSoft Desig, Artifex v.4.4.2, RSoft Desig Group, Ic., Sa Jose, Calif, USA, 23. [22] P. Z. Pebbles Jr., Probability, Radom Variables, ad Radom Sigal Priciples, McGraw-Hill, New York, NY, USA, [1] V. Shayder, B. Che, K. Loricz, T. R. F. Fulford-Joes, ad M. Welsh, Sesor etworks for medical care, Tech. Rep. TR- 8-5, Harvard Uiversity, Cambridge, Mass, USA, 25. [2] T.R.F.Fulford-Joes,G.-Y.Wei,adM.Welsh, Aportable, low-power, wireless two-lead EKG system, i Proceedigs of the 26th Aual Iteratioal Coferece of the IEEE Egieerig i Medicie ad Biology EMBC 4), vol. 3, pp , Sa Fracisco, Calif, USA, September 24. [3] E. Hartma, ECG frot-ed desig is simplified with microcoverter, Aalog Dialogue, vol. 37, o. 4, pp. 1 5, 23. [4] P. O. Bobbie, H. Chaudhari, C. Z. Arif, ad S. Pujari, Electrocardiogram EKG) data acquisitio ad wireless trasmissio, WSEAS Trasactios o Systems, vol. 3, o. 8, pp , 24. [5] M. Bishop, Computer Security: Art ad Sciece, Pearso Educatio, Bosto, Mass, USA, 23. [6] W. Stalligs, Cryptography ad Network Security: Priciples ad Practice, Pretice Hall, Upper Saddle River, NJ, USA, 3rd editio, 23. [7] Stadard for part 15.4: wireless MAC ad PHY specificatios for low rate WPAN, IEEE Std , IEEE, New York, NY, USA, October 23.

Introduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved.

Introduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved. Itroductio to Wireless & Mobile Systems Chapter 6 Multiple Radio Access 1 Outlie Itroductio Multiple Radio Access Protocols Cotetio-based Protocols Pure ALOHA Slotted ALOHA CSMA (Carrier Sese Multiple

More information

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,

More information

Admission control issues in sensor clusters

Admission control issues in sensor clusters Admissio cotrol issues i 802.15.4 sesor clusters Jelea Mišić, Shairmia Shafi, ad Vojislav B. Mišić Departmet of Computer Sciece, Uiversity of Maitoba Wiipeg, Maitoba, Caada PACS umbers: Valid PACS appear

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

History Based Probabilistic Backoff Algorithm

History Based Probabilistic Backoff Algorithm America Joural of Egieerig ad Applied Scieces, 2012, 5 (3), 230-236 ISSN: 1941-7020 2014 Rajagopala ad Mala, This ope access article is distributed uder a Creative Commos Attributio (CC-BY) 3.0 licese

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

A New per-class Flow Fixed Proportional Differentiated Service for Multi-service Wireless LAN*

A New per-class Flow Fixed Proportional Differentiated Service for Multi-service Wireless LAN* A New per-class Flow Fixed Proportioal Differetiated Service for Multi-service Wireless LAN* Meg Chag Che, Li-Pig Tug 2, Yeali S. Su 3, ad Wei-Kua Shih 2 Istitute of Iformatio Sciece, Academia Siica, Taipei,

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA

More information

GTS Scheduling Scheme for Real-Time Communication in IEEE Industrial Wireless Sensor Networks

GTS Scheduling Scheme for Real-Time Communication in IEEE Industrial Wireless Sensor Networks Idia Joural of Sciece ad Techology, Vol 9(7), DOI:.7485/ijst/6/v9i7/87734, February 6 ISSN (Prit) : 974-6846 ISSN (Olie) : 974-5645 GTS Schedulig Scheme for Real-Time Commuicatio i IEEE8.5.4 Idustrial

More information

A Generalized Markov Chain Model for Effective Analysis of Slotted IEEE

A Generalized Markov Chain Model for Effective Analysis of Slotted IEEE A Geeralized Markov Chai Model for Effective Aalysis of Slotted IEEE 8..4 Pagu Park, Piergiuseppe Di Marco, Pablo Soldati, Carlo Fischioe, Karl Herik Johasso Abstract A geeralized aalysis of the IEEE 8..4

More information

Lecture 10 Collision resolution. Collision resolution

Lecture 10 Collision resolution. Collision resolution Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information

A QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services

A QoS Provisioning mechanism of Real-time Wireless USB Transfers for Smart HDTV Multimedia Services A QoS Provisioig mechaism of Real-time Wireless USB Trasfers for Smart HDTV Multimedia Services Ji-Woo im 1, yeog Hur 2, Jog-Geu Jeog 3, Dog Hoo Lee 4, Moo Sog Yeu 5, Yeowoo Lee 6 ad Seog Ro Lee 7 1 Istitute

More information

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1 Quality of Service Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Quality of Service How good are late data ad lowthroughput chaels? It depeds o the applicatio. Do you care if... Your e-mail takes 1/2

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

MAC Throughput Improvement Using Adaptive Contention Window

MAC Throughput Improvement Using Adaptive Contention Window Joural of Computer ad Commuicatios, 2015, 3, 1 14 Published Olie Jauary 2015 i SciRes. http://www.scirp.org/joural/jcc http://dx.doi.org/10.4236/jcc.2015.31001 MAC Throughput Improvemet Usig Adaptive Cotetio

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview

APPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1 Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Performance Analysis of Multiclass FIFO: Motivation, Difficulty and a Network Calculus Approach

Performance Analysis of Multiclass FIFO: Motivation, Difficulty and a Network Calculus Approach Performace Aalysis of Multiclass FIFO: Motivatio, Difficulty ad a Network alculus Approach Yumig Jiag Norwegia Uiversity of Sciece ad Techology (NTNU) 1 19 March 2014, 2d Workshop o Network alculus, Bamberg,

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Acknowledgement-Aware MPR MAC Protocol for Distributed WLANs: Design and Analysis

Acknowledgement-Aware MPR MAC Protocol for Distributed WLANs: Design and Analysis Globecom 2012 - Wireless Commuicatios Symposium Ackowledgemet-Aware MPR MAC Protocol for Distributed WLANs: Desig ad Aalysis Arpa Mukhopadhyay, Neelesh B. Mehta, Seior Member, IEEE, Vikram Sriivasa, Member,

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,

More information

WYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET

WYSE Academic Challenge Sectional Computer Science 2005 SOLUTION SET WYSE Academic Challege Sectioal Computer Sciece 2005 SOLUTION SET 1. Correct aswer: a. Hz = cycle / secod. CPI = 2, therefore, CPI*I = 2 * 28 X 10 8 istructios = 56 X 10 8 cycles. The clock rate is 56

More information

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Media Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1

Media Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1 Media Access Protocols Sprig 2018 CS 438 Staff, Uiversity of Illiois 1 Where are We? you are here 00010001 11001001 00011101 A midterm is here Sprig 2018 CS 438 Staff, Uiversity of Illiois 2 Multiple Access

More information

Politecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects

Politecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects Politecico di Milao Advaced Network Techologies Laboratory Iteret of Thigs Projects 2016-2017 Politecico di Milao Advaced Network Techologies Laboratory Geeral Rules Geeral Rules o Gradig 26/30 are assiged

More information

Introduction to Network Technologies & Layered Architecture BUPT/QMUL

Introduction to Network Technologies & Layered Architecture BUPT/QMUL Itroductio to Network Techologies & Layered Architecture BUPT/QMUL 2018-3-12 Review What is the Iteret? How does it work? Whe & how did it come about? Who cotrols it? Where is it goig? 2 Ageda Basic Network

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Guaranteeing Hard Real Time End-to-End Communications Deadlines

Guaranteeing Hard Real Time End-to-End Communications Deadlines Guarateeig Hard Real Time Ed-to-Ed Commuicatios Deadlies K. W. Tidell A. Burs A. J. Welligs Real Time Systems Research Group Departmet of Computer Sciece Uiversity of York e-mail: ke@mister.york.ac.uk

More information

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

MOTIF XF Extension Owner s Manual

MOTIF XF Extension Owner s Manual MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus

More information

Message Integrity and Hash Functions. TELE3119: Week4

Message Integrity and Hash Functions. TELE3119: Week4 Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering

On the Accuracy of Vector Metrics for Quality Assessment in Image Filtering 0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

performance to the performance they can experience when they use the services from a xed location.

performance to the performance they can experience when they use the services from a xed location. I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Table 2 GSM, UMTS and LTE Coverage Levels

Table 2 GSM, UMTS and LTE Coverage Levels 6 INDICATORS OF QUALITY OF SERVICE This sectio defies quality idicators that characterize the performace of services supported o mobile commuicatio systems i their various phases of access ad use 6. 6.1

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Copyright 2010, Elsevier Inc. All rights Reserved

Copyright 2010, Elsevier Inc. All rights Reserved Computer Networks: A Systems Approach, 5e Larry L. Peterso ad Bruce S. Davie (Subset of topics) Gettig Coected Framig Error Detectio. Reliable Trasmissio Sharig: Etheret ad Multiple Access Networks, Wireless

More information

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

DIRECT SHEAR APPARATUS

DIRECT SHEAR APPARATUS DIRECT SHEAR APPARATUS I a direct shear test, the failure of the soil sample i shear is caused alog a predetermied plae. Test is performed as per IS 2720 part XIII The ormal load, strai ad shearig force

More information

Tutorial on Packet Time Metrics

Tutorial on Packet Time Metrics Power Matters. Tutorial o Packet Time Metrics Lee Cosart lee.cosart@microsemi.com ITS 204 204 Microsemi Corporatio. COMPANY POPIETAY Itroductio requecy trasport Oe-way: forward & reverse packet streams

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

TELETERM M2 Series Programmable RTU s

TELETERM M2 Series Programmable RTU s Model C6xC ad C6xC Teleterm MR Radio RTU s DATASHEET Cofigurable Iputs ad Outputs 868MHz or 900MHz radio port 0/00 Etheret port o C6Cx ISaGRAF 6 Programmable microsd Card Loggig Low power operatio Two

More information

Operating System Concepts. Operating System Concepts

Operating System Concepts. Operating System Concepts Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Spectral leakage and windowing

Spectral leakage and windowing EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad

More information

Interference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks

Interference Aware Channel Assignment Scheme in Multichannel Wireless Mesh Networks Iterferece Aware Chael Assigmet Scheme i Multichael Wireless Mesh Networks Sumyeg Kim Departmet of Computer Software Egieerig Kumoh Natioal Istitute of Techology Gum South Korea Abstract Wireless mesh

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information