ICC 2022 - IEEE International Conference on Communications最新文献

Clustered Hierarchical Distributed Federated Learning 集群分层分布式联邦学习

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838880

Yan Gou, Ruiyu Wang, Zonghui Li, M. Imran, Lei Zhang

引用次数: 3

Implicit Partial Product-LDPC Codes Using Free-Ride Coding 利用搭便车编码的隐式部分积- ldpc码

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9839082

Xiao Ma, Qianfan Wang, Suihua Cai, Xinglin Xie

{"title":"Implicit Partial Product-LDPC Codes Using Free-Ride Coding","authors":"Xiao Ma, Qianfan Wang, Suihua Cai, Xinglin Xie","doi":"10.1109/ICC45855.2022.9839082","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9839082","url":null,"abstract":"In this paper, we propose a new construction of product codes, where the whole information array is protected row-by-row by a low-density parity-check (LDPC) code while only a portion of the information array is protected column-by-column by an algebraic code. The most distinguished feature of the proposed product code is that, thanks to the free-ride coding technique, the additional column check bits are transmitted implicitly rather than explicitly. The constructed codes are referred to as implicit partial product-LDPC codes, which have the same rates as the row component LDPC codes. The decoding algorithm can be divided into four stages, including decoding of the free-ride codes, first-round decoding of the row codes, decoding of the column codes, and second-round decoding of the row codes by exploiting the messages associated with those successfully decoded columns. To predict the extremely low error rate of the doubly-protected (by both the row code and the column code) information bits, we derive an approximate upper bound. The simulation results show that, with a (3,6)-regular LDPC code of length 1024 as the component code, the proposed product code can lower the word error rate (WER) from 10−2 down to 10−6 at the SNR around 2 dB. The numerical results also show that the doubly-protected information bits are more reliable, which can have a bit error rate (BER) down to 10−15 at SNR around 2.6 dB as implied by the presented approximate upper bound.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115710111","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}

引用次数: 4

Data-and-Knowledge Dual-Driven Automatic Modulation Recognition for Wireless Communication Networks 无线通信网络数据与知识双驱动的自动调制识别

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838977

Rui Ding, Hao Zhang, Fuhui Zhou, Qihui Wu, Zhu Han

{"title":"Data-and-Knowledge Dual-Driven Automatic Modulation Recognition for Wireless Communication Networks","authors":"Rui Ding, Hao Zhang, Fuhui Zhou, Qihui Wu, Zhu Han","doi":"10.1109/ICC45855.2022.9838977","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9838977","url":null,"abstract":"Automatic modulation classification is of crucial importance in wireless communication networks. Deep learning based automatic modulation classification schemes have attracted extensive attention due to the superior accuracy. However, the data-driven method relies on a large amount of training samples and the classification accuracy is poor in the low signal-to-noise radio (SNR). In order to tackle these problems, a novel data-and-knowledge dual-driven automatic modulation classification scheme based on radio frequency machine learning is proposed by exploiting the attribute features of different modulations. The visual model is utilized to extract visual features. The attribute learning model is used to learn the attribute semantic representations. The transformation model is proposed to convert the attribute representation into the visual space. Extensive simulation results demonstrate that our proposed automatic modulation classification scheme can achieve better performance than the benchmark schemes in terms of the classification accuracy, especially in the low SNR. Moreover, the confusion among high-order modulations is reduced by using our proposed scheme compared with other traditional schemes.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123133465","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}

引用次数: 6

Coordinated Load Balancing in Mobile Edge Computing Network: a Multi-Agent DRL Approach 移动边缘计算网络中的协同负载均衡:一种多agent DRL方法

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838615

M. Ma, Di Wu, Yi Tian Xu, Jimmy Li, Seowoo Jang, Xue Liu, Gregory Dudek

{"title":"Coordinated Load Balancing in Mobile Edge Computing Network: a Multi-Agent DRL Approach","authors":"M. Ma, Di Wu, Yi Tian Xu, Jimmy Li, Seowoo Jang, Xue Liu, Gregory Dudek","doi":"10.1109/ICC45855.2022.9838615","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9838615","url":null,"abstract":"Mobile edge computing (MEC) networks have been recently adopted to accommodate the fast-growing number of mobile devices performing complicated tasks with limited hardware capability. Recently, edge nodes with communication, computation, and caching capacities are starting to be deployed in MEC networks. Due to the physical separation of these resources, efficient coordination and scheduling are important for efficient resource utilization and optimal network performance. In this paper, we study mobility load balancing for communication, computation, and caching-enabled heterogeneous MEC networks. Specifically, we propose to tackle this problem via a multi-agent deep reinforcement learning-based framework. Users served by overloaded edge nodes are handed over to less loaded ones, to minimize the load in the most loaded base station in the network. In this framework, the handover decision for each user is made based on the user’s own observation which comprises the user’s task at hand and the load status of the MEC network. Simulation results show that our proposed multi-agent deep reinforcement learning-based approach can reduce the time-average maximum load by up to 30% and the end-to-end delay by 50% compared to baseline algorithms.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"12 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123170559","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}

引用次数: 4

Capacity Analysis of Civil Aircraft Networks in SAGIN SAGIN民用飞机网络容量分析

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9839257

Qian Chen, Shuxun Li, W. Meng, Cheng Li

引用次数: 4

Intelligent UAV Navigation: A DRL-QiER Solution 智能无人机导航:一个DRL-QiER解决方案

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838566

Yuanjian Li, H. Aghvami

引用次数: 5

An Analysis of Signal Energy Impacts and Threats to Deep Learning Based SEI 基于深度学习的SEI信号能量影响与威胁分析

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838884

Joshua H. Tyler, M. Fadul, D. Reising, Farah I. Kandah

{"title":"An Analysis of Signal Energy Impacts and Threats to Deep Learning Based SEI","authors":"Joshua H. Tyler, M. Fadul, D. Reising, Farah I. Kandah","doi":"10.1109/ICC45855.2022.9838884","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9838884","url":null,"abstract":"Specific Emitter Identification (SEI) was conceived to detect, characterize, and identify radars using their transmitted signals. SEI’s success is linked to the imperfections of an emitter’s Radio Frequency (RF) front-end, which imparts unique \"coloration\" to the signal during its formation and transmission without impeding normal transceiver operations. Recent works propose Deep Learning (DL) based SEI due to its demonstrated successes in image and facial recognition, as well as its ability to learn radio-specific features directly from the sampled signals. This removes the needless, handcrafted feature engineering of traditional SEI. However, signal energy, its impacts, and its susceptibility to adversary mimicry has received little attention by DL-based SEI works. This work is the first to investigate the impacts and threats posed to DL-based SEI by the presence, lack, or manipulation of signal energy. Our work shows that Long Short-Term Memory (LSTM)-based SEI provides the highest average percent correct classification performance of 89.9% and the lowest rate, 0.68%, at which an adversary can circumvent the SEI process by manipulating the energy of its signals.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"52 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120817031","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}

引用次数: 9

How Does FAW Attack Impact an Imperfect PoW Blockchain: A Simulation-based Approach 一汽攻击如何影响不完善的PoW区块链:基于模拟的方法

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838837

Hao-Nan Zhu, Runkai Yang, J. Misic, V. Mišić, Xiaolin Chang

{"title":"How Does FAW Attack Impact an Imperfect PoW Blockchain: A Simulation-based Approach","authors":"Hao-Nan Zhu, Runkai Yang, J. Misic, V. Mišić, Xiaolin Chang","doi":"10.1109/ICC45855.2022.9838837","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9838837","url":null,"abstract":"Malignant miners with small computing power can achieve unfair revenue and degrade system throughput through launching Fork after withholding (FAW) attack in a Proof-of-Work (PoW) blockchain system. The existing works about FAW attack have some of the following issues: (i) only studying Bitcoin blockchain, (ii) assuming that the blockchain network is perfect and then ignoring forks due to block propagation delay, and (iii) assuming that there is only one pool under attack. This paper attempts to investigate FAW attack in imperfect Bitcoin and Ethereum networks where malicious miners attack multiple victim pools. We develop a simulator to capture the chain dynamics under FAW attack in a PoW system where the longest-chain protocol is used. Two different computing power allocation strategies for malicious miners, PAS and EAS, are investigated in terms of the profitability of FAW adversaries, the loss of victims, and the blockchain throughput. The results reveal that FAW adversaries can get more revenue under PAS when more victim pools are subjected to attack in both Bitcoin and Ethereum. If FAW adversaries adopt EAS and the number of victims vary from 1 to 12, they can get maximal revenue when attack 7 victims in Bitcoin. The blockchain throughput decreases significantly under PAS while it is almost unchanged under EAS with the increasing number of victims in both Bitcoin and Ethereum. Our work helps the design of countermeasures against FAW attack.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"30 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120855685","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}

引用次数: 1

Quantum Annealing for Next-Generation MU-MIMO Detection: Evaluation and Challenges 下一代MU-MIMO检测的量子退火:评估和挑战

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9839195

Juan Carlos De Luna Ducoing, K. Nikitopoulos

{"title":"Quantum Annealing for Next-Generation MU-MIMO Detection: Evaluation and Challenges","authors":"Juan Carlos De Luna Ducoing, K. Nikitopoulos","doi":"10.1109/ICC45855.2022.9839195","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9839195","url":null,"abstract":"Multi-user (MU), multiple-input, multiple-output (MIMO) detection has been extensively investigated, and many techniques have been proposed. However, further performance improvements may be constrained by limitations in classical computation. The motivation for this work is to test whether a machine that exploits quantum principles can offer improved performance over conventional detection approaches. This paper presents an evaluation of MIMO detection based on quantum annealing (QA) when run on an actual QA quantum processing unit (QPU) and describes the challenges and potential improvements. The evaluations show promising results in some cases, such as near-optimality in a QPSK-modulated 8×8 MIMO case, but poor results in other cases, such as for larger systems or when using 16-QAM. We show that some challenges of QA detection include dealing with integrated control errors (ICE), the limited dynamic range of QA QPUs, an exponential increase in the number of qubits to the problem size, and a high computation overhead. Solving these challenges could make QA-based detection superior to conventional approaches and bring a new generation of MU-MIMO detection methods.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121239388","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}

引用次数: 10

On Algorand Transaction Fees: Challenges and Mechanism Design 论算法交易费:挑战与机制设计

ICC 2022 - IEEE International Conference on Communications Pub Date : 2022-05-16 DOI: 10.1109/ICC45855.2022.9838795

M. Abbasi, M. Manshaei, M. Rahman, K. Akkaya, Murtuza Jadliwala

{"title":"On Algorand Transaction Fees: Challenges and Mechanism Design","authors":"M. Abbasi, M. Manshaei, M. Rahman, K. Akkaya, Murtuza Jadliwala","doi":"10.1109/ICC45855.2022.9838795","DOIUrl":"https://doi.org/10.1109/ICC45855.2022.9838795","url":null,"abstract":"Algorand is a public proof-of-stake (PoS) blockchain with a throughput of 750 MB of transactions per hour, 125 times more than Bitcoin. While the throughput of Algorand depends on the participation of most of its nodes, rational nodes may behave selfishly and not cooperate with others. To encourage nodes to participate in the consensus protocol, Algorand rewards nodes in each round. However, currently Algorand does not pay transaction fees to participating nodes, rather storing it for future use. In this paper, we show that this current approach of Algorand motivates selfish block proposers to increase their profits by creating empty blocks. Such selfish behavior reduces the throughput of Algorand. Therefore, the price of Algo will decrease in the long run. Because of this price reduction, nodes will leave Algorand, compromising its security. Moreover, lack of an appropriate mechanism to pay fees to participants causes additional issues, such as lack of transparency, centralization, and inability of nodes to prioritize transactions. To overcome this challenge, we design a perfectly competitive market and propose an algorithm for computing optimal transaction fees and block size in Algorand We also propose an algorithm that reduces the cost of Algorand, without compromising its security. We further simulate the Algorand network and show how the optimal transaction fee and block size can be calculated in practice.","PeriodicalId":193890,"journal":{"name":"ICC 2022 - IEEE International Conference on Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127533232","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}

引用次数: 1