Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set

Size: px
Start display at page:

Download "Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set"

Transcription

1 Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR; visiting eseache, VRC, Univesity of Bighton, UK Vetonics Reseach Cente (VRC), Univesity of Bighton, UK Abstact. The inceasing amount of electonic contol units (ECUs) and message taffic in in-vehicle and industial communication netwoks cause a ising demand fo highe bandwidth and low message esponse times. As a pominent eal-time distibuted contol netwok, CAN esponds to this demand with the CAN FD potocol which povides impoved bandwidth and payload capacities. CAN FD povides pefomance impovements mainly in two ways: fistly, by inceasing the bit-ate in the data-phase of the fame, which esults in faste message tansmission; secondly, by inceasing the payload size, which povides bette payload to ovehead atio. In a contol netwok, it is cucial to meet the citical timing equiements of had eal-time tasks. Simulating a eal-time system is an impotant pocess to investigate the timing behaviou and analyse the pefomance of system. This study povides the pefomance analysis of a CAN FD system with SAE Benchmak based message set, compised of both timetiggeed and event-tiggeed messages. In ode to investigate the pefomance impovements, the models fo both CAN and CAN-FD systems have been developed in Matlab Simulink envionment. The message delay and bus utilisation esults obtained with the simulation models show that the CAN-FD potocol povides high pefomance impovements to meet the equiements of eal-time contol systems. Intoduction Contolle Aea Netwok (CAN) is an asynchonous seial communication bus initially intoduced fo in-vehicle communication applications. Due to its low cost and obust potocol stuctue it has also become a widespead fieldbus in industial applications. CAN applies a pioity based medium access method which guaanties immediate bus access to the bus fo the highest pioity messages. Howeve, the lowe pioity messages may expeience extensive bus access delays especially unde heavy bus load and low tansmission bit-ate conditions. Inceasing amount of Electonic Contol Units (ECUs) and message taffic equie highe tansmission speeds in the netwok. Howeve, the CAN potocol limits the message tansmission speed to 1 Mbps at maximum 40 m bus length due to its pioity based abitation mechanism and acknowledgement method [1]. The potocols like Time Tiggeed Potocol (TTP) [2] and Flexay [3] use highe tansmission speeds in ode to meet the eal-time communication equiements. In ode to meet the demand fo highe tansmission speed in CAN, the CAN FD potocol has been developed [4][5]. CAN FD impoves the potocol capabilities by using highe bit-ates to tansmit the payload and, by inceasing the payload size. In this way, CAN FD povides inceased bandwidth capacity and bette data to ovehead atio. CAN FD uses the existing CAN envionment without equiing significant changes in hadwae and softwae stuctue in ode to povide a smooth tansition fom CAN to CAN FD. It is an impotant subject to model and simulate a system in ode to evaluate its behaviou and pefomance. In this study, a CAN FD system with the SAE benchmak based message set is modelled and simulated. In ode to compae the pefomance impovements, a CAN model with the same message set has also been developed. The simulation esults ae investigated to evaluate the pefomance impovements achieved by CAN FD. The esults show that CAN FD povides consideably impoved pefomance esults 07-12

2 fo the system in ode to meet eal-time equiements. CAN and CAN FD oveview CAN basics CAN is a pominent eal-time netwok technology in automotive and industial applications. The potocol has standad CAN and extended CAN fame fomats, which have 11 bit and 29 bit identifies espectively. In this study, the standad CAN potocol is used in simulation models. Figue 1 shows the standad CAN message fame. The CAN potocol applies a medium access method known as CSMA/CA with non-destuctive bit-wise abitation. In this mechanism, evey message has an identifie which also indicates the pioity of the message. In case of two o moe messages stating tansmission at the same time, the abitation mechanism ensues that the highest pioity message has the immediate access, and the lowe pioity messages ae tansmitted late accoding to thei pioities. This method povides immediate access fo the highest pioity messages, howeve the lowe pioity messages may expeience long delays. The esponse time fo message m m is whee Jm is the queuing jitte, the latest queuing time of message mm on the host CPU. Wm includes the queuing delay due to the highe pioity messages and the blocking time due to a lowe pioity message that has aleady taken the bus since the potocol is non-peemptive. Cm is the time taken to tansmit message mm on the bus [6][7][8]. The CAN potocol is subject to bit stuffing in ode to keep synchonisation duing message tansmission. Accoding to bitstuffing ule, afte the tansmission of evey five bits with the same polaity, a bit with the opposite polaity is inseted. Theefoe, the message tansmission time (Cm) with wostcase bit stuffing fo a standad CAN fame is 47 is the fixed fom size of a CAN fame excluding the payload. (34 +8s m )/4 is the floo opeato giving the stuff bit numbe fo the payload and the 34-bit pat of fixed fom field of the fame that is subject to bit stuffing, and τα is the bus bit-time [6]. The inceasing amount of ECUs and message taffic make it necessay fo the CAN potocol to use highe tansmission bit-ates in ode to meet the eal-time application equiements. Howeve, the tansmission speed is limited to 1 Mbps fo the CAN potocol. CAN FD basics In ode to povide highe tansmission speeds to solve the bandwidth poblem in CAN, the CAN FD potocol has been intoduced [4][5]. The CAN FD potocol impoves the system pefomance in two ways: fistly, by using highe bit-ates to tansmit the payload, and secondly, by inceasing the payload size up to 64 bytes. The bus speed is limited fo the CAN potocol since the bit-wise abitation mechanism and acknowledgement method do not allow highe tansmission bit-ates on the bus. Howeve, the payload can be tansmitted with highe bit-ates in ode to achieve highe tansmission speeds. Theefoe, the CAN FD potocol divides the message fame into two phases as the Abitationphase and the Data-phase. Figue 2 shows the stuctue of a message fame with 11-bit identifie. The abitation phase of the message is tansmitted with standad CAN bit-ate fom the Stat Of Fame (SOF) bit to the Bit-Rate Switch bit (BRS). The tansmission speed is switched to the highe data-phase bit-ate at the sample point of BRS bit on sampling a ecessive level. At the sample point of CRC delimite, the bus speed is switched back to the abitation-phase bit-ate. The Extended Data Length (EDL) bit indicates that the fame is in the CAN FD fomat. whee sm is the payload size in bytes

