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

Vehicle Control Method at T-Junctions for Mixed Environments Containing Autonomous and Non-autonomous Vehicles 包含自动驾驶和非自动驾驶车辆的混合环境t型交叉口车辆控制方法

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00024

Hiroto Furukawa, M. Saito, Yuichi Tokunaga, R. Kiyohara

引用次数: 2

Utilizing HoloLens to Support Industrial Service Processes 利用全息透镜支持工业服务流程

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00033

M. Aleksy, Michael Troost, Falk Scheinhardt, Gunnar T. Zank

引用次数: 11

An Ontology-Based Approach to Dynamic Contextual Role for Pervasive Access Control 基于本体的普适访问控制动态上下文角色研究

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00093

A. Kayes, J. Rahayu, T. Dillon

{"title":"An Ontology-Based Approach to Dynamic Contextual Role for Pervasive Access Control","authors":"A. Kayes, J. Rahayu, T. Dillon","doi":"10.1109/AINA.2018.00093","DOIUrl":"https://doi.org/10.1109/AINA.2018.00093","url":null,"abstract":"In role-based access control, roles are mostly organized in static hierarchies and users are authorized to play such roles in order to exercise the organizational functions. However, some of these roles cannot be organized in the same way in static hierarchies as the authorizations granted to such roles are strictly related to the dynamically changing contextual conditions (e.g., health profile information). Users need to satisfy these conditions in order to exercise the functions of such dynamic contextual roles. While several research works have been done in dynamic activation of static roles, no extensive research has been undertaken in the area of dynamic specification of contextual roles. This article makes a significant research contribution to the dynamic contextual role modeling and activation. We introduce both formal and ontology-based approaches in order to model the dynamic contextual roles and specify the context-aware access control policies by activating such dynamic roles at runtime. These contextual roles are equally important because of the demands of large-scale (pervasive) environments to control context-sensitive access to resources at different granularity levels with low processing overheads. We develop a software prototype to demonstrate the feasibility of our proposal and provide a walkthrough of the whole mechanism. Experimental results demonstrate the satisfactory performance of our proposed approach compared to our previous approach.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124092022","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

Optimal Speed Allocation in Sink-Based Energy Harvesting Wireless Sensor Networks 基于sink的能量采集无线传感器网络的最优速度分配

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00031

Abbas Mehrabi

{"title":"Optimal Speed Allocation in Sink-Based Energy Harvesting Wireless Sensor Networks","authors":"Abbas Mehrabi","doi":"10.1109/AINA.2018.00031","DOIUrl":"https://doi.org/10.1109/AINA.2018.00031","url":null,"abstract":"Unlike the existing sink-based data collection in energy harvesting wireless sensor networks (EH-WSNs) in which the mobile sink maintains a constant speed during its trajectory, the allocation of optimal sink speed can further improve the achievable network throughput. Inspired by this fact, in this paper, we formulate the optimal sink speed allocation problem with the objective of maximizing the network throughput (NTM-OSS) in delay-tolerant EH-WSNs. A mixed integer nonlinear programming(MINLP) optimization model is proposed for NTM-OSS formulation which takes into account the time duration for the acceleration and deceleration of mobile sink. With the sensors' information available in advance, an efficient algorithm named as optimal sink speed allocation (OSSAA) is designed which works based on an iteratively speed updating mechanism and runs by the mobile sink within consecutive time intervals. We show that the proposed algorithm guarantees the convergence to near-optimal solutions and has both time and message complexities of polynomial order in the worst case. The results of conducted simulations reveal that the proposed algorithm improves the network throughput by in average 1.6 × 10 3 data unit and achieves an average of 3.3 % energy saving compared to its competitor.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116047115","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

Research on PUF-Based Security Enhancement of Narrow-Band Internet of Things 基于puf的窄带物联网安全增强研究

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00106

Yuesong Lin, Fuqiang Jiang, Zhuping Wang, Zhuping Wang

{"title":"Research on PUF-Based Security Enhancement of Narrow-Band Internet of Things","authors":"Yuesong Lin, Fuqiang Jiang, Zhuping Wang, Zhuping Wang","doi":"10.1109/AINA.2018.00106","DOIUrl":"https://doi.org/10.1109/AINA.2018.00106","url":null,"abstract":"The Narrow-Band Internet of Things network (NB-IoT), which solves the communication problem for IoT, is growing mature rapidly and has become commercialized gradually. Network operators are investigating in the new technique. Compared with the traditional short range wireless communication technique, the entity model of the NB-IoT network is more complicated. Research on the security characteristics and the means of attack in the NB-IoT network is not sufficient by now. Problems such as effective binding between the components of the user equipment, loss or forgery of user equipment, illegal closure of the data security features, intercept of wireless communication, illegal acquisition of user privacy data still exist in the ubiquitous network. During the large scale application of such networks, numerous attacks on the user equipment and the network will occur and will cause serious security risk. Physical Unclonable Function (PUF) is the unique identity of a chip based on its physical characteristics. In this paper we first give a summery analysis of the security risks in the NB-IoT network. Then we propose the chip binding and anti-counterfeiting technique by having the PUF integrated in the chip of the NB-IoT user equipment. Considering the low power requirement of NB-IoT, we design a secure communication protocol based on PUF. Comparing with the PKI mechanism, the protocol simplifies the distribution of secret keys and certificates. Comparing with the TLS protocol, the proposed protocol simplifies the key agreement process and can still keep the high security level.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130466748","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}

引用次数: 9

A Novel Online QoE Prediction Model Based on Multiclass Incremental Support Vector Machine 一种基于多类增量支持向量机的QoE在线预测模型

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00058

Y. B. Youssef, Mériem Afif, Riadh Ksantini, S. Tabbane

{"title":"A Novel Online QoE Prediction Model Based on Multiclass Incremental Support Vector Machine","authors":"Y. B. Youssef, Mériem Afif, Riadh Ksantini, S. Tabbane","doi":"10.1109/AINA.2018.00058","DOIUrl":"https://doi.org/10.1109/AINA.2018.00058","url":null,"abstract":"Satisfying the user it's a primary goal to reach by telecom operators. Therefore, Quality of Experience (QoE), which is the measure of the user-perceived quality of a received service, has become a pivotal topic in the academic research. Generally, an efficient QoE model should be able to handle dynamic environments with large scale data, in order to continuously acquire feedback from the user, and then provide a real-time and accurate description of his perception. This paper proposes a novel online QoE estimation model, which is able to classify user perception toward video streaming service, using incremental multiclass SVM (multiclass-iSVM). The proposed online QoE model investigates the effectiveness of incremental learning, in order to handle large scale dynamic data and to improve prediction accuracy of QoE. In fact, it uses the mathematical properties of SVM and updates its unknown weights, as well as, the classification results incrementally, as new observations are considered. Comparative evaluation of the proposed multiclass iSVM-based QoE model is performed to show its superiority over relevant batch learning based models, in terms of QoE prediction accuracy and computational complexity. In particular, this model has achieved the highest classification rate of 89%, starting with only 10% of the dataset at the beginning of the incremental process.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116366746","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

A Protocol to Prevent Malicious Information Flow in P2PPS Systems P2PPS系统中防止恶意信息流的协议

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1007/978-3-319-93659-8_9

Shigenari Nakamura, T. Enokido, M. Takizawa

引用次数: 1

Design of Program Analysis Based Approach for Narrowing Down Misconfigurations in Beginner Network Construction Exercises 基于程序分析的减少初学者网络构造练习错误配置的方法设计

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00120

Y. Tateiwa, N. Takahashi

{"title":"Design of Program Analysis Based Approach for Narrowing Down Misconfigurations in Beginner Network Construction Exercises","authors":"Y. Tateiwa, N. Takahashi","doi":"10.1109/AINA.2018.00120","DOIUrl":"https://doi.org/10.1109/AINA.2018.00120","url":null,"abstract":"Traditionally, the identification of errors in network settings has been performed by reviewing the settings and executing diagnostic tools. However, because this method is based on the experience of the performer and also it is not procedurized, it is difficult to implement it with computers. Therefore, we focused on that it is possible to find relations between program input and output by analyzing program behavior with program analysis technique. In this paper, we propose a method to identify the network settings that affect network reachability errors by program analysis for behavior of a communication simulator program. The simulator takes network settings as a part of the input and computes communication reachability. The technical contributions of this study are as follows; 1) a formal representation that defines the specification of the exercise problems to which the proposed method can be applied, 2) the model of a simulator that is effective for the proposed method, 3) a technique that do not increase the burden on teachers in performing the method, and 4) a technique to reduce the amount of calculations required for performing the proposed method.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121754511","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

Optimal Replication Based on Optimal Path Hops for Opportunistic Networks 基于机会网络最优路径跳数的最优复制

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00047

Andre Ippisch, Salem Sati, Kalman Graffi

{"title":"Optimal Replication Based on Optimal Path Hops for Opportunistic Networks","authors":"Andre Ippisch, Salem Sati, Kalman Graffi","doi":"10.1109/AINA.2018.00047","DOIUrl":"https://doi.org/10.1109/AINA.2018.00047","url":null,"abstract":"Opportunistic Networks are highly mobile networks which may lack a reliable path between some source and destination. Therefore, this type of network uses Store, Carry and Forward and delivers messages based on hop-by-hop routing. Epidemic is the simplest routing protocol for Opportunistic Networks, as it replicates messages to all encountered nodes. For messages spread by Epidemic replication, we study and analyze the trade-off between the messages' delivery ratio, delay, and overhead. We consider that all members of the network, at any given time, know the amount of relay nodes that pass the message and each message carrier knows the amount of infected nodes that already have acquired the message. We address the problem of deriving the optimal closed-loop control for the replication strategy in our network. We draft this issue as a controlled, discrete-time and finite-state Markov Chain with an All Hops Optimal Path formulation. In real life scenarios, however, due to the intermittent correspondence in Opportunistic Networks the nodes do not have insight of the network's global state. We try to solve this issue by obtaining an Ordinary Differential Equation approximation of the Markov Chain for the replication process of messages. Furthermore, our model considers All Hops Optimal Path as network graph analysis for the optimally controlled replication. Lastly, we present the performance evaluation of these replication control conditions in finite networks. Our results show that this proposed Optimal Replication Based on Optimal Path Hops performs better than the omni-directional and contact-based Epidemic routing replication.","PeriodicalId":239730,"journal":{"name":"2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124200629","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}

引用次数: 5

Efficient Power Scheduling in Smart Homes Using Meta Heuristic Hybrid Grey Wolf Differential Evolution Optimization Technique 基于元启发式混合灰狼差分进化优化技术的智能家居高效电力调度

2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2018-05-16 DOI: 10.1109/AINA.2018.00098

Muqaddas Naz, N. Javaid, Urva Latif, T. N. Qureshi, Aqdas Naz, Z. Khan

{"title":"Efficient Power Scheduling in Smart Homes Using Meta Heuristic Hybrid Grey Wolf Differential Evolution Optimization Technique","authors":"Muqaddas Naz, N. Javaid, Urva Latif, T. N. Qureshi, Aqdas Naz, Z. Khan","doi":"10.1109/AINA.2018.00098","DOIUrl":"https://doi.org/10.1109/AINA.2018.00098","url":null,"abstract":"With the emergence of automated environment, energy demand by consumer is increasing day by day. More than 80% of total electricity is being consumed in residential sector. In this paper, a heuristic optimization technique is proposed for the efficient utilization of energy sources to balance load between demand and supply sides. An optimization technique is proposed which is a hybrid of Enhanced differential evolution (EDE) algorithm and Gray wolf optimization (GWO). The proposed scheme is named as hybrid gray wolf differential evolution (HGWDE). It is applied for home energy management (HEM) with the objective function of cost minimization and reducing peak to average ratio (PAR). Load shifting is performed from on peak hours to off peak hours on basis of user preference and real time pricing (RTP) tariff defined by utility. However, there is a trade off between user comfort and above mentioned parameters. To validate the performance of proposed algorithm, simulations have been carried out in MATLAB. Results illustrate that PAR and electricity bill have been reduced to 53.02%, and 12.81% respectively.","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-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131329598","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