首页 > 最新文献

Digital Communications and Networks最新文献

英文 中文
Spatio-temporal feature extraction with a global-local Transformer model for video scene graph generation 基于全局-局部Transformer模型的视频场景图生成时空特征提取
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-02-01 Epub Date: 2025-04-29 DOI: 10.1016/j.dcan.2025.04.010
Rongsen Wu, Jie Xu, Hao Zheng, Zhiyuan Xu, Zixuan Li, Shixue Cheng, Shumao Zhang
In the field of video scene graph generation, spatio-temporal feature extraction and the long-tail effect in relationship classification are core research issues. This paper proposes extracting spatio-temporal features using the global–local Transformer model for video scene graph generation. Methods based on the Transformer architecture and attention mechanism enrich the semantic information of spatio-temporal features in videos, thereby improving the accuracy of relationship classification. In the feature processing module, pose features are introduced to strengthen the semantic representation of objects. In the spatial feature encoding module, a local spatial visibility matrix based on bounding boxes and key points of human pose features is proposed to add the issue of insufficient attention to local details in traditional Transformer encoders. In the temporal feature encoding module, a global random frame extraction strategy is proposed, which considers global temporal features while also taking computational complexity into account. In the relation classification module, to address the uneven distribution of object and relation categories in the Action Genome dataset, a relation classification loss function based on bipartite graph matching and Focal Loss is proposed, which alleviates the long-tail effect in relation classification and improves the accuracy.
在视频场景图生成领域,时空特征提取和关系分类中的长尾效应是研究的核心问题。本文提出利用全局-局部Transformer模型提取视频场景图的时空特征。基于Transformer架构和注意机制的方法丰富了视频中时空特征的语义信息,从而提高了关系分类的准确性。在特征处理模块中,引入姿态特征,加强对象的语义表示。在空间特征编码模块中,针对传统Transformer编码器对局部细节关注不足的问题,提出了一种基于边界框和人体姿态特征关键点的局部空间可见性矩阵。在时间特征编码模块中,提出了一种考虑全局时间特征的全局随机帧提取策略,同时考虑了计算复杂度。在关系分类模块中,针对Action Genome数据集中对象和关系类别分布不均匀的问题,提出了一种基于二部图匹配和Focal loss的关系分类损失函数,缓解了关系分类中的长尾效应,提高了分类精度。
{"title":"Spatio-temporal feature extraction with a global-local Transformer model for video scene graph generation","authors":"Rongsen Wu,&nbsp;Jie Xu,&nbsp;Hao Zheng,&nbsp;Zhiyuan Xu,&nbsp;Zixuan Li,&nbsp;Shixue Cheng,&nbsp;Shumao Zhang","doi":"10.1016/j.dcan.2025.04.010","DOIUrl":"10.1016/j.dcan.2025.04.010","url":null,"abstract":"<div><div>In the field of video scene graph generation, spatio-temporal feature extraction and the long-tail effect in relationship classification are core research issues. This paper proposes extracting spatio-temporal features using the global–local Transformer model for video scene graph generation. Methods based on the Transformer architecture and attention mechanism enrich the semantic information of spatio-temporal features in videos, thereby improving the accuracy of relationship classification. In the feature processing module, pose features are introduced to strengthen the semantic representation of objects. In the spatial feature encoding module, a local spatial visibility matrix based on bounding boxes and key points of human pose features is proposed to add the issue of insufficient attention to local details in traditional Transformer encoders. In the temporal feature encoding module, a global random frame extraction strategy is proposed, which considers global temporal features while also taking computational complexity into account. In the relation classification module, to address the uneven distribution of object and relation categories in the Action Genome dataset, a relation classification loss function based on bipartite graph matching and Focal Loss is proposed, which alleviates the long-tail effect in relation classification and improves the accuracy.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 2","pages":"Pages 364-374"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147423854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalized Kennedy receivers enhanced CV-QKD in turbulent channels for endogenous security of space-air-ground integrated network 广义肯尼迪接收机增强湍流通道中CV-QKD的空-地一体化网络内生性安全
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-02-01 Epub Date: 2025-12-08 DOI: 10.1016/j.dcan.2025.12.004
Shouye Miao , Mugen Peng , Renzhi Yuan , Bin Cao , Mufei Zhao , Zhifeng Wang
Endogenous security in next-generation wireless communication systems attracts increasing attentions in recent years. A typical solution to endogenous security problems is the Quantum Key Distribution (QKD), where unconditional security can be achieved thanks to the inherent properties of quantum mechanics. Continuous Variable-Quantum Key Distribution (CV-QKD) enjoys high Secret Key Rate (SKR) and good compatibility with existing optical communication infrastructure. Traditional CV-QKD usually employ coherent receivers to detect coherent states, whose detection performance is restricted to the standard quantum limit. In this paper, we employ a generalized Kennedy receiver called CD-Kennedy receiver to enhance the detection performance of coherent states in turbulent channels, where Equal-Gain Combining (EGC) method is used to combine the output of CD-Kennedy receivers. Besides, we derive the SKR of a post-selection based CV-QKD protocol using both CD-Kennedy receiver and homodyne receiver with EGC in turbulent channels. We further propose an equivalent transmittance method to facilitate the calculation of both the Bit-Error Rate (BER) and SKR. Numerical results show that the CD-Kennedy receiver can outperform the homodyne receiver in turbulent channels in terms of both BER and SKR performance. We find that BER and SKR performance advantage of CD-Kennedy receiver over homodyne receiver demonstrate opposite trends as the average transmittance increases, which indicates that two separate system settings should be employed for communication and key distribution purposes. Besides, we also demonstrate that the SKR performance of a CD-Kennedy receiver is much robust than that of a homodyne receiver in turbulent channels.
近年来,下一代无线通信系统的内生安全问题越来越受到人们的关注。内生安全问题的典型解决方案是量子密钥分发(QKD),由于量子力学的固有特性,可以实现无条件安全。连续可变量子密钥分发(CV-QKD)具有较高的密钥速率(SKR)和与现有光通信基础设施良好的兼容性。传统的CV-QKD通常采用相干接收器来检测相干态,其检测性能受到标准量子极限的限制。为了提高湍流信道中相干态的检测性能,本文采用了一种广义的肯尼迪接收机cd -肯尼迪接收机,其中采用等增益组合(EGC)方法对cd -肯尼迪接收机的输出进行组合。此外,我们还推导了基于后选择的CV-QKD协议的SKR,该协议使用CD-Kennedy接收机和带EGC的纯差接收机。我们进一步提出了一种等效透射率方法,以方便计算误码率(BER)和SKR。数值结果表明,cd -肯尼迪接收机在湍流信道中的误码率和SKR性能都优于纯差接收机。我们发现CD-Kennedy接收机相对于纯差式接收机的BER和SKR性能优势随着平均透过率的增加呈现相反的趋势,这表明通信和密钥分配应采用两种单独的系统设置。此外,我们还证明了cd -肯尼迪接收机在湍流信道中的SKR性能比纯差接收机要稳健得多。
{"title":"Generalized Kennedy receivers enhanced CV-QKD in turbulent channels for endogenous security of space-air-ground integrated network","authors":"Shouye Miao ,&nbsp;Mugen Peng ,&nbsp;Renzhi Yuan ,&nbsp;Bin Cao ,&nbsp;Mufei Zhao ,&nbsp;Zhifeng Wang","doi":"10.1016/j.dcan.2025.12.004","DOIUrl":"10.1016/j.dcan.2025.12.004","url":null,"abstract":"<div><div>Endogenous security in next-generation wireless communication systems attracts increasing attentions in recent years. A typical solution to endogenous security problems is the Quantum Key Distribution (QKD), where unconditional security can be achieved thanks to the inherent properties of quantum mechanics. Continuous Variable-Quantum Key Distribution (CV-QKD) enjoys high Secret Key Rate (SKR) and good compatibility with existing optical communication infrastructure. Traditional CV-QKD usually employ coherent receivers to detect coherent states, whose detection performance is restricted to the standard quantum limit. In this paper, we employ a generalized Kennedy receiver called CD-Kennedy receiver to enhance the detection performance of coherent states in turbulent channels, where Equal-Gain Combining (EGC) method is used to combine the output of CD-Kennedy receivers. Besides, we derive the SKR of a post-selection based CV-QKD protocol using both CD-Kennedy receiver and homodyne receiver with EGC in turbulent channels. We further propose an equivalent transmittance method to facilitate the calculation of both the Bit-Error Rate (BER) and SKR. Numerical results show that the CD-Kennedy receiver can outperform the homodyne receiver in turbulent channels in terms of both BER and SKR performance. We find that BER and SKR performance advantage of CD-Kennedy receiver over homodyne receiver demonstrate opposite trends as the average transmittance increases, which indicates that two separate system settings should be employed for communication and key distribution purposes. Besides, we also demonstrate that the SKR performance of a CD-Kennedy receiver is much robust than that of a homodyne receiver in turbulent channels.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 2","pages":"Pages 332-342"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147423861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust connectivity in time-frequency dual fading channels for the 6G satellite IoT: chirp and FRFT 6G卫星物联网时频双衰落信道的鲁棒连通性:啁啾和FRFT
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-02-01 Epub Date: 2025-12-08 DOI: 10.1016/j.dcan.2025.12.002
Wenliang Lin , Xinghao Cao , Ke Wang , Zhongliang Deng , Yishan He , Kejia Cui , Yaohua Deng , Da Wan , Zhiwei He
With the development of Sixth-Generation (6G) mobile communication technologies, Low Earth Orbit (LEO) satellite communication systems have become extremely important in mobile communications owing to their large coverage, high efficiency, and low cost. However, the high dynamic LEO satellite channels cause serious time-frequency dual selective fading, significantly impairing the performance of conventional single time or frequency domain synchronization algorithms and limiting their applicability. To address these challenges, this paper proposes a synchronization algorithm based on Linear Frequency Modulation (LFM) signals and the Fractional Fourier Transform (FRFT). Exploiting the inherent robustness of LFM signals against frequency deviations and multipath effects, coupled with their energy concentration property in the optimal fractional Fourier domain, the proposed algorithm enables efficient synchronization with enhanced resilience to time-frequency variations. Furthermore, LFM preamble sequences are optimally designed for diverse channel conditions. This work presents a theoretical analysis of the time-frequency nonstationary characteristics of LEO satellite channels and discusses the performance limitations of traditional synchronization algorithms. The proposed integrated FRFT-LFM synchronization framework and sequence optimization scheme are rigorously evaluated via comprehensive simulations. The results demonstrate substantial improvements in synchronization accuracy and computational efficiency compared with conventional methods, particularly under time-frequency dual selective fading LEO satellite channels. The algorithm provides a robust and reliable solution for time-frequency synchronization in LEO satellite communication systems, thereby enhancing overall system performance and reliability.
随着第六代(6G)移动通信技术的发展,近地轨道卫星通信系统以其覆盖范围大、效率高、成本低等特点在移动通信中发挥着极其重要的作用。然而,低轨道卫星高动态信道导致严重的时频双选择性衰落,严重影响了传统的单时频同步算法的性能,限制了其适用性。为了解决这些问题,本文提出了一种基于线性调频(LFM)信号和分数阶傅立叶变换(FRFT)的同步算法。利用LFM信号对频率偏差和多径效应的固有鲁棒性,再加上它们在最优分数阶傅立叶域中的能量集中特性,该算法可以实现有效的同步,并增强对时频变化的弹性。此外,针对不同的信道条件,优化设计了LFM前导序列。本文对低轨道卫星信道时频非平稳特性进行了理论分析,讨论了传统同步算法的性能局限性。通过综合仿真,对提出的FRFT-LFM综合同步框架和序列优化方案进行了严格评估。结果表明,与传统方法相比,同步精度和计算效率有了很大提高,特别是在时频双选择性衰落LEO卫星信道下。该算法为低轨道卫星通信系统时频同步提供了鲁棒可靠的解决方案,从而提高了系统整体性能和可靠性。
{"title":"Robust connectivity in time-frequency dual fading channels for the 6G satellite IoT: chirp and FRFT","authors":"Wenliang Lin ,&nbsp;Xinghao Cao ,&nbsp;Ke Wang ,&nbsp;Zhongliang Deng ,&nbsp;Yishan He ,&nbsp;Kejia Cui ,&nbsp;Yaohua Deng ,&nbsp;Da Wan ,&nbsp;Zhiwei He","doi":"10.1016/j.dcan.2025.12.002","DOIUrl":"10.1016/j.dcan.2025.12.002","url":null,"abstract":"<div><div>With the development of Sixth-Generation (6G) mobile communication technologies, Low Earth Orbit (LEO) satellite communication systems have become extremely important in mobile communications owing to their large coverage, high efficiency, and low cost. However, the high dynamic LEO satellite channels cause serious time-frequency dual selective fading, significantly impairing the performance of conventional single time or frequency domain synchronization algorithms and limiting their applicability. To address these challenges, this paper proposes a synchronization algorithm based on Linear Frequency Modulation (LFM) signals and the Fractional Fourier Transform (FRFT). Exploiting the inherent robustness of LFM signals against frequency deviations and multipath effects, coupled with their energy concentration property in the optimal fractional Fourier domain, the proposed algorithm enables efficient synchronization with enhanced resilience to time-frequency variations. Furthermore, LFM preamble sequences are optimally designed for diverse channel conditions. This work presents a theoretical analysis of the time-frequency nonstationary characteristics of LEO satellite channels and discusses the performance limitations of traditional synchronization algorithms. The proposed integrated FRFT-LFM synchronization framework and sequence optimization scheme are rigorously evaluated via comprehensive simulations. The results demonstrate substantial improvements in synchronization accuracy and computational efficiency compared with conventional methods, particularly under time-frequency dual selective fading LEO satellite channels. The algorithm provides a robust and reliable solution for time-frequency synchronization in LEO satellite communication systems, thereby enhancing overall system performance and reliability.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 2","pages":"Pages 375-387"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147423855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient user scheduling in mmWave networks: leveraging knowledge transfer with channel knowledge map 毫米波网络中高效的用户调度:利用信道知识映射实现知识转移
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-02-01 Epub Date: 2025-10-02 DOI: 10.1016/j.dcan.2025.09.003
Chunlong He , Peihong He , Xingquan Li
This paper proposes a Deep Reinforcement Learning (DRL) algorithm for user scheduling in Millimeter Wave (mmWave) networks, which utilizes Channel Knowledge Map (CKM) for knowledge transfer to enhance the learning of scheduling strategies. The user scheduling and link configuration problems are modeled as a multi-queue system. Each queue represents the data demand of an individual user. This setup allows the base station to make dynamic scheduling decisions based on changing environmental conditions. This approach facilitates efficient management of user-specific requirements while addressing the challenges posed by dynamic network environments. Our model incorporates relay selection, codebook selection, and beam tracking to support flexible and efficient resource allocation. In contrast to traditional channel model-based optimization, we design algorithms for scheduling policy pre-training using CKMs, which provide information about the channel between specific pairs of locations. Specifically, we assume that the CKM is fully available to allow the complex scheduling network to have a better starting point or follow a more favorable gradient direction through knowledge migration. This integration of CKM with knowledge transfer significantly accelerates DRL convergence and enhances performance stability. Simulation results confirmed the effectiveness of the proposed approach. Relative to the baseline methods, integrating CKM with knowledge transfer accelerated the convergence of the DRL algorithm by approximately 20%, maintained the delay within 30 milliseconds, and reduced the average queue length by nearly 30%.
提出了一种基于深度强化学习的毫米波网络用户调度算法,该算法利用信道知识映射(Channel Knowledge Map, CKM)进行知识迁移,增强了调度策略的学习能力。将用户调度和链路配置问题建模为一个多队列系统。每个队列表示单个用户的数据需求。这种设置允许基站根据不断变化的环境条件做出动态调度决策。这种方法有助于有效地管理用户特定的需求,同时解决动态网络环境带来的挑战。我们的模型结合了中继选择、码本选择和波束跟踪,以支持灵活有效的资源分配。与传统的基于通道模型的优化相比,我们设计了使用ckm进行调度策略预训练的算法,该算法提供了特定位置对之间的通道信息。具体来说,我们假设CKM是完全可用的,通过知识迁移使复杂调度网络有一个更好的起点或遵循更有利的梯度方向。CKM与知识转移的集成显著加快了DRL的收敛速度,提高了性能稳定性。仿真结果验证了该方法的有效性。与基线方法相比,将CKM与知识转移相结合使DRL算法的收敛速度提高了约20%,延迟保持在30毫秒以内,平均队列长度减少了近30%。
{"title":"Efficient user scheduling in mmWave networks: leveraging knowledge transfer with channel knowledge map","authors":"Chunlong He ,&nbsp;Peihong He ,&nbsp;Xingquan Li","doi":"10.1016/j.dcan.2025.09.003","DOIUrl":"10.1016/j.dcan.2025.09.003","url":null,"abstract":"<div><div>This paper proposes a Deep Reinforcement Learning (DRL) algorithm for user scheduling in Millimeter Wave (mmWave) networks, which utilizes Channel Knowledge Map (CKM) for knowledge transfer to enhance the learning of scheduling strategies. The user scheduling and link configuration problems are modeled as a multi-queue system. Each queue represents the data demand of an individual user. This setup allows the base station to make dynamic scheduling decisions based on changing environmental conditions. This approach facilitates efficient management of user-specific requirements while addressing the challenges posed by dynamic network environments. Our model incorporates relay selection, codebook selection, and beam tracking to support flexible and efficient resource allocation. In contrast to traditional channel model-based optimization, we design algorithms for scheduling policy pre-training using CKMs, which provide information about the channel between specific pairs of locations. Specifically, we assume that the CKM is fully available to allow the complex scheduling network to have a better starting point or follow a more favorable gradient direction through knowledge migration. This integration of CKM with knowledge transfer significantly accelerates DRL convergence and enhances performance stability. Simulation results confirmed the effectiveness of the proposed approach. Relative to the baseline methods, integrating CKM with knowledge transfer accelerated the convergence of the DRL algorithm by approximately 20%, maintained the delay within 30 milliseconds, and reduced the average queue length by nearly 30%.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 2","pages":"Pages 319-331"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147423858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Security and privacy in edge computing: a survey of electric vehicles 边缘计算中的安全和隐私:对电动汽车的调查
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-02-01 Epub Date: 2025-10-30 DOI: 10.1016/j.dcan.2025.10.003
Honghao Gao , Wanqiu Huang , Yueshen Xu , Youhuizi Li
Electric Vehicles (EVs) have developed into a complex ecosystem that includes many technical components such as task offloading on mobile devices, the Internet of Vehicles (IoV), and smart grids. Moreover, Edge Computing (EC) is a technique that relocates applications and services closer to end-users. This computing paradigm has been extensively adopted across many scenarios, effectively reducing the load on the cloud computing infrastructure and centralized server facilities. EVs are closely related to EC in many aspects since electric vehicles are typically supported by modern communication and Artificial Intelligence (AI) technologies, such as, sensor networks, computation offloading, autonomous systems, and blockchain. However, the diversity and heterogeneity of edge devices have raised many security and privacy concerns in electric vehicles, and some complex EC scenarios make addressing these issues even more challenging. In this paper, we provide a comprehensive review of the security and privacy concerns raised by EC in EVs. First, we elaborate on the development, characteristics, and applications of EC in EVs. Next, we describe the typical architectures used to ensure the security and privacy of EC in EVs. Then, we analyze the risks and challenges related to the security and privacy of EC in EVs, focusing on several significant scenarios (e.g., offloading, the IoV, and smart grids). We also discuss current research progress on the security and privacy, covering methodologies, architectures, algorithms, insights, and performance. Finally, we discuss several future challenges and issues regarding the security and privacy of EC in EVs.
电动汽车(ev)已经发展成为一个复杂的生态系统,其中包括许多技术组件,如移动设备上的任务卸载、车联网(IoV)和智能电网。此外,边缘计算(EC)是一种将应用程序和服务重新定位到更靠近最终用户的技术。这种计算范式已在许多场景中广泛采用,有效地减少了云计算基础设施和集中式服务器设施的负载。电动汽车在许多方面与电子商务密切相关,因为电动汽车通常由现代通信和人工智能(AI)技术支持,例如传感器网络、计算卸载、自主系统和区块链。然而,边缘设备的多样性和异质性引起了电动汽车的许多安全和隐私问题,一些复杂的EC场景使得解决这些问题更具挑战性。在本文中,我们提供了一个全面的审查安全性和隐私问题的电子电气在电动汽车。首先,我们阐述了电动汽车电子动力系统的发展、特点和应用。接下来,我们描述了用于确保电动汽车EC安全性和隐私性的典型架构。然后,我们分析了与电动汽车中EC安全和隐私相关的风险和挑战,重点关注几个重要场景(例如卸载,IoV和智能电网)。我们还讨论了安全和隐私方面的最新研究进展,包括方法、架构、算法、见解和性能。最后,我们讨论了关于电动汽车EC安全性和隐私性的几个未来挑战和问题。
{"title":"Security and privacy in edge computing: a survey of electric vehicles","authors":"Honghao Gao ,&nbsp;Wanqiu Huang ,&nbsp;Yueshen Xu ,&nbsp;Youhuizi Li","doi":"10.1016/j.dcan.2025.10.003","DOIUrl":"10.1016/j.dcan.2025.10.003","url":null,"abstract":"<div><div>Electric Vehicles (EVs) have developed into a complex ecosystem that includes many technical components such as task offloading on mobile devices, the Internet of Vehicles (IoV), and smart grids. Moreover, Edge Computing (EC) is a technique that relocates applications and services closer to end-users. This computing paradigm has been extensively adopted across many scenarios, effectively reducing the load on the cloud computing infrastructure and centralized server facilities. EVs are closely related to EC in many aspects since electric vehicles are typically supported by modern communication and Artificial Intelligence (AI) technologies, such as, sensor networks, computation offloading, autonomous systems, and blockchain. However, the diversity and heterogeneity of edge devices have raised many security and privacy concerns in electric vehicles, and some complex EC scenarios make addressing these issues even more challenging. In this paper, we provide a comprehensive review of the security and privacy concerns raised by EC in EVs. First, we elaborate on the development, characteristics, and applications of EC in EVs. Next, we describe the typical architectures used to ensure the security and privacy of EC in EVs. Then, we analyze the risks and challenges related to the security and privacy of EC in EVs, focusing on several significant scenarios (e.g., offloading, the IoV, and smart grids). We also discuss current research progress on the security and privacy, covering methodologies, architectures, algorithms, insights, and performance. Finally, we discuss several future challenges and issues regarding the security and privacy of EC in EVs.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 2","pages":"Pages 223-235"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A blockchain-based user-centric identity management toward 6G networks 面向6G网络的基于区块链的用户中心身份管理
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-01-01 Epub Date: 2025-05-19 DOI: 10.1016/j.dcan.2025.05.009
Guoqiang Zhang, Qiwei Hu, Yu Zhang, Tao Jiang
The developing Sixth-Generation (6G) network aims to establish seamless global connectivity for billions of humans, machines, and devices. However, the rich digital service and the explosive heterogeneous connection between various entities in 6G networks can not only induce increasing complications of digital identity management, but also raise material concerns about the security and privacy of the user identity. In this paper, we design a user-centric identity management that returns the sole control to the user self and achieves identity sovereignty toward 6G networks. Specifically, we propose a blockchain-based Identity Management (IDM) architecture for 6G networks, which provides a practical method to secure digital identity management. Subsequently, we develop a fully privacy-preserving identity attribute management scheme by using zero-knowledge proof to protect the privacy-sensitive identity attribute. In particular, the scheme achieves an identity attribute hiding and verification protocol to support users in obtaining and applying their identity attributes without revealing concrete data. Finally, we analyze the security of the proposed architecture and implement a prototype system to evaluate its performance. The results demonstrate that our architecture ensures effective user digital identity management in 6G networks.
正在发展的第六代(6G)网络旨在为数十亿人、机器和设备建立无缝的全球连接。然而,6G网络中丰富的数字业务和各种实体之间的爆炸性异构连接,不仅会导致数字身份管理的复杂性日益增加,而且会引发用户身份安全和隐私方面的实质性担忧。在本文中,我们设计了一种以用户为中心的身份管理,将唯一的控制权交还给用户自己,实现了对6G网络的身份主权。具体来说,我们提出了一种基于区块链的6G网络身份管理(IDM)架构,它提供了一种实用的方法来保护数字身份管理。随后,我们利用零知识证明来保护隐私敏感的身份属性,提出了一种完全保护隐私的身份属性管理方案。特别是,该方案实现了身份属性隐藏和验证协议,支持用户在不泄露具体数据的情况下获取和应用自己的身份属性。最后,我们分析了所提出的架构的安全性,并实现了一个原型系统来评估其性能。结果表明,我们的架构确保了6G网络中有效的用户数字身份管理。
{"title":"A blockchain-based user-centric identity management toward 6G networks","authors":"Guoqiang Zhang,&nbsp;Qiwei Hu,&nbsp;Yu Zhang,&nbsp;Tao Jiang","doi":"10.1016/j.dcan.2025.05.009","DOIUrl":"10.1016/j.dcan.2025.05.009","url":null,"abstract":"<div><div>The developing Sixth-Generation (6G) network aims to establish seamless global connectivity for billions of humans, machines, and devices. However, the rich digital service and the explosive heterogeneous connection between various entities in 6G networks can not only induce increasing complications of digital identity management, but also raise material concerns about the security and privacy of the user identity. In this paper, we design a user-centric identity management that returns the sole control to the user self and achieves identity sovereignty toward 6G networks. Specifically, we propose a blockchain-based Identity Management (IDM) architecture for 6G networks, which provides a practical method to secure digital identity management. Subsequently, we develop a fully privacy-preserving identity attribute management scheme by using zero-knowledge proof to protect the privacy-sensitive identity attribute. In particular, the scheme achieves an identity attribute hiding and verification protocol to support users in obtaining and applying their identity attributes without revealing concrete data. Finally, we analyze the security of the proposed architecture and implement a prototype system to evaluate its performance. The results demonstrate that our architecture ensures effective user digital identity management in 6G networks.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"Pages 1-10"},"PeriodicalIF":7.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145969391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhanced multi-agent deep reinforcement learning for efficient task offloading and resource allocation in vehicular networks 基于多智能体深度强化学习的车辆网络高效任务卸载和资源分配
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-01-01 Epub Date: 2025-10-01 DOI: 10.1016/j.dcan.2025.09.002
Long Xu , Jiale Tan , Hongcheng Zhuang
In response to the rising demand for low-latency, computation-intensive applications in vehicular networks, this paper proposes an adaptive task offloading approach for Vehicle-to-Everything (V2X) environments. Leveraging an enhanced Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm with an attention mechanism, the proposed approach optimizes computation offloading and resource allocation, aiming to minimize energy consumption and service delay. In this paper, vehicles dynamically offload computing-intensive tasks to both nearby vehicles through V2V links and roadside units through V2I links. The adaptive attention mechanism enables the system to prioritize relevant state information, leading to faster convergence. Simulations conducted in a realistic urban V2X scenario demonstrate that the proposed Attention-enhanced MADDPG (AT-MADDPG) algorithm significantly improves performance, achieving notable reductions in both energy consumption and latency compared to baseline algorithms, especially in high-demand, dynamic scenarios.
针对车载网络对低延迟、计算密集型应用日益增长的需求,本文提出了一种适用于V2X (Vehicle-to-Everything)环境的自适应任务卸载方法。该方法利用增强型多智能体深度确定性策略梯度(madpg)算法和关注机制,优化计算卸载和资源分配,以最小化能耗和服务延迟为目标。在本文中,车辆通过V2V链路将计算密集型任务动态地卸载给附近车辆,并通过V2I链路将计算密集型任务动态地卸载给路边单元。自适应关注机制使系统能够优先考虑相关状态信息,从而加快收敛速度。在现实的城市V2X场景中进行的模拟表明,与基线算法相比,所提出的注意力增强型MADDPG (AT-MADDPG)算法显著提高了性能,显著降低了能耗和延迟,特别是在高需求的动态场景中。
{"title":"Enhanced multi-agent deep reinforcement learning for efficient task offloading and resource allocation in vehicular networks","authors":"Long Xu ,&nbsp;Jiale Tan ,&nbsp;Hongcheng Zhuang","doi":"10.1016/j.dcan.2025.09.002","DOIUrl":"10.1016/j.dcan.2025.09.002","url":null,"abstract":"<div><div>In response to the rising demand for low-latency, computation-intensive applications in vehicular networks, this paper proposes an adaptive task offloading approach for Vehicle-to-Everything (V2X) environments. Leveraging an enhanced Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm with an attention mechanism, the proposed approach optimizes computation offloading and resource allocation, aiming to minimize energy consumption and service delay. In this paper, vehicles dynamically offload computing-intensive tasks to both nearby vehicles through V2V links and roadside units through V2I links. The adaptive attention mechanism enables the system to prioritize relevant state information, leading to faster convergence. Simulations conducted in a realistic urban V2X scenario demonstrate that the proposed Attention-enhanced MADDPG (AT-MADDPG) algorithm significantly improves performance, achieving notable reductions in both energy consumption and latency compared to baseline algorithms, especially in high-demand, dynamic scenarios.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"Pages 66-75"},"PeriodicalIF":7.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data driven vehicular heterogeneity based intelligent collision avoidance system for Internet of Vehicles (IoV) 基于数据驱动车辆异构的车联网智能避碰系统
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-01-01 Epub Date: 2025-04-04 DOI: 10.1016/j.dcan.2025.03.010
Iqra Adnan , Tariq Umer , Ahmad Arsalan , Maryam M. Al Dabel , Ali Kashif Bashir , Arooj Ansif
The Internet of Vehicles (IoV) is an emerging technology that aims to connect vehicles, infrastructure, and other devices to enable intelligent transportation systems. One of the key challenges in IoV is to ensure safe and efficient communication among vehicles of different types and capabilities. This paper proposes a data-driven vehicular heterogeneity-based intelligent collision avoidance system for IoV. The system leverages Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication to collect real-time data about the environment and the vehicles. The data is collected to acknowledge the heterogeneity of vehicles and human behavior. The data is analyzed using machine learning algorithms to identify potential collision risks and recommend appropriate actions to avoid collisions. The system takes into account the heterogeneity of vehicles, such as their size, speed, and maneuverability, to optimize collision avoidance strategies. The proposed system is experimented with real-time datasets and compared with existing collision avoidance systems. The results are shown using the evaluation metrics that show the proposed system can significantly reduce the number of collisions and improve the overall safety and efficiency of IoV with an accuracy of 96.5% using the SVM algorithm. The trial outcomes demonstrated that the new system, incorporating vehicular, weather, and human behavior factors, outperformed previous systems that only considered vehicular and weather aspects. This innovative approach is poised to lead transportation efforts, reducing accident rates and improving the quality of transportation systems in smart cities. By offering predictive capabilities, the proposed model not only helps control accident rates but also prevents them in advance, ensuring road safety.
车联网(IoV)是一项新兴技术,旨在连接车辆、基础设施和其他设备,以实现智能交通系统。车联网面临的关键挑战之一是确保不同类型和功能的车辆之间安全高效的通信。提出了一种基于数据驱动的车联网异构智能避碰系统。该系统利用车对车(V2V)和车对基础设施(V2I)通信来收集有关环境和车辆的实时数据。收集数据是为了承认车辆和人类行为的异质性。使用机器学习算法对数据进行分析,以识别潜在的碰撞风险,并建议适当的行动来避免碰撞。该系统考虑了车辆的异质性,如车辆的大小、速度和机动性,以优化避碰策略。该系统在实时数据集上进行了实验,并与现有的避碰系统进行了比较。结果表明,使用SVM算法,该系统可以显著减少碰撞次数,提高车联网的整体安全性和效率,准确率达到96.5%。试验结果表明,结合车辆、天气和人类行为因素的新系统优于之前仅考虑车辆和天气因素的系统。这种创新的方法有望引领交通工作,降低事故率,提高智能城市交通系统的质量。通过提供预测功能,该模型不仅有助于控制事故率,还能提前预防,确保道路安全。
{"title":"Data driven vehicular heterogeneity based intelligent collision avoidance system for Internet of Vehicles (IoV)","authors":"Iqra Adnan ,&nbsp;Tariq Umer ,&nbsp;Ahmad Arsalan ,&nbsp;Maryam M. Al Dabel ,&nbsp;Ali Kashif Bashir ,&nbsp;Arooj Ansif","doi":"10.1016/j.dcan.2025.03.010","DOIUrl":"10.1016/j.dcan.2025.03.010","url":null,"abstract":"<div><div>The Internet of Vehicles (IoV) is an emerging technology that aims to connect vehicles, infrastructure, and other devices to enable intelligent transportation systems. One of the key challenges in IoV is to ensure safe and efficient communication among vehicles of different types and capabilities. This paper proposes a data-driven vehicular heterogeneity-based intelligent collision avoidance system for IoV. The system leverages Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication to collect real-time data about the environment and the vehicles. The data is collected to acknowledge the heterogeneity of vehicles and human behavior. The data is analyzed using machine learning algorithms to identify potential collision risks and recommend appropriate actions to avoid collisions. The system takes into account the heterogeneity of vehicles, such as their size, speed, and maneuverability, to optimize collision avoidance strategies. The proposed system is experimented with real-time datasets and compared with existing collision avoidance systems. The results are shown using the evaluation metrics that show the proposed system can significantly reduce the number of collisions and improve the overall safety and efficiency of IoV with an accuracy of 96.5% using the SVM algorithm. The trial outcomes demonstrated that the new system, incorporating vehicular, weather, and human behavior factors, outperformed previous systems that only considered vehicular and weather aspects. This innovative approach is poised to lead transportation efforts, reducing accident rates and improving the quality of transportation systems in smart cities. By offering predictive capabilities, the proposed model not only helps control accident rates but also prevents them in advance, ensuring road safety.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"Pages 180-197"},"PeriodicalIF":7.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RIS-assisted cellular networks with multiple D2D pairs: Outage and ergodic achievable rate 具有多个D2D对的ris辅助蜂窝网络:中断和遍历可达率
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-01-01 Epub Date: 2025-08-26 DOI: 10.1016/j.dcan.2025.08.008
Yaxuan Liu , Yiyang Ni , Haitao Zhao , Yuxi Wang , Yan Cai
Reconfigurable Intelligent Surface (RIS) is envisioned as a promising technology to improve the system capacity of 6G network, by controlling the electromagnetic wave propagation. Most existing works use the Central Limit Theorem (CLT) to analyze the performance of RIS-assisted systems for large number of reflective elements. However, the assumption of extremely large number of elements may not be practical in the actual situation. In addition, the CLT-based approximation yields an inaccurate scaling law of the outage probability when the transmit Signal-to-Noise Ratio (SNR) tends to infinity. Motivated by these limitations, in this paper, we investigate the performance of RIS-assisted cellular networks with multiple Device-to-Device (D2D) users under the general fading channels, i.e., Nakagami-m fading channels. We propose a tractable solution to evaluate the outage probability and the ergodic achievable rate, which is accurate for any number of reflective elements, any network topology, as well as any SNR. In addition, the accurate approximations for the high SNR case and the large number of reflective elements case are further derived in simpler closed form. Numerical results verify the accuracy of our analytical results and analyze the performance between CLT and the proposed method.
可重构智能表面(RIS)被认为是通过控制电磁波传播来提高6G网络系统容量的一项有前途的技术。现有的研究大多使用中心极限定理(CLT)来分析具有大量反射元素的ris辅助系统的性能。但是,在实际情况中,元素数量极大的假设可能并不实际。此外,当传输信噪比(SNR)趋于无穷大时,基于clt的近似产生了不准确的中断概率缩放规律。基于这些限制,在本文中,我们研究了具有多设备对设备(D2D)用户的ris辅助蜂窝网络在一般衰落信道下的性能,即Nakagami-m衰落信道。我们提出了一种易于处理的解决方案来评估中断概率和遍历可达率,该解决方案对任何数量的反射元件,任何网络拓扑以及任何信噪比都是准确的。此外,进一步以较简单的封闭形式推导出高信噪比情况和大量反射元情况的精确近似。数值结果验证了我们的分析结果的准确性,并分析了CLT与所提方法的性能差异。
{"title":"RIS-assisted cellular networks with multiple D2D pairs: Outage and ergodic achievable rate","authors":"Yaxuan Liu ,&nbsp;Yiyang Ni ,&nbsp;Haitao Zhao ,&nbsp;Yuxi Wang ,&nbsp;Yan Cai","doi":"10.1016/j.dcan.2025.08.008","DOIUrl":"10.1016/j.dcan.2025.08.008","url":null,"abstract":"<div><div>Reconfigurable Intelligent Surface (RIS) is envisioned as a promising technology to improve the system capacity of 6G network, by controlling the electromagnetic wave propagation. Most existing works use the Central Limit Theorem (CLT) to analyze the performance of RIS-assisted systems for large number of reflective elements. However, the assumption of extremely large number of elements may not be practical in the actual situation. In addition, the CLT-based approximation yields an inaccurate scaling law of the outage probability when the transmit Signal-to-Noise Ratio (SNR) tends to infinity. Motivated by these limitations, in this paper, we investigate the performance of RIS-assisted cellular networks with multiple Device-to-Device (D2D) users under the general fading channels, i.e., Nakagami-<em>m</em> fading channels. We propose a tractable solution to evaluate the outage probability and the ergodic achievable rate, which is accurate for any number of reflective elements, any network topology, as well as any SNR. In addition, the accurate approximations for the high SNR case and the large number of reflective elements case are further derived in simpler closed form. Numerical results verify the accuracy of our analytical results and analyze the performance between CLT and the proposed method.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"Pages 52-65"},"PeriodicalIF":7.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A certificateless and KGA-secure searchable encryption scheme with constant trapdoors in smart city 智慧城市中具有恒定活板门的无证书、kga安全的可搜索加密方案
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2026-01-01 Epub Date: 2024-08-08 DOI: 10.1016/j.dcan.2024.08.005
Hongjun Li , Debiao He , P. Vijayakumar , Fayez Alqahtani , Amr Tolba
Smart cities, as a typical application in the field of the Internet of Things, can combine cloud computing to realize the intelligent control of objects and process massive data. While cloud computing brings convenience to smart city services, a serious problem is ensuring that confidential data cannot be leaked to malicious adversaries. Considering the security and privacy of data, data owners transmit sensitive data in its encrypted form to cloud server, which seriously hinders the improvements of potential utilization and efficient sharing. Public key searchable encryption ensures that users can securely retrieve the encrypted data without decryption. However, most existing schemes cannot resist keyword guessing attacks or the size of trapdoors linearly increases with the number of data owners. In this work, by utilizing certificateless encryption and proxy re-encryption, we design an authenticated searchable encryption scheme with constant trapdoors. The designed scheme preserves the privacy of index ciphertexts and keyword trapdoors, and can resist keyword guessing attacks. In addition, data users can generate and upload trapdoors with lower computation and communication overheads. We show that the proposed scheme is suitable for smart city implementations and applications by experimentally evaluating its performance.
智慧城市作为物联网领域的典型应用,可以结合云计算实现对物体的智能控制和海量数据的处理。虽然云计算为智慧城市服务带来了便利,但一个严重的问题是如何确保机密数据不会泄露给恶意对手。考虑到数据的安全性和隐私性,数据所有者将敏感数据以加密形式传输到云服务器,严重阻碍了潜在利用率的提高和高效共享。公钥可搜索加密确保用户无需解密即可安全地检索加密数据。然而,大多数现有的方案不能抵抗关键字猜测攻击或陷阱门的大小随着数据所有者的数量线性增加。本文利用无证书加密和代理再加密,设计了一种具有恒定陷阱门的身份验证可搜索加密方案。该方案既保护了索引密文和关键字陷阱门的私密性,又能抵抗关键字猜测攻击。此外,数据用户可以生成和上传具有较低计算和通信开销的活板门。我们通过实验评估其性能,证明了所提出的方案适合智慧城市的实现和应用。
{"title":"A certificateless and KGA-secure searchable encryption scheme with constant trapdoors in smart city","authors":"Hongjun Li ,&nbsp;Debiao He ,&nbsp;P. Vijayakumar ,&nbsp;Fayez Alqahtani ,&nbsp;Amr Tolba","doi":"10.1016/j.dcan.2024.08.005","DOIUrl":"10.1016/j.dcan.2024.08.005","url":null,"abstract":"<div><div>Smart cities, as a typical application in the field of the Internet of Things, can combine cloud computing to realize the intelligent control of objects and process massive data. While cloud computing brings convenience to smart city services, a serious problem is ensuring that confidential data cannot be leaked to malicious adversaries. Considering the security and privacy of data, data owners transmit sensitive data in its encrypted form to cloud server, which seriously hinders the improvements of potential utilization and efficient sharing. Public key searchable encryption ensures that users can securely retrieve the encrypted data without decryption. However, most existing schemes cannot resist keyword guessing attacks or the size of trapdoors linearly increases with the number of data owners. In this work, by utilizing certificateless encryption and proxy re-encryption, we design an authenticated searchable encryption scheme with constant trapdoors. The designed scheme preserves the privacy of index ciphertexts and keyword trapdoors, and can resist keyword guessing attacks. In addition, data users can generate and upload trapdoors with lower computation and communication overheads. We show that the proposed scheme is suitable for smart city implementations and applications by experimentally evaluating its performance.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 1","pages":"Pages 198-209"},"PeriodicalIF":7.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146189434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Digital Communications and Networks
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1