3 S O F Abitation Field 11-bit Identifie R T R I D E Contol Field 6-bit 0 Data Field CRC Field DLC 0-8 Bytes 15-bit ACK Field EOF IFS 1b 1b 1b 7-bit 3-bit Figue 1: Standad CAN message fame. S O F Abitation Field 11-bit Identifie 1 I ACK Contol Field Data Field CRC Field Field EOF IFS 9-bit E D L B R S E SI D E 0 DLC 0-64 Bytes bits 1b 1b 1b 7-bit 3-bit Abitation Phase Data Phase Abitation Phase S O F 11-bit Identifie 1 I E D D E L 0 B RS 1b 1b 7-bit 3-bit Abitation Phase Data Phase Figue 2: CAN FD message fame. Abitation Phase The bit stuffing pocess is also applied in CAN FD potocol with mino changes. In the CRC field, fixed stuff bits ae used in ode to impove the eo detection capability of the potocol [4][9]. In CAN FD, CRC field is 17 bits plus 4 fixed stuff bits fo payload sizes up to 16 bytes, and 21 bits plus 5 fixed stuff bits fo payload sizes lage than 16 bytes. Theefoe, the message tansmission time with wost-case bit-stuffing [10] can be witten as whee s ab is the numbe of bits subject to bit-stuffing in the fist abitation-phase, whee the second abitation phase is not subject to bit stuffing. The total numbe of bits in the abitation-phase is 29, including the BRS bit and excluding the CRC delimite bit. τ α is the abitation-phase bit-time. The data-phase, excluding the payload, is 28 bits in length, which compises 27 bits of a CAN FD fame plus 1 stuff bit that may be inseted due to the BRS, ESI, and DLC bits. sm is the payload size in bytes. τ α is the data-phase bit-time. The EDL, 0, and BRS bits contain 1, 0, and 1, espectively, emaining 13 bits fo bit stuffing in the field befoe the fist bit-ate switch [10]. In the wost-case bit stuffing, the s ab /4 opeato can poduce 3 stuff bits, esulting in 32 bits. Theefoe, the equation can be simplified as Although the bit stuffing pocess inceases message size and consequently message tansmission time, it is necessay in ode to keep synchonisation duing tansmission. Thee ae some studies suggesting solutions to decease the effect of bit stuffing such us in [11]. Modelling and Simulation In ode to investigate the system pefomance impovements with the CAN FD potocol, the CAN and CAN FD models with the SAE benchmak based message set have been developed. The SAE benchmak message set oiginally includes 53 signals. In [6], the signals have been piggybacked and the set includes 17 messages. Table 1 shows the SAE benchmak based message set. The set includes piggybacked messages of the SAE benchmak, compised of both peiodic and spoadic messages [6]. Message M1 and M11 ae event-tiggeed, and messages fom M7 to M10 includes event-tiggeed signals piggybacked and tansmitted peiodically

4 CAN / CAN FD Bus Figue 3: Simplified epesentation of the simulation model. Messages fom M2 to M6, and fom M12 to M17 ae time-tiggeed messages. In the table, the messages ae placed in pioity ode fom the highest (M1) to the lowest (M17). T indicates the message peiod, while D indicates the deadline in milliseconds [6]. Table 1: SAE benchmak based message set. Message Size (bytes) T (ms) D (ms) M M M M M M M M M M M M M M M M M In the model development pocess, the SimEvents toolbox of Matlab Simulink softwae package has been used. Fist, a CAN model has been developed in ode to investigate the pefomance of the standad CAN potocol with the SAE based benchmak messages. Then, a CAN FD model has been developed in ode to compae the esults and evaluate the pefomance impovements achieved with the CAN FD potocol. In the modelling pocess, 11 bit identifie size of standad CAN potocol has been used. Figue 3 shows the simplified epesentation of the simulation model developed fo CAN and CAN FD systems. In the simulation model, one node is assigned fo each message. In ode to investigate the system pefomances, the models have been simulated at 1 Mbps, 500 kbps, 250 kbps, and 125 kbps tansmission bit-ates. In CAN FD, 5 Mbps is used as the data-phase tansmission bit-ate. Pefomance analysis In ode to evaluate the pefomance esults and compae the pefomance impovements achieved with the CAN FD potocol, both CAN and CAN FD models have been simulated at fou diffeent tansmission speeds. The esults fo wostcase and aveage message delays have been analysed and visualised in gaphs. As an impotant pefomance paamete, the bus utilisation esults have also been analysed. Wost-case message delay analysis The wost-case message delay o esponse time analysis is impotant in eal-time systems since it indicates the pefomance of the system to meet the deadline citeia. Figues fom 4 to 7 show the wost-case message delay gaphs fo 1 Mbps, 500 kbps, 250 kbps, and 125 kbps bus tansmission bit-ates. The gaph CAN max efeence epesents the message delay values given in [6]. These values ae used as a efeence to evaluate the esults obtained in simulations. The gaph CAN max epesents the wost-case delay values fo the CAN model

