{"title":"Towards Better Attack Path Visualizations Based on Deep Normalization of Host/Network IDS Alerts","authors":"Amir Azodi, Feng Cheng, C. Meinel","doi":"10.1109/AINA.2016.129","DOIUrl":"https://doi.org/10.1109/AINA.2016.129","url":null,"abstract":"Mitigation techniques employed by attackers has meant that traditional Network Intrusion Detection Systems (NIDS) are no longer able to reliably protect a network in the face of ever more sophisticated attacks. Security Information and Event Management (SIEM) systems monitor network systems by analyzing the logs they produce. In this paper, we propose a method of visualizing attacks by aggregating, normalizing and analyzing alerts raised by SIEM-based IDS (SIDS) systems as well as NIDS systems in real-time. We present the results of our proposed visualization technique when applied to different attack scenarios. In many cases, our approach allows for the path an attacker takes during their attack to be visualized.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122227157","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}
{"title":"A Cloud-Based Energy Efficient System for Enhancing the Detection and Prevention of Modern Malware","authors":"Q. A. K. Mirza, Ghulam Mohi Ud Din, I. Awan","doi":"10.1109/AINA.2016.133","DOIUrl":"https://doi.org/10.1109/AINA.2016.133","url":null,"abstract":"In today's modern world, a simple malware attack can result catastrophically and can cause havoc. In spite of numerous types of antiviruses available in the market, there is a dearth in detection techniques of these antiviruses. This paper proposes a complete system, which is a combination of conventional and new techniques for detecting malware. We first evaluate the antiviruses against 10,000+ malware samples to highlight their weaknesses and then propose, implement, and benchmark the cloud-based system against some defined parameters. We have tested the effectiveness and efficiency of the proposed system by monitoring the detection rate and processing power it consumes in order to operate in a host machine.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114064103","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}
{"title":"Trust Management Framework for Internet of Things","authors":"Yefeng Ruan, A. Durresi, L. Alfantoukh","doi":"10.1109/AINA.2016.136","DOIUrl":"https://doi.org/10.1109/AINA.2016.136","url":null,"abstract":"Internet of Things (IoT) can connect a large numberof things (or agents) through communication networks for varioustypes of applications. Like in many other applications, it isvery important for all the agents in IoT systems to collaboratewith each other following predefined protocols. In this paper, we proposed a general trust management framework aiming tohelp agents to evaluate their partners' trustworthiness. We run asimulation for a food nutrition analysis example. It shows that byusing trust, the analysis error can be reduced. Also, we illustratetwo possible types of attacks, and show how to use different trustfactors or environments together to alleviate the damage.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210619","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}
Abdul Majid, Irfan Azam, Abdul Waheed, Muhammad Zain-ul-Abidin, Taimur Hafeez, Z. Khan, U. Qasim, N. Javaid
{"title":"An Energy Efficient and Balanced Energy Consumption Cluster Based Routing Protocol for Underwater Wireless Sensor Networks","authors":"Abdul Majid, Irfan Azam, Abdul Waheed, Muhammad Zain-ul-Abidin, Taimur Hafeez, Z. Khan, U. Qasim, N. Javaid","doi":"10.1109/AINA.2016.165","DOIUrl":"https://doi.org/10.1109/AINA.2016.165","url":null,"abstract":"In Underwater Wireless Sensor Networks (UWSNs) nodes are equipped with limited battery power and battery replacement is expensive due to underwater harsh environment. Therefore, we propose EBECRP an energy Efficient and Balanced Energy consumption Cluster based Routing Protocol for UWSNs. In depth base routing protocols nodes near the sink (low depth nodes) die in no time because of high load. We avoid depth base routing in our proposed scheme and use mobile sinks to balance load on all nodes. We also use the concept of clustering to reduce multi hoping which results in more energy consumption. The selected Cluster Heads (CHs) collect data from one hope neighbor nodes to reduce global communication into locally compressed communication. Simulation results show that EBECRP achieves maximum stability period and network life time.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121713935","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}
{"title":"Bio-Inspired Cryptographic Techniques in Information Management Applications","authors":"L. Ogiela, M. Ogiela","doi":"10.1109/AINA.2016.161","DOIUrl":"https://doi.org/10.1109/AINA.2016.161","url":null,"abstract":"This paper will present new possibilities of information sharing with the use of biometric techniques. Various biometric techniques used in personal identification processes will constitute the basis for new data classification solutions. The process of data classification will be possible owing to the use of cryptographic techniques of sharing information, enriched by elements of biometric processes of personal identification. This type of solutions will serve to support the processes of managing strategic information.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"23 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131156855","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}
A. Sawada, Hiroki Kataoka, Dilawaer Duolikun, T. Enokido, M. Takizawa
{"title":"Energy-Aware Clusters of Servers for Storage and Computation Applications","authors":"A. Sawada, Hiroki Kataoka, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/AINA.2016.157","DOIUrl":"https://doi.org/10.1109/AINA.2016.157","url":null,"abstract":"It is now critical to reduce electric energy consumed in a cluster of servers, especially scalable systems like cloud computing systems. In clusters, most application processes like web applications use not only CPU resources but also files and databases. In this paper, we consider storage processes which read and write data in files in addition to computation processes. We propose a PCS model (power consumption model for a storage server) which shows how much electric power a server consumes to perform storage and computation processes. We also propose a CS model (a computation model for storage server) which shows how long it is expected to take to perform storage processes and computation processes. By using the PCS and CS models, we propose a local energy-aware (LEA) algorithm to select a server for a request process in a cluster so that the total electric energy consumption of the servers can be reduced. We evaluate the LEA algorithm in terms of total electric energy consumption of the servers. We show the electric energy consumed by servers to perform computation and storage processes can be reduced in the LEA algorithm.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133086244","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}
Michael Rethfeldt, P. Danielis, Benjamin Beichler, Björn Konieczek, Felix Uster, D. Timmermann
{"title":"Evaluating Cross-Layer Cooperation of Congestion and Flow Control in IEEE 802.11s Networks","authors":"Michael Rethfeldt, P. Danielis, Benjamin Beichler, Björn Konieczek, Felix Uster, D. Timmermann","doi":"10.1109/AINA.2016.12","DOIUrl":"https://doi.org/10.1109/AINA.2016.12","url":null,"abstract":"The new standard IEEE 802.11s enables vendor-independent wireless mesh networks based on the 802.11 WLAN technology. Transmission Control Protocol (TCP) is the most widespread transport protocol for reliable data delivery and still the basis for many network applications. TCP supports different mechanisms for flow and congestion control. However, designed for wired networks, it does not consider the dynamics of wireless networks and especially multi-hop wireless mesh networks. In addition, 802.11s provides own mechanisms such as Automatic Repeat Request (ARQ) for frame retransmissions to hide wireless loss from the upper layers. Being transparent to each other, retransmission schemes on both layers may interfere and operate redundantly, if not properly adjusted. We study the effects of ARQ retry limit variation on TCP throughput in a real-world multi-hop 802.11s test bed. As a result, we suggest ARQ adaptation based on the 802.11s standard's Airtime Link Metric (ALM) for path selection, serving as indicator for overall frame travel time. Our proposed approach solely relies on standard features and imposes no modifications to 802.11s or TCP.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130090598","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}
Everton R. Lira, Enrique Fynn, P. S. Coelho, L. Faina, Lásaro J. Camargos, R. Villaça, R. Pasquini
{"title":"An Architecture for Traffic Sign Management in Smart Cities","authors":"Everton R. Lira, Enrique Fynn, P. S. Coelho, L. Faina, Lásaro J. Camargos, R. Villaça, R. Pasquini","doi":"10.1109/AINA.2016.40","DOIUrl":"https://doi.org/10.1109/AINA.2016.40","url":null,"abstract":"This paper introduces and evaluates a Traffic Sign Management Architecture (TSMA), which represents a paradigm shift for the deployment of traffic sign infrastructure in the context of Intelligent Transport Systems, Vehicular Networks and Smart Cities. The proposal addresses limitations of the current traffic control model by enabling remote updates of traffic signs and displaying them on the vehicular navigation system display to improve their legibility. TSMA is an architecture developed to provide V2I interaction using a commodity technology, Wi-Fi, through the beacon-stuffing technique. The initial design of TSMA's security mechanisms is also presented in this paper. Evaluations were performed on a developed prototype and simulation environments.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121962429","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}
{"title":"NEXT-FIT: Available Bandwidth Measurement over 4G/LTE Networks -- A Curve-Fitting Approach","authors":"A. Paul, Atsuo Tachibana, T. Hasegawa","doi":"10.1109/AINA.2016.24","DOIUrl":"https://doi.org/10.1109/AINA.2016.24","url":null,"abstract":"Available bandwidth (ABW) estimation in wireless networks is a critical issue for quality-of-service (QoS) provisioning. Nowadays, a network path often contains at least one wireless link e.g., mobile users having wireless connection to the Internet through laptop PCs or smartphones. Most of the existing tools for measuring ABW have been developed and evaluated in wired networks. Since the characteristics of wired links and wireless links differ in many respects, such as fluctuations incapacity and stability due to the shared and unreliable nature of the wireless links, ABW estimation tools also need to be evaluated for network paths containing at least one wireless link. In this paper, we have extended our previous work, New Enhanced Available Bandwidth Estimation Technique (NEXT) by introducing a parameter-independent curve-fitting technique to detect the ABW from a one-way queuing delay signature and conducted a real test over a radio interface in a 4G/LTE mobile communication network. For the experiments, a commercial 4G/LTE mobile network of a Japanese mobile operator was used. Extensive simulations over an IEEE 802.11 network were also performed. Simulation results as well as real-world experimental results demonstrate that it is feasible to achieve reliable estimates under certain circumstances. Our extended approach, which we call NEXT -- FIT, has very good ABW estimation results under conditions of different packet sizes, dynamic wireless link rates, and channel noises.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122913837","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}
Sangdae Kim, Cheonyong Kim, Hyunchong Cho, Yongbin Yim, Sang-Ha Kim
{"title":"Void Avoidance Scheme for Real-Time Data Dissemination in Irregular Wireless Sensor Networks","authors":"Sangdae Kim, Cheonyong Kim, Hyunchong Cho, Yongbin Yim, Sang-Ha Kim","doi":"10.1109/AINA.2016.59","DOIUrl":"https://doi.org/10.1109/AINA.2016.59","url":null,"abstract":"The real-time data dissemination is based on a minimum delivery speed of each hop on the end-to-end shortest distance in order to ensure to reach the destination within the desired time deadline in hop-by-hop fashion. In other words, the schemes depend not only on single hop-delay, but also on the distance between the source and destination. However, the performance of the real-time data dissemination could suffered from some \"Voids\" in the irregular sensor network which blocks the data forwarding. Namely, the voids lengthen the delivery path and the time for detour the voids. These extended delivery path and time aggravate real-time data dissemination success ratio because the additional distance and time increment were not considered in the calculated minimum delivery speed at source node. To deal with this phenomenon, there are detouring methods of voids such as perimeter routing, back pressure. Although the methods enable a void detouring of data packets, the real-time data dissemination success ratio have not improved much because of a many control message to detour voids. To solve this problem, we propose void avoidance scheme for real-time data dissemination. In our scheme, nodes surrounding a void could detect. This void information are transmitted to whole sensors in the network by broadcasting. When a source transmits data to sink, the source uses the void information to find certain point for avoiding voids by the shortest distance. Thus, the source could set desired speed toward the destination via the point without facing a voids. Performance evaluation shows that our scheme provides better real-time dissemination success ratio in practical environments.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122245284","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}