Pub Date : 2023-11-01DOI: 10.23919/jcc.ea.2022-0372.202302
Ying Chen, Wei Gu, Jiajie Xu, Yongchao Zhang, Geyong Min
Limited by battery and computing resources, the computing-intensive tasks generated by Internet of Things (IoT) devices cannot be processed all by themselves. Mobile edge computing (MEC) is a suitable solution for this problem, and the generated tasks can be offloaded from IoT devices to MEC. In this paper, we study the problem of dynamic task offloading for digital twin-empowered MEC. Digital twin techniques are applied to provide information of environment and share the training data of agent deployed on IoT devices. We formulate the task offloading problem with the goal of maximizing the energy efficiency and the workload balance among the ESs. Then, we reformulate the problem as an MDP problem and design DRL-based energy efficient task offloading (DEETO) algorithm to solve it. Comparative experiments are carried out which show the superiority of our DEETO algorithm in improving energy efficiency and balancing the workload.
{"title":"Dynamic task offloading for digital twin-empowered mobile edge computing via deep reinforcement learning","authors":"Ying Chen, Wei Gu, Jiajie Xu, Yongchao Zhang, Geyong Min","doi":"10.23919/jcc.ea.2022-0372.202302","DOIUrl":"https://doi.org/10.23919/jcc.ea.2022-0372.202302","url":null,"abstract":"Limited by battery and computing resources, the computing-intensive tasks generated by Internet of Things (IoT) devices cannot be processed all by themselves. Mobile edge computing (MEC) is a suitable solution for this problem, and the generated tasks can be offloaded from IoT devices to MEC. In this paper, we study the problem of dynamic task offloading for digital twin-empowered MEC. Digital twin techniques are applied to provide information of environment and share the training data of agent deployed on IoT devices. We formulate the task offloading problem with the goal of maximizing the energy efficiency and the workload balance among the ESs. Then, we reformulate the problem as an MDP problem and design DRL-based energy efficient task offloading (DEETO) algorithm to solve it. Comparative experiments are carried out which show the superiority of our DEETO algorithm in improving energy efficiency and balancing the workload.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"1 1","pages":"164-175"},"PeriodicalIF":4.1,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68735263","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}
Pub Date : 2023-11-01DOI: 10.23919/jcc.fa.2022-0607.202311
Xiao Liu, Mingyuan Li, Haipeng Peng, Shoushan Luo
With the rapid development of the Internet of Things (IoT), there is an increasing need for interaction between different networks. In order to improve the level of interconnection, especially the interoperability of users/devices between different nodes is very important. In the IoT heterogeneous blockchain scenario, how to ensure the legitimacy of the chain and how to confirm the identity of cross-chain information users/devices become the key issues to be solved for blockchain interoperability. In this paper, we propose a secure and trusted interoperability mechanism for IoT based on heterogeneous chains to improve the security of blockchain interoperability. In this mechanism, a primary sidechain architecture supporting authentication at both ends of the heterogeneous chain is designed. In addition, a distributed gateway architecture is proposed for cross-chain authentication and protocol conversion. The security and performance analysis shows that our scheme is feasible and effective in improving the security of cross-chain operations in IoT.
{"title":"Secure and trusted interoperability scheme of heterogeneous blockchains platform in IoT networks","authors":"Xiao Liu, Mingyuan Li, Haipeng Peng, Shoushan Luo","doi":"10.23919/jcc.fa.2022-0607.202311","DOIUrl":"https://doi.org/10.23919/jcc.fa.2022-0607.202311","url":null,"abstract":"With the rapid development of the Internet of Things (IoT), there is an increasing need for interaction between different networks. In order to improve the level of interconnection, especially the interoperability of users/devices between different nodes is very important. In the IoT heterogeneous blockchain scenario, how to ensure the legitimacy of the chain and how to confirm the identity of cross-chain information users/devices become the key issues to be solved for blockchain interoperability. In this paper, we propose a secure and trusted interoperability mechanism for IoT based on heterogeneous chains to improve the security of blockchain interoperability. In this mechanism, a primary sidechain architecture supporting authentication at both ends of the heterogeneous chain is designed. In addition, a distributed gateway architecture is proposed for cross-chain authentication and protocol conversion. The security and performance analysis shows that our scheme is feasible and effective in improving the security of cross-chain operations in IoT.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135610541","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}
Pub Date : 2023-11-01DOI: 10.23919/jcc.ea.2021-0888.202302
Yanli Xu, Jian Shang, Hao Tang
With the vigorous development of automobile industry, in-vehicle network is also constantly upgraded to meet data transmission requirements of emerging applications. The main transmission requirements are low latency and certainty especially for autonomous driving. Time sensitive networking (TSN) based on Ethernet gives a possible solution to these requirements. Previous surveys usually investigated TSN from a general perspective, which referred to TSN of various application fields. In this paper, we focus on the application of TSN to the in-vehicle networks. For in-vehicle networks, we discuss all related TSN standards specified by IEEE 802.1 work group up to now. We further overview and analyze recent literature on various aspects of TSN for automotive applications, including synchronization, resource reservation, scheduling, certainty, software and hardware. Application scenarios of TSN for in-vehicle networks are analyzed one by one. Since TSN of in-vehicle network is still at a very initial stage, this paper also gives insights on open issues, future research directions and possible solutions.
{"title":"Recent trends of in-vehicle time sensitive networking technologies, applications and challenges","authors":"Yanli Xu, Jian Shang, Hao Tang","doi":"10.23919/jcc.ea.2021-0888.202302","DOIUrl":"https://doi.org/10.23919/jcc.ea.2021-0888.202302","url":null,"abstract":"With the vigorous development of automobile industry, in-vehicle network is also constantly upgraded to meet data transmission requirements of emerging applications. The main transmission requirements are low latency and certainty especially for autonomous driving. Time sensitive networking (TSN) based on Ethernet gives a possible solution to these requirements. Previous surveys usually investigated TSN from a general perspective, which referred to TSN of various application fields. In this paper, we focus on the application of TSN to the in-vehicle networks. For in-vehicle networks, we discuss all related TSN standards specified by IEEE 802.1 work group up to now. We further overview and analyze recent literature on various aspects of TSN for automotive applications, including synchronization, resource reservation, scheduling, certainty, software and hardware. Application scenarios of TSN for in-vehicle networks are analyzed one by one. Since TSN of in-vehicle network is still at a very initial stage, this paper also gives insights on open issues, future research directions and possible solutions.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"253 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136017966","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}
Pub Date : 2023-10-01DOI: 10.23919/jcc.ea.2021-0765.202302
Xiangyu Liu, Jingyu Hao, Lei Guo, Song Song
In visible light positioning systems, some scholars have proposed target tracking algorithms to balance the relationship among positioning accuracy, real-time performance, and robustness. However, there are still two problems: (1) When the captured LED disappears and the uncertain LED reappears, existing tracking algorithms may recognize the landmark in error; (2) The receiver is not always able to achieve positioning under various moving statuses. In this paper, we propose an enhanced visual target tracking algorithm to solve the above problems. First, we design the lightweight recognition/demodulation mechanism, which combines Kalman filtering with simple image preprocessing to quickly track and accurately demodulate the landmark. Then, we use the Gaussian mixture model and the LED color feature to enable the system to achieve positioning, when the receiver is under various moving statuses. Experimental results show that our system can achieve high-precision dynamic positioning and improve the system's comprehensive performance.
{"title":"Dynamic visible light positioning based on enhanced visual target tracking","authors":"Xiangyu Liu, Jingyu Hao, Lei Guo, Song Song","doi":"10.23919/jcc.ea.2021-0765.202302","DOIUrl":"https://doi.org/10.23919/jcc.ea.2021-0765.202302","url":null,"abstract":"In visible light positioning systems, some scholars have proposed target tracking algorithms to balance the relationship among positioning accuracy, real-time performance, and robustness. However, there are still two problems: (1) When the captured LED disappears and the uncertain LED reappears, existing tracking algorithms may recognize the landmark in error; (2) The receiver is not always able to achieve positioning under various moving statuses. In this paper, we propose an enhanced visual target tracking algorithm to solve the above problems. First, we design the lightweight recognition/demodulation mechanism, which combines Kalman filtering with simple image preprocessing to quickly track and accurately demodulate the landmark. Then, we use the Gaussian mixture model and the LED color feature to enable the system to achieve positioning, when the receiver is under various moving statuses. Experimental results show that our system can achieve high-precision dynamic positioning and improve the system's comprehensive performance.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"41 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":"136139703","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}
Pub Date : 2023-10-01DOI: 10.23919/jcc.fa.2022-0829.202310
Song Bai, Qiang Li, Donghong Cai
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.
{"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}
Pub Date : 2023-10-01DOI: 10.23919/jcc.fa.2023-0133.202310
Mingqian Liu, Zhaoxi Wen, Yunfei Chen, Ming Li
Modulation recognition becomes unreliable at low signal-to-noise ratio (SNR) over fading channel. A novel method is proposed to recognize the digital modulated signals with frequency and phase offsets over multi-path fading channels in this paper. This method can overcome the effects of phase offset, Gaussian noise and multi-path fading. To achieve this, firstly, the characteristic parameters search is constructed based on the cyclostationarity of received signals, to overcome the phase offset, Gaussian white noise, and influence caused by multi-path fading. Then, the carrier frequency of the received signal is estimated, and the maximum characteristic parameter is searched around the integer multiple carriers and their vicinities. Finally, the modulation types of the received signal with frequency and phase offsets are classified using decision thresholds. Simulation results demonstrate that the performance of the proposed method is better than the traditional methods when SNR is over 5dB, and that the proposed method is robust to frequency and phase offsets over multi-path channels.
{"title":"Modulation recognition with frequency offset and phase offset over multipath channels","authors":"Mingqian Liu, Zhaoxi Wen, Yunfei Chen, Ming Li","doi":"10.23919/jcc.fa.2023-0133.202310","DOIUrl":"https://doi.org/10.23919/jcc.fa.2023-0133.202310","url":null,"abstract":"Modulation recognition becomes unreliable at low signal-to-noise ratio (SNR) over fading channel. A novel method is proposed to recognize the digital modulated signals with frequency and phase offsets over multi-path fading channels in this paper. This method can overcome the effects of phase offset, Gaussian noise and multi-path fading. To achieve this, firstly, the characteristic parameters search is constructed based on the cyclostationarity of received signals, to overcome the phase offset, Gaussian white noise, and influence caused by multi-path fading. Then, the carrier frequency of the received signal is estimated, and the maximum characteristic parameter is searched around the integer multiple carriers and their vicinities. Finally, the modulation types of the received signal with frequency and phase offsets are classified using decision thresholds. Simulation results demonstrate that the performance of the proposed method is better than the traditional methods when SNR is over 5dB, and that the proposed method is robust to frequency and phase offsets over multi-path channels.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"44 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":"136200353","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}
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.
{"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}
To remove the restriction on code length of polar codes, this paper proposes a construction scheme, called stepwise polar codes, which can generate arbitrary-length polar codes. The stepwise polar codes are generated by sub-polar codes with different code lengths. To improve coding performance, sub-polar codes are united by polarization effect priority algorithm, which can reduce the number of incompletely polarized channels. Then, the construction method of the generator matrix of the stepwise polar code is presented. Furthermore, we prove that the proposed scheme has lower decoding complexity than punctured, multi-kernel polar codes. Simulation results show that the proposed method can achieve similar decoding performance compared with the conventional punctured polar codes, rate-compatible punctured polar code, PC-short and asymmetric polar codes (APC) when code length N=48 and 72, respectively.
{"title":"A construction method of arbitrary-length polar codes","authors":"Xiaojun Zhang, Chengguan Chen, Rongcai Zhang, Jianming Cui, Qingtian Zeng","doi":"10.23919/jcc.fa.2021-0178.202310","DOIUrl":"https://doi.org/10.23919/jcc.fa.2021-0178.202310","url":null,"abstract":"To remove the restriction on code length of polar codes, this paper proposes a construction scheme, called stepwise polar codes, which can generate arbitrary-length polar codes. The stepwise polar codes are generated by sub-polar codes with different code lengths. To improve coding performance, sub-polar codes are united by polarization effect priority algorithm, which can reduce the number of incompletely polarized channels. Then, the construction method of the generator matrix of the stepwise polar code is presented. Furthermore, we prove that the proposed scheme has lower decoding complexity than punctured, multi-kernel polar codes. Simulation results show that the proposed method can achieve similar decoding performance compared with the conventional punctured polar codes, rate-compatible punctured polar code, PC-short and asymmetric polar codes (APC) when code length N=48 and 72, respectively.","PeriodicalId":9814,"journal":{"name":"China Communications","volume":"22 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":"136200048","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}
Pub Date : 2023-10-01DOI: 10.23919/jcc.fa.2021-0080.202310
Ningjie Gao, Ru Huo, Shuo Wang, Jiang Liu, Tao Huang, Yunjie Liu
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.
{"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}
Pub Date : 2023-10-01DOI: 10.23919/jcc.fa.2022-0678.202310
Mingjun Dai, Wanru Li, Chanting Zhang, Xiaohui Lin, Bin Chen
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 m,,,{_=^triangle},,n-k . 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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：