5 The gaph CAN FD max epesents the wost-case delay values fo the CAN FD model. The delays ae shown in the gaphs in message pioity ode fom the highest (M1) to the lowest (M17). As can be seen fom the figues, CAN wostcase delay values obtained with simulation show discepancies fom the CAN efeence delay values. This is because the wost-case delay is vey ae in simulations, wheeas the efeence values ae obtained by analysis. The study in [12] pesents the evaluation and compaison of esults obtained by simulation and analysis. Howeve, at lowe tansmission bit-ates, the simulation and efeence esults pesent close delay values since at lowe tansmission speeds it is moe likely that the messages expeience the wost-case delays. Fom the gaphs, it can be seen that the CAN FD model povides consideable wost-case message delay pefomance impovement fo the system. This impovement is achieved due to the highe tansmission speed used in dataphase of the message fame. In ode to investigate the pefomance impovement in moe detail, the wostcase delay atio of each message in CAN to CAN FD is computed, and the message delay atios ae pesented in Table 2 as aveage, minimum, and maximum. The delay atios ae investigated at fou diffeent tansmission bit-ates. At 1 Mbps bit-ate, the aveage atio is 1.78, that is, the wost-case message delay with CAN FD is 1.78 times smalle on aveage than it is with CAN. The aveage atio at 500 kbps is 2, which means CAN FD has half wost-case message delay of CAN on aveage. The atio is 2.16 and 3.28 at 250 kbps and 125 kbps bit ates, espectively. These atios show the aveage wost-case message delay impovement achieved with the CAN FD potocol. The table also gives the minimum and maximum wost-case message delay atios. The minimum atio anges fom 1.66 to 2.5, while the maximum atio anges fom 1.98 to 6.00, which means CAN FD tansmits messages up to 6 times smalle wost-case message delays with the SAE benchmak based message set. Figue 4: Wost-case delays at 1 Mbps Figue 5: Wost-case delays at 500 kbps Figue 6: Wost-case delays at 250 kbps Figue 7: Wost-case delays at 125 kbps 07-16

6 Table 2: Wost-case message delay atios CAN /CAN FD Mbps Mbps Mbps Mbps Aveage Minimum Maximum Aveage message delay analysis Figues fom 8 to 11 show the aveage message delay values fo CAN and CAN FD models at fou diffeent bus bit-ates. As can be seen fom the figues, the dominant facto affecting the CAN aveage delay is the message tansmission time at 1 Mbps ant 500 kbps bus bit-ates. At 250 kbps bus bit-ate, the effect of abitation delay becomes noticeable in CAN as the lowe pioity messages expeience ising delays due to the inceased bus utilisation. At 125 kbps bus bit-ate, the effect of the abitation delay becomes vey obvious in CAN as the lowe pioity messages expeience vey high message delays. Howeve, the aveage message delays in CAN FD ae mostly affected by the tansmission time and only little effect of the abitation delay can be obseved at almost all bus bit-ates. The highest message tansmission time in CAN is obseved with message 7 as it has the lagest payload size in the message set, and the effect of payload diffeence is noticeable. Howeve, the payload size diffeence is not vey noticeable in CAN FD. This shows the pefomance impovement achieved with CAN FD due to the application of highe tansmission bit-ate in the data-phase of the message fame. This application povides enough bandwidth fo message tansmissions with lowe delays even at low abitation-phase bit ates. As can be seen fom the figues, even at 125 kbps, CAN FD aveage message delays ae compaatively much smalle than CAN delays, which become extensively high especially with lowe pioity messages. In ode to analyse pefomance impovements in moe detail, the atios also fo the aveage message delays have been computed and listed in Table 3 as aveage, minimum and maximum. Figue 8: Aveage delays at 1Mbps Figue 9: Aveage delays at 500 kbps Figue 10: Aveage delays at 250 kbps Figue 11: Aveage delays at 125 kbps 07-17

