{"title":"PhD Forum: Data traffic classification using deep learning models","authors":"M. M. Raikar","doi":"10.1109/WoWMoM51794.2021.00035","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00035","url":null,"abstract":"The growth in data traffic is exponential with the usage of network applications in mundane activities. The network operators are posed with the challenge of providing Quality of Experience (QoE) to the deluge of internet users. Network traffic classification plays a significant role in network resource management with prominent security, billing, and accounting applications. In this paper, the network data traffic classification is performed using the Deep Learning (DL) models. The previous data traffic mechanism fails when the scale in data generated is in Exabytes per day from the perspective of the internet user. The network resource management is automated by classification of the traffic without intervening by the operator. The dataset is collected from the campus network for different applications.The network traffic classification is performed using the AlexNet, ResNet, and GoogLeNet DL models. The accuracy obtained for ResNet is 95%, AlexNet is 75%, and GoogLeNet is 91%. The challenge in network traffic classification is converting the packet capture files to the data type requirements of the Convolution Neural Networks (CNN) as an image. The four different network applications are considered for traffic classification. In the next-generation network architecture, artificial intelligence will be an integral part. It reduces the human intervention in traffic characterization and analysis, which aids in meeting the QoE requirements of the users.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121491953","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}
F. Buccafurri, V. D. Angelis, Maria Francesca Idone, Cecilia Labrini
{"title":"WIP: An Onion-Based Routing Protocol Strengthening Anonymity","authors":"F. Buccafurri, V. D. Angelis, Maria Francesca Idone, Cecilia Labrini","doi":"10.1109/WoWMoM51794.2021.00041","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00041","url":null,"abstract":"Anonymous Communication Networks (ACNs) are networks in which, beyond data confidentiality, also traffic flow confidentiality is provided. The most popular routing approach for ACNs also used in practice is Onion. Onion is based on multiple encryption wrapping combined with the proxy mechanism (relay nodes). However, it offers neither sender anonymity nor recipient anonymity in a global passive adversary model, simply because the adversary can observe (at the first relay node) the traffic coming from the sender, and (at the last relay node) the traffic delivered to the recipient. This may also cause a loss of relationship anonymity if timing attacks are performed. This paper presents Onion-Ring, a routing protocol that improves anonymity of Onion in the global adversary model, by achieving sender anonymity and recipient anonymity, and thus relationship anonymity.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123092296","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}
Caitao Zhan, Mohammad Ghaderibaneh, Pranjal Sahu, Himanshu Gupta
{"title":"DeepMTL: Deep Learning Based Multiple Transmitter Localization","authors":"Caitao Zhan, Mohammad Ghaderibaneh, Pranjal Sahu, Himanshu Gupta","doi":"10.1109/WoWMoM51794.2021.00017","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00017","url":null,"abstract":"In this paper, we address the problem of Multiple Transmitters Localization (MTL), i.e., to determine the locations of potential multiple transmitters in a field, based on readings from a distributed set of sensors. In contrast to the widely studied single transmitter localization problem, the MTL problem has only been studied recently in a few works. MTL problem is of great significance in many applications wherein intruders may be present. E.g., in shared spectrum systems, detection of unauthorized transmitters is imperative to efficient utilization of the shared spectrum.In this paper, we present DeepMTL, a novel deep-learning approach to address the MTL problem. In particular, we frame MTL as a sequence of two steps, each of which is a computer vision problem: image-to-image translation and object detection. The first step of image-to-image translation essentially maps an input image representing sensor readings to an image representing distribution of transmitter locations, and the second object detection step derives precise locations of transmitters from the image of transmitter distributions. For the first step, we design our learning model sen2peak, while for the second step, we customize a state-of-the-art object detection model YOLOv3-cust. We demonstrate the effectiveness of our approach via extensive large-scale simulations, and show that our approach outperforms the previous approaches significantly (by 50% or more) in accuracy performance metrics, and incurs an order of magnitude less latency compared to other prior works.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122433740","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":"Feasibility of Multipath Construction in mmWave Backhaul","authors":"Yan Yan, Qiang Hu, D. Blough","doi":"10.1109/WoWMoM51794.2021.00021","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00021","url":null,"abstract":"This paper focuses on the problem of finding multiple paths with relay nodes to maximize throughput for ultra-high-rate millimeter wave (mmWave) backhaul networks in urban environments. Relays are selected between a pair of source and destination base stations to form multiple interference-free paths. We first formulate the problem of feasibility of multi-path construction as a constraint satisfaction problem that includes constraints on intra-path and inter-path interference and several other constraints that arise from the problem setting. Based on the derived equations, we transform the multiple paths construction problem into a Boolean satisfiability problem. This problem can then be solved through use of a satisfiability (SAT) solver, which however results in a very high running time for realistic problem sizes. To address this, we propose a heuristic algorithm that runs in a fraction of the time of the SAT solver and finds multiple interference-free paths using a modification of a maximum flow algorithm. Simulation results based on 3-D models of a section of downtown Atlanta show that the heuristic algorithm finds multiple paths in almost all the feasible cases (those where the SAT solver succeeds in finding a solution) and produces paths with higher average throughput than the SAT solver. Furthermore, the heuristic increases throughput by 50-100% in typical cases compared to a single-path solution.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130285723","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 Novel Method for Analyzing Weather Effect on Smart City Traffic","authors":"A. Nasser, V. Simon","doi":"10.1109/WoWMoM51794.2021.00061","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00061","url":null,"abstract":"Traffic congestion has become more concerning as the number of cars has rapidly increased in urban environments, resulting in dangerous pollution levels amid global warming. The effect of weather factors on traffic flow is evident thus studying this relationship can improve traffic prediction, which can help us to prevent or dissolve traffic congestion in smart cities where intelligent transportation systems have been deployed. In this paper, a new method, the Weather Based Traffic Analysis (hereafter WBTA) has been proposed to investigate the temporal correlations between traffic flow and exogenous weather factors, at different frequencies and time intervals. This can help in the proper selection of the most important weather factors which influence traffic flow behavior, in addition to the duration of that effect. This can help in choosing input parameters of a multi-input traffic prediction model. Several weather factors are analyzed, however, for the sake of this paper, the precipitation factor is discussed.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236883","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}
Elvina Gindullina, Sebastian Mortag, M. Dudin, L. Badia
{"title":"Multi-Agent Navigation of a Multi-Storey Parking Garage via Game Theory","authors":"Elvina Gindullina, Sebastian Mortag, M. Dudin, L. Badia","doi":"10.1109/WoWMoM51794.2021.00052","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00052","url":null,"abstract":"Intelligent autonomous vehicles navigating in a smart city environment need to find a parking spot, and often resort to multi-storey parking facilities. The task of efficiently using parking resources is at odds with the competitive nature of autonomous vehicles operating in a selfish way. In this paper, we model the problem through game theory and we evaluate the efficiency of a distributed decision mechanism. At the same time, we also gain insight on the complexity of identifying efficient solutions and hint that the overall problem is difficult to solve without compromising the inherent selfish objective of each individual vehicle. We also propose some distributed simulation scenarios to capture some aspects of the competition, thereby suggesting possible further analytical studies.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028115","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":"Serving HTC and Critical MTC in a RAN Slice","authors":"V. Mancuso, P. Castagno, M. Sereno, M. Marsan","doi":"10.1109/WoWMoM51794.2021.00032","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00032","url":null,"abstract":"We consider a slice of a radio access network where human and machine users access services with either high throughput or low latency requirements. The slice offers both eMBB and URLLC service categories to serve HTC (Human-Type Communication) and MTC (Machine-Type Communication) traffic. We propose to use eMBB for both HTC and MTC, transferring machine traffic to URLLC only when eMBB is not able to meet the low latency requirements of MTC. We show that by so doing the slice is capable of providing very good performance to about one hundred MTC users under high HTC traffic conditions. Instead, running time-critical MTC over only eMBB is not doable at all, whereas using URLLC suffices for at most a few tens of devices. Therefore, our approach improves the number of users served by the slice by one order of magnitude, without requiring extra resources or compromising performance. To study system performance we develop a novel analytical model of uplink packet transmissions, which covers both legacy eMBB-or URLLC-based MTC, as well as our compound approach. Our model allows to tune slice parameters so as to achieve the desired balance between HTC and MTC service guarantees. We validate the model against detailed simulations using as an example an autonomous driving scenario.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115544926","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}
Marco Picone, S. Mariani, M. Mamei, F. Zambonelli, Mirko Berlier
{"title":"WIP: Preliminary Evaluation of Digital Twins on MEC Software Architecture","authors":"Marco Picone, S. Mariani, M. Mamei, F. Zambonelli, Mirko Berlier","doi":"10.1109/WoWMoM51794.2021.00047","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00047","url":null,"abstract":"Digital Twins (DTs) are becoming a reference design abstraction for many Internet of Things (IoT) application scenarios. Also, data processing is shifting to a decentralised setting leveraging the edge computing paradigm to move computation closer to the physical devices. In this context, Multi-access Edge Computing (MEC) technologies on 5G cellular networks are redefining the IoT networking infrastructure by enabling ultra low latency, and reliable and responsive connectivity. However, evaluation of the MEC architecture from the application developer standpoint is currently missing from literature, as well as an assessment of performance while adopting DT on top of MEC. Therefore, this paper reports on a MEC implementation based on OpenNESS toolkit, in the context of DT-based mobility, and an evaluation of its service-level performance.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125912017","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. Giannopoulos, S. Spantideas, N. Capsalis, P. Gkonis, Panos Karkazis, L. Sarakis, P. Trakadas, C. Capsalis
{"title":"WIP: Demand-Driven Power Allocation in Wireless Networks with Deep Q-Learning","authors":"A. Giannopoulos, S. Spantideas, N. Capsalis, P. Gkonis, Panos Karkazis, L. Sarakis, P. Trakadas, C. Capsalis","doi":"10.1109/WoWMoM51794.2021.00045","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00045","url":null,"abstract":"Power allocation is strongly related to the coverage and capacity of wireless networks, playing a critical role in the development of 5G networks. This paper proposes a Demand-Driven Power Allocation (DDPA) algorithm aiming to fulfill the requested throughput of individual users and accommodate their needs. DDPA is based on model-free Deep Reinforcement Learning (DRL) approaches and has the ability to proactively adjust the power levels of network transmitters. The performance of the developed algorithm is evaluated for a variety of simulation parameters and variable user demands. According to the presented results, the DDPA scheme exhibits a near-optimal performance for up to 50 users in the network area (i.e. satisfaction percentage exceeds 95%), with each one requesting 1 Mbps. Moreover, performance comparison between DDPA and two typical baseline methods reveals that the former results into enhanced total allocated throughput solutions (i.e. a performance increase by a factor of approximately 9% against baseline methods).","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122172127","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. Petrosino, Giancarlo Sciddurlo, Sergio Martiradonna, D. Striccoli, G. Piro, G. Boggia
{"title":"WIP: An Open-Source Tool for Evaluating System-Level Performance of NB-IoT Non-Terrestrial Networks","authors":"A. Petrosino, Giancarlo Sciddurlo, Sergio Martiradonna, D. Striccoli, G. Piro, G. Boggia","doi":"10.1109/WoWMoM51794.2021.00042","DOIUrl":"https://doi.org/10.1109/WoWMoM51794.2021.00042","url":null,"abstract":"Satellite Communication is expected to play a leading role in 5G & Beyond networks. Current studies, however, focus the attention on physical and link-level aspects, while ignoring to evaluate system-level performance. This paper presents a novel simulation tool, conceived as a new module for the open-source 5G-air-simulator, modeling NB-IoT satellite-based communication systems. Specifically, it implements several link-to-system abstraction models, the cell selection procedure, and a configurable satellite constellation. Furthermore, these essential features are successfully integrated within the rest of the 5G-air-simulator, thus offering the opportunity to test flexible network deployments (e.g., by varying the number and the distribution of users) under different application statistics. To demonstrate the actual effectiveness of the developed tool, this work also presents a preliminary performance assessment of an NB-IoT satellite-based communication system enabling reference monitoring scenarios.","PeriodicalId":131571,"journal":{"name":"2021 IEEE 22nd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129830634","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}