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

Digital Twin Enabled Intelligent Network Orchestration for 6G: A Dual-Layered Approach 支持数字孪生的6G智能网络编排:一种双层方法

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

Pengyi Jia, Xianbin Wang, X. Shen

{"title":"Digital Twin Enabled Intelligent Network Orchestration for 6G: A Dual-Layered Approach","authors":"Pengyi Jia, Xianbin Wang, X. Shen","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226083","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226083","url":null,"abstract":"Meeting diverse service requirements concurrently in the future 6th-generation (6G) networks is becoming extremely challenging due to the dramatically increased network and service complexities. Overcoming this challenge relies on accurate and timely understanding of network dynamics and distributed service requirements. However, the excessive delay and resource consumption associated with network-wide information gathering and centralized processing will inevitably deteriorate the 6G network operation effectiveness. To address this challenge, a dual-layered digital twin paradigm is proposed in this paper to enable intelligent network orchestration for fast real-time optimization of 6G networks. Rapid identification of problematic network situations and the corresponding fast decision-making in tackling the related issues are successively achieved by the two layers of the proposed digital twin. The new dual-layered digital twin is further adopted for traffic engineering in 6G networks with maximized quality of service provisioning. Simulation results demonstrate that the dual-layered digital twin paradigm can intelligently achieve accurate and situation-aware digital twin construction and network optimization with enhanced efficiency.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"10 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":"131258384","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

Offloading Tasks to Unknown Edge Servers: A Contextual Multi-Armed Bandit Approach 卸载任务到未知的边缘服务器:上下文多武装强盗方法

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

Shu Zhang, Mingjun Xiao, Guoju Gao, Yin Xu, He Sun

{"title":"Offloading Tasks to Unknown Edge Servers: A Contextual Multi-Armed Bandit Approach","authors":"Shu Zhang, Mingjun Xiao, Guoju Gao, Yin Xu, He Sun","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226047","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226047","url":null,"abstract":"Mobile Edge Computing (MEC), envisioned as an innovative paradigm, pushes resources from the cloud to the network edge and prompts users to offload computation-intensive and data-intensive tasks to edge servers for meeting the stringent service requirements. Prior approaches often study efficiently offloading tasks with given system information, though rigorously time-sensitive tasks offloading problems receive less attention under system uncertainty. As motivated, we propose a multi-user collaborative offloading model where users jointly decide time-sensitive task placement while considering the unknown system information and contexts. We formulate the offloading problem as a Multi-user Contextual Combinatorial Multi-armed Bandit (MCC-MAB) problem and propose a learning algorithm Context-Aware Task Offloading Decision (CATOD) to explore the system uncertainty. Since the time-sensitive task offloading problem with learned system information is still NP-hard, we present an approximation algorithm Offline Generalized Task Assignment (OGTA) to obtain an efficient offloading solution. Additionally, meticulous theoretical analysis and extensive evaluations demonstrate the significant performance on a real-world dataset.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"20 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":"133108106","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

Multi-Agent Distributed Cooperative Routing for Maritime Emergency Communication 海上应急通信多智能体分布式协同路由

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

Tingting Yang, Yujia Huo, Chengzhuo Han, Xin Sun

{"title":"Multi-Agent Distributed Cooperative Routing for Maritime Emergency Communication","authors":"Tingting Yang, Yujia Huo, Chengzhuo Han, Xin Sun","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225796","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225796","url":null,"abstract":"With the development of intelligent shipping industry, massive terminal device is connected to maritime network, which causes the centralized scheduling mechanism fails to meet the communication requirements of large-scale network. Mean-while, constant location changes of vessels make it difficult to acquire the optimal route planning with existing routing schemes. Therefore, enlightened by the success of multi-agent reinforcement learning (MARL), we propose a multi-agent distributed cooperative routing algorithm driven by maritime emergency communication task. The algorithm utilizes the calculation results of adjacent agents to train local model, which can alleviate the coupling between individual agent and global data. For large network with small-scale topological changes, we leverage online learning mechanism for local training to ensure the accuracy of routing decision. The simulation results demonstrate that the proposed routing algorithm could not only avoid congestion, but substantially reduce retraining time, overhead communication cost and high compute consumption brought by small-scale topological dynamic changes. The corresponding open-source repository is shared on Github.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"46 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":"127197886","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

Securing PUFs Against ML Modeling Attacks via an Efficient Challenge-Response Approach 通过有效的挑战-响应方法保护puf免受ML建模攻击

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

Mieszko Ferens, Edlira Dushku, Sokol Kosta

{"title":"Securing PUFs Against ML Modeling Attacks via an Efficient Challenge-Response Approach","authors":"Mieszko Ferens, Edlira Dushku, Sokol Kosta","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226062","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226062","url":null,"abstract":"Physical Unclonable Functions (PUFs) are lightweight security primitives capable of providing functionalities such as device authentication and identification. Such lightweight solutions are particularly important for small resource-constrained devices that cannot support many of the standard security mechanisms like e.g., TPMs. Even though PUFs are constructed to be unpredictable and unclonable, they have been susceptible to Machine Learning (ML) modeling attacks. Mitigation of these attacks typically requires additional hardware, causing potential deviation from the lightweight nature of low-end embedded devices. In this paper, we analyze the technical details that lead to the success of the previous ML modeling attacks, and utilize these findings to devise a novel challenge-response approach that improves PUF's security, more specifically the 4-XOR and 5-XOR PUFs, without additional hardware requirements. Our experimental results show that the proposed approach reduces modeling accuracies of state-of-the-art ML attacks by 10-15%, lowering the success rate of attacks significantly while remaining practical in the implementation.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"14 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":"115368411","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

Detection and mitigation of indirect conflicts between xApps in Open Radio Access Networks 开放无线接入网络中xApps间间接冲突的检测和缓解

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

Cezary Adamczyk, Adrian Kliks

引用次数: 0

Wireless Signal Denoising Using Conditional Generative Adversarial Networks 基于条件生成对抗网络的无线信号去噪

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

H. Tang, Yanxiao Zhao, Guodong Wang, Changqing Luo, Wei Wang

{"title":"Wireless Signal Denoising Using Conditional Generative Adversarial Networks","authors":"H. Tang, Yanxiao Zhao, Guodong Wang, Changqing Luo, Wei Wang","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225927","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225927","url":null,"abstract":"Wireless signal strength plays a critical role in wireless security. For example, we can intentionally reduce transmission power at a transmitter to prevent eavesdropping. Later the receiver will employ signal denoising techniques to enhance the signal-to-noise ratio. Also, signals are deteriorated by noise and interference during transmission. Therefore, wireless signal enhancement or denoising is a critical challenge. This paper tackles this challenge and investigates an adversarial learning-based approach for wireless signal denoising, which will correspondingly enhance signal strength. Specifically, we design a conditional generative adversarial network at the receiver to establish an adversarial game between a generator and a discriminator. The generator receives the noisy signal and aims to generate the denoised signal, while the discriminator aims to force the denoised signal to match the noisy signal exactly. Unlike traditional signal denoising methods that estimate the noise or interference in the noisy signals, our proposed method estimates and learns the features of real noise-free signals, which is more adaptive to dynamic wireless communication environments. We conduct simulations on signals with four different modulations to evaluate the performance. The results demonstrate that our method can generate denoised signals effectively and outperforms other traditional methods.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"65 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":"114414015","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

Implementing an Open 5G Standalone Testbed: Challenges and Lessons Learnt 实施开放的5G独立测试平台:挑战和经验教训

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

Maryam Amini, Ahmed El-Ashmawy, C. Rosenberg

引用次数: 0

Q-Learning for Sum-Throughput Optimization in Wireless Visible-Light UAV Networks 基于q学习的无线可见光无人机网络总吞吐量优化

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

Yu Long, Nan Cen

{"title":"Q-Learning for Sum-Throughput Optimization in Wireless Visible-Light UAV Networks","authors":"Yu Long, Nan Cen","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225783","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225783","url":null,"abstract":"Unmanned aerial vehicles (UAVs) have been adopted as aerial base stations (ABSs) to provide wireless connectivity to ground users in events of increased network demand, and points-of-failure infrastructure (such as in disasters). However, with the existing crowded radio frequency (RF) spectrum, UAV ABSs cannot provide high-data-rate communication required in 5G and beyond. To address this challenge, visible light communication (VLC) is proposed to be equipped on UAVs to take advantage of the flexible and on-demand deployment feature of the UAV, and the high-data-rate communication of the VLC. However, VLC has strong alignment requirements between transceivers, therefore, how to determine the position and orientation of the UAV is critically important for sum-throughput improvement. In this paper, we propose two Q-learning based methods to maximize the sum throughput of the wireless visible-light UAV network by jointly controlling the position and orientation of the UAV. The results show that the proposed approaches can achieve a network-wide data rate very close to the optimal solution obtained by exhaustive search and outperform up to 18% compared with the intuitive centroid-based method. Computation complexity is also evaluated, where results showing that the proposed two Q-learning based methods can both consume less computational time, i.e., approximately 9 times and 210 times less on average than that of the exhaustive search approach.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"55 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":"116372717","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

Data Transport for the Orbiting Internet 轨道互联网的数据传输

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

Aiden Valentine, G. Parisis

引用次数: 0

GI 2023 Progrma

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

引用次数: 0