2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)最新文献_第6页

Robust Federated Learning For Image Semantic Transmission Under Byzantine Attacks 拜占庭攻击下图像语义传输的鲁棒联邦学习

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233811

Yile Song, Jiaqi Wang, Yiming Liu

{"title":"Robust Federated Learning For Image Semantic Transmission Under Byzantine Attacks","authors":"Yile Song, Jiaqi Wang, Yiming Liu","doi":"10.1109/ICCCWorkshops57813.2023.10233811","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233811","url":null,"abstract":"Semantic communication provides an efficient solution for image transmission, leveraging the advancements in joint source and channel coding facilitated by deep neural networks (DNNs). To address the limited communication and computing resources in edge devices, federated learning (FL) has emerged as a promising approach for collaboratively training semantic encoder/decoder models of semantic communication systems. However, FL-enabled semantic communication systems are still susceptible to malicious attacks, such as raw data tampering and incorrect transmission of semantic models, which pose significant security and integrity risks. In this paper, we propose a robust FL framework for image semantic transmission (IST) to defend against Byzantine attacks, i.e., data and model poisoning attacks, enabling more robust model training with fewer user data fitting. In the proposed framework, we design an end-to-end IST model based on convolutional neural networks (CNNs) to process semantic information. Then, we investigate the impact of Byzantine attacks on image recognition tasks in semantic communication systems and propose an improved Weiszfeld algorithm for model aggregation at the edge server, effectively mitigating the effects of Byzantine attacks on the IST model training process. Simulation results show that the proposed robust FL framework can adaptively select reliable users for aggregation while rejecting adversarial and low-quality users, thereby ensuring the robustness of semantic communication systems for image transmission.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122956885","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

An Efficient Joint Decoding Scheme for Outer Codes in DNA-Based Data Storage 基于dna的数据存储中外部码的有效联合解码方案

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233840

Yi Ding, Xuan He, K. Cai, Guanghui Song, Bin Dai, Xiaohu Tang

引用次数: 0

Estimation of Channel Parameters for Port Selection in Millimeter-Wave Fluid Antenna Systems 毫米波流体天线系统中用于端口选择的信道参数估计

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233765

Rujian Wang, Yu Chen, Yanzhao Hou, Kai-Kit Wong, Xiaofeng Tao

引用次数: 0

A variable length gating approach for queue scheduling in deterministic networks 确定性网络中队列调度的变长门控方法

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233764

Jun Li, Q. Gao, Jinyan Li, Yanxia Xing, Xu Xia

{"title":"A variable length gating approach for queue scheduling in deterministic networks","authors":"Jun Li, Q. Gao, Jinyan Li, Yanxia Xing, Xu Xia","doi":"10.1109/ICCCWorkshops57813.2023.10233764","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233764","url":null,"abstract":"The emergence of deterministic network technologies in B5G/6G networks such as Time Sensitive Network (TSN) and Deterministic Network (DetNet) overcomes the drawbacks of traditional Ethernet BE (Best Effort) service and provides bounded deterministic forwarding services such as low delay and high reliability for the time-sensitive critical services. However, the current gating queue scheduling method employed by the Deterministic Internet Protocol (DIP) is a timed polling multi-queue scheduling technology, and the gating period of each gate is fixed with limited flexibility. When the phase characteristics of services are not matched due to the nonadjustable gating period, extra queuing delay and low network resource utilization are likely to occur. Therefore, in this paper, a variable length gating approach for queue scheduling is proposed, which fully considers the phase characteristics of the packets. Based on the statistics of packet arrival rules, an observation window mechanism is set to adaptively adjust the gating period on a per-window basis. Numerical results are provided to demonstrate the proposed approach can further reduce the average delay of packet queuing of the traditional approach, which can also improve the utilization of network resources and the flexibility of queue scheduling.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127422371","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

Neighbor Discovery with Directional Transmission in Integrated Sensing and Communication for Underwater Acoustic Networks 水声网络集成传感与通信中定向传输的邻居发现

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233782

Yanan Guo, Xiaoxiao Zhuo, Liang Tang, Wen Wu, Yi Wei, Fengzhong Qu

{"title":"Neighbor Discovery with Directional Transmission in Integrated Sensing and Communication for Underwater Acoustic Networks","authors":"Yanan Guo, Xiaoxiao Zhuo, Liang Tang, Wen Wu, Yi Wei, Fengzhong Qu","doi":"10.1109/ICCCWorkshops57813.2023.10233782","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233782","url":null,"abstract":"This paper proposes a directional transducer-enabled neighbor discovery algorithm in integrated sensing and communication for underwater acoustic networks (ISAC-UANs). The neighbor discovery algorithm is a bidirectional scanning-based (SBA) and detection-assisted neighbor discovery (SBA-D) algorithm, which is divided into three steps. Firstly, in ISACUANs, prior knowledge about the distance away from neighbor nodes is obtained via the detection ability. Secondly, the neighbor discovery of detected nodes stage is proposed leveraging the prior knowledge to adjust the transmission power, which reduces the packet collision probability of discovering the detected neighbor nodes. Thirdly, the neighbor discovery of remaining nodes stage is proposed to discover the remaining neighbor nodes following the SBA algorithm. Furthermore, we analyze and derive the performance of the proposed SBA-D algorithm. Numerical simulation results show that the performance of the proposed SBA-D algorithm for ISAC-UANs is better than that of the SBA algorithm in underwater acoustic communication networks (UACNs).","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126884028","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

Mobility-aware Clustering Routing Algorithm for Urban Rail Transit Ad Hoc Network 城市轨道交通Ad Hoc网络的机动性感知聚类路由算法

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233763

Mengdi Zhai, Yang Sun, Yuwei Bian, Meng Li, Pengbo Si, Zhuwei Wang

{"title":"Mobility-aware Clustering Routing Algorithm for Urban Rail Transit Ad Hoc Network","authors":"Mengdi Zhai, Yang Sun, Yuwei Bian, Meng Li, Pengbo Si, Zhuwei Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233763","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233763","url":null,"abstract":"With the development of urban rail transit systems, Communication-Based Train Control (CBTC) system choose to deploy Ad Hoc network alongside the track for train-to-trackside communication. However, due to the mobility of the train, how to efficiently send information to the train by Ad Hoc network still remains a challenge. Considering the dynamic characteristics of the train and multiple optimization objectives, we propose a mobility-aware multi-objective Deep Deterministic Policy Gradient (DDPG) algorithm for routing to optimize delay, throughput and energy consumption. We first set up the clustering routing model according to the dynamic routing scenario. To solve the problem of route selection, Markov decision process (MDP) models are constructed for intra-cluster optimization and inter-cluster optimization respectively, and train operating conditions are considered in inter-cluster MDP. Then we propose a multi-objective DDPG routing algorithm to get the optimal routing, where delay, throughput and energy consumption are designed as a three-dimensional vector. Simulation results indicate that our scheme optimizes multiple objectives in a balanced manner, and shows better performance compared with other schemes.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139945","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

Proactive Congestion Avoidance Mechanism with Attention based CNN 基于注意力CNN的主动拥塞避免机制

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233266

Tong Luo, Fangqi Shi, Xue Zhang, Kang Liu, Mingyuan Liu, Wei Quan, Deyun Gao

{"title":"Proactive Congestion Avoidance Mechanism with Attention based CNN","authors":"Tong Luo, Fangqi Shi, Xue Zhang, Kang Liu, Mingyuan Liu, Wei Quan, Deyun Gao","doi":"10.1109/ICCCWorkshops57813.2023.10233266","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233266","url":null,"abstract":"Congestion avoidance has been a hot topic in the field of network transmission. In order to reduce the probability of congestion, it is an effective solution to dynamically adjust the flow table in the switch according to the time-varying network traffic. However, due to the peculiarity of flow burstiness, it always leads to an unexpected delay in congestion processing if directly using the traffic measurement. To this end, this paper proposes a proactive congestion avoidance mechanism with the attention based CNN (AttCNN-PCA). In particular, we first propose a multi-step convolutional neural network model with attention mechanism (AttCNN) to prevent potential congestion in advance. Then, a greedy-based heuristic algorithm is also proposed to quickly find the appropriate rerouting policy according to the predicted congestion traffic, which can effectively achieve congestion avoidance. Finally, we build a prototype system based on the barefoot tofino P4 switches, in which AttCNN-PCA is implemented. Based on the massive experiments, it shows that the proposed AttCNN-PCA solution effectively avoids the risk of congestion by reducing the maximum link utilization (MLU) by 11.3%-27.5% compared to the state-of-the-art solutions.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134309538","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

Spatial Modulation Covert Communication Assisted By Artificial Noise 人工噪声辅助的空间调制隐蔽通信

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233812

Luying Huang, Jing Lei, Ying Huang

{"title":"Spatial Modulation Covert Communication Assisted By Artificial Noise","authors":"Luying Huang, Jing Lei, Ying Huang","doi":"10.1109/ICCCWorkshops57813.2023.10233812","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233812","url":null,"abstract":"Covert communication often used to confuse Willie by using the environment background signals or forging similar signals, which uses environment as a cover to increase the covertness of transmission signal. In this article, a spatial modulation (SM) covert communication system using a multi-antenna transmitter that transmits artificial noise (AN) to cover covert information transmission is considered. First, we hide some covert information in the antenna index by SM, which can improve covertness by using the unequal priori information, as well as improve the covert capacity. The achievable covert capacity is derived from the mutual information knowledge of information theory. Second, Alice transmits both covert information and AN with random power. In this case, Willie cannot make a correct judgement even if Alice generates very power fluctuations, which ensure the security of the communication process. Additionally, the power of AN and covert information is allocated and optimized by Alice, which can make better use of system resources and achieve the trade-off between covertness and effectiveness. The simulation results show that when the total transmit power of Alice exceeds −5dBw, the variation of power has no significant effect on covertness. Therefore, the covert capacity can be improved by increasing the transmit power while maintaining the covertness.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129337905","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

Robust Hierarchical Combination of Least Mean p-Power Algorithm Based on Binary Tree Structure 基于二叉树结构的最小均值p-幂鲁棒分层组合算法

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233732

Yiming Wang, Bo Wang, Yang Feng, Bin Lin

引用次数: 0

A Companding Scheme for Reducing PAPR of Optical OFDM Signals 一种降低光OFDM信号PAPR的扩展方案

2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops) Pub Date : 2023-08-10 DOI: 10.1109/ICCCWorkshops57813.2023.10233801

Ruoyun Cao, Xiaodong Yang, Yuhong Song, Weiping Zhong, Jixiang Li, Ye Rui, Yang Lei

引用次数: 0