7 Table 3: Aveage message delay atios CAN /CAN FD Mbps Mbps Mbps Mbps Aveage Minimum Maximum At 1 Mbps tansmission bit-ate, mean message delay is 1.67 times smalle on aveage in CAN FD than it is in CAN. The aveage atio fo bit-ates fom 1 Mbps to 125 kbps anges fom 1.67 to 4.16, which means up to 4.16 times smalle aveage message delays ae achieved on aveage with CAN FD. The minimum atio anges fom 1.53 to 2.16, and the maximum atio anges fom 2.17 to 6.00, which means, as in wost-case delay atios, up to 6 times smalle aveage message delays ae achieved with CAN FD. Bus utilisation analysis Figue 12: Bus utilisation. Figue 12 shows the bus utilisation values fo CAN efeence, CAN, and CAN FD. Fom the figue, it can be seen that the CAN efeence and CAN gaphs show almost the same chaacteistics. The CAN FD gaph shows that the same message set is tansmitted with less bus utilisation with CAN FD. Bus utilisation affects the system pefomance. As the utilisation becomes highe, the delay caused by the abitation mechanism also gets highe. At high bus utilisation values, especially lowe pioity messages expeience extensive bus access delays as they have to wait fo the highe pioity messages to be tansmitted fist. This effect can be seen clealy at 125 kbps bus bit-ate, whee the bus utilisation is ove 80%. Howeve, the bus utilisation with CAN FD at the same bit-ate is just ove 40%, which is almost half that of CAN. The simulated bus utilisation values at bus bitates fom 1 Mbps to 125 kbps anges fom 10.3 to 82.5 fo CAN, and fom 6.7 to 43.8 fo CAN FD, espectively. The esults show that compaed to CAN, CAN FD povides faste message tansmission with less bus utilisation. Conclusion As the amount of ECUs and message taffic in automotive and industial applications incease, the moe need aises fo highe bandwidth and faste message tansmission. The CAN FD potocol povides a solution fo bit-ate limitation in CAN using highe tansmission bit-ates in data-phase of the message fame. In this study, modelling and simulation of the CAN and CAN FD systems with the SAE benchmak based message set have been ealised in ode to investigate the pefomance impovements achieved by the CAN FD potocol. The pefomance analysis have been ealised fo wostcase message delays, aveage message delays, and bus utilisations. The wost-case message delay analysis has shown that with the CAN FD model based on the SAE benchmak message set, fom 1.78 to 3.28 times smalle wost-case message delays on aveage can be achieved compaed to the CAN model. Similaly, fom 1.67 to 4.16 times smalle mean message delays on aveage has been obseved with CAN FD. In bus utilisation esults, almost half the bus utilisation values have been obseved with CAN FD. The simulation esults have evealed that the CAN FD potocol povides consideable pefomance impovements in message tansmission speed and bus utilisation compaed to CAN

8 Acknowledgement: This wok was suppoted by The Scientific and Technological Reseach Council of Tukey (TUBITAK). Mahmut Tenuh Mugla S. K. Univesity Depatment of Electical & Electonics Engineeing TR Mugla Panagiotis Oikonomidis Univesity of Bighton Vetonics Reseach Cente (VRC) Lewes Road GB-BN2 4GJ Bighton Peiklis Chachalakis Univesity of Bighton Vetonics Reseach Cente (VRC) Lewes Road GB-BN2 4GJ Bighton Elias Stipidis Univesity of Bighton Vetonics Reseach Cente (VRC) Lewes Road GB-BN2 4GJ Bighton Refeences [1] CAN Specification, Vesion 2.0, Robet Bosch GmbH, [2] H. Baue and G. Kopetz, The timetiggeed achitectue, Poc. IEEE, vol. 91, no. 1, pp , [3] FlexRay Communications System Potocol Specification, Vesion 3.0.1, the FlexRay Consotium, [4] F. Hatwich, CAN with flexible data-ate, in 13th Int. CAN Conf., 2012, pp [5] CAN with Flexible Data-Rate, specification vesion 1.0, Robet Bosch GmbH, [6] K. Tindell and A. Buns, Guaanteeing Message Latencies on Contol Aea Netwok (CAN), in 1st Int. CAN Conf., 1994, pp [7] K. W. Tindell, A. Buns, and A. J. Wellings, Calculating Contolle Aea Netwok (CAN) message esponse times, Contol Eng. Pact., vol. 3, no. 8, pp , [8] R. I. Davis, A. Buns, R. J. Bil, and J. J. Lukkien, Contolle aea netwok (CAN) schedulability analysis: Refuted, evisited and evised, Real-Time Syst., vol. 35, no. 3, pp , [9] A. Mutte, CAN FD and the CRC issue, CAN Newslette, no. 1, pp. 4 10, [10] U. D. Bodoloi and S. Samii, The Fame Packing Poblem fo CAN-FD, in 2014 IEEE Real-Time Systems Symposium, 2014, pp [11] G. Cena, I. C. Betolotti, T. Hu, and A. Valenzano, Fixed-length payload encoding fo low-jitte contolle aea netwok communication, IEEE Tans. Ind. Inf., vol. 9, no. 4, pp , [12] N. Navet, CAN in Automotive Applications: a Look Fowad, in 13 th Int. CAN Conf.,

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

An Improved Resource Reservation Protocol

An Improved Resource Reservation Protocol Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver 1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent

More information

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

More information

