China Communications最新文献_第4页

Dynamic task offloading for digital twin-empowered mobile edge computing via deep reinforcement learning 通过深度强化学习实现数字孪生移动边缘计算的动态任务卸载

IF 4.1 3区计算机科学

China Communications Pub Date : 2023-11-01 DOI: 10.23919/jcc.ea.2022-0372.202302

Ying Chen, Wei Gu, Jiajie Xu, Yongchao Zhang, Geyong Min

引用次数: 17

Secure and trusted interoperability scheme of heterogeneous blockchains platform in IoT networks 物联网网络中异构区块链平台安全可信互操作方案

3区计算机科学

China Communications Pub Date : 2023-11-01 DOI: 10.23919/jcc.fa.2022-0607.202311

Xiao Liu, Mingyuan Li, Haipeng Peng, Shoushan Luo

引用次数: 0

Recent trends of in-vehicle time sensitive networking technologies, applications and challenges 车载时间敏感网络技术的最新发展趋势、应用和挑战

3区计算机科学

China Communications Pub Date : 2023-11-01 DOI: 10.23919/jcc.ea.2021-0888.202302

Yanli Xu, Jian Shang, Hao Tang

引用次数: 1

Dynamic visible light positioning based on enhanced visual target tracking 基于增强视觉目标跟踪的动态可见光定位

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.ea.2021-0765.202302

Xiangyu Liu, Jingyu Hao, Lei Guo, Song Song

引用次数: 0

Reconfigurable intelligent surface-based hybrid phase and code modulation for symbiotic radio 共生无线电的可重构智能表面混合相位和编码调制

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.fa.2022-0829.202310

Song Bai, Qiang Li, Donghong Cai

