Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00021
Theodoros Giannakas, T. Spyropoulos, O. Smid
Network slicing has been proposed as a paradigm for 5G+ networks. The operators slice physical resources from the edge, all the way to datacenter, and are responsible to micromanage the allocation of these resources among tenants bound by predefined Service Level Agreements (SLAs). A key task, for which recent works have advocated the use of Deep Neural Networks (DNNs), is tracking the tenant demand and scaling its resources. Nevertheless, for edge resources (e.g. RAN), a question arises whether operators can: (a) scale edge resources fast enough (often in the order of ms) and (b) afford to transmit huge amounts of data towards a cloud where such a DNN-based algorithm might operate. We propose a Distributed-DNN architecture for a class of such problems: a small subset of the DNN layers at the edge attempt to act as fast, standalone resource allocator; this is coupled with a Bayesian mechanism to intelligently offload a subset of (harder) decisions to additional DNN layers running at a remote cloud. Using the publicly available Milano dataset, we investigate how such a DDNN should be jointly trained, as well as operated, to efficiently address (a) and (b), resolving up to 60% of allocation decisions locally with little or no penalty on the allocation cost.
{"title":"Fast and accurate edge resource scaling for 5G/6G networks with distributed deep neural networks","authors":"Theodoros Giannakas, T. Spyropoulos, O. Smid","doi":"10.1109/WoWMoM54355.2022.00021","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00021","url":null,"abstract":"Network slicing has been proposed as a paradigm for 5G+ networks. The operators slice physical resources from the edge, all the way to datacenter, and are responsible to micromanage the allocation of these resources among tenants bound by predefined Service Level Agreements (SLAs). A key task, for which recent works have advocated the use of Deep Neural Networks (DNNs), is tracking the tenant demand and scaling its resources. Nevertheless, for edge resources (e.g. RAN), a question arises whether operators can: (a) scale edge resources fast enough (often in the order of ms) and (b) afford to transmit huge amounts of data towards a cloud where such a DNN-based algorithm might operate. We propose a Distributed-DNN architecture for a class of such problems: a small subset of the DNN layers at the edge attempt to act as fast, standalone resource allocator; this is coupled with a Bayesian mechanism to intelligently offload a subset of (harder) decisions to additional DNN layers running at a remote cloud. Using the publicly available Milano dataset, we investigate how such a DDNN should be jointly trained, as well as operated, to efficiently address (a) and (b), resolving up to 60% of allocation decisions locally with little or no penalty on the allocation cost.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"11 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128329466","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00066
Hongya Wang, H. Luan
In recent years, most indoor localization systems coordinate the angle of arrival (AoA) of multiple access points (APs) for triangulation or sacrifice the availability of the system in order to obtain accurate time of flight (ToF), which is not conducive to the actual deployment of the system. The recent standardization by IEEE of Fine Timing Measurement (FTM), a native firmware implementation ToF based approach for ranging. In this way, we can pay more attention to AoA-based localization system. We present SAP-AoA, a WIFI based localization system, which only requires one AP and one channel to complete localization. To accomplish this, we use two incident angles and the distance between two antennas to determine the unique constraint of the target, and then search the localization field to get the target. At the same time, we simulate the FTM value and use it with SAP-AoA to obtain better positioning accuracy. We implemented SAP-AoA using Intel 5300 commodity WIFI cards and deployed it in four environments with different multipath propagation. Results indicate the best median localization error is 0.85m.
{"title":"Toward Reliable Localization with a Single Unaided Receiver by AoA","authors":"Hongya Wang, H. Luan","doi":"10.1109/WoWMoM54355.2022.00066","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00066","url":null,"abstract":"In recent years, most indoor localization systems coordinate the angle of arrival (AoA) of multiple access points (APs) for triangulation or sacrifice the availability of the system in order to obtain accurate time of flight (ToF), which is not conducive to the actual deployment of the system. The recent standardization by IEEE of Fine Timing Measurement (FTM), a native firmware implementation ToF based approach for ranging. In this way, we can pay more attention to AoA-based localization system. We present SAP-AoA, a WIFI based localization system, which only requires one AP and one channel to complete localization. To accomplish this, we use two incident angles and the distance between two antennas to determine the unique constraint of the target, and then search the localization field to get the target. At the same time, we simulate the FTM value and use it with SAP-AoA to obtain better positioning accuracy. We implemented SAP-AoA using Intel 5300 commodity WIFI cards and deployed it in four environments with different multipath propagation. Results indicate the best median localization error is 0.85m.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127152295","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00065
A. Marin, M. Meo, M. Sereno, M. Marsan
We consider an access link of a data network loaded with data flows generated by streaming and elastic services requested by fixed or mobile end users, and subjected to an admission control (AC) algorithm. For the performance analysis of such link we develop a new queuing model and we show that, with the considered AC, the queuing model admits a product form expression for the joint limiting probability distribution of the numbers of active services of the different types. Numerical results show unexpected oscillating behaviors for several performance metrics, and provide interesting insight into the link performance.
{"title":"Modeling Service Mixes in Access Links: Product Form and Oscillations","authors":"A. Marin, M. Meo, M. Sereno, M. Marsan","doi":"10.1109/WoWMoM54355.2022.00065","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00065","url":null,"abstract":"We consider an access link of a data network loaded with data flows generated by streaming and elastic services requested by fixed or mobile end users, and subjected to an admission control (AC) algorithm. For the performance analysis of such link we develop a new queuing model and we show that, with the considered AC, the queuing model admits a product form expression for the joint limiting probability distribution of the numbers of active services of the different types. Numerical results show unexpected oscillating behaviors for several performance metrics, and provide interesting insight into the link performance.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114413064","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00037
Xuening Gao, Longkun Guo, Kewen Liao
Effective monitoring of applications in wireless sensor networks can be underpinned by the multiple coverage problem with unit disks. In the problem, we are given a set of targets T = {t1, t2, …, tn} distributed in the plane, where ti needs to be covered f(ti) times for any positive integer f(ti). The aim is to place a minimum number of disks, such that all the targets can be covered as desired. In the paper, we first present a 5-approximation algorithm with runtime O(n + m) for m = maxi{f(ti)}. Then, we give a theoretically improved 4-approximation algorithm, albeit with an increased time complexity to O(n2). In addition, we consider the online setting where targets arrive in sequence and upon each arrival the corresponding coverage disk must be placed. For this setting, we devise an online algorithm with a competitive ratio of 6 and constant update time. To verify aforementioned theoretical findings, numerical experiments are conducted to demonstrate and compare the practical performance of the proposed algorithms.
{"title":"Fast Approximation Algorithms for Multiple Coverage with Unit Disks","authors":"Xuening Gao, Longkun Guo, Kewen Liao","doi":"10.1109/WoWMoM54355.2022.00037","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00037","url":null,"abstract":"Effective monitoring of applications in wireless sensor networks can be underpinned by the multiple coverage problem with unit disks. In the problem, we are given a set of targets T = {t1, t2, …, tn} distributed in the plane, where ti needs to be covered f(ti) times for any positive integer f(ti). The aim is to place a minimum number of disks, such that all the targets can be covered as desired. In the paper, we first present a 5-approximation algorithm with runtime O(n + m) for m = maxi{f(ti)}. Then, we give a theoretically improved 4-approximation algorithm, albeit with an increased time complexity to O(n2). In addition, we consider the online setting where targets arrive in sequence and upon each arrival the corresponding coverage disk must be placed. For this setting, we devise an online algorithm with a competitive ratio of 6 and constant update time. To verify aforementioned theoretical findings, numerical experiments are conducted to demonstrate and compare the practical performance of the proposed algorithms.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130026290","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00093
Hasan Kivrak, P. D. E. Baniqued, S. Watson, B. Lennox
Digital twins tend to be on the way of becoming the future of robots, artificial intelligence, and IoT devices, especially in industrial applications. Creating a digital twin solution will help to solve challenges faced in managing the tasks in their operating environment since it enables an integrated solution for the framework that seamlessly connects to their physical counterparts with the latest internet technologies. In this study, we aim to develop a synchronous, situational-aware, bi-directional/multi-directional digital twin platform that allows us to perceive real-time/simultaneous flow of sensory environmental data and remotely operate robots through digital twins for continuous inspection. To achieve this aim, we will investigate the interoperability issues in robot teleoperation with 3D mapping of a remote unknown environment case scenario.
{"title":"An Investigation of the Network Characteristics and Requirements of 3D Environmental Digital Twins for Inspection Robots","authors":"Hasan Kivrak, P. D. E. Baniqued, S. Watson, B. Lennox","doi":"10.1109/WoWMoM54355.2022.00093","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00093","url":null,"abstract":"Digital twins tend to be on the way of becoming the future of robots, artificial intelligence, and IoT devices, especially in industrial applications. Creating a digital twin solution will help to solve challenges faced in managing the tasks in their operating environment since it enables an integrated solution for the framework that seamlessly connects to their physical counterparts with the latest internet technologies. In this study, we aim to develop a synchronous, situational-aware, bi-directional/multi-directional digital twin platform that allows us to perceive real-time/simultaneous flow of sensory environmental data and remotely operate robots through digital twins for continuous inspection. To achieve this aim, we will investigate the interoperability issues in robot teleoperation with 3D mapping of a remote unknown environment case scenario.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130121054","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00017
Justus Rischke, Christian L. Vielhaus, Peter Sossalla, Sebastian Itting, Giang T. Nguyen, F. Fitzek
5G campus networks, whose advantages include flexible deployment, can be a promising candidate for production plants to complement existing Wifi-based networks. Toward that goal, 5G has to satisfy strict requirements about real-time communication to facilitate novel use cases. However, the realtime-capability of 5G is not well understood yet. In this work, we deliver insights into the functioning of 5G NR RAN Release 15, which includes actual one-way delay and Round-Trip Time (RTT) measurements for Downlink and Uplink in a private 5G Standalone campus network. The extensive measurement results reveal that these delays are correlated, and the corresponding RTT, i.e. the sum of Downlink and Uplink delays, is discreetly clustered, ranging between 12ms and 40ms. The measurements also show that the distribution of RTTs is mainly dependent on the packet rates and their inter-arrival times. Our study helps expand the current understanding of 5G used for latency-critical applications. We make the code and the measurement data traces publicly available as the IEEE DataPort 5G Campus Networks: Measurement Traces dataset (DOI 10.21227/xe3c-e968).
5G园区网络的优势包括灵活部署，可以成为生产工厂补充现有wifi网络的有希望的候选者。为了实现这一目标，5G必须满足对实时通信的严格要求，以促进新的用例。然而，5G的实时能力还没有得到很好的理解。在这项工作中，我们深入了解了5G NR RAN Release 15的功能，其中包括在专用5G独立校园网中下行链路和上行链路的实际单向延迟和往返时间(RTT)测量。广泛的测量结果表明，这些延迟是相关的，相应的RTT，即下行链路和上行链路延迟的总和，被谨慎地聚类，范围在12ms到40ms之间。测量结果还表明，rtt的分布主要取决于分组速率和它们的间隔到达时间。我们的研究有助于扩展目前对用于延迟关键应用的5G的理解。我们将代码和测量数据跟踪作为IEEE DataPort 5G校园网:测量跟踪数据集(DOI 10.21227/xe3c-e968)公开提供。
{"title":"Empirical Study of 5G Downlink & Uplink Scheduling and its Effects on Latency","authors":"Justus Rischke, Christian L. Vielhaus, Peter Sossalla, Sebastian Itting, Giang T. Nguyen, F. Fitzek","doi":"10.1109/WoWMoM54355.2022.00017","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00017","url":null,"abstract":"5G campus networks, whose advantages include flexible deployment, can be a promising candidate for production plants to complement existing Wifi-based networks. Toward that goal, 5G has to satisfy strict requirements about real-time communication to facilitate novel use cases. However, the realtime-capability of 5G is not well understood yet. In this work, we deliver insights into the functioning of 5G NR RAN Release 15, which includes actual one-way delay and Round-Trip Time (RTT) measurements for Downlink and Uplink in a private 5G Standalone campus network. The extensive measurement results reveal that these delays are correlated, and the corresponding RTT, i.e. the sum of Downlink and Uplink delays, is discreetly clustered, ranging between 12ms and 40ms. The measurements also show that the distribution of RTTs is mainly dependent on the packet rates and their inter-arrival times. Our study helps expand the current understanding of 5G used for latency-critical applications. We make the code and the measurement data traces publicly available as the IEEE DataPort 5G Campus Networks: Measurement Traces dataset (DOI 10.21227/xe3c-e968).","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122913851","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}
Pub Date : 2022-06-01DOI: 10.1109/wowmom54355.2022.00009
{"title":"Reviewers: SwarmNet 2022","authors":"","doi":"10.1109/wowmom54355.2022.00009","DOIUrl":"https://doi.org/10.1109/wowmom54355.2022.00009","url":null,"abstract":"","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"637 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122949851","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}
In recent years, mobile traffic has gradually become a major part of network traffic. To attract customers, mobile network operators provide free-traffic, which is a preferential policy that is free of charge for specific application traffic. Since the emergence of free-traffic, fake free-traffic also appeared soon. Fake free-traffic is a malicious behavior, which helps attackers illegally use network resources and evade network resource charging. The appearance of fake free-traffic maliciously harms the interests of operators and disrupts the rules of network resource charging. Because of the uniqueness of free-traffic, it encapsulates a layer of the HTTP protocol in addition to the actual application communication protocol, existing studies on encrypted traffic analysis are not applicable to identify fake free-traffic. In this paper, we propose Burst Series Based Approach (BSBA), a novel method for identifying fake free-traffic. The key idea behind BSBA is to construct effective features by capturing the differences of burst series among fake free-traffic, free-traffic and non-free traffic, and combine the constructed features with machine learning algorithms to identify fake free-traffic. We collect a real-world traffic dataset and conduct evaluations to verify the effectiveness of the BSBA. Experiment results demonstrate that the BSBA achieves excellent performances (96.82% Accuracy, 96.46% Precision, 96.57% Recall and 96.51% F1-score) and is superior to the state-of-the-art methods.
{"title":"BSBA: Burst Series Based Approach for Identifying Fake Free-traffic","authors":"Sijia Li, Chang Liu, Zhuguo Li, Qingya Yang, Anlin Xu, Gaopeng Gou","doi":"10.1109/WoWMoM54355.2022.00019","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00019","url":null,"abstract":"In recent years, mobile traffic has gradually become a major part of network traffic. To attract customers, mobile network operators provide free-traffic, which is a preferential policy that is free of charge for specific application traffic. Since the emergence of free-traffic, fake free-traffic also appeared soon. Fake free-traffic is a malicious behavior, which helps attackers illegally use network resources and evade network resource charging. The appearance of fake free-traffic maliciously harms the interests of operators and disrupts the rules of network resource charging. Because of the uniqueness of free-traffic, it encapsulates a layer of the HTTP protocol in addition to the actual application communication protocol, existing studies on encrypted traffic analysis are not applicable to identify fake free-traffic. In this paper, we propose Burst Series Based Approach (BSBA), a novel method for identifying fake free-traffic. The key idea behind BSBA is to construct effective features by capturing the differences of burst series among fake free-traffic, free-traffic and non-free traffic, and combine the constructed features with machine learning algorithms to identify fake free-traffic. We collect a real-world traffic dataset and conduct evaluations to verify the effectiveness of the BSBA. Experiment results demonstrate that the BSBA achieves excellent performances (96.82% Accuracy, 96.46% Precision, 96.57% Recall and 96.51% F1-score) and is superior to the state-of-the-art methods.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128149062","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00070
Kaixuan Zheng, S. Zou, Guosheng Xu, Zixiang Bi
With the rapid development of Internet of Vehicles and autonomous driving technologies, car manufacturers provide more comfortable and safe driving experience while gradually exposing their vehicles to the background of cyber-attacks. As the car’s interior communicates through the CAN bus, the intrusion detection for CAN bus becomes crucial. Some studies use bus data characteristics, machine learning algorithms, or information theory algorithms to perform intrusion detection on the CAN bus, but they have problems such as low detection accuracy, high performance requirements, and insufficient detection granularity. This paper innovatively proposes a lightweight detection algorithm—Segment Detection Algorithm (SDA), which calculates the bit flip rate by segment, discovers the variation relationship between bits within each segment, and utilizes multiple inter-message features to achieve the detection of abnormal traffic. Experiments show that compared with existing research, the algorithm has effectively improved the detection accuracy, especially the detection of replay attacks. In addition, the algorithm has extremely low time complexity, can adapt to the limited resources in the vehicle environment, and achieve high-precision real-time detection of abnormal traffic.
{"title":"Segment Detection Algorithm: CAN bus intrusion detection based on Bit Constraint","authors":"Kaixuan Zheng, S. Zou, Guosheng Xu, Zixiang Bi","doi":"10.1109/WoWMoM54355.2022.00070","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00070","url":null,"abstract":"With the rapid development of Internet of Vehicles and autonomous driving technologies, car manufacturers provide more comfortable and safe driving experience while gradually exposing their vehicles to the background of cyber-attacks. As the car’s interior communicates through the CAN bus, the intrusion detection for CAN bus becomes crucial. Some studies use bus data characteristics, machine learning algorithms, or information theory algorithms to perform intrusion detection on the CAN bus, but they have problems such as low detection accuracy, high performance requirements, and insufficient detection granularity. This paper innovatively proposes a lightweight detection algorithm—Segment Detection Algorithm (SDA), which calculates the bit flip rate by segment, discovers the variation relationship between bits within each segment, and utilizes multiple inter-message features to achieve the detection of abnormal traffic. Experiments show that compared with existing research, the algorithm has effectively improved the detection accuracy, especially the detection of replay attacks. In addition, the algorithm has extremely low time complexity, can adapt to the limited resources in the vehicle environment, and achieve high-precision real-time detection of abnormal traffic.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132960850","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}
Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00048
T. Wahl, D. Borrmann, M. Bleier, A. Nüchter, T. Wiemann, T. Hänel, N. Aschenbruck
This work in progress paper presents an automated approach for network coverage prediction in real-world environments by combining mobile mapping, 3D mesh generation, and a ray launching based network simulator. We identify the challenges and demonstrate the functionality of such a pipeline. We preview an empirical evaluation in a realistic real-world environment.
{"title":"WIP: Real-world 3D models derived from mobile mapping for ray launching based propagation loss modeling","authors":"T. Wahl, D. Borrmann, M. Bleier, A. Nüchter, T. Wiemann, T. Hänel, N. Aschenbruck","doi":"10.1109/WoWMoM54355.2022.00048","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00048","url":null,"abstract":"This work in progress paper presents an automated approach for network coverage prediction in real-world environments by combining mobile mapping, 3D mesh generation, and a ray launching based network simulator. We identify the challenges and demonstrate the functionality of such a pipeline. We preview an empirical evaluation in a realistic real-world environment.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133353405","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：