WIRELESS sensor networks (WSNs), which are capable

WIRELESS sensor networks (WSNs), which are capable IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. XX, NO. XX, XXX 214 1 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang, Kuan

More information

Adaptation of TDMA Parameters Based on Network Conditions

Adaptation of TDMA Parameters Based on Network Conditions Adaptation of TDMA Paametes Based on Netwok Conditions Boa Kaaoglu Dept. of Elect. and Compute Eng. Univesity of Rocheste Rocheste, NY 14627 Email: kaaoglu@ece.ocheste.edu Tolga Numanoglu Dept. of Elect.

More information

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks 788 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 12, NO. 2, APRIL 2016 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang,

More information

XFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers

XFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile

More information

EE 6900: Interconnection Networks for HPC Systems Fall 2016

EE 6900: Interconnection Networks for HPC Systems Fall 2016 EE 6900: Inteconnection Netwoks fo HPC Systems Fall 2016 Avinash Kaanth Kodi School of Electical Engineeing and Compute Science Ohio Univesity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement: Inteconnection

More information

Dynamic Topology Control to Reduce Interference in MANETs

Dynamic Topology Control to Reduce Interference in MANETs Dynamic Topology Contol to Reduce Intefeence in MANETs Hwee Xian TAN 1,2 and Winston K. G. SEAH 2,1 {stuhxt, winston}@i2.a-sta.edu.sg 1 Depatment of Compute Science, School of Computing, National Univesity

More information

APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE

APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE 1 YAROSLAVTSEV A.F., 2 Al-THUNEIBAT S.A., 3 AL TAWALBEH N.A 1 Depatment of Netwoking, SSUTI, Novosibisk, Russia

More information

Color Correction Using 3D Multiview Geometry

Color Correction Using 3D Multiview Geometry Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,

More information

arxiv: v2 [physics.soc-ph] 30 Nov 2016

arxiv: v2 [physics.soc-ph] 30 Nov 2016 Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

Cardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions

Cardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions Cadiac C-Am CT SNR Enhancement by Combining Multiple Retospectively Motion Coected FDK-Like Reconstuctions M. Pümme 1, L. Wigstöm 2,3, R. Fahig 2, G. Lauitsch 4, J. Honegge 1 1 Institute of Patten Recognition,

More information

Image Enhancement in the Spatial Domain. Spatial Domain

Image Enhancement in the Spatial Domain. Spatial Domain 8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

The Dual Round Robin Matching Switch with Exhaustive Service

The Dual Round Robin Matching Switch with Exhaustive Service The Dual Round Robin Matching Switch with Exhaustive Sevice Yihan Li, Shivenda S. Panwa, H. Jonathan Chao Abstact Vitual Output Queuing is widely used by fixed-length highspeed switches to ovecome head-of-line

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Topological Characteristic of Wireless Network

Topological Characteristic of Wireless Network Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

An Efficient Handover Mechanism Using the General Switch Management Protocol on a Multi-Protocol Label Switching Network

An Efficient Handover Mechanism Using the General Switch Management Protocol on a Multi-Protocol Label Switching Network An Efficient andove Mechanism Using the Geneal Switch Management Potocol on a Multi-Potocol abel Switching Netwok Seong Gon hoi, yun Joo Kang, and Jun Kyun hoi Using the geneal switch management potocol

More information

Performance Optimization in Structured Wireless Sensor Networks

Performance Optimization in Structured Wireless Sensor Networks 5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame

More information

Fifth Wheel Modelling and Testing

Fifth Wheel Modelling and Testing Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les

More information

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS SCALABL NRGY FFICINT AD-HOC ON DMAND DISTANC VCTOR (S-AODV) ROUTING PROTOCOL IN WIRLSS MSH NTWORKS Sikande Singh Reseach Schola, Depatment of Compute Science & ngineeing, Punjab ngineeing College (PC),

More information

Minimizing spatial and time reservation with Collision-Aware DCF in mobile ad hoc networks

Minimizing spatial and time reservation with Collision-Aware DCF in mobile ad hoc networks Available online at www.sciencediect.com Ad Hoc Netwoks 7 (29) 23 247 www.elsevie.com/locate/adhoc Minimizing spatial and time esevation with Collision-Awae DCF in mobile ad hoc netwoks Lubo Song a, Chansu

More information

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks On the Fowading Aea of Contention-Based Geogaphic Fowading fo Ad Hoc and Senso Netwoks Dazhi Chen Depatment of EECS Syacuse Univesity Syacuse, NY dchen@sy.edu Jing Deng Depatment of CS Univesity of New

More information

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute

More information

Drag Optimization on Rear Box of a Simplified Car Model by Robust Parameter Design

