2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)最新文献_第8页

Efficient RPL Tree Construction Using Passive Link Quality Estimation 利用被动链路质量估计高效构建RPL树

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00009

Hiroto Fujita, Yasuyuki Tanaka, K. Mori, F. Teraoka

{"title":"Efficient RPL Tree Construction Using Passive Link Quality Estimation","authors":"Hiroto Fujita, Yasuyuki Tanaka, K. Mori, F. Teraoka","doi":"10.1109/CANDARW53999.2021.00009","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00009","url":null,"abstract":"For LLNs (Low power and Lossy Networks), RPL (IPv6 Routing Protocol for LLNs) has been standardized by the IETF (Internet Engineering Task Force) as a routing protocol for LLNs. In RPL, each node estimates the link quality to neighboring nodes and selects the parent node by the OF (Objective Function). As a result, a tree structure rooted at the sink is constructed. Existing OFs such as MRHOF (Minimum Rank with Hysteresis OF) adopt active monitoring for link quality estimation, i.e., each node periodically broadcasts control packets, which results in large control overhead. This paper proposes BROF (Broadcast Reception based OF) which employs passive monitoring for link quality estimation, i.e., each node estimates the link quality by the actual number of control packet receptions and the expected number of control packet receptions. This paper also evaluates the basic performance of BROF by comparing with MRHOF implemented in Contiki-NG, which is an OS (Operating System) for IoT devices. As a result, the number of parent node switching in BROF is 20% lower than that in MRHOF and the control overhead in BROF is 65% lower than that in MRHOF although the network construction time in BROF is 15% larger than that in MRHOF. Furthermore, the delay time of UDP packet transmission from each node to the sink in BROF is 1% smaller than that in MRHOF.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132275495","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

Verification of the Effectiveness to Monitor Darknet across Multiple Organizations 跨多个组织监控暗网的有效性验证

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00065

K. Nishijima, Takao Kondo, Tatsumi Hosokawa, Tomohiro Shigemoto, N. Kawaguchi, Hiroyuki Hasegawa, Hideyuki Honda, Yasuhito Suzuki, T. Kaji, Osamu Nakamura

{"title":"Verification of the Effectiveness to Monitor Darknet across Multiple Organizations","authors":"K. Nishijima, Takao Kondo, Tatsumi Hosokawa, Tomohiro Shigemoto, N. Kawaguchi, Hiroyuki Hasegawa, Hideyuki Honda, Yasuhito Suzuki, T. Kaji, Osamu Nakamura","doi":"10.1109/CANDARW53999.2021.00065","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00065","url":null,"abstract":"Researchers and network operators regularly monitor unused Internet address space called the darknet to understand malicious activities on the Internet such as malware infections, DDoS, and scanning to find vulnerable systems. The purpose of this study is to demonstrate the effectiveness of darknet monitoring across multiple organizations by conducting a detailed similarity analysis. In this paper, we analyze darknet data observed in two organizations in different industries and the first octet subnet range. We compared the results of the similarity analysis between intra-organization and inter-organization calculations by dividing the address space into multiple blocks so that one organization conducts similarity analysis in an intra-organization manner. The results show that the similarity of the source hosts is lower in the inter-organization calculation than in the intra-organization calculation. In addition, we monitor more source hosts in inter-organization. Moreover, this work also reports that the results differ depending on the destination ports/protocols. From the results obtained, we clarified the effectiveness of distributing the monitoring points of the darknet across multiple organizations.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132325219","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

Transparent Relational Database Caching Based on Storage Engines Using In-memory Database 基于内存数据库存储引擎的透明关系数据库缓存

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00082

Motoshi Miyamoto, Ryota Kawashima, H. Matsuo

{"title":"Transparent Relational Database Caching Based on Storage Engines Using In-memory Database","authors":"Motoshi Miyamoto, Ryota Kawashima, H. Matsuo","doi":"10.1109/CANDARW53999.2021.00082","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00082","url":null,"abstract":"Relational databases (RDB) can be used with in-memory cache DBs such as Redis and memcached to shorten the response time. However, programs are complicated by explicitly controlling the RDB and in-memory cache DB on the client-side. In this paper, we propose a method to implement an access function to the in-memory cache DB in the RDB storage engine, so that the client-side can use the in-memory cache DB transparently by accessing the RDB. The storage engine is implemented for MySQL. The cache is used to provide quick access to data for indexed reads. We conducted the following three evaluations. First, to evaluate a description method that does not make the client aware of the cache, we evaluated the existing method and the amount of source code. As a result, we confirmed that the amount of description could be reduced to about 1/3. Next, we evaluated the performance of MySQL and the proposed method using the same source code. As a result, the throughput was improved by up to 55%. Finally, we evaluated the overhead of our method by writing cache-aware code on the client side and evaluating our method. As a result, we confirmed that the overhead of our method is about 2.7%.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"8 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123523918","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

A Practical Parallel Computation in a Scalable Multiparty Private Set Intersection 一种实用的可扩展多方私有集交叉口并行计算方法

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00063

Seitaro Mishima, Kazuhisa Nakasho, Yuuki Takano, A. Miyaji

引用次数: 1

Instillation Checking Using Long Short-Term Memories for Ophthalmology Patients 眼科患者长短期记忆的灌注检查

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00032

Tomohiro Ishigami, T. Isokawa, N. Kamiura, Hiroki Masumoto, Hitoshi Tabuchi

引用次数: 0

An Externally-Constrained Ising Clustering Method for Material Informatics 一种材料信息学的外部约束Ising聚类方法

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00040

K. Komatsu, Masahito Kumagai, Ji Qi, Masayuki Sato, Hiroaki Kobayashi

{"title":"An Externally-Constrained Ising Clustering Method for Material Informatics","authors":"K. Komatsu, Masahito Kumagai, Ji Qi, Masayuki Sato, Hiroaki Kobayashi","doi":"10.1109/CANDARW53999.2021.00040","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00040","url":null,"abstract":"Due to the recent advancement of data science, such as machine learning and big-data analysis, the approach using data science techniques has attracted attention even to develop new materials, called material informatics. In material informatics, clustering is one of the essential data processing techniques to understand thermophysical properties. Thus, clustering quality is a high priority to be considered. To improve clustering accuracy, this paper evaluates Ising-based clustering methods using an annealing machine. As an annealing machine minimizes the energy of an Ising model, the Ising-based clustering methods define the clustering as an Ising model to minimize the sum of intra-cluster distances among data. Since the non-Ising-based clustering methods conventionally used in materials informatics perform pseudo-optimization, the Ising-based clustering methods can achieve high clustering accuracy. The experimental results show that the Ising-based clustering method with externally-defined constraint achieves higher clustering accuracy with an affordable execution time than the conventional K-means clustering method.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115650679","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

[Copyright notice] (版权)

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/candarw53999.2021.00003

引用次数: 0

Analysis of Resistance Distribution and Voltage Drop in Chips with Inductive Coupling Wireless Communication Interface 电感耦合无线通信接口芯片的电阻分布和压降分析

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00055

Hideto Kayashima, H. Amano

{"title":"Analysis of Resistance Distribution and Voltage Drop in Chips with Inductive Coupling Wireless Communication Interface","authors":"Hideto Kayashima, H. Amano","doi":"10.1109/CANDARW53999.2021.00055","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00055","url":null,"abstract":"The building block computing system can build several systems by stacking small chips with inductive coupling wireless chip-to-chip connection TCI (Through Chip Interface). TCI IP (Intellectual Property) was developed by using the Renesas 65nm SOTB process, and several family chips have been developed with the IP. Although all of the chips worked alone without problems, when they were stacked to construct a system, problems were found on some combinations of chips that TCI did not work as designed. This paper analyzes the resistances of power grid of chips with IPs from their layout to investigate the reason of the problems. Then, the voltage drop is estimated with the model built from the real chip evaluation. The analysis results appeared that in some chips, the resistances of the power grid are more than double of the target value, and because of the voltage drop, the supply voltage given to the IP of the largest chip SMTT is about the half of given to the power pad. Although it comes from the limitation of the I/O pads for chip stacking and fixed location of TCI IPs, we must take special care of the design of the transmitter power grid.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129252904","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

Proposal and Evaluation of a Gesture Authentication Method with Peep Resistance for Smartwatches 一种智能手表防窥视手势认证方法的提出与评价

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00067

Mirang Park, K. Aburada, N. Okazaki

{"title":"Proposal and Evaluation of a Gesture Authentication Method with Peep Resistance for Smartwatches","authors":"Mirang Park, K. Aburada, N. Okazaki","doi":"10.1109/CANDARW53999.2021.00067","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00067","url":null,"abstract":"The use of mobile terminals with small touchscreens such as smartwatches has increased dramatically in recent years. A PIN or pattern lock is commonly used for personal authentication on such devices, but because the information is displayed directly, authentication information can be leaked to someone peeking at the screen. In this paper, we propose a gesture-based smartwatch authentication method that reduces the likelihood of leaks by allowing the owner to include a dummy (or \"fake\") number at the time of authentication registration. The dummy number enables the user to perform an authenticating gesture different from that indicated by the icon displayed on the screen. In a series of experiments, we confirmed the usability of the proposed method, evaluated the effect of long-term familiarity and assessed the method’s resistance to shoulder-surfing. In the usability experiment, the authentication time and success rate were 10.9 seconds and 73.3%, respectively. The authentication time and success rate in the long-term familiarity experiment improved to 8.8 seconds and 93%, and the leakage rate in the peep experiments was 0%.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130477611","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

Observation of Method Invocation in Application Runtime in Android for CPU Clock Rate Adjustment Android应用运行时方法调用对CPU时钟速率调整的观察

2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2021-11-01 DOI: 10.1109/CANDARW53999.2021.00090

Kota Kumakura, Atsuya Sonoyama, Takeshi Kamiyama, M. Oguchi, Saneyasu Yamaguchi

{"title":"Observation of Method Invocation in Application Runtime in Android for CPU Clock Rate Adjustment","authors":"Kota Kumakura, Atsuya Sonoyama, Takeshi Kamiyama, M. Oguchi, Saneyasu Yamaguchi","doi":"10.1109/CANDARW53999.2021.00090","DOIUrl":"https://doi.org/10.1109/CANDARW53999.2021.00090","url":null,"abstract":"Smartphones are currently widely used. Especially, the Android operating system has the largest market share. Nowadays, power consumption and the battery life of an Android device have been important issues. Performance and battery life are in a trade-off relation. A suitable CPU clock rate adjustment considering both performance and power consumption is desired. In the case of the Android operating system, Linux is used as its kernel and the kernel controls its CPU clock rate. Because the kernel cannot predict the CPU usage in the near future, it does not control the rate in advance. Namely, its control is based on a follow-up method. However, some papers reported that this follow-up method resulted in an unsuitable control. In the cases of Android smartphones, the CPU usage is dominantly determined by the foreground application. Thus, the CPU usage in the system can be approximately predicted in advance if the CPU resource requirement in the near future by the foreground application can be estimated. In many cases, the behavior of CPU resources has a strong relationship with the features of each method in an application. In this paper, we propose a method for observing the relationship between the application’s method call and its CPU resource requirements. The proposed method modifies the Android Runtime (ART) and then monitors the cumulative CPU usage time at invocations and returns of every application. This method extracts the CPU usage information of every method separately while the kernel cannot separate the CPU time by methods. Our verification experiments showed that our method can give the information correctly in the case of our target application and methods.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130634823","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}

引用次数: 3