Deterministic Access for DSRC/802.11p Vehicular Safety Communication

Size: px
Start display at page:

Download "Deterministic Access for DSRC/802.11p Vehicular Safety Communication"

Transcription

1 eterminiti Ae for SRC/802.11p Vehiular Safety Communiation Jihene Rezgui, Soumaya Cheraoui, Omar Charoun INTERLAB Reearh Laboratory Univerité de Sherbrooe, Canada {jihene.rezgui, oumaya.heraoui, omar.haroun Abtrat In thi wor, we preent the deign of an effiient eterminiti medium Ae (A for ediated Short-Range Communiation (SRC vehiular afety ommuniation over IEEE p, alled Vehiular A (VA. VA upport two type of afety ervie (emergeny and routine afety meage with different prioritie and trit requirement on delay, epeially for emergeny afety meage. VA proee both type of afety meage to maintain a balane between two onfliting requirement: reduing hane of paet olliion and lowering the tranmiion delay. To avoid long delay and high paet olliion, VA allow vehile to ae the wirele medium at eleted time with a lower ontention than would otherwie be poible within two-hop neighborhood by the laial p ECA or CF heme. Partiularly, our heme provide an effiient adaptive adjutment of the Contention Free Period (CFP duration to etablih a priority between emergeny and routine meage. Simulation how that the propoed heme learly outperform the laial CF heme ued by p in high-offered load ondition while bounding the tranmiion delay of afety meage. Inde Term Vehiular ad Ho networ, ontention-free, afety meage, determiniti ae. I. INTROUCTION Vehiular Ad ho Networ (VANET i urrently onidered an eential tehnology for future road afety and telemati appliation. The Federal Communiation Commiion (FCC of the U.S. approved the 75MHz bandwidth at GHz band for Intelligent Tranportation Sytem (ITS. Thi wirele petrum i ommonly nown a the ediated Short-Range Communiation (SRC petrum alloated by to be ued eluively for Vehile-Vehile (V2V and Vehile-Road (V2R ommuniation. evie operating in SRC petrum will be uing IEEE p by following the WAVE operation mode [2]. SRC petrum i made up of even 10 MHz wide hannel a hown in Fig.1. Channel 178 i the ontrol hannel (CCH, whih i the default hannel for ommon afety ommuniation. The two hannel at the end of the petrum band are reerved for peial ue. The ret are ervie hannel (SCH available for both afety and non-afety ue. There ha been a vat literature [2, 8-12] on the deription and evaluation of SRC and VANET tehnologie. A thorough urvey an be found in [8]. Eiting wor that ue SRC/802.11p, tre the importane of meeting the trit delay and low paet olliion requirement of afety appliation, epeially in high offered-load ondition and try to find adequate olution to thee iue. Thee wor an roughly be divided into three ategorie: broadat enhanement heme [9], MAC layer olution for baoff algorithm improvement [2] and ommuniation rate and/or power adjutment trategie [12]. Fig.1 SRC petrum and hannel in USA Wherea, a few wor ontribute on etablihing delay bound to guarantee a hort delay in IEEE p [13], our novel propoed approah for Vehiular eterminiti Ae, alled VA, omplement previou olution in term of tringent delay bound for afety meage. To reah thi goal, we propoe a determiniti ae for afety appliation and we etablih a priority between routine and emergeny meage. To the bet of our nowledge, we are the firt to onider A over IEEE p. Some of the fator that affet mot IEEE p performane and reliability, epeially at high vehiular denitie, are it hannel ae priority mehanim and it CSMA baoff proe. Emergeny afety meage requirement of low delay and low paet olliion are diffiult to guarantee in dene vehiular enario, beaue of the random ontention ued by the traditional CSMA/CA MAC in IEEE p. Some tudie tried to olve thi problem by enforing a ontention-baed MAC with omple heme or by propoing modifiation to the baoff algorithm [2]. The development of a robut and effiient MAC protool will be eential to the apability of SRC devie in enabling reliable afety appliation. To ahieve uh a protool, we propoe enhanement to the p medium ae that are inpired from the optional Meh eterminiti Ae (MA mehanim propoed for IEEE [3]. Thi mehanim /11/$ IEEE 595

2 allow determiniti ae to the medium at eleted time to redue the poibilitie of olliion. MA aim to provide tringent MAC delay guarantee for real-time ervie uh a voie over IP (VoIP, whih i a ondition that an hardly be atified in laial IEEE tandard. The MA heme [3-5] etend the IEEE medium intantaneou reervation proedure, alo nown a the virtual arrier ening (V-CS, to a more advaned reervation proedure uing heduled MA OPportunitie (MAOP within a two-hop neighborhood. MAOP are firt negotiated between neighboring node by ehanging broadat etup meage, then, MAOP reervation are performed in multiple of a time-lot unit, during the elivery Traffi Indiation Meage (TIM periodi interval. To limit the meage broadat ignaling overhead, MA-related meage are ent only within two-hop neighborhood. It i worth noting though that while the MA heme i nown to redue to a ertain etent the delay bound, it la the onept of differentiating frame with different prioritie. Baially, MA provide a hannel ae with equal probabilitie for all tation ontending for the determiniti ae in a ditributed manner. However, equal ae probabilitie are not deirable among afety meage with different priorie. Some reent tudie a in [7] how that enforing MA with an effiient adjutment of the Contention Free Period (CFP allowing differentiation between different lae of ervie outperform the Enhaned itributed Channel Ae (ECA in term of delay and paet lo probability for IEEE Our ontribution, in thi paper, an be ummarized a follow: (1 we firt introdue and jutify the adaptation of the meh determiniti medium ae named MA to redue paet olliion in IEEE p; (2 we improve and adapt MA in the ontet of vehiular afety ommuniation with two level of afety ervie overing mot of the poible afety appliation; we all the new heme VA; (3 we derive analytially the orreponding epreion of the periodiity and VA opportunity (VAOP duration in order to guarantee tringent delay bound for afety meage; (4 we tae into aount the vehile in the Carrier Sening Range (CSR to guarantee that none of thee vehile tranmit/ontend with the ender in order to enure a high paet reeption rate and a low olliion a poible; and (5 we evaluate our model ompared to tandard p/CF in term of delay, throughput and paet reeption rate for both routine and emergeny afety meage. The remainder of the paper i organized a follow. Setion II preent the motivation behind the integration of determiniti ae in IEEE p. Setion V propoe our heme named VA and preent a mathematial formulation of the ey parameter. Setion IV evaluate the propoed olution via imulation. Finally, Setion V onlude the paper. II. MOTIVATION FOR THE USE OF ETERMINISTIC ACCESSS FOR IEEE P When upporting afety appliation over SRC/802.11p we have to tae into aount trit requirement on low olliion and delay, epeially for emergeny meage uh a Forward Colliion Warning (FCW or Eletroni Emergeny Brea Light (EEBL whih require trit delay bound; otherwie many enviioned future afety ytem would be uele to help the driver deal with emergeny ituation, avoid aident and ave live. The main point that motivate u to onider/adapt a determiniti ae uh MA in IEEE p are a follow: (1 Mot of afety meage are baed on diret or ingle hop broadat ommuniation among vehile within the tranmiion range of one another. Thi i jutified by the fat that if an emergeny meage happen, the vehile potentially affeted are thoe whih are loe to the ender. Therefore, diret ommuniation i enough to reah potentially affeted vehile. MA i proven [3] to be more effiient within two hop range than laial CF/ECF, and to guarantee a hort delay. (2 In a low-load ondition, where olliion are very rare, CSMA provide lower delay than MA ine the former tranmit almot intantaneouly in a random time lot. In a low-load ondition, MA ha a lightly higher delay than CSMA primarily due to the problem of non-ontiguoune of the reerved time-lot. MA wait longer period before being able to tranmit in peifi reerved ontiguou time lot. However, in high-load ondition, the delay with MA i bounded by *TIM [6]; being the imum number of hop in a path (=1 for broadat meage. The delay provided by CSMA inreae without any bound with the inreae of the offered load. Thi i beaue many more node are ontending for the ame hannel, auing many more olliion and reulting in both longer binary eponential baoff and more frequent MAC retranmiion. Therefore, it i intereting to invetigate/adapt a determiniti ae uh a MA over IEEE p to tae advantage of the bounded delay guarantie it offer. (3 Vehile afety ommuniation networ are entirely ditributed ad ho wirele networ, and MA i a ditributed determiniti medium ae. III. PROPOSE VEHICULAR ETERMINISTIC ACCESS SCHEME: VA A. Current IEEE p Communiation Sheme IEEE p adopt IEEE a layer peifiation with minor modifiation. Thi i a random ae heme for all vehile loated in the tranmiion range of the ender baed on CSMA/CA. IEEE p ue CSMA/CA with ECA a in IEEE e or CF a in IEEE a and alo ue four prioritie queue with different Baoff and AIFS parameter. Neverthele, the Baoff proe with ECA involve high probabilitie of olliion, epeially in high offered-load ondition. There are two type of afety meage: emergeny afety meage (M e and periodi beaoning (or routine: M r afety meage. While emergeny meage happen only oaionally and require very high reliability, le olliion and hort delay, routine meage are broadated by all vehile at a frequeny of time per eond. Routine meage ontain the tate of a vehile uh a it poition and 596

3 diretion and they require low reliability and long lateny ompared to M e [2]. In fat, one of the main onern about p, i how it will perform when SRC devie will be largely adopted, maing high-offered-load ondition very liely in dene vehiular traffi ituation, while having ontinuou routine meage beaoning haring the medium with more urgent life-ritial event-driven emergeny meage. B. Introduing VA Proe in IEEE p VA heduling i baed on MA onept; therefore, we tart by introduing MA before going into detailing our propoed heme VA to how what we added and modified in bai MA. In bai MA [3], the time between oneutive TIM beaon frame i divided into time lot of length 32 µ. The periodi broadat of beaon frame to all radio in the ame tranmiion range allow the ynhronization of thee TIM interval. Initially, node reerve the wirele medium for MAOP, whih are reerved a multiple of time-lot during a given Contention Free Period (CFP of a imum ae fration (MAF= α T of the TIM interval T (ee Fig.2. The remaining part of the TIM interval, a illutrated in Fig. 3, i the ontention period (CP ued for throughput-enitive rather than delay enitive data appliation (it ould be ued in the ontet of VANET for eample for private ervie meage, M p. Note that MA doe not upport different ervie with different prioritie and ha the ame behavior for all ervie meage in the networ. The meage type illutrated in Fig 2 rather refer to VA heme. We haraterize eah MAOP (in MA /VAOP (in VA reervation requet for meage by the triplet < O, π,, δ > where O i the VAOP offet from the N TIM tart period, TIM period, and Π δ i the VAOP periodiity within the i the VAOP duration in number of time-lot. Π i the number of time the peified VAOP repeat themelve equiditantly within a TIM interval (T. In fat, all vehile in the ame tranmiion range are aware of the reervation hedule due to the broadat of VA advertiement meage by the VAOP requeter node and the granter node [3]. In VA heduling, δ i the number of time-lot reerved for afety meage of type (ee Eq. 1 in eah of the Π (ee Eq. 2 ub-interval that atifie a hard ontraint on a imal delay for a imum number of hop m in a path. We aume that M { M e, M r } where M repreent the afety meage of type ; being equal to e if it i an emergeny meage, r otherwie (i.e. routine meage. We note that thi tranmiion our after duration AIFS. To prevent eeeding the one-hop delay, the periodiity Π in the VA reervation requet ha to be uffiiently lower bounded by: Π T. For the / ae of impliity, we onider a uniform ditribution of over interfering lin even though a better repartition may tae into aount the non-uniformity of traffi load over thee lin. Thu, the VAOP duration (Eq. 1 and periodiity (Eq.2 are epreed a follow: δ AIFS = τ L + C N N and Where τ i the time-lot duration, L i the paet ize (inluding PHY and above, tranmiion rate, N (1 C i the IEEE i the number of meage of type and i a imal delay for meage omputed in Eq.3. TIM T Π M = = Fig.2 how the detail of VA funtionality in the preene of M e and M r in the CFP. VA etablihe priority between both afety meage and partiularly, VA prioritize M e over M r. VA alo erve private meage in the CP period beaue uh meage are not delay-enitive. It i worth noting that the tandard multi-hannel withing operation in WAVE allow the CCH and SCH interval to be different, a long a their total length i the TIM interval. We then define the dwell-time ratio a the time-perentage between CCH and SCH interval (e.g., we ould have 75% CCH well and 25% SCH well. Fig.2 VAOP hedule for emergeny (M e and routine (M r meage in VA C. well Time-Ratio in VA In VA, we ue CCH=CFP Interval (ICCH=ICFP and SCH=CP Interval (ISCH=ICP. A mentioned before, WAVE allow CCH and SCH to be different, jut a long a the length of the Synhronization Interval (ISynhroniation = ICCH+ISCH whih i in our ae equal to TIM interval. We aume that the TIM i a divior of 1e. The ICFP and ICP an be dynamially adaptable in VA heme.. Paet Tranmiion elay in VA We define the delay a the um of the ervie and queuing delay. The ervie delay i the um of the VA heduling delay, the AIFS and the tranmiion delay of the paet. We define VA heduling delay a the waiting time of the net (2 597

4 paet to be ent, for it reerved VAOP during whih it an tranmit without ontention. We aume that the baoff delay i negligible over a long period of time ine we aume that a ontention with other node i very rare during the reerved VAOP. And we define the queuing delay a the time a paet wait in the tranmiion queue. For emergeny meage, we are in the ontet of 1-hop broadat; eah broadat ha π1 paet to tranmit in every TIM interval. Then the ervie rate ould be epreed by π S 1 π m rate = for one-hop, otherwie for m-hop Srate =. TIM TIM M M = m The imal delay i denoted by (3, i.e., the hard ontraint on imal delay for a imum number of hop m in a path and M. i the required delay by the afety meage E. Probability of reeption rate in VA The paet reeption rate i defined a the ratio of the number of paet uefully reeived to the number of paet tranmitted. The paet reeption rate an be een a the probability that all vehile within the tranmiion range of the ender vehile reeive the broadat afety meage M uefully. We denote thi probability P. Fig.3 Senario We aume that vehile are plaed on the line (ee Fig.3 aording to Poion proe with networ denity β (vehile/m [2]. We an epre the probability to have v vehile per tranmiion range R a follow: v 2β ( R (2βR e P( v, R = v! (4 And the probability to have N vehile per tranmiion range R -R denoted by C a follow where R i the arrier ening range: N 2 ( C (2 C C β β e P( N, C = N! (5 Where N i the number of vehile that ould ontend for the ame time-lot with the ender in it range R. The Probability of Reeption Rate ( P RR in tranmiion range R an be epreed a follow: PRR = P( X, R = PRR ( S, R PX R ( δ X, OX PX R ( δx, OX Therefore, we deribe two ae: X X RR (6 Cae1: N = 0 C PRR ( S, R = P( v, R P, R ( δ, O (7 Where P ( δ, O 1 ine the ender i the only owner of, R δ and offet O in it tranmiion range R. Sine we ue a determiniti ae in VA, we epet low olliion to be happening. The average number of vehile in R i equal to 2πR while in C it i N = 2πC. Cae2: N 0 PRR ( S, R = P( v, R P, R ( δ, O C ( δ, O (8 Where P S ( δ, O i the probability that none of the C vehile S in range C tranmit in the time-lot alloated to the ender vehile S in range R during the CFP period. Let u define firt P 0 a the probability that a vehile ha an event or a routine afety meage to tranmit. In order to ahieve determiniti ae for vehile S in it range R, we ompute the probability P S ( δ, O, that none of the vehile C in C range ( S' NC tranmit with number of time-lot δ from the offet O. Proof: To formally epre P S ( δ, O, we applied a tandard C tehnique of proof by ae to define P S ( δ, O. We epre C firt the bae ae of thi probability for CFP equal to 2 lot with N 2 (ee Equation.8 and for CFP equal to 3 lot N 3 (ee Equation.9. For CFP=2 lot; N 2 2 (1 P0 C ( δ, O = A P 0 + A P0 (1 P0 + A (1 P0 N N N For CFP=3 lot; N 3 3 (1 P0 C ( δ, O = A P0 + A P0 (1 P0 + A P0 (1 P0 + A (1 P0 N N N N Then imilarly, For CFP=K lot and following equation: And for N K K (1 P C O = 0 (δ, K K A P P0 N 0 (1 = 0 N K, K (1 P C = O 0 (δ, N N K N A P P P 0 0 N 0 (1 (1 = 0 IV. SIMULATION RESULTS (9 (10 we epre the (11 (12 In thi etion, we ondut a imulation tudy uing n-2 to evaluate and ompare the performane of our propoed heme, i.e., VA, with the eiting heme baed on p CF. We evaluate everal metri: 1 the end-to-end delay; 2 the outage probability; 3 the paet reeption rate and 4 the average delay. The end-to-end delay i involved when afety 598

5 related meage need to be relayed to other vehile in a multi-hop manner (e. pot-rah meage. The outage probability i defined a the ratio of the number of vehile eperiening paet loe higher than the given threhold to the total number of vehile in the VANET. The paet reeption rate i rate of meage reeived within a one-hop range. The average delay i the average delay within a one-hop range. A. Simulation Configuration We ue a topology ompoed of 80 vehile with 10 vehile in eah lane in an 8 lane highway (4 lane/ diretion The radio tranmiion range r tae one of the following value: 150m, 200m and 250m and the tranmiion interferene R of eah vehile i 550m. Alo, we fi the paet ize to 1000Byte. The parameter are preented in Table I. Table I. Sytem Parameter PHY radio model SINR Carrier Sene Range 550m Tranmiion range 150m, 200m, 250m TIM 32m Threhold paet lo 5% α 0,68 well time-ratio 50% CCH well Time lot 20 µ MAC type (ued with SRC Channel bandwidth [Mbp] 6, 9,12,24 Traffi type CBR (UP Period of meage 100 diemination [m] Meage payload ize [byte] 1000 Number of vehile 80 Speed [m/h] 100 Traffi denity [veh/m/lane] 10 Number of lane 8 Simulation time [e] 60 The end-to-end delay with VA in imulation doe not eeed 390m; it i bounded by the TIM interval, whih i equal to 32m, multiplied by the imum number of hop in a path that i equal to 10 in our topology. Wherea the delay provided by CF inreae without any bound with the inreae of the offered load. For eample, the delay with CF reahe 725m at 8 Mbp and it reult in many more vehile ontending for the ommuniation hannel, auing many more olliion and reulting in both longer baoff and more frequent retranmiion. The delay improvement (for all load i about 40% for VA ompared to CF. Fig.4. The end-to-end delay of both VA and CF. 2 The outage Probability Study B. Reult Analyi 1 The elay Study We tudied the performane of ae method CF and VA when tranmitting data on the hared hannel. We ditinguih between low and high offered load ondition: In light offered load ondition (0.05 Mbp-0.5 Mbp, where olliion are very rare, CF ae method provide lower delay, a hown in Fig. 4, ine it tranmit almot intantaneouly in a random time lot no later than 0.68m. In low offered load ondition, VA wait longer period before tranmitting in a peifi reerved ontiguou time lot. Thi i beaue VAOP annot be heduled to tart until the end of a TIM period of 32m. Thi heduling i performed regardle of the abene of interferene and even if earlier time lot are available, ine it need ontiguou available time lot to tranmit paet. Therefore, the average ae delay i higher with VA ompared to that of CF when the offered load i low. However, one hould note that in low offered load ondition, delay are very low both in CF and VA, and the etra delay introdued by VA i very low. In high offered load ondition (0.75Mbp-12Mbp, VA outperform CF and dereae the delay by a fator of two (i.e., VA and CF-0.7 in average. Fig.5. The outage ratio of both VA and CF. Fig.5 how the outage for both VA and CF method when varying the offered load. VA outage i muh lower ine the VA heme allow vehile to ae the wirele medium at eleted time with a lower ontention than would otherwie be poible within two-hop neighborhood by the laial p CF heme. Therefore, VA outage whih i related diretly to meage loe will obviouly outperform CF method. It preent an improvement of 46% over all load a hown in Fig.5. In the following et of eperiment we fied the offered load to 2Mbp, and varied vehile denity in order to ae the paet reeption rate and the average delay in a one-hop range when many vehile are ontending for the medium in dene vehiular enario both for CF and VA method. 3 The Paet Reeption Rate Study Fig.6 learly illutrate the differene of reult between CF and VA method. CF method uffer from inevitable olliion. Therefore, it ha a ignifiant drop in reeption 599

6 probability. VA enhane heduling. The fat that VA tae into aount the vehile in the arrier ene range to guarantee that none of them ontend with the ender enure high paet reeption rate and low delay. VA outperform CF by 42% in term of reeption probability. We note that in average for all denitie, VA reeption probability equal 0.78 and for CF it equal Fig.6. The paet reeption rate of both VA and CF. 4 The elay of Emergeny and Routine Meage Study Fig.7. The delay of both emergeny and routine meage in VA heme. From vehile afety point of view, it i ruial for vehile in the highway to reeive tatu update (routine meage from eah neighboring vehile in the tranmiion range frequently enough and in an evenly timed manner. For eventdriven meage (emergeny meage, the tranmiion delay requirement are even more trit. That i why it i very ueful to have an effiient heduling heme uh a VA that provide lower tranmiion delay epeially for emergeny afety meage. Fig.7 how the delay of both emergeny and routine afety meage when varying vehile denity. From the figure, we an ee that, on the one hand, VA enure a very low delay for all denitie that i le than Thi i very deirable ine emergeny meage uually involve urgent life-ritial ituation. On the other hand, routine meage have an average delay equal to 0.33 whih i higher than the delay of emergeny meage but good enough for routine meage. Thi i the epeted behavior from VA, ine the heme prioritize emergeny meage over routine meage when heduling VAOP a hown in Fig. 2. V. CONCLUSIONS AN FUTURE WORK In thi paper, we how how we minimize ontention between high-priority afety-oriented routine or emergeny traffi and non-afety appliation traffi uing a determiniti ae method over p alled VA. VA provide bounded delay and low loe partiularly for emergeny meage. Uing imulation, we how that the propoed approah, integrating determiniti ae, outperform CF and ahieve good performane in term of delay and paet reeption rate. Currently, we plan to invetigate a mehanim that prevent interfering vehile not integrating VA with p, from aeing the heduled VA opportunitie (VAOP and ubequently the hared medium during reerved time-lot. VI. ACKNOWLEGEMENT Thi wor i part of CooPerCom, an international reearh projet (Canada-Frane. The author would lie to than the National Siene and Engineering Reearh Counil (NSERC of Canada for upporting thi wor. REFERENCES [1] H. Su and X. Zhang, "Clutering-Baed Multihannel MAC Protool for QoS Proviioning Over Vehiular Ad Ho Networ," IEEE Tranation on Vehiular Tehnology, vol. 56, pp , [2] M. iaomin, C. Xianbo, and H. Refai Hazem, "Performane and Reliability of SRC Vehiular Safety Communiation: A Formal Analyi," EURASIP Journal on Wirele Communiation and Networing, vol. 2009, Artile I , 13 page, doi: /2009/ [3] G. R. Hiertz, S. Ma, Y. Zang, T. Junge, and. enteneer, "IEEE MAC fundamental, " in Pro. IEEE MehTeh, pp. 1 8, [4] G. R. Hiertz, S. Ma, T. Junge,. enteneert, and L. Berlemann, "IEEE Meh determiniti ae, " in Pro. of 14th EW, pp. 1 8, [5] C. Cionetti, L. Lenzini, and E. Mingozzi, "Sheduling and dynami reloation for IEEE meh determiniti ae, " in Pro. of IEEE SECON, pp , [6] J. Rezgui, A. Hafid, and M. Gendreau, "itributed Admiion Control in Wirele Meh Networ: Model, Algorithm, and Evaluation," IEEE Tranation on Vehiular Tehnology, Volume: 59, Iue: 3, [7] J. Rezgui, A. Hafid, and M. Gendreau, "Admiion Control and QoS Proviioning in Multi-Servie MA in IEEE baed Wirele Meh Networ," in Pro. of ISCT Conferene on Heterogeneou Networing for Quality, Reliability, Seurity and Robutne (Qhine, [8] B. Fan, et al., "Toward haraterizing and laifying ommuniationbaed automotive appliation from a wirele networing perpetive", in Pro. of IEEE Worhop on Automotive Networing and Appliation (AutoNet, [9]. Jiang, et al., "eign of 5.9 ghz dr-baed vehiular afety ommuniation", Wirele Communiation, IEEE, 13, pp , [10] W. Zhe and H. Mahbub, "How muh of dr i available for non-afety ue?", in Pro. of the fifth ACM international worhop on VehiulAr Inter-NETworing, pp.23-29, [11] C. Qi,. Jiang, and L. elgroi, "IEEE SRC multi-hannel operation and it impliation on vehile afety ommuniation", in Pro. of IEEE Vehiular Networing Conferene (VNC, pp. 1-8, [12] H. Ching-Ling, et al., "Adaptive intervehile ommuniation ontrol for ooperative afety ytem", Networ, IEEE, Vol. 24, pp. 6-13, [13] R.Mangharam, et al., "Bounded-Lateny Alert in Vehiular Networ", in Pro. of Mobile Networing for Vehiular Environment (MOVE, pp ,

Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying

Relayer Selection Strategies in Cellular Networks with Peer-to-Peer Relaying Relayer Seletion Strategie in Cellular Network with Peer-to-Peer Relaying V. Sreng, H. Yanikomeroglu, and D. D. Faloner Broadband Communiation and Wirele Sytem (BCWS) Centre Dept. of Sytem and Computer

More information

Description of Traffic in ATM Networks by the First Erlang Formula

Description of Traffic in ATM Networks by the First Erlang Formula 5th International Conferene on Information Tehnology and Appliation (ICITA 8) Deription of Traffi in ATM Network by the Firt Erlang Formula Erik Chromý, Matej Kavaký and Ivan Baroňák Abtrat In the paper

More information

KINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS

KINEMATIC ANALYSIS OF VARIOUS ROBOT CONFIGURATIONS International Reearh Journal of Engineering and Tehnology (IRJET) e-in: 39-6 Volume: 4 Iue: May -7 www.irjet.net p-in: 39-7 KINEMATI ANALYI OF VARIOU ROBOT ONFIGURATION Game R. U., Davkhare A. A., Pakhale..

More information

Combined Radix-10 and Radix-16 Division Unit

Combined Radix-10 and Radix-16 Division Unit Combined adix- and adix-6 Diviion Unit Tomá ang and Alberto Nannarelli Dept. of Eletrial Engineering and Computer Siene, Univerity of California, Irvine, USA Dept. of Informati & Math. Modelling, Tehnial

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Incorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions

Incorporating Speculative Execution into Scheduling of Control-flow Intensive Behavioral Descriptions Inorporating Speulative Exeution into Sheduling of Control-flow Intenive Behavioral Deription Ganeh Lakhminarayana, Anand Raghunathan, and Niraj K. Jha Dept. of Eletrial Engineering C&C Reearh Laboratorie

More information

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies International Journal of Innovative Trend and Emerging Tehnologie ROBUST SCAN TECHNIQUE FOR SECURED AES AGAINST DIFFERENTIAL CRYPTANALYSIS BASED SIDE CHANNEL ATTACK A.TAMILARASAN 1, MR.A.ANBARASAN 2 1

More information

Parametric Micro-level Performance Models for Parallel Computing

Parametric Micro-level Performance Models for Parallel Computing Computer Siene Tehnial Report Computer Siene 12-5-1994 Parametri Miro-level Performane Model for Parallel Computing Youngtae Kim Iowa State Univerity Mark Fienup Iowa State Univerity Jeffrey S. Clary Iowa

More information

Visual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television

Visual Targeted Advertisement System Based on User Profiling and Content Consumption for Mobile Broadcasting Television Viual Targeted Advertiement Sytem Baed on Uer Profiling and ontent onumption for Mobile Broadating Televiion Silvia Uribe Federio Alvarez Joé Manuel Menéndez Guillermo inero Abtrat ontent peronaliation

More information

OSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1

OSI Model. SS7 Protocol Model. Application TCAP. Presentation Session Transport. ISDN-UP Null SCCP. Network. MTP Level 3 MTP Level 2 MTP Level 1 Direte Event Simulation of CCS7 DAP Benjamin, AE Krzeinki and S Staven Department of Computer Siene Univerity of Stellenboh 7600 Stellenboh, South Afria fbenj,aek,taveng@.un.a.za ABSTRACT: Complex imulation

More information

Q1:Choose the correct answer:

Q1:Choose the correct answer: Q:Chooe the orret anwer:. Purpoe of an OS i a. Create abtration b. Multiple proee ompete for ue of proeor. Coordination. Sheduler deide a. whih proee get to ue the proeor b. when proee get to ue the proeor.

More information

1. Introduction. Abstract

1. Introduction. Abstract Automati Ontology Derivation Uing Clutering for Image Claifiation 1 Latifur Khan and Lei Wang Department of Computer Siene Univerity of Texa at Dalla, TX 75083-0688 Email: [lkhan, leiwang]@utdalla.edu

More information

Automatic design of robust PID controllers based on QFT specifications

Automatic design of robust PID controllers based on QFT specifications IFAC Conferene on Advane in PID Control PID'1 Breia (Italy), Marh 8-3, 1 Automati deign of robut PID ontroller baed on QFT peifiation R. Comaòliva*, T. Eobet* J. Quevedo* * Advaned Control Sytem (SAC),

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

arxiv: v1 [physics.soc-ph] 17 Oct 2013

arxiv: v1 [physics.soc-ph] 17 Oct 2013 Emergene of Blind Area in Information Sreading arxiv:131707v1 [hyi.o-h] 17 Ot 2013 Zi-Ke Zhang 1,2,, Chu-Xu Zhang 1,3,, Xiao-Pu Han 1,2 and Chuang Liu 1,2 1 Intitute of Information Eonomy, Hangzhou Normal

More information

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

Inverse Kinematics 1 1/29/2018

Inverse Kinematics 1 1/29/2018 Invere Kinemati 1 Invere Kinemati 2 given the poe of the end effetor, find the joint variable that produe the end effetor poe for a -joint robot, given find 1 o R T 3 2 1,,,,, q q q q q q RPP + Spherial

More information

Kinematic design of a double wishbone type front suspension mechanism using multi-objective optimization

Kinematic design of a double wishbone type front suspension mechanism using multi-objective optimization 5 th utralaian Congre on pplied Mehani, CM 2007 10-12 Deember 2007, Bribane, utralia Kinemati deign of a double wihbone tpe front upenion mehanim uing multi-objetive optimiation J. S. wang 1, S. R. Kim

More information

Macrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations

Macrohomogenous Li-Ion-Battery Modeling - Strengths and Limitations Marohomogenou Li-Ion-Battery Modeling - Strength and Limitation Marku Lindner Chritian Wieer Adam Opel AG Sope Purpoe of the reearh: undertand and quantify impat of implifiation in marohomogeneou model

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

SLA Adaptation for Service Overlay Networks

SLA Adaptation for Service Overlay Networks SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada

More information

Calculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb

Calculations for multiple mixers are based on a formalism that uses sideband information and LO frequencies: ( ) sb Setting frequeny parameter in the WASP databae A. Harri 24 Aug 2003 Calulation for multiple mixer are baed on a formalim that ue ideband information and LO frequenie: b b := ign f ig f LO f IF := f ig

More information

Pruning Game Tree by Rollouts

Pruning Game Tree by Rollouts Pruning Game Tree by Rollout Bojun Huang Mirooft Reearh bojhuang@mirooft.om Abtrat In thi paper we how that the α-β algorithm and it ueor MT-SSS*, a two lai minimax earh algorithm, an be implemented a

More information

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

Datum Transformations of NAV420 Reference Frames

Datum Transformations of NAV420 Reference Frames NA4CA Appliation Note Datum ranformation of NA4 Referene Frame Giri Baleri, Sr. Appliation Engineer Crobow ehnology, In. http://www.xbow.om hi appliation note explain how to onvert variou referene frame

More information

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov

More information

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks

A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering

More information

New Channel Allocation Techniques for Power Efficient WiFi Networks

New Channel Allocation Techniques for Power Efficient WiFi Networks ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre

More information

Network Coding in Duty-Cycled Sensor Networks

Network Coding in Duty-Cycled Sensor Networks 1 Network Coding in Duty-Cycled Senor Network Roja Chandanala, Radu Stoleru, Member, IEEE Abtract Network coding and duty-cycling are two popular technique for aving energy in wirele adhoc and enor network.

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

Shortest Paths in Directed Graphs

Shortest Paths in Directed Graphs Shortet Path in Direted Graph Jonathan Turner January, 0 Thi note i adapted from Data Struture and Network Algorithm y Tarjan. Let G = (V, E) e a direted graph and let length e a real-valued funtion on

More information

A Local Mobility Agent Selection Algorithm for Mobile Networks

A Local Mobility Agent Selection Algorithm for Mobile Networks A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g

More information

COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017

COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 COURSEWORK 1 FOR INF2B: FINDING THE DISTANCE OF CLOSEST PAIRS OF POINTS ISSUED: 9FEBRUARY 2017 Submiion Deadline: The ourework onit of two part (of a different nature) relating to one problem. A hown below

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,

More information

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP

An Evolutionary Multiple Heuristic with Genetic Local Search for Solving TSP An Evolutionary Multiple Heuriti with Geneti Loal Searh for Solving TSP Peng Gang Ihiro Iimura 2 and Shigeru Nakayama 3 Department of Information and Computer Siene Faulty of Engineering Kagohima Univerity

More information

Diverse: Application-Layer Service Differentiation in Peer-to-Peer Communications

Diverse: Application-Layer Service Differentiation in Peer-to-Peer Communications Divere: Application-Layer Service Differentiation in Peer-to-Peer Communication Chuan Wu, Student Member, IEEE, Baochun Li, Senior Member, IEEE Department of Electrical and Computer Engineering Univerity

More information

1 The secretary problem

1 The secretary problem Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.

More information

Factor Graphs and Inference

Factor Graphs and Inference Factor Graph and Inerence Sargur Srihari rihari@cedar.bualo.edu 1 Topic 1. Factor Graph 1. Factor in probability ditribution. Deriving them rom graphical model. Eact Inerence Algorithm or Tree graph 1.

More information

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.

More information

Keywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.

Keywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing. Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La

More information

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

Modeling Throughput and Delay in Infrastructure Mode Networks with QoS Support from the Point Coordination Function

Modeling Throughput and Delay in Infrastructure Mode Networks with QoS Support from the Point Coordination Function Proceeding of the World Congre on Engineering and Computer Science 2012 Vol II, October 24-26, 2012, San Francico, USA Modeling Throughput and Delay in 802.11 Infratructure Mode Network with QoS Support

More information

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing. Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in

More information

Modeling the Effect of Mobile Handoffs on TCP and TFRC Throughput

Modeling the Effect of Mobile Handoffs on TCP and TFRC Throughput Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,

More information

About this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder

About this Topic. Topic 4. Arithmetic Circuits. Different adder architectures. Basic Ripple Carry Adder About thi Topi Topi 4 Arithmeti Ciruit Peter Cheung Department of Eletrial & Eletroni Engineering Imperial College London URL: www.ee.imperial.a.uk/pheung/ E-mail: p.heung@imperial.a.uk Comparion of adder

More information

/06/$ IEEE 364

/06/$ IEEE 364 006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;

More information

Towards Mobility-Aware Proactive Caching for Vehicular Ad hoc Networks

Towards Mobility-Aware Proactive Caching for Vehicular Ad hoc Networks Toward Mobility-Aware Proactive aching for Vehicular Ad hoc Network Youef AlNagar, Sameh Hony, Amr A. El-Sherif Wirele Intelligent Network enter (WIN), Nile Univerity, Giza, Egypt. Department of Electrical

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of

More information

Advanced Encryption Standard and Modes of Operation

Advanced Encryption Standard and Modes of Operation Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES

More information

Using Bayesian Networks for Cleansing Trauma Data

Using Bayesian Networks for Cleansing Trauma Data Uing Bayeian Network for Cleaning Trauma Data Prahant J. Dohi pdohi@.ui.edu Dept. of Computer Siene Univ of Illinoi, Chiago, IL 60607 Lloyd G. Greenwald lgreenwa@.drexel.edu Dept. of Computer Siene Drexel

More information

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors We are IntehOpen, the worl leaing publiher of Open Ae book Built by ientit, for ientit 4, 116, 12M Open ae book available International author an eitor Downloa Our author are among the 154 Countrie elivere

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

A Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong

A Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong 4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information

Modeling of underwater vehicle s dynamics

Modeling of underwater vehicle s dynamics Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

Separation of Routing and Scheduling in Backpressure- Based Wireless Networks

Separation of Routing and Scheduling in Backpressure- Based Wireless Networks Separation of Routing and Scheduling in - Baed Wirele Network The MIT Faculty ha made thi article openly available. Pleae hare how thi acce benefit you. Your tory matter. Citation A Publihed Publiher Seferoglu,

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Modeling and Analysis of Slow CW Decrease for IEEE WLAN

Modeling and Analysis of Slow CW Decrease for IEEE WLAN Modeling and Analyi of Slow CW Decreae for IEEE 82. WLAN Qiang Ni, Imad Aad 2, Chadi Barakat, and Thierry Turletti Planete Group 2 Planete Group INRIA Sophia Antipoli INRIA Rhône-Alpe Sophia Antipoli,

More information

Problem Set 2 (Due: Friday, October 19, 2018)

Problem Set 2 (Due: Friday, October 19, 2018) Electrical and Computer Engineering Memorial Univerity of Newfoundland ENGI 9876 - Advanced Data Network Fall 2018 Problem Set 2 (Due: Friday, October 19, 2018) Quetion 1 Conider an M/M/1 model of a queue

More information

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at

More information

A Handover Scheme for Mobile WiMAX Using Signal Strength and Distance

A Handover Scheme for Mobile WiMAX Using Signal Strength and Distance A Handover Scheme for Mobile WiMAX Uing Signal Strength and Ditance Mary Alatie, Mjumo Mzyece and Anih Kurien Department of Electrical Engineering/French South African Intitute of Technology (F SATI) Thwane

More information

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

Lecture 14: Minimum Spanning Tree I

Lecture 14: Minimum Spanning Tree I COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce

More information

Embedding Service Function Tree with Minimum Cost for NFV Enabled Multicast

Embedding Service Function Tree with Minimum Cost for NFV Enabled Multicast 1 Embedding Service Function Tree with Minimum ot for NFV Enabled Multicat angbang Ren, Student Member, IEEE, eke Guo, Senior Member, IEEE, Yulong Shen, Member, IEEE, Guoming Tang, Member, IEEE, Xu Lin,

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

Kinematics Programming for Cooperating Robotic Systems

Kinematics Programming for Cooperating Robotic Systems Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,

More information

UC Berkeley International Conference on GIScience Short Paper Proceedings

UC Berkeley International Conference on GIScience Short Paper Proceedings UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment

More information

PERFORMANCE EVALUATION OF TRANSMISSION DISTANCE AND BIT RATES IN INTER-SATELLITE OPTICAL WIRELESS COMMUNICATION SYSTEM

PERFORMANCE EVALUATION OF TRANSMISSION DISTANCE AND BIT RATES IN INTER-SATELLITE OPTICAL WIRELESS COMMUNICATION SYSTEM PERFORMANCE EVALUATION OF TRANSMISSION DISTANCE AND BIT RATES IN INTER-SATELLITE OPTICAL WIRELESS COMMUNICATION SYSTEM Rohni Joy 1, Ami Lavingia 2, Prof. Kruti Lavingia 3 1 Electronic and Communication

More information

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online

More information

Service and Network Management Interworking in Future Wireless Systems

Service and Network Management Interworking in Future Wireless Systems Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering

More information

Research Article Real-Time Communications in Large-Scale Wireless Networks

Research Article Real-Time Communications in Large-Scale Wireless Networks Hindawi Publihing Corporation International Journal of Digital Multimedia Broadcating Volume 2008, Article ID 586067, 16 page doi:10.1155/2008/586067 eearch Article eal-time Communication in Large-Scale

More information

An efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed

An efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed Univerity of Wollongong Reearch Online Faculty of Informatic - Paper (Archive) Faculty of Engineering and Information Science 200 An efficient reource allocation algorithm for OFDMA cooperative relay network

More information

Software Agent (SA) to guarantee QoS for multi constrain applications in all-ip networks

Software Agent (SA) to guarantee QoS for multi constrain applications in all-ip networks Software Agent (SA) to guarantee QoS for multi contrain application in all-ip network Kazi Khaled Al-Zahid and Mituji Matumoto GITS, Waeda Univerity 94 Waeda Univ. Bldg. A-308, 1011Okuboyama Nihitomida

More information

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb

More information

SIMIT 7. Profinet IO Gateway. User Manual

SIMIT 7. Profinet IO Gateway. User Manual SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion

More information

The Association of System Performance Professionals

The Association of System Performance Professionals The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and

More information

Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II

Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II IEEE INFOCO 2002 1 Ditributed Partial Information anagement (DPI) Scheme for Survivable Network - Part II Dahai Xu Chunming Qiao Department of Computer Science and Engineering State Univerity of New York

More information

mapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee

mapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,

More information

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de

More information

In-Plane Shear Behavior of SC Composite Walls: Theory vs. Experiment

In-Plane Shear Behavior of SC Composite Walls: Theory vs. Experiment Tranation, MiRT, 6- November,, New Delhi, India Div-VI: Paper ID# 764 In-Plane hear Behavior of C Compoite Wall: Theory v. Experiment Amit H. Varma, ai Zhang, Hoeok Chi 3, Peter Booth 4, Tod Baker 5 Aoiate

More information

Diff-Max: Separation of Routing and Scheduling in Backpressure-Based Wireless Networks

Diff-Max: Separation of Routing and Scheduling in Backpressure-Based Wireless Networks Diff-Max: Separation of Routing and Scheduling in -Baed Wirele Network Hulya Seferoglu and Eytan Modiano Laboratory For Information and Deciion Sytem Maachuett Intitute of Technology {heferog, modiano}@mit.edu

More information

The Implementation of an Adaptive Mechanism in the RTP Packet in Mobile Video Transmission

The Implementation of an Adaptive Mechanism in the RTP Packet in Mobile Video Transmission 2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Pre, Singapore DOI: 10.7763/IPCSIT.2012.V52.91 The Implementation of an Adaptive

More information

TFRC-CR: An Equation-based Transport Protocol for Cognitive Radio Networks

TFRC-CR: An Equation-based Transport Protocol for Cognitive Radio Networks 213 International onference on omputing, Networking and ommunication (IN) Workhop on omputing, Networking and ommunication -R: An Equation-baed Tranport Protocol for ognitive Radio Network Abdulla K. Al-Ali

More information

else end while End References

else end while End References 621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized

More information

Distributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters

Distributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters Proeedings of the 45th IEEE Conferene on Deision & Control Manhester Grand Hyatt Hotel an Diego, CA, UA, Deember 13-15, 2006 Distributed Resoure Alloation trategies for Ahieving Quality of ervie in erver

More information

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC Priya N. Werahera and Anura P. Jayasumana Department of Eletrial Engineering Colorado State University

More information

Design of a Stewart Platform for General Machining Using Magnetic Bearings

Design of a Stewart Platform for General Machining Using Magnetic Bearings eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented

More information