Drag Optimization on Rear Box of a Simplified Car Model by Robust Parameter Design Vol.2, Issue.3, May-June 2012 pp-1253-1259 ISSN: 2249-6645 Dag Optimization on Rea Box of a Simplified Ca Model by Robust Paamete Design Sajjad Beigmoadi 1, Asgha Ramezani 2 *(Automotive Engineeing Depatment,

More information

A Full-mode FME VLSI Architecture Based on 8x8/4x4 Adaptive Hadamard Transform For QFHD H.264/AVC Encoder

A Full-mode FME VLSI Architecture Based on 8x8/4x4 Adaptive Hadamard Transform For QFHD H.264/AVC Encoder 20 IEEE/IFIP 9th Intenational Confeence on VLSI and System-on-Chip A Full-mode FME VLSI Achitectue Based on 8x8/ Adaptive Hadamad Tansfom Fo QFHD H264/AVC Encode Jialiang Liu, Xinhua Chen College of Infomation

More information

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which

More information

Module 6 STILL IMAGE COMPRESSION STANDARDS

Module 6 STILL IMAGE COMPRESSION STANDARDS Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.

More information

Tier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints

Tier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints Tie-Based Undewate Acoustic Routing fo Applications with Reliability and Delay Constaints Li-Chung Kuo Depatment of Electical Engineeing State Univesity of New Yok at Buffalo Buffalo, New Yok 14260 Email:

More information

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition

More information

A Novel Automatic White Balance Method For Digital Still Cameras

A Novel Automatic White Balance Method For Digital Still Cameras A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing

More information

Erasure-Coding Based Routing for Opportunistic Networks

Erasure-Coding Based Routing for Opportunistic Networks Easue-Coding Based Routing fo Oppotunistic Netwoks Yong Wang, Sushant Jain, Magaet Matonosi, Kevin Fall Pinceton Univesity, Univesity of Washington, Intel Reseach Bekeley ABSTRACT Routing in Delay Toleant

More information

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,

More information

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE Tolga Numanoglu, Bulent Tavli, and Wendi Heinzelman Depatment of Electical and Compute Engineeing Univesity

More information

Method of controlling access to intellectual switching nodes of telecommunication networks and systems

Method of controlling access to intellectual switching nodes of telecommunication networks and systems ISSN (e): 2250 3005 Volume 05 Issue 05 ay 2015 Intenational Jounal of Computational Engineeing eseach (IJCE) ethod of contolling access to intellectual switching nodes of telecommunication netwoks and

More information

A New Finite Word-length Optimization Method Design for LDPC Decoder

A New Finite Word-length Optimization Method Design for LDPC Decoder A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology

More information

Simulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM

Simulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM J. Basic. Appl. Sci. Res., 1(10)1594-1602, 2011 2011, TextRoad Publication ISSN 2090-424X Jounal of Basic and Applied Scientific Reseach www.textoad.com Simulation and Pefomance Evaluation of Netwok on

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

More information

Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs

Fault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs Fault-Toleant Routing Schemes in RDT(,,)/α-Based Inteconnection Netwok fo Netwoks-on-Chip Designs Mei Yang, Tao Li, Yingtao Jiang, and Yulu Yang Dept. of Electical & Compute Engineeing Univesity of Nevada,

More information

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal

More information

Configuring RSVP-ATM QoS Interworking

Configuring RSVP-ATM QoS Interworking Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP

More information

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks Numbe of Paths and Neighbous Effect on Multipath Routing in Mobile Ad Hoc Netwoks Oday Jeew School of Infomation Systems and Accounting Univesity of Canbea Canbea ACT 2617, Austalia oday.jeew@canbea.edu.au

More information

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1)

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1) 1 Multi Path PERT Ankit Singh and A. L. Naasimha Reddy Electical and Compute Engineeing Depatment, Texas A&M Univesity; email: eddy@ece.tamu.edu. Abstact This pape pesents a new multipath delay based algoithm,

More information

Separability and Topology Control of Quasi Unit Disk Graphs

Separability and Topology Control of Quasi Unit Disk Graphs Sepaability and Topology Contol of Quasi Unit Disk Gaphs Jiane Chen, Anxiao(Andew) Jiang, Iyad A. Kanj, Ge Xia, and Fenghui Zhang Dept. of Compute Science, Texas A&M Univ. College Station, TX 7784. {chen,

More information

Annales UMCS Informatica AI 2 (2004) UMCS

Annales UMCS Informatica AI 2 (2004) UMCS Pobane z czasopisma Annales AI- Infomatica http://ai.annales.umcs.pl Annales Infomatica AI 2 (2004) 33-340 Annales Infomatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ Embedding as a

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

Event-based Location Dependent Data Services in Mobile WSNs

Event-based Location Dependent Data Services in Mobile WSNs Event-based Location Dependent Data Sevices in Mobile WSNs Liang Hong 1, Yafeng Wu, Sang H. Son, Yansheng Lu 3 1 College of Compute Science and Technology, Wuhan Univesity, China Depatment of Compute Science,

More information

Towards Adaptive Information Merging Using Selected XML Fragments

Towards Adaptive Information Merging Using Selected XML Fragments Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,

More information

MANET QoS support without reservations

MANET QoS support without reservations SECURITY AND COMMUNICATION NETWORKS Secuity Comm. Netwoks (2010) Published online in Wiley InteScience (www.intescience.wiley.com)..183 SPECIAL ISSUE PAPER MANET QoS suppot without esevations Soon Y. Oh,

More information

An Extension to the Local Binary Patterns for Image Retrieval

An Extension to the Local Binary Patterns for Image Retrieval , pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science

More information

Hierarchically Clustered P2P Streaming System

Hierarchically Clustered P2P Streaming System Hieachically Clusteed P2P Steaming System Chao Liang, Yang Guo, and Yong Liu Polytechnic Univesity Thomson Lab Booklyn, NY 11201 Pinceton, NJ 08540 Abstact Pee-to-pee video steaming has been gaining populaity.

More information

The concept of PARPS - Packet And Resource Plan Scheduling

The concept of PARPS - Packet And Resource Plan Scheduling The concept of PARPS - Packet And Resouce Plan Scheduling Magnus Eiksson 1 and Håkan Sätebeg 2 1) Dept. of Signals, Sensos and Systems, Royal Inst. of Technology, Sweden. E-mail: magnus.eiksson@ite.mh.se.

