IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第4页

A Framework to Enable Runtime Programmable P4-enabled FPGAs in the Open Cloud Testbed 在开放云测试平台中启用运行时可编程p4 fpga的框架

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10225877

Zhaoyang Han, Suranga Handagala, Kalyani Patle, M. Zink, M. Leeser

引用次数: 0

DAAPEO: Detect and Avoid Path Planning for UAV-Assisted 5G Enabled Energy-Optimized IoT DAAPEO:无人机辅助5G能量优化物联网的检测和避免路径规划

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10225891

Sandeep Verma, Aneek Adhya

{"title":"DAAPEO: Detect and Avoid Path Planning for UAV-Assisted 5G Enabled Energy-Optimized IoT","authors":"Sandeep Verma, Aneek Adhya","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225891","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225891","url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) have been making an indelible mark on the automation industry by meeting the stringent standards of Fifth Generation (5G) connectivity for seamless data dissemination from Internet of Things (IoT). However, the limited battery resources of IoT Sensor Devices (ISD), collision free flight operation of swarm of UAVs i.e., multiple UAVs flying at the same time, are challenging concerns which need to be given attention. In this work, the proposed work addresses the aforementioned issues by proposing an energy-optimized data dissemination strategy for the IoT and a pre-determined path planning strategy for collision-free UAV flight operation, the proposed work is reffered as DAAPEO. The boosted sooty tern optimization is used for selecting the Cluster-Head (CH) in IoT being deployed with a large number of ISDs. Following the selection of the CH, two UAVs are programmed to hover in a pre-determined path, collecting data from the corresponding CHs in their immediate vicinity. The proposed idea is decentralized when it comes to choosing a CH and centralized when it comes to UAVs path planning. For collision avoidance with the UAV or other obstacles, a Light Detection and Ranging (LiDAR) sensor is used for the former, and deterministic path planning is done for the latter. Simulation results showcase the predominance of proposed work (i.e., DAAPEO) over the competitive methods, as it essentially improves the energy efficiency of 5G IoT and also helps in Detect and Avoid (DAA) path planning for avoiding the collision of launched UAV s within themselves or with other objects.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125036825","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

Android Malware Classification and Optimisation Based on BM25 Score of Android API 基于Android API BM25评分的Android恶意软件分类与优化

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10226039

Rahul Yumlembam, B. Issac, Longzhi Yang, S. M. Jacob

{"title":"Android Malware Classification and Optimisation Based on BM25 Score of Android API","authors":"Rahul Yumlembam, B. Issac, Longzhi Yang, S. M. Jacob","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226039","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226039","url":null,"abstract":"With the growth of Android devices, there is a rise in malware applications affecting these networked devices. Android malware classification is an important task in ensuring the security and privacy of Android devices. One promising approach to this problem is to capture the difference in the usage of API in benign and malware applications through the BM25 (Best Matching 25) scoring function by calculating the BM25 score of each API (Application Program Interface). A linear regression model is fitted using the BM25 score to select the 1000 most important APIs using the feature importance weight of the linear regression model. The selected API's BM25 score and the Permission and Intents of an application are used to train Naive Bayes, Random Forest, Decision Tree, Support Vector Machine, and CNN (Convolutional Neural Network) for classification. To illustrate the effectiveness of using the BM25 score of APIs for malware classification, we train the optimised Particle Swarm Optimisation (PSO) based Machine learning and Deep Learning algorithms using Permission and Intents features with and without the BM25 score. Experiments show that the BM25 score improves the result. Overall, this study demonstrates the potential of using the BM25 score of API calls, in combination with Permissions and Intents, as a valuable tool for Android malware classification.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129935524","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

INFOCOM 2023 Demo

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/infocomwkshps57453.2023.10226177

引用次数: 0

Edge Oriented Redistribution of Computational Load for Authentication Systems 面向边缘的认证系统计算负载重分配

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10226059

Zakaria EI-Awadi, Manki Min

引用次数: 0

A GAF and CNN based Wi-Fi Network Intrusion Detection System 基于GAF和CNN的Wi-Fi网络入侵检测系统

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10226036

Rayed S. Ahmad, A. H. Ali, S. M. Kazim, Quamar Niyaz

引用次数: 0

Trustworthy and Load-Balancing Routing Scheme for Satellite Services with Multi-Agent DRL 基于多agent DRL的卫星业务可信负载均衡路由方案

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10226127

Jiaxin Song, Ying Ju, Lei Liu, Qingqi Pei, Celimuge Wu, M. Jan, S. Mumtaz

{"title":"Trustworthy and Load-Balancing Routing Scheme for Satellite Services with Multi-Agent DRL","authors":"Jiaxin Song, Ying Ju, Lei Liu, Qingqi Pei, Celimuge Wu, M. Jan, S. Mumtaz","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226127","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226127","url":null,"abstract":"Massive computing tasks of various applications have been generated in 6G space-air-ground integrated networks, and need to be transmitted securely and reliably. Nevertheless, the mobility of satellites and the untrusted nodes bring new challenges to the routing scheme design in low earth orbit (LEO) satellite networks. To improve the system trust and elevate the service quality, this paper proposes a fully distributed trustworthy load-balancing routing scheme for satellite services with a multi-agent dueling double deep Q network (D3QN)-based learning algorithm. Our scheme organizes multiple agents to generate hop-by-hop routes and makes decisions based on the trust value of the nodes, which has good scalability to deploy on various satellite constellations and can meet the trust requirements of the services. Besides, we add a variable delay constraint into the load minimization objective to meet various delay-sensitive satellite quality of service (QoS) requirements. We demonstrate that the proposed scheme dramatically reduces the link queue utilization rate and enhances the system capability of handling delay-sensitive services. The packet loss rate of our scheme is 24% lower than that of the benchmark scheme when the system has 30% malicious nodes.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645555","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

Accelerating BLE Neighbor Discovery via Wi-Fi Fingerprints 通过Wi-Fi指纹加速BLE邻居发现

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10225984

Tong Li, Bowen Hu, Guanjie Tu, Jinwen Shuai, Jiaxin Liang, Yukuan Ding, Ziwei Li, Ke Xu

引用次数: 0

Anarchic Convex Federated Learning 无政府凸联邦学习

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/INFOCOMWKSHPS57453.2023.10225908

Dongsheng Li, Xiaowen Gong

{"title":"Anarchic Convex Federated Learning","authors":"Dongsheng Li, Xiaowen Gong","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225908","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225908","url":null,"abstract":"The rapid advances in federated learning (FL) in the past few years have recently inspired a great deal of research on this emerging topic. Existing work on FL often assume that clients participate in the learning process with some particular pattern (such as balanced participation), and/or in a synchronous manner, and/or with the same number of local iterations, while these assumptions can be hard to hold in practice. In this paper, we propose AFLC, an Anarchic Federated Learning algorithm for Convex learning problems, which gives maximum freedom to clients. In particular, AFLC allows clients to 1) participate in arbitrary rounds; 2) participate asynchronously; 3) participate with arbitrary numbers of local iterations. The proposed AFLC algorithm enables clients to participate in FL efficiently and flexibly according to their needs, e.g., based on their heterogeneous and time-varying computation and communication capabilities. We characterize performance bounds on the learning loss of AFLC as a function of clients' local model delays and local iteration numbers. Our results show that the convergence error can be made arbitrarily small by choosing appropriate learning rates, and the convergence rate matches that of existing benchmarks. The results also characterize the impacts of clients' various parameters on the learning loss, which provide useful insights. Numerical results demonstrate the efficiency of the proposed algorithm.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116139182","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

DroneCom 2023 Program DroneCom 2023计划

IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2023-05-20 DOI: 10.1109/infocomwkshps57453.2023.10225918

引用次数: 0