Practical Issues with the Timing Analysis of the Controller Area Network
|
|
- Alan Hill
- 6 years ago
- Views:
Transcription
1 Practcal Issues wth the Tmng Analyss of the Controller Area Network Marco D Natale Scuola Superore Sant Anna, Italy. Emal: marco@sssup.t Habo Zeng McGll Unversty, Canada. Emal: habo.zeng@mcgll.ca Abstract The Controller Area Network (CAN) bus s wdely used and has been studed n several research works to determne the worst-case response tme of messages. More results are beng added to study systems that are not constructed accordng to the deal behavor of the message queung and CAN controller assumed n the past. In ths paper, we provde an assessment on the practcal relevance of several of those results. We also present theory and emprcal studes on the relatve mportance of several mplementaton ssues that are qute common n real systems and further devate from the deal behavor. In addton, we propose a heurstc for the desgn of multple software queues when usng TxObjects wthout preempton, and derve an upper bound on the worst case response tme when message output at the CAN drver s pollng based. I. INTRODUCTION Snce ts development n the md 9s, the Controller Area Network (CAN) has attracted a sgnfcant amount of research from the real-tme systems communty. The CAN protocol adopts a collson detecton and resoluton scheme, where the message to be transmtted s chosen accordng to ts dentfer. When multple nodes need to transmt over the same bus, the lowest dentfer message s selected for transmsson. Ths arbtraton protocol allows encodng the message prorty nto the dentfer feld and mplementng prorty-based schedulng. The early analyss on the CAN message response tme [2] was derved by Tndell et al. out of an analogy to the CPU schedulng results. The analyss was later found to be flawed by Davs et al. [2], where a set of formulas s provded for the exact evaluaton and safe approxmaton of the worst case message response tmes. However, the schedulng on a CAN system may be a mult-level schedulng problem n several cases of practcal nterests. The lowest level deals wth the schedulng of the network medum. Above that, the transmt buffers (TxObjects) n the CAN controller need to be approprately assgned to messages, and a software queue at the drver or mddleware layer s used to manage the messages f no TxObject s avalable. The analyss methods [2] [2] are based on a number of assumptons at the mddleware, drver, and controller levels of the CAN communcaton stack that are seldom true n practcal systems (especally automotve systems). These dealzed assumptons nclude the exstence of a perfect prorty-based software queue at each node for the outgong messages, the avalablty of one TxObject for each message (or preemptablty of the TxObjects), and mmedate (zero-tme) copy of the hghest prorty message from the software queue to the TxObjects. Also, researchers tend to assume an assgnment of message dentfers close to Rate Monotonc (RM) or Deadlne Monotonc (DM) polcy, and a possble breakdown utlzaton for the CAN network that s arbtrarly close to %. When these assumptons do not hold, as s the case for many systems, the message response tme (or latency) can be larger than what s predcted by the analyss n [2]. A relatvely lmted number of studes has attempted at the analyss of the addtonal prorty nverson and blockng n the mddleware, devce drver, and CAN controller hardware. [5] [8] analyze the addtonal delay caused by non-abortable (and lmted number of) TxObjects at the CAN controller. Usng FIFO queung (or other polces that are work conservng) for messages nsde the CAN drver/mddleware layers s dscussed and analyzed n [3] [4]. [8] consders the addtonal source of prorty nverson where the copy tme from the message queue to the TxObject cannot be neglected. [7] uses real message traces to analyze more devatons from the assumptons made n the worst-case analyss [2]. In the followng, we wll dscuss the practcal relevance of [2], show several cases of devatons from such deal behavors, and explore the consequences. The paper contrbuton and organzaton are as follows. Secton II ntroduces the notatons and the deal schedulng model, and summarzes the analyss gven n [2]. It then uses random CAN systems to study the probablty when such an analyss s actually needed (the orgnal analyss n [2] s flawed). Secton III uses fve CAN bus confguratons from actual automotve systems to llustrate the realstc breakdown utlzaton n CAN consderng the fact that message dentfers are not assgned accordng to the Rate Monotonc polcy. Secton IV dscusses two cases where the deal schedulng model s volated. One s to consder the mpossblty of preemptng TxObjects (abortng message transmssons). We expermentally evaluate the mpact of ths polcy when the copy tme from the message queue to the TxObject s neglectable. A heurstc algorthm s provded to determne the mnmum number of TxObjects used by (software) message queues and the parttonng of messages among them, whch s shown to acheve optmalty for all our expermental automotve systems. The second case s when message output at the CAN drver s pollng based, for whch we derve an upper bound on the worst case message response tme. Fnally, Secton V concludes the paper.
2 II. AN UNLIKELY REFUTE The ttle of one of the recent and most popular papers on CAN worst-case tmng analyss s Controller Area Network (CAN) Schedulablty Analyss: Refuted, Revsted and Revsed [2]. It could not be more clear: there s a serous ssue wth the old analyss and nobody should use t. The paper ntroducng the correct analyss [2] starts wth an example system wth three messages that s not schedulable and yet s consdered as such by the prevous method n [2]. The three messages (A, B and C) have a transmsson tme of unt each and perods of, respectvely, 2.5, 3.5 and 3.5 unts (the utlzaton of the bus s approxmately 97.%). The prorty order (the dentfer assgnment) s such that A has a hgher prorty than B and then C. B,C A A B C A B A C RC Fgure. The example from [2] showng the flaw n the analyss of [2]. For the analyss model, each perodc or sporadc message m s defned by the tuple m = {N,d,T,J,C,D } where N s the sendng node, d s the CAN dentfer, T s the perod or the mnmum nterarrval tme, J s the queung jtter (sometmes also referred to as release jtter), C s the transmsson tme, and D s the deadlne. The transmsson tme C s gven by the total number of transmtted bts (ncludng the stuffed bts) dvded by the bus transmsson rate. For m,thecrtcal nstant s the tme nstant where: ) the contenton on the bus has just won by the longest lower prorty message (f one exsts); 2) all the hgher prorty messages hp() become smultaneously ready and arrve at ther maxmum rates thereafter. The blockng tme,.e. the tme spent on watng for the transmsson of a lower prorty message already on the bus when m becomes ready, s denoted as B. Consder the analyss of message C n Fgure. Gven that C s the lowest-prorty message, there s no blockng tme. The crtcal nstant s represented n Fgure, wth all messages released at tme t =. Because of the mpossblty to preempt the transmsson of the frst nstance of C, the second nstance of message A s delayed, and, as a result, t pushes over the executon of the second nstance of C. The consequence s that the worst case response tme for message C does not occur at the frst nstance (transmtted after 3 tme unts), but at the second one, wth an actual response tme of 3.5 tme unts. The prevous (flawed and unsafe) analyss n [2] smply assumed that the worst case queung delay w could be determned on the frst nstance n the busy perod as w = B + w + J k + τ bt C k () k hp() where τ bt s the tme to transmt one bt of data on the bus. The fx [2] s obtaned by observng that the worst case response tme s always nsde the busy perod. To fnd the correct worst case response tme, the formula to be appled s a small modfcaton to [2] that checks all the q nstances of message m transmtted nsde the busy perod. Analytcally, the worst-case queung delay w (q) for the q-th nstance n the busy perod s w (q) =B + q C + w + J k + τ bt C k (2) k hp() T k The response tme of the q-th nstance s T k R (q) =J + w (q) q T + C (3) where q ranges from to the last nstance q max of m nsde the busy perod. The length of the longest busy perod L and the ndex of the last nstance can be calculated as L + J k + τ bt L = B + C k k=hp() T k {} (4) q max L + J = T The worst case message response tme s the maxmum among all ts nstances n the busy perod. R = max q=,...,q max{r (q)} (5) A. What Are the Chances that the Fx s Needed The example n [2] has three messages wth such a small perod that each of them takes about 3% of the bus utlzaton. For example, for the typcal bus speed at 5kbps, a message wth full sze (35 bts for standard CAN wth worst case bt stuffng) has a transmsson tme of.27ms. Ths mples a message perod of less than ms for a 3% utlzaton, whch would be unrealstc, even when assumng aperodc loads. In realty, a CAN bus typcally support tens of messages, each one wth a very small fracton of the system utlzaton. Also, nobody would desgn a message system that s on the brnk of feasblty. CAN transmsson may fal and lead to retransmssons, whch are not accounted for n the old analyss [2] or the new one [2] (but could be added wthout much dffculty [3] []). We perform experments to check n what cases the flaws of the analyss n [2] are actually exposed and requre the fx n [2]. We analyze fve bus confguratons taken from actual automotve systems (used also n the other sectons of the paper, one such message set s shown n Table I, another one s descrbed n [5]). In none of the fve real
3 bus confguratons there s any dfference between the results of the old formula and the new one. We also try randomly generated bus confguratons wth n =, 5, 2,..., 6 messages. For each n, 8 random sets are generated whch are consdered as schedulable by the analyss n [2]. The perods of the messages are generated by the product of one to three factors, each randomly drawn from three harmonc sets (2, 4), (6, 2), (5, ). In such a way, the message perods belong to at most three harmonc sets, as s the case for most applcatons of practcal nterest. For all messages, the deadlne s the same as the perod. In the random experments we try several bus speeds. The typcal automotve CAN bus has a transmsson speed of 5kbps. In the frst set of experments, all messages are assumed to have 8 bytes of data wth worst-case bt stuffng, thus the transmsson tme s.27ms. Out of the. 9 message sets, there are only 6 cases where the system s not schedulable accordng to the analyss n [2] (and the fx s requred). None of these 6 cases has more than 35 messages, and the lowest bus utlzaton among them s 99.8%. The experments wth a slower bus speed at 25kbps (and message transmsson tmes of.54ms) produce 52 message sets out of. bllon (less than one n a mllon cases) n whch the revsed analyss produced a dfferent result. None of these cases happens for a confguraton wth 35 messages or more, and the lowest bus utlzaton that requres a fx s 98.%. If we further slow down the bus speed to 25kbps (and message transmsson tmes of.8ms), a total of 54 message sets out of. 9 (slghtly more than one n a mllon cases) requres the fx from [2]. All these cases happen for a confguraton wth 3 messages or less, and the mnmum bus utlzaton s 97.74%. We repeat the experment assumng the message data length s unformly dstrbuted between and 8 bytes wth worst-case bt stuffng. For CAN bus wth 5kbps transmsson speed, there s no message set where the fx from [2] s requred. For CAN bus wth 25kbps and 25kbps, the number of message sets for whch [2] reports false postve schedulablty results s 25 and 877, respectvely. The lowest bus utlzaton among them s 89.39% for a set wth messages and 25kbps bus speed. The need to consder all the nstances n the busy perod, together wth the fact that the length of the busy perod s unknown n advance, results n an excessve complexty of the exact analyss [2] (mpossble to lnearze) for desgn optmzaton purposes. On the other hand, the probablty of the analyss n [2] (whch defnes a necessary condton for schedulablty) beng flawed s very small, whch ndcates a very good chance that the soluton obtaned usng ths condton s also feasble wth respect to the exact test. Gong back to our experments, 89.39% s a very hgh utlzaton, but there are several other ssues that are worth dscussng and lmt the bus utlzaton to much less than 9% or even 8%: Prortes are often not assgned accordng to the RM or DM polcy (Secton III); Messages may be dropped and retransmtted due to errors [3] []; Messages are not always queued by prorty, TxObjects are seldom preemptable, and message copy tme can be larger than the nterframe bts (Secton IV). The mpact of errors can be analyzed, by frst estmatng the number of transmsson errors, then consderng the error recovery overhead [3] []. We focus on the frst and thrd ssues n the followng. III. TYPICAL BREAKDOWN UTILIZATION The frst lmtaton n the use of the CAN bus bandwdth relates to the assgnment of dentfers to messages. Identfers defne the prorty of the messages. Therefore, we may expect that they are assgned to ease schedulablty as much as possble. Contrary to what was stated n [], the RM polcy s not necessarly optmal when schedulng perodc messages (wth blockng tmes) wth deadlnes equal to ther perods (ths was also noted n [2]): t suffces to consder the counterexample wth three messages havng transmsson tmes and perods m =(3, 5), m 2 =(2, 8), and m 3 =(, ). The RM prorty assgnment results n unschedulablty for m 3, but the system s schedulable f m has a hgher prorty than m 3 and then m 2. However, RM (or DM, n the case that the deadlne s smaller than the perod) s stll a very good heurstc for the assgnment of CAN message prortes, especally when the perods and transmsson tmes are realstc (typcally each message has no more than 5% of the bus utlzaton). Unfortunately, n many systems ncludng automotve applcatons, message dentfers are not necessarly assgned accordng to the message perods or deadlnes. Ths happens for a number of reasons. In automotve systems, each dentfer has been tradtonally assgned to match the functonal content of the message rather than ts crtcalty (or rate), such that messages wth dfferent perods but assocated wth the same functonalty are typcally assgned smlar dentfers. Ths s to ease the message flterng process at the recevng node, although at the expense of schedulablty. In other systems, for example, those usng J939 CAN [4] smart sensors, the dentfers of messages sent from a sensor are predetermned by the sensor manufacturer. Agan, ths has lttle to do wth the message perod (whch s often programmable). We use the breakdown utlzaton to llustrate the mpact of the fact that message dentfers are not assgned to maxmze schedulablty. The breakdown utlzaton of a CAN bus s defned as the the maxmum bus utlzaton (by scalng up the bus speed) at whch at least one message was found unschedulable. We compute the breakdown utlzaton usng fve CAN bus confguratons from actual automotve
4 Table I THE LIST OF MESSAGES IN ONE OF THE EXPERIMENTAL BUSES (unt for perods: ms; unt for message length: byte) m N T Len d m N T Len d m N T Len d m E m 28 E 8 28 m 55 E m 2 E m 29 E 8 29 m 56 E 8 56 m 3 E m 3 E 8 3 m 57 E m 4 E m 3 E 8 3 m 58 E m 5 E m 32 E m 59 E m 6 E m 33 E m 6 E m 7 E 8 7 m 34 E m 6 E m 8 E m 35 E m 62 E m 9 E m 36 E m 63 E m E m 37 E m 64 E m E m 38 E m 65 E m 2 E m 39 E m 66 E m 3 E 8 3 m 4 E m 67 E m 4 E m 4 E m 68 E m 5 E 8 5 m 42 E m 69 E m 6 E m 43 E m 7 E m 7 E m 44 E m 7 E m 8 E 8 8 m 45 E m 72 E m 9 E 8 9 m 46 E m 73 E m 2 E 8 2 m 47 E m 74 E m 2 E 8 2 m 48 E m 75 E m 22 E m 49 E m 76 E m 23 E m 5 E m 77 E m 24 E m 5 E m 78 E m 25 E m 52 E m 79 E m 26 E 8 26 m 53 E m 8 E m 27 E 8 27 m 54 E m 8 E systems. Four CAN bus confguratons belong to an expermental vehcle, and the other one to a hybrd bus. Table I shows the message set n the hybrd bus (for IP protecton, the prorty order rather than the actual CAN dentfer s shown n the table), wth many volatons to the RM polcy. The results confrm that the breakdown utlzaton s sensbly lower than %. The hybrd bus has a CAN network (for whch the message set s shown n Table I) wth a breakdown utlzaton of 45.6%. For the four buses of the expermental vehcle, the hghest breakdown utlzaton s 9.6% for a bus that carres nformaton about objects detected n the envronment by a set of sensors (characterzed by a small number of sendng nodes and messages wth smlar perods). The next two buses (body nformaton, the detals of whch can be found n [5], and chasss wth sgnallng nformaton) have a breakdown utlzaton of 7.7% and 67.% respectvely. Fnally, another bus carryng general (not tme crtcal) nformaton has an even lower breakdown utlzaton at 36.8%. IV. MESSAGE QUEUING AND BUFFERING The confguraton and management of the perpheral TxObjects and the possble message queung are mportant n the evaluaton of the prorty nverson and the worst case blockng tmes for CAN messages. CAN controllers have a number of avalable transmt buffers (TxObjects). When the number of TxObjects avalable at the controller s smaller than the number of messages sent by the node (as s the case for automotve gateways and nodes wth lots of output nformaton, or when message recepton s pollng-based and a relatvely large number of buffers must be reserved to nput streams n order to avod message loss by overwrtng), t s necessary to use a software queue to hold messages watng to be coped to a TxObject. Several commercal drvers (ncludng those from Vector [], probably the most commonly used n automotve systems) allow to put the outgong messages n software queues as a temporary storage for accessng TxObjects. It s also qute common to use multple queues, wth each queue lnked to a sngle TxObject. When a TxObject s avalable, a message s extracted from the queue and coped nto t. In ths case, the preservaton of the prorty order of the messages n the access to the bus requres the followng: (a) The contents of the software queue must be kept sorted by message prorty (.e., by message dentfer). (b) When a TxObject becomes free, the hghest prorty message n the queue s mmedately extracted and coped nto the TxObject. (c) If a hgher prorty message becomes ready and all the TxObjects are used by lower prorty messages, the lowest prorty message n one of the TxObjects must be evcted and put back n the queue to ensure that a TxObject s avalable for the hghest prorty message. (d) Messages n the TxObjects must be sent n the order of ther CAN dentfers (prortes). If ths conflcts wth the transmsson order predefned by the hardware for the TxObjects, the poston of the messages n the TxObjects should be dynamcally rearranged. When any of these condtons does not hold, prorty nverson occurs and the worst case tmng analyss n [2] cannot be used. All these ssues are dscussed n [6] where the mpact of transmsson by pollng (as opposed to nterruptdrven) s also outlned. Usng FIFO or any work-conservng queung for messages nsde the CAN drver/mddleware layers ((a) n the prevous lst) s dscussed and analyzed n [3] [4]. [8] consders the addtonal source of prorty nverson where the copy tme from the message queue to the TxObject cannot be neglected ((b) n the lst). Here, we provde further nsght on the management of TxObjects wthout preempton ((c) n the lst) and pollng based message output at CAN drver (a further volaton of (b) n the lst). A. Impossblty of Preemptng the TxObjects Ideally, a message that s coped nsde a TxObject can be evcted from t (.e., the TxObject s preempted or the transmsson request s aborted), unless the transmsson has already started. However, the need to avod any type of drver complexty, even f at the possble expense of tme predctablty and prorty nverson, mpacts the TxObject management n many practcal systems. Qute often developers prefer not to remove a message from the TxObject, even f a hgher prorty message becomes ready.
5 Consder the case of a sngle queue sorted by prorty, where the messages use a sngle TxObject. The TxObject cannot be preempted, that s, when a (lower prorty) message s coped nto t, the other messages n the queue may be blocked watng for ts transmsson. In realty, the typcal system mplementaton prevents most cases of prorty nverson. The queung of the perodc messages n a node does not happen asynchronously, but s performed by a sngle perodc task, executed nsde the Interacton Layer []. Ths task (often called TxTask) executes at the greatest common dvsor of the message perods. Every tme t s actvated, t checks f some message perods are expred. If so, t assembles the messages contents and queues them, n the order of ther prorty. Therefore, a prorty nverson only occurs f the TxObject s not empty by the next actvaton of the TxTask. x6f8 x3a8 x3 the TxTask enqueues messages x6f8 s coped nto the TxObject x3 x3a8 x6f8 Fgure 2. the CAN network s used by other messages x3 x3 s delayed and experences prorty nverson Prorty nverson when the TxObject cannot be revoked. One example s shown n Fgure 2. In ths case, a lower prorty message (x6f8 n the fgure), enqueued by a prevous nstance of the TxTask, s stll watng for transmsson n the TxObject when the next nstance of TxTask arrves and enqueues hgher prorty messages (lke the second nstance of x3 n the fgure). Ths type of prorty nverson experenced by x3 clearly volates the rules on whch Equaton (2) s derved. Analyss on the worst case message response tme for ths case where transmsson requests are not aborted s provded n [5] and later n [8]. ) Evaluatng the cost of TxObject preempton: Even when transmsson aborton s allowed by the CAN controller, the developer may choose not to make use of t, to keep the drver desgn smple and save the addtonal overhead that would be requred for the message evcton and replacement. The ntuton s that the smaller overhead together wth the lkelhood that the blockng message s transmtted n a short tme, wll n most cases compensate for the possble ncrease n the worst-case message response tme. Ths choce s qute common n the automotve ndustry and ndeed experments show that t could be justfed by the average tmng performance of messages (as opposed to the worst-case). Consderng that true hard real-tme systems are ndeed rare, ths may be suffcent justfcaton. To evaluate the mpact of dsablng TxObject preempton on the tmng performance of messages, we perform experments where the drver overhead for evctng a message from a TxObject s estmated, based on measurements of queung operatons and regster access on a Freescale MPC5674F mcrocontroller runnng at 2MHz. Gven that the most common structure for the message queue s a smple lst, the tmng overhead s estmated as the tme to take back a message from the TxObject (wth the correspondng operatons on the controller regster) and nsert nto the software queue, whch can be expressed as (2+4n)μs, wheren s the number of messages already n the queue. probablty (cdf) Ideal behavor.2 Aborton wth measured overhead Aborton wth doubled overhead No aborton Worst case from [2] response tme (Xus) Fgure 3. The response tme of a hgh prorty message wth nonpreemptable TxObjects. probablty (cdf) No aborton Ideal behavor.2 Aborton wth measured overhead Aborton wth doubled overhead Worst case from [2] response tme (Xus) Fgure 4. The response tme of a medum prorty message wth nonpreemptable TxObjects. As an example, we present results on one of the CAN buses of an expermental vehcle, wth 69 messages sent from 6 nodes (the detals are avalable n [5]). We select three representatve messages: a hgh prorty one (second hghest on ts node) wth relatve prorty order of 4; a medum one wth prorty order of 4 (9th out of 8 on ts node); and a low prorty message wth order 63 (the lowest prorty on ts node). We use smulaton to evaluate the tmng performance for four cases: the deal behavor where the TxObject s preemptable wth neglgble tme, the case where the TxObject s preemptable but wth tmng over-
6 n queue... 2 queues... 3 queues....8 n... + j... + probablty (cdf).6.4 Fgure 6. n... j+ Parttonng of messages nto TxObjects/software queues..2 No aborton Ideal behavor Aborton wth measured overhead Aborton wth doubled overhead Worst case from [2] response tme (Xus) Fgure 5. The response tme of a low prorty message wth nonpreemptable TxObjects. head, the case where the TxObject s non-preemptable, and, as an addtonal comparson, the case where the TxObject aborton overhead s doubled. Fgures 3 5 show the results for the representatve messages comparng the cumulatve dstrbuton functons (cdfs) for the four confguratons wth the values from worst case analyss [2]. The fgures show that the overhead of message transmsson aborton at the TxObject does not change much the average tmng performance, as demonstrated by the proxmty of the curves wth the deal behavor. Dsablng the preempton of the TxObject can cause sgnfcant addtonal delays for hgh prorty messages (Fgure 3), where the average response tme ncreases from 5μs to 742μs. However, qute nterestngly, for medum and low prorty messages (Fgures 4 and 5), the average tmng performance s actually better f transmsson aborton s dsabled, protectng these messages from further nterference. 2) Defnng the (software) message queues: To allevate the mpact on hgher prorty messages due to the lack of TxObject preempton, multple TxObjects (each of whch corresponds to a dedcated software queue) can be used. Ths soluton s used n the desgn of many automotve systems. In ths case, the desgner s job s to fnd the mnmum number of TxObjects (and software queues) that s requred to ensure all messages meet ther deadlnes and partton the outgong messages among the queues. Ths desgn synthess problem s stll open, and the complexty of the analyss ([5] [8]) suggests that a provably optmum algorthm s hard to fnd. We propose a smple heurstc soluton to the problem of parttonng the messages among queues whch performs extremely well. The soluton conssts n puttng messages wth contguous prorty levels to the same queue. We frst sort messages by prorty (dentfer). The hghest prorty TxObject and the correspondng queue should contan the hghest prorty messages, untl some ndex. The next queue the messages from prorty ndex + to j, and so on (Fgure 6). The requred number of queues and the breakup ponts can be found by exhaustvely explorng all possble optons wth complexty ( n ) = n (n s the number of messages to be queued) for a two-queue system (as opposte to 2 n for an exhaustve search), and ( ) n 2 = n(n ) 2 for a system wth three queues, and so on. The optmzaton goal s to maxmze the laxty of the node E, defned as the mnmum dfference between the deadlne and worst case response tme among ts messages: X = mn (D j R j ) N j=e We use the fve automotve CAN systems (one n Table I, another n [5]) to evaluate the effectveness of the heurstc algorthm. These fve bus systems contan a total of 59 CAN nodes, each sendng to 4 messages. The proposed heurstc can be evaluated by comparng wth the optmum computed from an exhaustve search (whch s feasble for nodes wth less than 2 messages and 3 queues). However, n case the exhaustve search s too tme consumng, the computed result can stll be demonstrated to be optmal f ts maxmum laxty s the same as the (optmal) case where each message s assumed to have a dedcated TxObject. In all our real automotve case studes the heurstc algorthm computes the optmal soluton. For all nodes n all the systems, two queues are suffcent to guarantee the schedulablty of the messages and acheve the maxmum laxty, wth only one excepton (node E 3 n [5], wth 8 outgong messages, where the schedulablty and maxmum laxty requre three queues). Interestngly, ths shows that n most cases, TxObject evcton could ndeed be compensated by usng only two queues. Ths also results n a smpler drver mplementaton, wth better performance for several messages n the average case and stll retanng a guaranteed worst-case performance. B. Pollng-based Output n CAN Drver Fgure 7 shows the basc functonng of a pollng-based output and ts mpact on message latency. A pollng task s executed wth a perod T p. When t executes, t checks the avalablty of the TxObjects. If one TxObject s free, then t extracts the (hghest prorty) message from the queue and copes nto the TxObject. Then t goes back to sleep. As a result, transmssons from a node are always separated by at least T p. If a message s enqueued wth n other messages n front of t n the queue, then t wll have to wat for at
7 Applcaton layer Mddleware layer Drver layer Controller layer CAN bus Fgure 7. Pollng task TxTask message queue TxObject Pollng task perod The Tx pollng task ntroduces delays between transmsson. least (n )T p before beng coped to the TxObject and consdered for bus arbtraton. The typcal result of a node wth pollng-based message output s shown on the left-hand sde of Fgure 8 for a gven medum prorty message (the detals of the message set can be found n [7]). The rght Y-axs of the fgure shows the cumulatve fracton of nstances that are transmtted wth the latency no larger than the value on the X-axs. Despte the medum prorty, there are nstances wth latences larger than 5ms. Ths s qute unusual, compared to the typcal shape of a latency dstrbuton for a message wth a smlar prorty but usng nterrupt-based message output polcy, as shown on the rght-hand sde of Fgure 8. Indeed, based on ts dentfer, the message should not be delayed by more than a few mllseconds, as the worst-case analyss [2] predcts a worst case latency of approxmately 8ms. However, the source node uses pollng-based message transmsson, and the perod of the pollng task s 2.5ms (as ndcated by the steps n the latency dstrbuton). The number of hgher prorty messages n front of t n the queue vares from to 7, whch s the cause of the correspondng large worst case latency and the substantal latency jtter. We provde an upper bound on the worst case message response tmes for pollng-based output under the assumpton that the perod T p of the pollng task s sgnfcantly larger than the message transmsson tmes. T p s typcally n the range of several mllseconds, and the worst case message transmsson tme s n the order of hundreds of mcroseconds. Followng the framework of the prevous Secton II, we analyze the worst case queung delay w (q) for the q-th nstance of message m. The length of the longest busy perod can be computed n a smlar way. Durng the queung delay w (q), a hgher prorty message m j hp() can provde a number of nterferences on m equal to w (q) n j = w (q) + J j + τ bt T j (6) can be consdered as the sum of three tems: w (q) = I () + I (2) + B (7) where I (): nterferences from hgher prorty messages on the same node, plus the prevous q nstances of m ; I (2): nterferences from hgher prorty messages on other nodes; B : blockng tme from lower prorty messages. Fndng the worst case scenaro that smultaneously consders the contrbutons from the above three tems s not an easy task, and very lkely an NP-hard problem. Instead, we fnd an upper bound for each of the tems separately. Each nstance of m j contrbutng to I () alone can delay the transmsson of the q-th nstance of message m by T p (nstead of C j as n the analyss summarzed n Secton II). Thus, I () s bounded from above by I () = (q + n j ) T p (8) j hp(),n j =N All the hgher prorty messages from other nodes contrbute to the nterference term by addng ther transmsson tme at each of ther n j actvatons. Thus, I (2) s I (2) = (n j C j ) (9) j hp(),n j N Suppose the maxmum transmsson tme of a lower prorty message n lp() s B max = max C k () k lp() Each tme m s delayed up to T p due to the nterference and blockng delay I (2) + B, an addtonal blockng tme can occur equal to the longest transmsson tme of any lower prorty message. It s possble that the transmsson of the messages contrbutng to I () may suffer blockng delays, but ths wll not further affect I () or B (as we assume T p s sgnfcantly larger than the message transmsson tmes). The number of actvatons of the pollng task at whch I (2) + B addtonal blockngs can happen s n b = +. T p Thus, the blockng tme s B = n b B max I (2) + B =( +) B max () The queung delay can be calculated usng an teratve procedure wth two nested loops, as n Algorthm. w (q) s teratvely computed by the outer loop (lnes 2 4). Frst, Equatons (6), (8), and (9) are used to compute the nterferences from hgher prorty messages usng the value w (q) from the prevous teraton. Then, n the nner loop (lnes 8 ), Equaton () teratvely computes the blockng tme B gven the nterferences from hgher prorty messages I () and I (2). The blockng tme B found after convergence s then used wth the other tems to update w (q). For the message on the left-hand sde of Fgure 8, the computed worst case response tme s 37.22ms. Such an T p
8 number of nstances 4 2 number of nstances cumulatve fracton 5.8 cumulatve fracton number of nstances number of nstances cumulatve fracton 4.8 rate depends on remote nterference cumulatve fracton 8 ~2.5 ms mnmum latency from hgher prorty messages from the same node wth harmonc perod message response tme (ms) message response tme (ms) Fgure 8. Latency dstrbuton for a message wth pollng-based output (left) compared to another message wth nterrupt-drven output (rght). Algorthm Calculatng the worst case queung delay w (q) : fnd an ntal value w (q)new (e.g. assumng j hp(), n j = ) 2: repeat 3: w (q)old = w (q)new 4: for j hp() do w (q)old + J j + τ bt 5: n j = T j 6: calculate I () and I (2) usng Equatons (8) (9) 7: B new = B old = B max // ntal value for B 8: repeat 9: B old = B new I(2) : B new + B old =( +) B max : untl B new 2: B = B new 3: w (q)new 4: untl w (q)new 5: w (q) T p = B old // converged value for B = I () + I (2) + B = w (q)old = w (q)new // converged value for w (q) exceedngly large (although pessmstc) bound s further evdence that pollng-based output management n a CAN drver s smply not the rght choce for real-tme systems. V. CONCLUSION Ths paper dscusses several ssues wth respect to the practcal relevance of the analyss of message latences n CAN networks. The possble causes of prorty nversons at dfferent levels n the communcaton stack are examned. A heurstc soluton s proposed for the problem of desgnng multple software queues when usng TxObjects wthout preempton, whch s demonstrated to be close to optmal n practcal systems desgn. We also derve an upper bound on the worst case response tme when message output at the CAN drver level s pollng based. REFERENCES [] Vector canbedded nteracton layer. [2] R. Davs, A. Burns, R. Brl, and J. Lukken. Controller Area Network (CAN) schedulablty analyss: Refuted, revsted and revsed. Real- Tme Systems, 35(3): , 27. [3] R.I. Davs, S. Kollmann, V. Pollex, F. Slomka, Schedulablty Analyss for Controller Area Network (CAN) wth FIFO Queues Prorty Queues and Gateways. In Real-Tme Systems, Volume 49, Issue, Pages 73-6, Jan 23. [4] R. Davs and N. Navet. Controller Area Network (CAN) Schedulablty Analyss for Messages wth Arbtrary Deadlnes n FIFO and Work- Conservng Queue. In Proc. 9th IEEE Internatonal Workshop on Factory Communcaton System, 22. [5] M. D Natale. Evaluatng message transmsson tmes n Controller Area Networks wthout buffer preempton. In 8th Brazlan Workshop on Real-Tme Systems, 26. [6] M. D Natale. What can go wrong n CAN (tmng analyss). In Socety of Automotve Engneers World Congress, 2. [7] M. D Natale, H. Zeng, P. Gusto, and A. Ghosal. Chapter 7, Understandng and Usng the Controller Area Network Communcaton Protocol. Sprnger, ISBN , Feburary 22. [8] D. Khan, R. Davs, and N. Navet. Schedulablty analyss of CAN wth non-abortable transmsson requests. In Proc. 6th IEEE Conference on Emergng Technologes & Factory Automaton, 2. [9] A. Mesch, M. D Natale, and M. Spur. Prorty nverson at the network adapter when schedulng messages wth earlest deadlne technques. In Proc. Euromcro Conference on Real-Tme Systems, 996. [] N. Navet, Y.-Q. Song, and F. Smonot. Worst-case deadlne falure probablty n real-tme applcatons dstrbuted over controller area network. Journal of Systems Archtecture, 46(7):67 67, 2. [] M. Park. Non-preemptve fxed prorty schedulng of hard real-tme perodc tasks. In Proc. 7th Internatonal Conference on Computatonal Scence, 27. [2] K. Tndell, H. Hansson, and A.J. Wellngs. Analysng real-tme communcatons: Controller Area Network (CAN). In Proc. 5th Real- Tme Systems Symposum, 994. [3] K. Tndell and A. Burns. Guaranteed Message Latences For Dstrbuted Safety-Crtcal Hard Real-Tme Control Networks. Techncal Report, Department of Computer Scence, Unversty of York, May 994. Techncal Report YCS229. [4] Wlfred Voss. A Comprehensble Gude to J939. Copperhll Technologes Corporaton, 28. [5] H. Zeng, M. D Natale, P. Gusto, and A. Sangovann-Vncentell. Usng Statstcal Methods to Compute the Probablty Dstrbuton of Message Response Tme n Controller Area Network. IEEE Transactons on Industral Informatcs, 6(4):678 69, 2.
Redes de Comunicação em Ambientes Industriais Aula 8
Redes de Comuncação em Ambentes Industras Aula 8 Luís Almeda lda@det.ua.pt Electronc Systems Lab-IEETA / DET Unversdade de Avero Avero, Portugal RCAI 2005/2006 1 In the prevous epsode... Cooperaton models:
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationMTBF PREDICTION REPORT
MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0
More informationResource Scheduling in Dependable Integrated Modular Avionics
Resource Schedulng n Dependable Integrated Modular Avoncs Yann-Hang Lee and Daeyoung Km Real Tme Systems Research Laboratory CISE Department, Unversty of Florda {yhlee, dkm}@cse.ufl.edu Mohamed Youns,
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationHigh Speed ADC Sampling Transients
Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.
More informationThe Synthesis of Dependable Communication Networks for Automotive Systems
06AE-258 The Synthess of Dependable Communcaton Networks for Automotve Systems Copyrght 2005 SAE Internatonal Nagarajan Kandasamy Drexel Unversty, Phladelpha, USA Fad Aloul Amercan Unversty of Sharjah,
More informationNATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985
NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationExploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,
More informationTECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf
TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationControl Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart
Control Chart - hstory Control Chart Developed n 920 s By Dr. Walter A. Shewhart 2 Process n control A phenomenon s sad to be controlled when, through the use of past experence, we can predct, at least
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationPriority based Dynamic Multiple Robot Path Planning
2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna
More informationNon Pre-emptive Scheduling of Messages on SMTV Token-Passing Networks
on Pre-emptve Schedulng of Messages on SM oen-passng etwors Eduardo ovar Department of Computer Engneerng, ISEP, Polytechnc Ittute of Porto, Portugal E-mal: emt@de.sep.pp.pt Abstract Feldbus communcaton
More informationAnalysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson
37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se
More informationDigital Transmission
Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal
More informationModeling Hierarchical Event Streams in System Level Performance Analysis
Modelng Herarchcal Event Streams n System Level Performance Analyss IK Report 9 obas Ren, Ka Lampka, Lothar hele Computer Engneerng and Networks Laboratory Swss Federal Instsute of echnology (EH) Zurch,
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationHard Real-Time Scheduling for Low-Energy Using Stochastic Data and DVS Processors
Hard Real-me Schedulng for Low-Energy Usng Stochastc Data and DVS Processors Flavus Gruan Department of Computer Scence, Lund Unversty Box 118 S-221 00 Lund, Sweden el.: +46 046 2224673 e-mal: Flavus.Gruan@cs.lth.se
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationQueuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks
1 Queung-Based Dynamc Channel Selecton for Heterogeneous ultmeda Applcatons over Cogntve Rado Networks Hsen-Po Shang and haela van der Schaar Department of Electrcal Engneerng (EE), Unversty of Calforna
More informationWebinar Series TMIP VISION
Webnar Seres TMIP VISION TMIP provdes techncal support and promotes knowledge and nformaton exchange n the transportaton plannng and modelng communty. DISCLAIMER The vews and opnons expressed durng ths
More informationA Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks
74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham
More informationOptimal Sizing and Allocation of Residential Photovoltaic Panels in a Distribution Network for Ancillary Services Application
Optmal Szng and Allocaton of Resdental Photovoltac Panels n a Dstrbuton Networ for Ancllary Servces Applcaton Reza Ahmad Kordhel, Student Member, IEEE, S. Al Pourmousav, Student Member, IEEE, Jayarshnan
More informationEnergy-Aware Algorithms for Tasks and Bandwidth Co-Allocation under Real-Time and Redundancy Constraints
Proceedngs of the 17th IEEE Internatonal Conference on Emergng Technology and Factory Automaton (ETFA 2012) Energy-Aware Algorthms for Tasks and Bandwdth Co-Allocaton under Real-Tme and Redundancy Constrants
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Communcaton Networks Asynchronous TDMA ad hoc networks: Schedulng and Performance THEODOROS SALONIDIS AND LEANDROS TASSIULAS, Department of Electrcal and Computer Engneerng, Unversty of Maryland at College
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationPassive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)
Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called
More informationSecure Transmission of Sensitive data using multiple channels
Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.com
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Performance ssues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks by Theodoros Salonds, Leandros Tassulas CSHCN TR 00 (ISR TR 005) The Center for Satellte
More informationA Model-Driven Co-Design Framework for Fusing Control and Scheduling Viewpoints
Artcle A Model-Drven Co-Desgn Framework for Fusng Control and Schedulng Vewponts Sakthvel Mankandan Sundharam 1, * ID, Ncolas Navet 1, Sebastan Altmeyer 2 ID Lonel Havet 3 1 Laboratory of Advanced Software
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationHarmonic Balance of Nonlinear RF Circuits
MICROWAE AND RF DESIGN Harmonc Balance of Nonlnear RF Crcuts Presented by Mchael Steer Readng: Chapter 19, Secton 19. Index: HB Based on materal n Mcrowave and RF Desgn: A Systems Approach, nd Edton, by
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationA Simple Satellite Exclusion Algorithm for Advanced RAIM
A Smple Satellte Excluson Algorthm for Advanced RAIM Juan Blanch, Todd Walter, Per Enge Stanford Unversty ABSTRACT Advanced Recever Autonomous Integrty Montorng s a concept that extends RAIM to mult-constellaton
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationOpportunistic Beamforming for Finite Horizon Multicast
Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationExact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
Exact Probablstc Analyss of the Lmted Schedulng Algorthm for Symmetrcal Bluetooth Pconets Gl Zussman *, Ur Yechal 2, and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology,
More informationEstimating Mean Time to Failure in Digital Systems Using Manufacturing Defective Part Level
Estmatng Mean Tme to Falure n Dgtal Systems Usng Manufacturng Defectve Part Level Jennfer Dworak, Davd Dorsey, Amy Wang, and M. Ray Mercer Texas A&M Unversty IBM Techncal Contact: Matthew W. Mehalc, PowerPC
More informationThs materal s publshed n the open archve of Md Sweden Unversty DIVA http://mun.dva-portal.org to ensure tmely dssemnaton of scholarly and techncal work. Copyrght and all rghts theren are retaned by authors
More informationWeighted Penalty Model for Content Balancing in CATS
Weghted Penalty Model for Content Balancng n CATS Chngwe Davd Shn Yuehme Chen Walter Denny Way Len Swanson Aprl 2009 Usng assessment and research to promote learnng WPM for CAT Content Balancng 2 Abstract
More informationA New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs
Journal of Communcatons Vol. 9, No. 9, September 2014 A New Type of Weghted DV-Hop Algorthm Based on Correcton Factor n WSNs Yng Wang, Zhy Fang, and Ln Chen Department of Computer scence and technology,
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
More informationShunt Active Filters (SAF)
EN-TH05-/004 Martt Tuomanen (9) Shunt Actve Flters (SAF) Operaton prncple of a Shunt Actve Flter. Non-lnear loads lke Varable Speed Drves, Unnterrupted Power Supples and all knd of rectfers draw a non-snusodal
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationComparison of Two Measurement Devices I. Fundamental Ideas.
Comparson of Two Measurement Devces I. Fundamental Ideas. ASQ-RS Qualty Conference March 16, 005 Joseph G. Voelkel, COE, RIT Bruce Sskowsk Rechert, Inc. Topcs The Problem, Eample, Mathematcal Model One
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationGuidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014
Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,
More informationMASTER TIMING AND TOF MODULE-
MASTER TMNG AND TOF MODULE- G. Mazaher Stanford Lnear Accelerator Center, Stanford Unversty, Stanford, CA 9409 USA SLAC-PUB-66 November 99 (/E) Abstract n conjuncton wth the development of a Beam Sze Montor
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationHUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1
Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,
More informationproblems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance
palette of problems Davd Rock and Mary K. Porter 1. If n represents an nteger, whch of the followng expressons yelds the greatest value? n,, n, n, n n. A 60-watt lghtbulb s used for 95 hours before t burns
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationArterial Travel Time Estimation Based On Vehicle Re-Identification Using Magnetic Sensors: Performance Analysis
Arteral Travel Tme Estmaton Based On Vehcle Re-Identfcaton Usng Magnetc Sensors: Performance Analyss Rene O. Sanchez, Chrstopher Flores, Roberto Horowtz, Ram Raagopal and Pravn Varaya Department of Mechancal
More informationQoS Provisioning in Wireless Data Networks under Non-Continuously Backlogged Users
os Provsonng n Wreless Data Networks under Non-Contnuously Backlogged Users Tmotheos Kastrnoganns, and Symeon Papavasslou, Member, IEEE School of Electrcal and Computer Engneerng Natonal Techncal Unversty
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More information@IJMTER-2015, All rights Reserved 383
SIL of a Safety Fuzzy Logc Controller 1oo usng Fault Tree Analyss (FAT and realablty Block agram (RB r.-ing Mohammed Bsss 1, Fatma Ezzahra Nadr, Prof. Amam Benassa 3 1,,3 Faculty of Scence and Technology,
More informationVRT014 User s guide V0.8. Address: Saltoniškių g. 10c, Vilnius LT-08105, Phone: (370-5) , Fax: (370-5) ,
VRT014 User s gude V0.8 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationImplementation of a Dominance Protocol for Wireless Medium Access
Implementaton of a Domnance Protocol for Wreless Medum Access Nuno Perera, Björn Andersson and Eduardo Tovar IPP Hurray Research Group Polytechnc Insttute of Porto, Portugal {nperera,bandersson,emt}@de.sep.pp.pt
More informationConfiguring the communication on FlexRay - the case of the static segment
Confgurng the communcaton on FlexRay - the case of the statc segment Matheu Grener, Lonel Havet, Ncolas Navet To cte ths verson: Matheu Grener, Lonel Havet, Ncolas Navet. Confgurng the communcaton on FlexRay
More informationantenna antenna (4.139)
.6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,
More information1 GSW Multipath Channel Models
In the general case, the moble rado channel s pretty unpleasant: there are a lot of echoes dstortng the receved sgnal, and the mpulse response keeps changng. Fortunately, there are some smplfyng assumptons
More informationDistributed Channel Allocation Algorithm with Power Control
Dstrbuted Channel Allocaton Algorthm wth Power Control Shaoj N Helsnk Unversty of Technology, Insttute of Rado Communcatons, Communcatons Laboratory, Otakaar 5, 0150 Espoo, Fnland. E-mal: n@tltu.hut.f
More informationREAL-TIME SCHEDULING IN LTE FOR SMART GRIDS. Yuzhe Xu, Carlo Fischione
REAL-TIME SCHEDULING IN LTE FOR SMART GRIDS Yuzhe Xu, Carlo Fschone Automatc Control Lab KTH, Royal Insttue of Technology 1-44, Stockholm, Sweden Emal: yuzhe@kth.se, carlof@kth.se ABSTRACT The latest wreless
More informationAN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2
AN ALGORITHM TO COMBINE LINK ADAPTATION AND TRANSMIT POWER CONTROL IN HIPERLAN TYPE 2 Markus Radmrsch Inst. f. Allgem. Nachrchtentechnk, Unv. Hannover, Appelstr. 9a, 3167 Hannover, Germany Tel.: +49-511-762
More informationLow Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks
Low Complexty Duty Cycle Control wth Jont Delay and Energy Effcency for Beacon-enabled IEEE 8254 Wreless Sensor Networks Yun L Kok Keong Cha Yue Chen Jonathan Loo School of Electronc Engneerng and Computer
More informationApproximating User Distributions in WCDMA Networks Using 2-D Gaussian
CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer
More informationKeywords LTE, Uplink, Power Control, Fractional Power Control.
Volume 3, Issue 6, June 2013 ISSN: 2277 128X Internatonal Journal of Advanced Research n Computer Scence and Software Engneerng Research Paper Avalable onlne at: www.jarcsse.com Uplnk Power Control Schemes
More informationLow Switching Frequency Active Harmonic Elimination in Multilevel Converters with Unequal DC Voltages
Low Swtchng Frequency Actve Harmonc Elmnaton n Multlevel Converters wth Unequal DC Voltages Zhong Du,, Leon M. Tolbert, John N. Chasson, Hu L The Unversty of Tennessee Electrcal and Computer Engneerng
More informationMalicious User Detection in Spectrum Sensing for WRAN Using Different Outliers Detection Techniques
Malcous User Detecton n Spectrum Sensng for WRAN Usng Dfferent Outlers Detecton Technques Mansh B Dave #, Mtesh B Nakran #2 Assstant Professor, C. U. Shah College of Engg. & Tech., Wadhwan cty-363030,
More informationSide-Match Vector Quantizers Using Neural Network Based Variance Predictor for Image Coding
Sde-Match Vector Quantzers Usng Neural Network Based Varance Predctor for Image Codng Shuangteng Zhang Department of Computer Scence Eastern Kentucky Unversty Rchmond, KY 40475, U.S.A. shuangteng.zhang@eku.edu
More information38050 Povo Trento (Italy), Via Sommarive 14
UNIVERSIY OF RENO EARMEN OF INFORMAION AN COMMUNICAION ECHNOLOGY 38050 ovo rento (Italy), Va Sommarve 14 http://www.dt.untn.t USH LESS AN ULL HE CURREN HIGHES EMANE AA IEM O ECREASE HE WAIING IME IN ASYMMERIC
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationAdaptive Fault Tolerance in Real-Time Information Systems
Shubnsky I.B., Rozenberg I.N., Papc L. Adaptve Fault Tolerance n Real-Tme Informaton Systems Shubnsky I.B., Rozenberg I.N., Papc L. Russa, Moscow, JSC NIIAS, Serba, Prjevor, ICDQM Abstract Real-tme nformaton
More informationResearch on the Process-level Production Scheduling Optimization Based on the Manufacturing Process Simplifies
Internatonal Journal of Smart Home Vol.8, No. (04), pp.7-6 http://dx.do.org/0.457/sh.04.8.. Research on the Process-level Producton Schedulng Optmzaton Based on the Manufacturng Process Smplfes Y. P. Wang,*,
More informationTHE GENERATION OF 400 MW RF PULSES AT X-BAND USING RESONANT DELAY LINES *
SLAC PUB 874 3/1999 THE GENERATION OF 4 MW RF PULSES AT X-BAND USING RESONANT DELAY LINES * Sam G. Tantaw, Arnold E. Vleks, and Rod J. Loewen Stanford Lnear Accelerator Center, Stanford Unversty P.O. Box
More informationPower System State Estimation Using Phasor Measurement Units
Unversty of Kentucky UKnowledge Theses and Dssertatons--Electrcal and Computer Engneerng Electrcal and Computer Engneerng 213 Power System State Estmaton Usng Phasor Measurement Unts Jaxong Chen Unversty
More informationGeneralized Incomplete Trojan-Type Designs with Unequal Cell Sizes
Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationA High-Sensitivity Oversampling Digital Signal Detection Technique for CMOS Image Sensors Using Non-destructive Intermediate High-Speed Readout Mode
A Hgh-Senstvty Oversamplng Dgtal Sgnal Detecton Technque for CMOS Image Sensors Usng Non-destructve Intermedate Hgh-Speed Readout Mode Shoj Kawahto*, Nobuhro Kawa** and Yoshak Tadokoro** *Research Insttute
More informationDynamic Power Consumption in Virtex -II FPGA Family
Dynamc Power Consumpton n Vrtex -II FPGA Famly L Shang Prnceton Unversty EE Dept., Prnceton, NJ 08540 lshang@ee.prnceton.edu Alreza S Kavan Xlnx Inc. 2100 Logc Dr., San Jose, CA 95124 alreza.kavan@xlnx.com
More informationMultiple Error Correction Using Reduced Precision Redundancy Technique
Multple Error Correcton Usng Reduced Precson Redundancy Technque Chthra V 1, Nthka Bhas 2, Janeera D A 3 1,2,3 ECE Department, Dhanalakshm Srnvasan College of Engneerng,Combatore, Tamlnadu, Inda Abstract
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationTwo-Phase Cooperative Broadcasting Based on Batched Network Code
Two-Phase Cooperatve Broadcastng Based on Batched Network Code Xaol Xu, Praveen Kumar M. Gandh, Yong Lang Guan, and Peter Han Joo Chong 1 arxv:1504.04464v1 [cs.it] 17 Apr 2015 Abstract In ths paper, we
More informationA MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION
A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,
More informationAn Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG
An Adaptve Over-current Protecton Scheme for MV Dstrbuton Networks Includng DG S.A.M. Javadan Islamc Azad Unversty s.a.m.javadan@gmal.com M.-R. Haghfam Tarbat Modares Unversty haghfam@modares.ac.r P. Barazandeh
More information