More information

On Error Estimation in Runge-Kutta Methods

On Error Estimation in Runge-Kutta Methods Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment

More information

On Adaptive Bandwidth Sharing with Rate Guarantees

On Adaptive Bandwidth Sharing with Rate Guarantees On Adaptive Bandwidth Shaing with Rate Guaantees N.G. Duffield y T. V. Lakshman D. Stiliadis y AT&T Laboatoies Bell Labs Rm A175, 180 Pak Avenue Lucent Technologies Floham Pak, 101 Cawfods Cone Road NJ

More information

COMPARISON OF CHIRP SCALING AND WAVENUMBER DOMAIN ALGORITHMS FOR AIRBORNE LOW FREQUENCY SAR DATA PROCESSING

COMPARISON OF CHIRP SCALING AND WAVENUMBER DOMAIN ALGORITHMS FOR AIRBORNE LOW FREQUENCY SAR DATA PROCESSING COMPARISON OF CHIRP SCALING AND WAVENUMBER DOMAIN ALGORITHMS FOR AIRBORNE LOW FREQUENCY SAR DATA PROCESSING A. Potsis a, A. Reigbe b, E. Alivisatos a, A. Moeia c,and N. Uzunoglu a a National Technical

More information

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300

More information

Ethernet PON (epon): Design and Analysis of an Optical Access Network.

Ethernet PON (epon): Design and Analysis of an Optical Access Network. Ethenet PON epon: Design and Analysis of an Optical Access Netwo. Glen Kame Depatment of Compute Science Univesity of Califonia, Davis, CA 9566, USA Tel:.530.297.527; Fax:.530.297.530 E-mail: ame@cs.ucdavis.edu

More information

i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA

i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA i-pcgrid Wokshop 2016 Apil 1 st 2016 San Fancisco, CA Liang Min* Eddy Banks, Bian Kelley, Met Kokali, Yining Qin, Steve Smith, Philip Top, and Caol Woodwad *min2@llnl.gov, 925-422-1187 LDRD 13-ERD-043

More information

Positioning of a robot based on binocular vision for hand / foot fusion Long Han

Positioning of a robot based on binocular vision for hand / foot fusion Long Han 2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,

More information

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation

More information

The Internet Ecosystem and Evolution

The Internet Ecosystem and Evolution The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee

More information

Input Layer f = 2 f = 0 f = f = 3 1,16 1,1 1,2 1,3 2, ,2 3,3 3,16. f = 1. f = Output Layer

Input Layer f = 2 f = 0 f = f = 3 1,16 1,1 1,2 1,3 2, ,2 3,3 3,16. f = 1. f = Output Layer Using the Gow-And-Pune Netwok to Solve Poblems of Lage Dimensionality B.J. Biedis and T.D. Gedeon School of Compute Science & Engineeing The Univesity of New South Wales Sydney NSW 2052 AUSTRALIA bbiedis@cse.unsw.edu.au

More information

Reachable State Spaces of Distributed Deadlock Avoidance Protocols

Reachable State Spaces of Distributed Deadlock Avoidance Protocols Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Monte Carlo Simulation for the ECAT HRRT using GATE

Monte Carlo Simulation for the ECAT HRRT using GATE Monte Calo Simulation fo the ECAT HRRT using GATE F. Bataille, C. Comtat, Membe, IEEE, S. Jan, and R. Tébossen Abstact The ECAT HRRT (High Resolution Reseach Tomogaph, CPS Innovations, Knoxville, TN, U.S.A.)

More information

FINITE ELEMENT MODEL UPDATING OF AN EXPERIMENTAL VEHICLE MODEL USING MEASURED MODAL CHARACTERISTICS

FINITE ELEMENT MODEL UPDATING OF AN EXPERIMENTAL VEHICLE MODEL USING MEASURED MODAL CHARACTERISTICS COMPDYN 009 ECCOMAS Thematic Confeence on Computational Methods in Stuctual Dynamics and Eathquake Engineeing M. Papadakakis, N.D. Lagaos, M. Fagiadakis (eds.) Rhodes, Geece, 4 June 009 FINITE ELEMENT

More information

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity

More information

Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing

Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing IEEE TRANSACTIONS ON COMPUTERS, VOL. 50, NO. 9, SEPTEMBER 200 949 Dynamic Multiple Paity (DMP) Disk Aay fo Seial Tansaction Pocessing K.H. Yeung, Membe, IEEE, and T.S. Yum, Senio Membe, IEEE AbstactÐThe

