2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)最新文献_第3页

Design of a Message Authentication Protocol for CAN FD Based on Chaskey Lightweight MAC 基于Chaskey轻量级MAC的CAN FD消息认证协议设计

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00057

Guillaume Carel, Ryunosuke Isshiki, Takuya Kusaka, Y. Nogami, Shunsuke Araki

{"title":"Design of a Message Authentication Protocol for CAN FD Based on Chaskey Lightweight MAC","authors":"Guillaume Carel, Ryunosuke Isshiki, Takuya Kusaka, Y. Nogami, Shunsuke Araki","doi":"10.1109/CANDARW.2018.00057","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00057","url":null,"abstract":"The development of the autonomous driving and the connected services severely increase security threats on old automotive technologies that are still present on-board vehicles since the long incremental process were employed. For example, the Controller Area Network (CAN) bus, which was standardized in 1991, can be connected to modern Linux embedded computer nodes where evil attacker might be able to exploit a vulnerability on the nodes. However, it is not easy to implement countermeasures on the CAN bus, since the strict requirements and limited performances of CAN specification. That is one of the major reason for the new standard CAN Flexible Data-rate (CAN FD) has been released in 2012 by Bosch to fill the gap between these challenges and the CAN protocol. In this research, a new simple authentication protocol for CAN FD is proposed, and the protocol is evaluated by experiments. The results show that the proposed protocol prevents infected nodes from usurping identity of a critical node and forge messages, with practical computational complexity on modern low-power embedding boards.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

An Analytical Model of Energy-Aware RPL for Wireless Sensor Networks 无线传感器网络能量感知RPL分析模型

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00062

Wilbert Jethro R. Limjoco, N. Tiglao

{"title":"An Analytical Model of Energy-Aware RPL for Wireless Sensor Networks","authors":"Wilbert Jethro R. Limjoco, N. Tiglao","doi":"10.1109/CANDARW.2018.00062","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00062","url":null,"abstract":"Battery-operated Wireless Sensor Networks (WSNs) deployed in wide and remote areas are difficult to maintain as replacing their batteries in such scenarios is a daunting task. Thus, there is a need to make use of self-sustaining energy harvesting sensor nodes. However, the Routing Protocol for Low Power and Lossy Networks (RPL), the de facto standard routing protocol for WSNs, assumes that there is a constant supply of energy for all sensors, and that it does not use energy as its routing metric. Therefore, there is a need to modify RPL to factor in energy in its routing metric to improve the network lifetime. This study addresses this problem by dynamically converting the energy level of a node into an additive penalty to the ETX metric used by RPLs Minimum Rank Hysteresis Objective Function (MRHOF). RPL is modeled using a modified version of the Bellman-Ford algorithm. Assuming we use a lossless channel and we implement aggressive parent-switching, we have found out in our analytical model simulations that the Average Charge Cycle times and Time of First Node Death increase up to 2.5 times longer as compared to standard RPL for a simple, four node diamond topology. There is also the consequence of child nodes being disconnected from the network due to the energy balancing in the parent nodes, which lowers the total Packet Delivery Ratio up to 10% lower than standard RPL for the simple diamond topology. However, this is balanced out by the increase in Sending Rate of the parent nodes by up to 20% due to longer lifetimes. Thus, the total number of packets received from the entire network is up to 8% higher for the experiment topology.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Cellular Automaton Model for Turing Tumble Mechanical Computer 图灵滚筒式机械计算机元胞自动机模型

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00014

Takahiro Tomita, Jia Lee, T. Isokawa, F. Peper, N. Kamiura, T. Yumoto

引用次数: 0

User-Side Updating of Third-Party Libraries for Android Applications Android应用的第三方库的用户端更新

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00088

Hiroki Ogawa, Eiji Takimoto, Koichi Mouri, S. Saito

引用次数: 3

Performance Evaluation and Visualization of Scientific Applications Using PMlib 使用PMlib的科学应用程序的性能评估和可视化

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00053

Kazunori Mikami, K. Ono, J. Nonaka

{"title":"Performance Evaluation and Visualization of Scientific Applications Using PMlib","authors":"Kazunori Mikami, K. Ono, J. Nonaka","doi":"10.1109/CANDARW.2018.00053","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00053","url":null,"abstract":"The computational performance of scientific applications on HPC systems is often much lower than user expectation based on the system's maximum performance specifications. To understand the basis for this performance gap, a multi-perspective evaluation is important. For instance, from the user perspective, correlating the theoretical computation coded as a source program with the actual computation workload produced by the compilers is valuable. From the system perspective, evaluating the characteristics of microarchitecture elements such as processor core and memory is of significance. An open source library called PMlib was developed to address these types of synthetic evaluations. PMlib provides an avenue for reporting the arithmetic/application workload explicitly coded in the source program, as well as the actually executed system workload. It also provides detailed utilization reports of processor-specific hardware including the categorized SIMD instruction statistics, the layered cache hit/miss rate, and the effective memory bandwidth, which are captured via hardware performance counters (HWPC). Using PMlib, users can conduct a synthetic analysis of application performance, and obtain useful feedback for further optimized execution of applications.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133797930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Formalization of Asynchronous Cellular Automata Using Asynchronous Protocol for Communications 使用异步通信协议的异步元胞自动机形式化

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00015

Jia Lee, F. Peper, K. Leibnitz

引用次数: 0

A Smaller-State Implementation of Real-Time Sequence Generator for {n^3 | n= 1, 2, 3,...} {n^3 | n= 1,2,3，…}实时序列生成器的小状态实现

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00012

N. Kamikawa, H. Umeo

引用次数: 0

An Extension of A Temperature Modeling Tool HotSpot 6.0 for Castle-of-Chips Stacking 芯片城堡堆叠温度建模工具HotSpot 6.0的扩展

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00073

Tomohiro Totoki, M. Koibuchi, H. Amano

引用次数: 0

The Impact of Job Mapping on Random Network Topology 作业映射对随机网络拓扑结构的影响

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00024

Yao Hu, M. Koibuchi

{"title":"The Impact of Job Mapping on Random Network Topology","authors":"Yao Hu, M. Koibuchi","doi":"10.1109/CANDARW.2018.00024","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00024","url":null,"abstract":"A number of small parallel applications run on datacenters and supercomputers simultaneously. Job mapping becomes crucial to improving system utilization and application execution. Fragmentation of unused compute nodes could not be assigned for an incoming job since it may largely harm communication abilities between non-adjacent compute nodes. In this case, however, incoming jobs are likely to be pending on the overloaded system because they have to wait for the release of adjacent occupied compute nodes. In this study, we explore job mapping on random topology for the purpose of improving job scheduling ability. Ideally, a diverse application workload can be better supported disregarding its interconnection network topology with a certain time-space tradeoff. Our simulation results demonstrate that, over 3-D torus interconnection networks, the embedding of random topology performs better than that of 2-D mesh by 84% and seems comparable to that of 3-D mesh in terms of job scheduling performance. Over random topologies, the scheduling performance can be much improved by the embedding of random topologies especially for dealing with dozens of intensively incoming jobs. Overall, job mapping on random guest topology over random host topology presents the best job scheduling performance among all the cases in our evaluation.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114884269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Acceleration of Analysis Processing on Decentralized Performance Profiling System Using Virtual Machines 利用虚拟机加速分散式性能分析系统的分析处理

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00035

Masao Yamamoto, Kohta Nakashima, Toshihiro Yamauchi, A. Nagoya, H. Taniguchi

{"title":"Acceleration of Analysis Processing on Decentralized Performance Profiling System Using Virtual Machines","authors":"Masao Yamamoto, Kohta Nakashima, Toshihiro Yamauchi, A. Nagoya, H. Taniguchi","doi":"10.1109/CANDARW.2018.00035","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00035","url":null,"abstract":"To detect the performance anomaly of a computer, as a structure for continuous performance profiling, decentralization of the performance profiling system using virtual machines has been proposed. Moreover, there have already been evaluation results reported regarding overhead, including data storing, and data sampling stall time. On the other hand, for continuous performance profiling, the continuous processing of performance profiling is needed, including not only data sampling and data storing but also analysis processing. Therefore, first, this paper describes a relationship condition among data sampling time, data storing time, and analysis processing time as the necessary condition for continuous performance profiling on a decentralized performance profiling system. Second, in order to satisfy the relationship condition, we propose a concurrent operation technique as the acceleration method of analysis processing for a decentralized performance profiling system. Finally, this paper presents quantitative evaluations of the proposed method, including the case of a multi-VMM environment.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128033720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0