{"title":"Reconfigurable intelligent surface-based hybrid phase and code modulation for symbiotic radio","authors":"Song Bai, Qiang Li, Donghong Cai","doi":"10.23919/jcc.fa.2022-0829.202310","DOIUrl":"https://doi.org/10.23919/jcc.fa.2022-0829.202310","url":null,"abstract":"Reconfigurable intelligent surface (RIS)-assisted symbiotic radio is a spectrum- and energy-efficient communication paradigm, in which an RIS performs passive beamforming to enhance active transmission, while using the electromagnetic waves from the active transmission for additional information transfer (i.e., passive transmission). In this paper, a hybrid RIS-based modulation, termed hybrid phase and code modulation (HPCM), is proposed to improve the reliability of RIS-assisted symbiotic radio. In RIS-HPCM, the RIS simultaneously performs direct sequence spread spectrum and passive beamforming on incident signals. Moreover, both the spreading code and phase offset are exploited to carry the RIS's own information. A low-complexity detector is designed, in which the receiver first detects the spreading codes and then demodulates the constellation symbols. We analyze the bit error rate (BER) performance of RIS-HPCM over Rician fading channels. BER upper bounds and approximate BER expressions are derived in closed-form for maximum-likelihood and low-complexity detectors, respectively. Simulation results in terms of BER verify the analysis and show the superiority of RIS-HPCM over the existing RIS-based modulation.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136200349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Modulation recognition with frequency offset and phase offset over multipath channels 调制识别与频率偏移和相位偏移在多径信道

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.fa.2023-0133.202310

Mingqian Liu, Zhaoxi Wen, Yunfei Chen, Ming Li

引用次数: 0

Learning-based dynamic connectivity maintenance for UAV-assisted D2D multicast communication 基于学习的无人机辅助D2D多播通信动态连通性维护

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.ea.2021-0190.202302

Jingjing Wang, Yanjing Sun, Bowen Wang, Shenshen Qian, Zhijian Tian, Xiaolin Wang

{"title":"Learning-based dynamic connectivity maintenance for UAV-assisted D2D multicast communication","authors":"Jingjing Wang, Yanjing Sun, Bowen Wang, Shenshen Qian, Zhijian Tian, Xiaolin Wang","doi":"10.23919/jcc.ea.2021-0190.202302","DOIUrl":"https://doi.org/10.23919/jcc.ea.2021-0190.202302","url":null,"abstract":"Unmanned aerial vehicles (UAVs) enable flexible networking functions in emergency scenarios. However, due to the movement characteristic of ground users (GUs), it is challenging to capture the interactions among GUs. Thus, we propose a learning-based dynamic connectivity maintenance architecture to reduce the delay for the UAV-assisted device-to-device (D2D) multicast communication. In this paper, each UAV transmits information to a selected GU, and then other GUs receive the information in a multi-hop manner. To minimize the total delay while ensuring that all GUs receive the information, we decouple it into three subproblems according to the time division on the topology: For the cluster-head selection, we adopt the Whale Optimization Algorithm (WOA) to imitate the hunting behavior of whales by abstracting the UAVs and cluster-heads into whales and preys, respectively; For the D2D multi-hop link establishment, we make the best of social relationships between GUs, and propose a node mapping algorithm based on the balanced spanning tree (BST) with reconfiguration to minimize the number of hops; For the dynamic connectivity maintenance, Restricted Q-learning (RQL) is utilized to learn the optimal multicast timeslot. Finally, the simulation results show that our proposed algorithms perform better than other benchmark algorithms in the dynamic scenario.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136139701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A construction method of arbitrary-length polar codes 一种任意长度极性码的构造方法

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.fa.2021-0178.202310

Xiaojun Zhang, Chengguan Chen, Rongcai Zhang, Jianming Cui, Qingtian Zeng

引用次数: 0

SBFT: A BFT consensus mechanism based on DQN algorithm for industrial Internet of Thing SBFT:基于DQN算法的工业物联网BFT共识机制

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.fa.2021-0080.202310

Ningjie Gao, Ru Huo, Shuo Wang, Jiang Liu, Tao Huang, Yunjie Liu

{"title":"SBFT: A BFT consensus mechanism based on DQN algorithm for industrial Internet of Thing","authors":"Ningjie Gao, Ru Huo, Shuo Wang, Jiang Liu, Tao Huang, Yunjie Liu","doi":"10.23919/jcc.fa.2021-0080.202310","DOIUrl":"https://doi.org/10.23919/jcc.fa.2021-0080.202310","url":null,"abstract":"With the development and widespread use of blockchain in recent years, many projects have introduced blockchain technology to solve the growing security issues of the Industrial Internet of Things(IIoT). However, due to the conflict between the operational performance and security of the blockchain system and the compatibility issues with a large number of IIoT devices running together, the mainstream blockchain system cannot be applied to IIoT scenarios. In order to solve these problems, this paper proposes SBFT (Speculative Byzantine Consensus Protocol), a flexible and scalable blockchain consensus mechanism for the Industrial Internet of Things. SBFT has a consensus process based on speculation, improving the throughput and consensus speed of blockchain systems and reducing communication overhead. In order to improve the compatibility and scalability of the blockchain system, we select some nodes to participate in the consensus, and these nodes have better performance in the network. Since multiple properties determine node performance, we abstract the node selection problem as a joint optimization problem and use Dueling Deep Q Learning (DQL) to solve it. Finally, we evaluate the performance of the scheme through simulation, and the simulation results prove the superiority of our scheme.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136200049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Sparse Rev-Shift coded modulation with novel overhead bound 具有新开销界的稀疏Rev-Shift编码调制

3区计算机科学

China Communications Pub Date : 2023-10-01 DOI: 10.23919/jcc.fa.2022-0678.202310

Mingjun Dai, Wanru Li, Chanting Zhang, Xiaohui Lin, Bin Chen

{"title":"Sparse Rev-Shift coded modulation with novel overhead bound","authors":"Mingjun Dai, Wanru Li, Chanting Zhang, Xiaohui Lin, Bin Chen","doi":"10.23919/jcc.fa.2022-0678.202310","DOIUrl":"https://doi.org/10.23919/jcc.fa.2022-0678.202310","url":null,"abstract":"To provide reliability in distributed systems, combination property (CP) is desired, where k original packets are encoded into n ≥ k packets and arbitrary k are sufficient to reconstruct all the original packets. Shift-and-add (SA) encoding combined with zigzag decoding (ZD) obtains the CP-ZD, which is promising to reap low computational complexity in the encoding/decoding process of these systems. As densely coded modulation is difficult to achieve CP-ZD, research attentions are paid to sparse coded modulation. The drawback of existing sparse CP-ZD coded modulation lies in high overhead, especially in widely deployed setting m < k, where <tex xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">m,,,{_=^triangle},,n-k</tex> . For this scenario, namely, m < k, a sparse reverseorder shift (Rev-Shift) CP-ZD coded modulation is designed. The proof that Rev-Shift possesses CP-ZD is provided. A lower bound for the overhead, as far as we know is the first for sparse CP-ZD coded modulation, is derived. The bound is found tight in certain scenarios, which shows the code optimality. Extensive numerical studies show that compared to existing sparse CP-ZD coded modulation, the overhead of Rev-Shift reduces significantly, and the derived lower bound is tight when k or m approaches 0.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136200057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0