2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)最新文献

筛选
英文 中文
Cross-Layer Balanced Relay Node Selection Algorithm for Opportunistic Routing in Underwater Ad-Hoc Networks 水下Ad-Hoc网络机会路由跨层均衡中继节点选择算法
Ning Li, José-Fernán Martínez-Ortega, Vicente Hernández Díaz, Lourdes López-Santidrián
{"title":"Cross-Layer Balanced Relay Node Selection Algorithm for Opportunistic Routing in Underwater Ad-Hoc Networks","authors":"Ning Li, José-Fernán Martínez-Ortega, Vicente Hernández Díaz, Lourdes López-Santidrián","doi":"10.1109/AINA.2018.00087","DOIUrl":"https://doi.org/10.1109/AINA.2018.00087","url":null,"abstract":"Due to the different transmission media, the underwater environment poses a more severe situation for routing algorithm design than that of the terrestrial environment. In this paper, we propose a weight based fuzzy logic (WBFL) relay node selection algorithm for the underwater Ad-hoc network, which can get the most balanced result than the previous algorithms without increasing the computation complexity. In this algorithm, the parameter scatters instead of the parameter values are inputted into the fuzzy logic inference system. By this innovation, the algorithm can take as much cross-layer parameters into account as possible during the relay node selection. Moreover, taking the node mobility into account, we propose a geographic based link lifetime prediction algorithm for underwater Ad-hoc network. The simulation results show that the WBFL algorithm can improve the network throughput at most 50% compare with the ExOR algorithm; moreover, the WBFL is effective and accurate on selecting relay nodes and the computation complexity is less than the previous algorithms.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128447508","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}
引用次数: 7
Simple Models of Processes Migration with Virtual Machines in a Cluster of Servers 服务器集群中虚拟机进程迁移的简单模型
Ryoma Watanabe, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"Simple Models of Processes Migration with Virtual Machines in a Cluster of Servers","authors":"Ryoma Watanabe, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2018.00040","DOIUrl":"https://doi.org/10.1109/AINA.2018.00040","url":null,"abstract":"It is critical to reduce the electric energy consumption of servers in a cluster. In this paper, we discuss a migration approach to reducing the electric energy consumption of servers where a virtual machine with application processes migrates to a more energy-efficient server. In this paper, we consider a homogeneous cluster. We newly propose an ISEAM2H algorithm. Here, a virtual machine on a host server is selected to perform a process issued by an application and a guest server to which a virtual machine migrates is found so that the total electric energy consumption of servers can be minimized. In the evaluation, we show the total electric energy consumption and active time of the servers and the average execution time of processes can be reduced in the ISEAM2H algorithm.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116731128","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
A Context Aware Recommender System for Digital Storytelling 面向数字故事叙述的情境感知推荐系统
Fabio Clarizia, F. Colace, Marco Lombardi, F. Pascale
{"title":"A Context Aware Recommender System for Digital Storytelling","authors":"Fabio Clarizia, F. Colace, Marco Lombardi, F. Pascale","doi":"10.1109/AINA.2018.00085","DOIUrl":"https://doi.org/10.1109/AINA.2018.00085","url":null,"abstract":"Finding the information and making it available today is a very complex challenge. On the one hand, the large amount of available data requires a great ability to manage information; on the other hand, understanding the real needs of users requires complex systems that can provide contextual information. Italy's economy is based on tourism, thanks to its cultural heritage visited by millions of people every day. The goal of this paper is to create a recommender system to furnish a tailor-made story for the user based on the context in which it is located, thanks to a smart app that can provide contextual information. Using a Chatbot, this system also provides a context awareness data in order to enhance the tourist experience.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117220227","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}
引用次数: 12
Fog Computing with Distributed Database 雾计算与分布式数据库
Tsukasa Kudo
{"title":"Fog Computing with Distributed Database","authors":"Tsukasa Kudo","doi":"10.1109/AINA.2018.00096","DOIUrl":"https://doi.org/10.1109/AINA.2018.00096","url":null,"abstract":"In recent years, with the progress of IoT, the entry data from various sensors is accumulated on the cloud server and used for various analyses as big data. On the other hand, in order to transfer a large amount of data to the cloud server, there were the problems such as the restriction of network bandwidth, and the delay of feedback control of the sensors. For these problems, Fog computing has been proposed in which the primary processing of the sensor data is performed at the fog node installed near the sensors, and only its processing results are transferred to the cloud server. However, in this method, in the case where the original data of the sensor is required for various analyses at the cloud server, such a data must be transferred additionally. That is, a mechanism is necessary to manage the data of the entire system and to mutually utilize it. In this paper, I propose a data model which consists of three levels: the first level saves the original sensor data and is placed in the fog node; the second level saves the extraction data extracted by the primary processing; the third level saves the analysis results data. The second and third levels are placed in the cloud server. And, by constructing this data model with a distributed database, it can be performed efficiently to refer the arbitrary original sensor data in the fog nodes from the cloud server. Moreover, I implement this reference processing in two ways using MongoDB, which is a kind of NoSQL database, to evaluate this data model. And, I show it is necessary to select the reference way according to the system environment: the network bandwidth, the database performance of the fog node and cloud server, and the number of the fog nodes.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814259","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}
引用次数: 8
Reducing Error of Positioning Based on Unstable RSSI of Short Range Communication 基于不稳定RSSI的近距离通信定位误差减小
Wakana Nakai, Yu Kawahama, R. Katsuma
{"title":"Reducing Error of Positioning Based on Unstable RSSI of Short Range Communication","authors":"Wakana Nakai, Yu Kawahama, R. Katsuma","doi":"10.1109/AINA.2018.00089","DOIUrl":"https://doi.org/10.1109/AINA.2018.00089","url":null,"abstract":"Many services that use location information have been proposed; however, improving positioning accuracy in these devices remains an important challenge. The existing conventional positioning method uses trilateration to estimate the target node from three anchor nodes. For short-range communication, such as Bluetooth, the distance between each node is estimated by the received signal strength indicator (RSSI). However, if radio waves are blocked, the positioning estimation error increases because the RSSI value may be reduced signi?cantly. We propose a method to reduce positioning error in an environment with four or more nodes. First, the proposed method estimates the position of the target node relative to three anchor nodes. The positions of the remaining anchor nodes are estimated by two of the three anchor nodes and the target node. The proposed method adjusts the Unit RSSI value such that the difference between the estimated and actual anchor position is minimized. The results of an experiment performed with four anchor nodes demonstrate that the positioning error can be reduced by 37.5% compared to the existing method.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116621283","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}
引用次数: 6
Starvation-Avoidance Routing Assignment for Multihop Wireless Networks 多跳无线网络的饥饿避免路由分配
Shih-Yao Chen, F. Lin, Y. Wen, Chiu-Han Hsiao
{"title":"Starvation-Avoidance Routing Assignment for Multihop Wireless Networks","authors":"Shih-Yao Chen, F. Lin, Y. Wen, Chiu-Han Hsiao","doi":"10.1109/AINA.2018.00062","DOIUrl":"https://doi.org/10.1109/AINA.2018.00062","url":null,"abstract":"A distributed coordination function is a serial fundamental media access control (MAC) mechanism of the IEEE 802.11 wireless network standards for accessing a medium and reducing the probability of collisions. Before sending data, each sender must check whether the medium is available. However, asymmetric detection and collision-avoidance mechanisms create transmission starvation problems. Hence, this paper addresses starvation problems to improve the quality of service in multihop wireless networks by adapting the transmission power range and carrier-sense threshold to alleviate starvation problems and to improve system performance. The problem is modelled as a mathematical formulation, and a Lagrangian relaxation (LR) approach is applied to obtain the approximation solution. The performance of the proposed algorithm is verified by applying it to several simulated starvation-avoidance routing problems. The results show that the proposed algorithm can near-optimally solve these problems, with an average lower bound–upper bound gap of 12.4%.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121105174","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
Comparison of Selected Homomorphic Encryption Techniques 所选同态加密技术的比较
M. Ogiela, Marcin Oczko
{"title":"Comparison of Selected Homomorphic Encryption Techniques","authors":"M. Ogiela, Marcin Oczko","doi":"10.1109/AINA.2018.00159","DOIUrl":"https://doi.org/10.1109/AINA.2018.00159","url":null,"abstract":"In this paper will be described selected homomorphic cryptosystems, with characterization of selected security features and comparison of main parameters. A test encryption circuit will be created to perform such comparison, and evaluation of core efficiency parameters. Also possible application of such cryptosystems will be presented, and future directions of theirs development will be presented.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557747","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}
引用次数: 4
Securing Cloud Storage Brokerage Systems Through Threat Models 通过威胁模型保护云存储代理系统
K. Torkura, M. Sukmana, Michael Meinig, Anne Kayem, Feng Cheng, Hendrik Graupner, C. Meinel
{"title":"Securing Cloud Storage Brokerage Systems Through Threat Models","authors":"K. Torkura, M. Sukmana, Michael Meinig, Anne Kayem, Feng Cheng, Hendrik Graupner, C. Meinel","doi":"10.1109/AINA.2018.00114","DOIUrl":"https://doi.org/10.1109/AINA.2018.00114","url":null,"abstract":"Cloud storage brokerage is an abstraction aimed at providing value-added services. However, Cloud Service Brokers are challenged by several security issues including enlarged attack surfaces due to integration of disparate components and API interoperability issues. Therefore, appropriate security risk assessment methods are required to identify and evaluate these security issues, and examine the efficiency of countermeasures. A possible approach for satisfying these requirements is employment of threat modeling concepts, which have been successfully applied in traditional paradigms. In this work, we employ threat models including attack trees, attack graphs and Data Flow Diagrams against a Cloud Service Broker (CloudRAID) and analyze these security threats and risks. Furthermore, we propose an innovative technique for combining Common Vulnerability Scoring System (CVSS) and Common Configuration Scoring System (CCSS) base scores in probabilistic attack graphs to cater for configuration-based vulnerabilities which are typically leveraged for attacking cloud storage systems. This approach is necessary since existing schemes do not provide sufficient security metrics, which are imperatives for comprehensive risk assessments. We demonstrate the efficiency of our proposal by devising CCSS base scores for two common attacks against cloud storage: Cloud Storage Enumeration Attack and Cloud Storage Exploitation Attack. These metrics are then used in Attack Graph Metric-based risk assessment. Our experimental evaluation shows that our approach caters for the aforementioned gaps and provides efficient security hardening options. Therefore, our proposals can be employed to improve cloud security.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128897621","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}
引用次数: 7
Minicamp: Middleware for Incomplete Participation in Structured Peer-to-Peer Monitoring Protocols Minicamp:用于不完全参与结构化对等监控协议的中间件
Andreas Disterhöft, Kalman Graffi
{"title":"Minicamp: Middleware for Incomplete Participation in Structured Peer-to-Peer Monitoring Protocols","authors":"Andreas Disterhöft, Kalman Graffi","doi":"10.1109/AINA.2018.00150","DOIUrl":"https://doi.org/10.1109/AINA.2018.00150","url":null,"abstract":"In order to provide a certain level of quality to the users of a peer-to-peer network, the network's status needs to be monitored in the first place. In this paper, we tackle the problem of monitoring peer-to-peer networks with structured monitoring solutions with the constraint of incomplete participation of the nodes in the monitoring process. We propose a middleware overlay which operates between the common p2p overlay aiming at routing and resolving lookups and a monitoring overlay aiming to obtain and disseminate statistics on the network. Our solution covers an assignment, maintenance and probing scheme to build up a common global view for all nodes in the common p2p overlay. Evaluation shows a high precision for the assignment and probing scheme in the presence of only a fraction of the nodes in the network contributing to the monitoring.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"5 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130429689","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
Edge and Cluster Computing as Enabling Infrastructure for Internet of Medical Things 边缘和集群计算作为医疗物联网的使能基础设施
Pierluigi Ritrovato, F. Xhafa, Andrea Giordano
{"title":"Edge and Cluster Computing as Enabling Infrastructure for Internet of Medical Things","authors":"Pierluigi Ritrovato, F. Xhafa, Andrea Giordano","doi":"10.1109/AINA.2018.00108","DOIUrl":"https://doi.org/10.1109/AINA.2018.00108","url":null,"abstract":"The continuous adoption of fitness and medical smart sensors are boosting the development of Internet of Medical Things (IoMT), reshaping and revolutionizing Healthcare. This digital transformation is paving the way to new forms of care based on real-time analysis of huge amounts of data produced by sensors, which is seen as a basis for improving clinical efficiency and helping to save lives. A medical sensor typically produces several KBs of data per second so the collection and analysis of these data can be approached with Big Data technologies. The aim of this paper is to present and evaluate a hybrid architecture for real-time anomaly detection from data streams coming from sensors attached to patients. The architecture includes an edge computing data staging platform based on Raspberry Pi 3 for data logging, data transformation in RDF triple and data streaming towards a cluster computing running Apache Kafka for collecting RDFStreams, Apache Flink for running a parallel version of the Hierarchical Temporal Memory algorithm and Cassandra for data storing. The different layers of the architecture have been evaluated in terms of both CPU performance and memory usage using the REALDISP dataset.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115351433","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信