{"title":"Network Alarm Flood Pattern Mining Algorithm Based on Multi-dimensional Association","authors":"Xudong Zhang, Yuebin Bai, Peng Feng, Weitao Wang, Shuai Liu, Wenhao Jiang, Junfang Zeng, Rui Wang","doi":"10.1145/3242102.3242130","DOIUrl":"https://doi.org/10.1145/3242102.3242130","url":null,"abstract":"In the process of network operation, a large number of alerts are generated every day, which reflect the occurrence of some abnormal conditions. Traditional methods depend too much on the knowledge of equipment manufacturers and industry experts, so we need some novel ways to overcome this problem in the network management. The application of data mining technology to alarm pattern analysis has become the focus of current research. Researchers developed many kinds of algorithms fitting different application characteristics. This paper proposes the concept of association matrix pattern mining, which means that before mining the data, we use the multi-dimensional information of the data to construct the association matrices between the items. And we develop a conditional pattern mining algorithm based on the association matrix which aims to find out less but more meaning results. Our experiments validate that with the multi-dimensional information stored in association matrix, the algorithm performs better than traditional pattern mining methods in finding out the detailed alarm pattern from network alarm flood.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114597702","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":"Machine Learning as a Powerful Tool to Enjoy Future Intelligent Wireless Networks","authors":"W. Ajib","doi":"10.1145/3242102.3277895","DOIUrl":"https://doi.org/10.1145/3242102.3277895","url":null,"abstract":"Wireless communication systems are irreversibly changing our lives. Today, wireless networks are extremely complex systems and they are evolving towards more complex ones because of the increasing diversity and heterogeneity of applications, devices, quality requirements and standards. At the same time, resources used by wireless communications are either naturally limited e.g., time, spectrum, or need to be optimally exploited e.g., energy, computation, infrastructure. Hence, traditional resource allocation approaches that are based on optimization and heuristic techniques start to show their limitations. Those approaches are often centrally-managed, reactive, and not adaptive. They also require a huge amount of control data exchange. Hence, there is a need for new approaches to provide adaptive, proactive and self-organized networking solutions. Thanks to the availability of increasingly powerful computing systems and of huge amount of data that can be efficiently exploited in wireless networks, we envision the employment of machine learning techniques in order to achieve intelligent, adaptive, resource-efficient and data-driven future wireless networks. This talk discusses how wireless network designers and operators can employ and adopt advanced machine learning techniques for adding predictive and adaptive intelligence to the system. The state of the art of using machine learning in wireless networks will be deeply discussed and some interesting issues for new research avenues will be identified.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128917505","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":"Information-Centric Intelligent Vehicular Networks: Challenges and Guidelines","authors":"Rodolfo W. L. Coutinho, A. Boukerche","doi":"10.1145/3242102.3277846","DOIUrl":"https://doi.org/10.1145/3242102.3277846","url":null,"abstract":"Multimedia data traffic will explosively increase in vehicular networking scenarios as the current advances in vehicular communication technologies and connected cars penetrate on the market. However, current data dissemination protocols and even the host-centric content delivery paradigm will not support the anticipated traffic load without degrading vehicular applications QoS/QoE. Recent research efforts are proposing the information-centric networking paradigm as a viable solution for handling multimedia content distribution in vehicular networks and connected and autonomous vehicles [1-10].","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114093246","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}
Wei Bao, Dong Yuan, Zhengjie Yang, Shen Wang, B. Zhou, Stewart Adams, Albert Y. Zomaya
{"title":"sFog: Seamless Fog Computing Environment for Mobile IoT Applications","authors":"Wei Bao, Dong Yuan, Zhengjie Yang, Shen Wang, B. Zhou, Stewart Adams, Albert Y. Zomaya","doi":"10.1145/3242102.3242107","DOIUrl":"https://doi.org/10.1145/3242102.3242107","url":null,"abstract":"Fog computing is a promising solution to provide low-latency and ubiquitously available computation offloading services to widely distributed Internet of Things (IoT) devices with limited computing capabilities. One obstacle, however, is how to seamlessly hand over mobile IoT devices among different fog nodes to avoid service interruption. In this paper, we propose seamless fog (sFog), a new framework supporting efficient congestion control and seamless handover schemes. Intrinsically, sFog improves system performance during handovers (achieved by the handover scheme), and guarantees the performance does not degrade when handovers do not occur (achieved by the congestion control scheme). Through the congestion control scheme, jobs are efficiently offloaded without causing unnecessary system idling; through the handover scheme, jobs are pre-migrated to the target fog node when a handover is about to occur, in order to reduce migration delay. In order to evaluate the performance of sFog, we propose a theoretical framework and establish a real-world prototype. Both the theoretical and experimental results show that sFog achieves substantial delay reductions compared with traditional benchmark handover schemes.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"275 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121485782","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":"FastLink","authors":"Irmak Aykin, M. Krunz","doi":"10.1145/3242102.3242105","DOIUrl":"https://doi.org/10.1145/3242102.3242105","url":null,"abstract":"To overcome the high propagation loss and satisfy a given link budget, millimeter wave (mmW) communication systems rely on highly directional antennas, both at the base station (BS) and the user equipment (UE). Due to this directionality, initial access (IA) and association can be particularly challenging. Existing approaches for IA in directional networks suffer from long discovery time and/or high misdetection probability of the UE. In this paper, we propose FastLink, an efficient IA protocol for mmW systems with electronically steerable antennas. FastLink always transmits/receives using the narrowest possible beam, allowing high beamforming gains and low misdetection rate. It uses a unique binary-search-based algorithm, called 3DPF, to scan only a small subset of the angular space and find in logarithmic time the best transmit-receive beam pair. We formulate the beam-finding process as a sparse problem, exploiting the poor scattering nature of mmW channels. Compressive sensing is then used to determine the minimum number of measurements needed to reconstruct the sparse channel. 3DPF is incorporated into FastLink to establish the directional link, and the required messaging between the BS and the UE is explained in detail. For performance evaluation purposes, we first conduct simulations based on NYU mmW channel model and then experiment with a custom mmW testbed utilizing uniform planar arrays and operating at $29$ GHz frequency. Our extensive simulations and hardware experiments verify the efficiency of FastLink, and show that 3DPF can reduce the search time by $65-99%$ compared to 802.11ad-like beam finding scheme.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116896438","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":"Maximizing Mobiles Energy Saving Through Tasks Optimal Offloading Placement in two-tier Cloud","authors":"H. Mazouzi, N. Achir, K. Boussetta","doi":"10.1145/3242102.3242133","DOIUrl":"https://doi.org/10.1145/3242102.3242133","url":null,"abstract":"In this paper, we focus on tasks offloading over two tiered mobile cloud computing environment. We consider several users with energy constrained tasks that can be offloaded over cloudlets or on a remote cloud with differentiated system and network resources capacities. We investigate offloading policy that decides which tasks should be offloaded and determine the offloading location on the cloudlets or on the cloud. The objective is to minimize the total energy consumed by the users. We formulate this problem as a Non-Linear Binary Integer Programming. Since the centralized optimal solution is NP-hard, we propose a distributed linear relaxation heuristic based on Lagrangian decomposition approach. To solve the subproblems, we also propose a greedy heuristic that computes the best cloudlet selection and bandwidth allocation following tasks' energy consumption. We compared our proposal against existing approaches under different system parameters (e.g. CPU resources), variable number of users and for six applications, each having specific traffic pattern, resource demands and time constraints. Numerical results show that our proposal outperforms existing approaches. We also analyze the performance of our proposal for each application.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127309848","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":"Collision-Free Broadcast Methods for IEEE 802.15.4-TSCH Networks Formation","authors":"A. Karalis, Dimitrios Zorbas, C. Douligeris","doi":"10.1145/3242102.3242108","DOIUrl":"https://doi.org/10.1145/3242102.3242108","url":null,"abstract":"One of the most recent and reliable MAC protocols for low-rate wireless personal area networks is the IEEE802.15.4-TSCH. The formation of an IEEE802.15.4-TSCH network depends on the periodic transmission of Enhanced Beacons (EBs), and, by extension, on the scheduling of EB transmissions. In this paper, we present and analyze a negative phenomenon that can occur in most of the autonomous EB scheduling methods proposed in the literature. This phenomenon, which we call full collision, takes place when all the neighboring EB transmissions of a joining node collide. As a consequence, a node may not be able to join the network fast, consuming a considerable amount of energy as well. In order to eliminate collisions during EB transmissions, and, thus, to avoid the occurrence of this phenomenon, we propose a novel autonomous collision-free EB scheduling policy. The results of our simulations demonstrate the superiority of our policy compared to two other recently proposed policies.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128004678","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}
Thomas Begin, A. Busson, I. G. Lassous, A. Boukerche
{"title":"Video on Demand in IEEE 802.11p-based Vehicular Networks: Analysis and Dimensioning","authors":"Thomas Begin, A. Busson, I. G. Lassous, A. Boukerche","doi":"10.1145/3242102.3242109","DOIUrl":"https://doi.org/10.1145/3242102.3242109","url":null,"abstract":"We consider a VoD (Video on-Demand) platform designed for vehicles traveling on a highway or other major roadway. Typically, cars or buses would subscribe to this delivery service so that their passengers get access to a catalog of movies and series stored on a back-end server. Videos are delivered through IEEE 802.11p Road Side Units deployed along the highway. In this paper, we propose a simple analytical and yet accurate solution to estimate (at the speed of a click) two key performance parameters for a VoD platform: (i) the total amount of data downloaded by a vehicle over its journey and (ii) the total \"interruption time'', which corresponds to the time a vehicle spends with the playback of its video interrupted because of an empty buffer. After validating its accuracy against a set of simulations run with ns-3, we show an example of application of our analytical solution for the sizing of an IEEE 802.11p-based VoD platform.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134220239","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":"An Intrusion Detection System for Constrained WSN and IoT Nodes Based on Binary Logistic Regression","authors":"Christiana Ioannou, V. Vassiliou","doi":"10.1145/3242102.3242145","DOIUrl":"https://doi.org/10.1145/3242102.3242145","url":null,"abstract":"In this paper we evaluate the feasibility of running a lightweight Intrusion Detection System within a constrained sensor or IoT node. We propose mIDS, which monitors and detects attacks using a statistical analysis tool based on Binary Logistic Regression (BLR). mIDS takes as input only local node parameters for both benign and malicious behavior and derives a normal behavior model that detects abnormalities within the constrained node.We offer a proof of correct operation by testing mIDS in a setting where network-layer attacks are present. In such a system, critical data from the routing layer is obtained and used as a basis for profiling sensor behavior. Our results show that, despite the lightweight implementation, the proposed solution achieves attack detection accuracy levels within the range of 96% - 100%.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133668310","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":"Analytical Model for Performance Evaluation of Random Wireless Sensor Networks","authors":"Fabian Giertzsch, Leo Krüger, A. Timm‐Giel","doi":"10.1145/3242102.3242144","DOIUrl":"https://doi.org/10.1145/3242102.3242144","url":null,"abstract":"Today Wireless Sensor Networks (WSNs) can be found in many application areas, e.g. they are used in smart home systems or in industrial settings in order to monitor and control machinery. The latter usually requires a guaranteed performance of the network. This mainly addresses the real-time capability of the network, i.e. knowledge of possible delays which occur on the multi-hop route between sender and receiver is needed. In this paper, a novel approach to model multi-hop networks with a fixed number of nodes uniformly distributed on a square area is proposed. Accordingly, no explicit knowledge of the routing and the topology is needed. That is, no specific network is reflected, but a class of random networks sharing common properties is modelled. In our model, all nodes generate frames according to a Poisson process with the same rate and send them to a common gateway. Based on this scenario, we deduce a mathematical model for the probability of simultaneous transmissions assuming that a generic CSMA MAC protocol is implemented. We use this result in order to derive an expression for the mean delays arising on the links, i.e. the medium access and queueing delay, of the multi-hop route in the special case of the IEEE 802.15.4 MAC and PHY protocols being used. The model results correspond well to an OMNeT++ simulation if the offered traffic does not exceed a certain limit. Beyond this limit, up to the capacity of the network, the model still captures the behaviour of the simulation but the deviation grows.","PeriodicalId":241359,"journal":{"name":"Proceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122825427","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}