More information

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

More information

1.3 Multiplexing, Time-Switching, Point-to-Point versus Buses

1.3 Multiplexing, Time-Switching, Point-to-Point versus Buses http://achvlsi.ics.foth.g/~kateveni/534 1.3 Multiplexing, Time-Switching, Point-to-Point vesus Buses n R m Aggegation (multiplexing) Distibution (demultiplexing) Simplest Netwoking, like simplest pogamming:

More information

Wormhole Detection and Prevention in MANETs

Wormhole Detection and Prevention in MANETs Womhole Detection and Pevention in MANETs Lija Joy Compute Science and Engineeing KMEA Engineeing College Enakulum, Keala, India lijavj@gmail.com Sheena Kuian K Compute Science and Engineeing KMEA Engineeing

More information

QUALITY OF SERVICE DESIGN ISSUES IN MULTIMEDIA COMMUNICATIONS OVER POWER LINE NETWORKS SRINIVAS KATAR

QUALITY OF SERVICE DESIGN ISSUES IN MULTIMEDIA COMMUNICATIONS OVER POWER LINE NETWORKS SRINIVAS KATAR QUALITY OF SERVICE DESIGN ISSUES IN MULTIMEDIA COMMUNICATIONS OVER POWER LINE NETWORKS By SRINIVAS KATAR A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT

More information

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,

More information

Mobility Pattern Recognition in Mobile Ad-Hoc Networks

Mobility Pattern Recognition in Mobile Ad-Hoc Networks Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif

More information

ANN Models for Coplanar Strip Line Analysis and Synthesis

ANN Models for Coplanar Strip Line Analysis and Synthesis 200 IJCSNS Intenational Jounal of Compute Science and Netwok Secuity, VOL.8 No.10, Octobe 2008 Models fo Coplana Stip Line Analysis and J.Lakshmi Naayana D.K.Si Rama Kishna D.L.Patap Reddy Chalapathi Institute

More information

AMERICAN UNIVERSITY OF BEIRUT IMPROVING DATA COMMUNICATIONS IN VEHICULAR AD HOC NETWORKS VIA COGNITIVE NETWORKS TECHNIQUES ALI JAWAD GHANDOUR

AMERICAN UNIVERSITY OF BEIRUT IMPROVING DATA COMMUNICATIONS IN VEHICULAR AD HOC NETWORKS VIA COGNITIVE NETWORKS TECHNIQUES ALI JAWAD GHANDOUR AMERICAN UNIVERSITY OF BEIRUT IMPROVING DATA COMMUNICATIONS IN VEHICULAR AD HOC NETWORKS VIA COGNITIVE NETWORKS TECHNIQUES by ALI JAWAD GHANDOUR A thesis submitted in patial fulfillment of the equiements

More information

On the throughput-cost tradeoff of multi-tiered optical network architectures

On the throughput-cost tradeoff of multi-tiered optical network architectures 1 On the thoughput-cost tadeoff of multi-tieed optical netwok achitectues Guy Weichenbeg, Vincent W. S. Chan, and Muiel Médad Laboatoy fo Infomation and Decision Systems Massachusetts Institute of Technology

More information

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann. A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of

More information

COLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE

COLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE COLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE Slawo Wesolkowski Systems Design Engineeing Univesity of Wateloo Wateloo (Ont.), Canada, NL 3G s.wesolkowski@ieee.og Ed Jenigan

More information

Automatically Testing Interacting Software Components

Automatically Testing Interacting Software Components Automatically Testing Inteacting Softwae Components Leonad Gallaghe Infomation Technology Laboatoy National Institute of Standads and Technology Gaithesbug, MD 20899, USA lgallaghe@nist.gov Jeff Offutt

More information

Quality Aware Privacy Protection for Location-based Services

Quality Aware Privacy Protection for Location-based Services In Poceedings of the th Intenational Confeence on Database Systems fo Advanced Applications (DASFAA 007), Bangkok, Thailand, Apil 9-, 007. Quality Awae Pivacy Potection fo Location-based Sevices Zhen Xiao,,

More information

UCB CS61C : Machine Structures

UCB CS61C : Machine Structures inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called

More information

Effects of Model Complexity on Generalization Performance of Convolutional Neural Networks

Effects of Model Complexity on Generalization Performance of Convolutional Neural Networks Effects of Model Complexity on Genealization Pefomance of Convolutional Neual Netwoks Tae-Jun Kim 1, Dongsu Zhang 2, and Joon Shik Kim 3 1 Seoul National Univesity, Seoul 151-742, Koea, E-mail: tjkim@bi.snu.ac.k

More information

Vehicle Chassis Control Using Adaptive Semi-Active Suspension

Vehicle Chassis Control Using Adaptive Semi-Active Suspension Poceedings of the 17th Wold Congess The Intenational Fedeation of Automatic Contol Vehicle Chassis Contol Using Adaptive Semi-Active Suspension V. Sankaanaayanan, Sinan Oncu, Dince Ocan, and Levent Güvenç

More information