首页 > 最新文献

Digital Communications and Networks最新文献

英文 中文
Hybrid millimeter wave heterogeneous networks with spatially correlated user equipment 具有空间相关用户设备的混合毫米波异构网络
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.10.022

In this paper, we analyze a hybrid Heterogeneous Cellular Network (HCNet) framework by deploying millimeter Wave (mmWave) small cells with coexisting traditional sub-6GHz macro cells to achieve improved coverage and high data rate. We consider randomly-deployed macro base stations throughout the network whereas mmWave Small Base Stations (SBSs) are deployed in the areas with high User Equipment (UE) density. Such user centric deployment of mmWave SBSs inevitably incurs correlation between UE and SBSs. For a realistic scenario where the UEs are distributed according to Poisson cluster process and directional beamforming with line-of-sight and non-line-of-sight transmissions is adopted for mmWave communication. By using tools from stochastic geometry, we develop an analytical framework to analyze various performance metrics in the downlink hybrid HCNets under biased received power association. For UE clustering we considered Thomas cluster process and derive expressions for the association probability, coverage probability, area spectral efficiency, and energy efficiency. We also provide Monte Carlo simulation results to validate the accuracy of the derived expressions. Furthermore, we analyze the impact of mmWave operating frequency, antenna gain, small cell biasing, and BSs density to get useful engineering insights into the performance of hybrid mmWave HCNets. Our results show that network performance is significantly improved by deploying millimeter wave SBS instead of microwave BS in hot spots.

本文分析了一种混合异构蜂窝网络(HCNet)框架,通过部署毫米波(mmWave)小基站与共存的传统 6GHz 以下宏基站,实现更好的覆盖和更高的数据传输速率。我们考虑在整个网络中随机部署宏基站,而毫米波小基站(SBS)则部署在用户设备(UE)密度高的区域。这种以用户为中心的毫米波 SBS 部署不可避免地会在 UE 和 SBS 之间产生相关性。在现实场景中,UE 按照泊松集群过程分布,毫米波通信采用视距和非视距传输的定向波束成形。通过使用随机几何工具,我们开发了一个分析框架,用于分析下行链路混合 HCNets 在有偏差的接收功率关联下的各种性能指标。对于 UE 聚类,我们考虑了托马斯聚类过程,并推导出了关联概率、覆盖概率、区域频谱效率和能效的表达式。我们还提供了蒙特卡罗模拟结果,以验证推导表达式的准确性。此外,我们还分析了毫米波工作频率、天线增益、小基站偏置和基站密度的影响,从而获得了有关混合毫米波 HCN 网络性能的有用工程见解。我们的研究结果表明,在热点地区部署毫米波 SBS 而不是微波 BS 可以显著提高网络性能。
{"title":"Hybrid millimeter wave heterogeneous networks with spatially correlated user equipment","authors":"","doi":"10.1016/j.dcan.2022.10.022","DOIUrl":"10.1016/j.dcan.2022.10.022","url":null,"abstract":"<div><p>In this paper, we analyze a hybrid Heterogeneous Cellular Network (HCNet) framework by deploying millimeter Wave (mmWave) small cells with coexisting traditional sub-6GHz macro cells to achieve improved coverage and high data rate. We consider randomly-deployed macro base stations throughout the network whereas mmWave Small Base Stations (SBSs) are deployed in the areas with high User Equipment (UE) density. Such user centric deployment of mmWave SBSs inevitably incurs correlation between UE and SBSs. For a realistic scenario where the UEs are distributed according to Poisson cluster process and directional beamforming with line-of-sight and non-line-of-sight transmissions is adopted for mmWave communication. By using tools from stochastic geometry, we develop an analytical framework to analyze various performance metrics in the downlink hybrid HCNets under biased received power association. For UE clustering we considered Thomas cluster process and derive expressions for the association probability, coverage probability, area spectral efficiency, and energy efficiency. We also provide Monte Carlo simulation results to validate the accuracy of the derived expressions. Furthermore, we analyze the impact of mmWave operating frequency, antenna gain, small cell biasing, and BSs density to get useful engineering insights into the performance of hybrid mmWave HCNets. Our results show that network performance is significantly improved by deploying millimeter wave SBS instead of microwave BS in hot spots.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 904-917"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002310/pdfft?md5=973cc82a3f5ad2909702271a161a3652&pid=1-s2.0-S2352864822002310-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42234446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Semi-supervised learning based hybrid beamforming under time-varying propagation environments 时变传播环境下基于半监督学习的混合波束形成
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.018

Hybrid precoding is considered as a promising low-cost technique for millimeter wave (mm-wave) massive Multi-Input Multi-Output (MIMO) systems. In this work, referring to the time-varying propagation circumstances, with semi-supervised Incremental Learning (IL), we propose an online hybrid beamforming scheme. Firstly, given the constraint of constant modulus on analog beamformer and combiner, we propose a new broad-network-based structure for the design model of hybrid beamforming. Compared with the existing network structure, the proposed network structure can achieve better transmission performance and lower complexity. Moreover, to enhance the efficiency of IL further, by combining the semi-supervised graph with IL, we propose a hybrid beamforming scheme based on chunk-by-chunk semi-supervised learning, where only few transmissions are required to calculate the label and all other unlabelled transmissions would also be put into a training data chunk. Unlike the existing single-by-single approach where transmissions during the model update are not taken into the consideration of model update, all transmissions, even the ones during the model update, would make contributions to model update in the proposed method. During the model update, the amount of unlabelled transmissions is very large and they also carry some information, the prediction performance can be enhanced to some extent by these unlabelled channel data. Simulation results demonstrate the spectral efficiency of the proposed method outperforms that of the existing single-by-single approach. Besides, we prove the general complexity of the proposed method is lower than that of the existing approach and give the condition under which its absolute complexity outperforms that of the existing approach.

在毫米波(mm-wave)大规模多输入多输出(MIMO)系统中,混合预编码被认为是一种前景广阔的低成本技术。在这项工作中,我们针对时变传播环境,通过半监督增量学习(IL),提出了一种在线混合波束成形方案。首先,考虑到模拟波束成形器和合路器模数恒定的约束条件,我们提出了一种新的基于宽网络结构的混合波束成形设计模型。与现有的网络结构相比,所提出的网络结构能实现更好的传输性能和更低的复杂度。此外,为了进一步提高 IL 的效率,我们将半监督图与 IL 结合起来,提出了一种基于逐块半监督学习的混合波束成形方案,在这种方案中,只需要少量传输来计算标签,其他所有未标记的传输也将被放入一个训练数据块中。与现有的单次方法不同的是,在模型更新过程中的传输不会被纳入模型更新的考虑范围,而在建议的方法中,所有传输,即使是模型更新过程中的传输,都会对模型更新做出贡献。在模型更新过程中,未标记的传输量非常大,它们也携带了一些信息,这些未标记的信道数据可以在一定程度上提高预测性能。仿真结果表明,所提方法的频谱效率优于现有的逐单方法。此外,我们还证明了所提方法的一般复杂度低于现有方法,并给出了其绝对复杂度优于现有方法的条件。
{"title":"Semi-supervised learning based hybrid beamforming under time-varying propagation environments","authors":"","doi":"10.1016/j.dcan.2023.01.018","DOIUrl":"10.1016/j.dcan.2023.01.018","url":null,"abstract":"<div><p>Hybrid precoding is considered as a promising low-cost technique for millimeter wave (mm-wave) massive Multi-Input Multi-Output (MIMO) systems. In this work, referring to the time-varying propagation circumstances, with semi-supervised Incremental Learning (IL), we propose an online hybrid beamforming scheme. Firstly, given the constraint of constant modulus on analog beamformer and combiner, we propose a new broad-network-based structure for the design model of hybrid beamforming. Compared with the existing network structure, the proposed network structure can achieve better transmission performance and lower complexity. Moreover, to enhance the efficiency of IL further, by combining the semi-supervised graph with IL, we propose a hybrid beamforming scheme based on chunk-by-chunk semi-supervised learning, where only few transmissions are required to calculate the label and all other unlabelled transmissions would also be put into a training data chunk. Unlike the existing single-by-single approach where transmissions during the model update are not taken into the consideration of model update, all transmissions, even the ones during the model update, would make contributions to model update in the proposed method. During the model update, the amount of unlabelled transmissions is very large and they also carry some information, the prediction performance can be enhanced to some extent by these unlabelled channel data. Simulation results demonstrate the spectral efficiency of the proposed method outperforms that of the existing single-by-single approach. Besides, we prove the general complexity of the proposed method is lower than that of the existing approach and give the condition under which its absolute complexity outperforms that of the existing approach.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 1168-1177"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000317/pdfft?md5=15e51103139c8d2d6b5c8e5d6603104c&pid=1-s2.0-S2352864823000317-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47745189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Position-aware packet loss optimization on service function chain placement 基于位置感知的业务功能链丢包优化
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.002

The advent of Network Function Virtualization (NFV) and Service Function Chains (SFCs) unleashes the power of dynamic creation of network services using Virtual Network Functions (VNFs). This is of great interest to network operators since poor service quality and resource wastage can potentially hurt their revenue in the long term. However, the study shows with a set of test-bed experiments that packet loss at certain positions (i.e., different VNFs) in an SFC can cause various degrees of resource wastage and performance degradation because of repeated upstream processing and transmission of retransmitted packets.

To overcome this challenge, this study focuses on resource scheduling and deployment of SFCs while considering packet loss positions. This study developed a novel SFC packet dropping cost model and formulated an SFC scheduling problem that aims to minimize overall packet dropping cost as a Mixed-Integer Linear Programming (MILP) and proved that it is NP-hard. In this study, Palos is proposed as an efficient scheme in exploiting the functional characteristics of VNFs and their positions in SFCs for scheduling resources and deployment to optimize packet dropping cost. Extensive experiment results show that Palos can achieve up to 42.73% improvement on packet dropping cost and up to 33.03% reduction on average SFC latency when compared with two other state-of-the-art schemes.

网络功能虚拟化(NFV)和服务功能链(SFC)的出现释放了利用虚拟网络功能(VNF)动态创建网络服务的力量。这引起了网络运营商的极大兴趣,因为从长远来看,服务质量差和资源浪费可能会损害他们的收入。然而,该研究通过一组测试平台实验表明,SFC 中某些位置(即不同的 VNF)的数据包丢失会造成不同程度的资源浪费和性能下降,因为要重复上游处理和传输重新传输的数据包。这项研究建立了一个新颖的 SFC 丢包成本模型,并以混合整数线性规划(MILP)的形式提出了一个旨在最小化总体丢包成本的 SFC 调度问题,并证明该问题具有 NP 难度。在这项研究中,Palos 作为一种高效方案被提出,它利用 VNF 的功能特性及其在 SFC 中的位置来调度资源和部署,从而优化丢包成本。广泛的实验结果表明,与其他两种最先进的方案相比,Palos 可将丢包成本提高 42.73%,将 SFC 平均延迟降低 33.03%。
{"title":"Position-aware packet loss optimization on service function chain placement","authors":"","doi":"10.1016/j.dcan.2023.01.002","DOIUrl":"10.1016/j.dcan.2023.01.002","url":null,"abstract":"<div><p>The advent of Network Function Virtualization (NFV) and Service Function Chains (SFCs) unleashes the power of dynamic creation of network services using Virtual Network Functions (VNFs). This is of great interest to network operators since poor service quality and resource wastage can potentially hurt their revenue in the long term. However, the study shows with a set of test-bed experiments that packet loss at certain positions (i.e., different VNFs) in an SFC can cause various degrees of resource wastage and performance degradation because of repeated upstream processing and transmission of retransmitted packets.</p><p>To overcome this challenge, this study focuses on resource scheduling and deployment of SFCs while considering packet loss positions. This study developed a novel SFC packet dropping cost model and formulated an SFC scheduling problem that aims to minimize overall packet dropping cost as a Mixed-Integer Linear Programming (MILP) and proved that it is NP-hard. In this study, <em>Palos</em> is proposed as an efficient scheme in exploiting the functional characteristics of VNFs and their positions in SFCs for scheduling resources and deployment to optimize packet dropping cost. Extensive experiment results show that <em>Palos</em> can achieve up to 42.73% improvement on packet dropping cost and up to 33.03% reduction on average SFC latency when compared with two other state-of-the-art schemes.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 1057-1067"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000160/pdfft?md5=f29887ba5852bc0c526d0fa622929345&pid=1-s2.0-S2352864823000160-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48388018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards privacy-preserving and efficient word vector learning for lightweight IoT devices 为轻量级物联网设备实现保护隐私的高效词向量学习
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.10.019
Nan Jia , Shaojing Fu , Guangquan Xu , Kai Huang , Ming Xu

Nowadays, Internet of Things (IoT) is widely deployed and brings great opportunities to change people's daily life. To realize more effective human-computer interaction in the IoT applications, the Question Answering (QA) systems implanted in the IoT services are supposed to improve the ability to understand natural language. Therefore, the distributed representation of words, which contains more semantic or syntactic information, has been playing a more and more important role in the QA systems. However, learning high-quality distributed word vectors requires lots of storage and computing resources, hence it cannot be deployed on the resource-constrained IoT devices. It is a good choice to outsource the data and computation to the cloud servers. Nevertheless, it could cause privacy risks to directly upload private data to the untrusted cloud. Therefore, realizing the word vector learning process over untrusted cloud servers without privacy leakage is an urgent and challenging task. In this paper, we present a novel efficient word vector learning scheme over encrypted data. We first design a series of arithmetic computation protocols. Then we use two non-colluding cloud servers to implement high-quality word vectors learning over encrypted data. The proposed scheme allows us to perform training word vectors on the remote cloud servers while protecting privacy. Security analysis and experiments over real data sets demonstrate that our scheme is more secure and efficient than existing privacy-preserving word vector learning schemes.

如今,物联网(IoT)已得到广泛应用,并为改变人们的日常生活带来了巨大机遇。为了在物联网应用中实现更有效的人机交互,植入物联网服务的问题解答(QA)系统理应提高理解自然语言的能力。因此,包含更多语义或句法信息的词的分布式表示在问答系统中发挥着越来越重要的作用。然而,学习高质量的分布式单词向量需要大量的存储和计算资源,因此无法在资源有限的物联网设备上部署。将数据和计算外包给云服务器是一个不错的选择。不过,直接将私人数据上传到不可信的云端可能会带来隐私风险。因此,在不受信任的云服务器上实现词向量学习过程而不泄露隐私是一项紧迫而又具有挑战性的任务。本文提出了一种新颖高效的加密数据词向量学习方案。我们首先设计了一系列算术计算协议。然后,我们使用两个非共轭云服务器在加密数据上实现高质量的词向量学习。所提出的方案允许我们在远程云服务器上进行词向量训练,同时保护隐私。对真实数据集的安全性分析和实验证明,我们的方案比现有的保护隐私的词向量学习方案更安全、更高效。
{"title":"Towards privacy-preserving and efficient word vector learning for lightweight IoT devices","authors":"Nan Jia ,&nbsp;Shaojing Fu ,&nbsp;Guangquan Xu ,&nbsp;Kai Huang ,&nbsp;Ming Xu","doi":"10.1016/j.dcan.2022.10.019","DOIUrl":"10.1016/j.dcan.2022.10.019","url":null,"abstract":"<div><p>Nowadays, Internet of Things (IoT) is widely deployed and brings great opportunities to change people's daily life. To realize more effective human-computer interaction in the IoT applications, the Question Answering (QA) systems implanted in the IoT services are supposed to improve the ability to understand natural language. Therefore, the distributed representation of words, which contains more semantic or syntactic information, has been playing a more and more important role in the QA systems. However, learning high-quality distributed word vectors requires lots of storage and computing resources, hence it cannot be deployed on the resource-constrained IoT devices. It is a good choice to outsource the data and computation to the cloud servers. Nevertheless, it could cause privacy risks to directly upload private data to the untrusted cloud. Therefore, realizing the word vector learning process over untrusted cloud servers without privacy leakage is an urgent and challenging task. In this paper, we present a novel efficient word vector learning scheme over encrypted data. We first design a series of arithmetic computation protocols. Then we use two non-colluding cloud servers to implement high-quality word vectors learning over encrypted data. The proposed scheme allows us to perform training word vectors on the remote cloud servers while protecting privacy. Security analysis and experiments over real data sets demonstrate that our scheme is more secure and efficient than existing privacy-preserving word vector learning schemes.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 895-903"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002280/pdfft?md5=69163c8cc8c0fd1dd38ce15845d9e704&pid=1-s2.0-S2352864822002280-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scheduling optimization for UAV communication coverage using virtual force-based PSO model 基于虚拟兵力PSO模型的无人机通信覆盖调度优化
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.007

When the ground communication base stations in the target area are severely destroyed, the deployment of Unmanned Aerial Vehicle (UAV) ad hoc networks can provide people with temporary communication services. Therefore, it is necessary to design a multi-UAVs cooperative control strategy to achieve better communication coverage and lower energy consumption. In this paper, we propose a multi-UAVs coverage model based on Adaptive Virtual Force-directed Particle Swarm Optimization (AVF-PSO) strategy. In particular, we first introduce the gravity model into the traditional Particle Swarm Optimization (PSO) algorithm so as to increase the probability of full coverage. Then, the energy consumption is included in the calculation of the fitness function so that maximum coverage and energy consumption can be balanced. Finally, in order to reduce the communication interference between UAVs, we design an adaptive lift control strategy based on the repulsion model to reduce the repeated coverage of multi-UAVs. Experimental results show that the proposed coverage strategy based on gravity model outperforms the existing state-of-the-art approaches. For example, in the target area of any size, the coverage rate and the repeated coverage rate of the proposed multi-UAVs scheduling are improved by 6.9–29.1%, and 2.0–56.1%, respectively. Moreover, the proposed scheduling algorithm is high adaptable to diverse execution environments.© 2022 Published by Elsevier Ltd.

当目标区域的地面通信基站遭到严重破坏时,部署无人飞行器(UAV)特设网络可以为人们提供临时通信服务。因此,有必要设计一种多无人机协同控制策略,以实现更好的通信覆盖和更低的能耗。本文提出了一种基于自适应虚拟力导向粒子群优化(AVF-PSO)策略的多无人机覆盖模型。具体而言,我们首先在传统的粒子群优化(PSO)算法中引入重力模型,以提高全覆盖概率。然后,在计算适应度函数时加入能量消耗,使最大覆盖率和能量消耗达到平衡。最后,为了减少无人机之间的通信干扰,我们设计了一种基于斥力模型的自适应升力控制策略,以减少多无人机的重复覆盖。实验结果表明,基于重力模型的覆盖策略优于现有的先进方法。例如,在任意大小的目标区域,拟议的多无人机调度的覆盖率和重复覆盖率分别提高了 6.9-29.1% 和 2.0-56.1%。此外,所提出的调度算法对不同的执行环境具有很强的适应性。
{"title":"Scheduling optimization for UAV communication coverage using virtual force-based PSO model","authors":"","doi":"10.1016/j.dcan.2023.01.007","DOIUrl":"10.1016/j.dcan.2023.01.007","url":null,"abstract":"<div><p>When the ground communication base stations in the target area are severely destroyed, the deployment of Unmanned Aerial Vehicle (UAV) ad hoc networks can provide people with temporary communication services. Therefore, it is necessary to design a multi-UAVs cooperative control strategy to achieve better communication coverage and lower energy consumption. In this paper, we propose a multi-UAVs coverage model based on Adaptive Virtual Force-directed Particle Swarm Optimization (AVF-PSO) strategy. In particular, we first introduce the gravity model into the traditional Particle Swarm Optimization (PSO) algorithm so as to increase the probability of full coverage. Then, the energy consumption is included in the calculation of the fitness function so that maximum coverage and energy consumption can be balanced. Finally, in order to reduce the communication interference between UAVs, we design an adaptive lift control strategy based on the repulsion model to reduce the repeated coverage of multi-UAVs. Experimental results show that the proposed coverage strategy based on gravity model outperforms the existing state-of-the-art approaches. For example, in the target area of any size, the coverage rate and the repeated coverage rate of the proposed multi-UAVs scheduling are improved by 6.9–29.1%, and 2.0–56.1%, respectively. Moreover, the proposed scheduling algorithm is high adaptable to diverse execution environments.© 2022 Published by Elsevier Ltd.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 1103-1112"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000202/pdfft?md5=291b743db1543baa3206b2f6159d1259&pid=1-s2.0-S2352864823000202-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41811143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel hybrid authentication protocol utilizing lattice-based cryptography for IoT devices in fog networks 一种用于雾网络中物联网设备的基于格密码的新型混合认证协议
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.003

The Internet of Things (IoT) has taken the interconnected world by storm. Due to their immense applicability, IoT devices are being scaled at exponential proportions worldwide. But, very little focus has been given to securing such devices. As these devices are constrained in numerous aspects, it leaves network designers and administrators with no choice but to deploy them with minimal or no security at all. We have seen distributed denial-of-service attacks being raised using such devices during the infamous Mirai botnet attack in 2016. Therefore we propose a lightweight authentication protocol to provide proper access to such devices. We have considered several aspects while designing our authentication protocol, such as scalability, movement, user registration, device registration, etc. To define the architecture we used a three-layered model consisting of cloud, fog, and edge devices. We have also proposed several pre-existing cipher suites based on post-quantum cryptography for evaluation and usage. We also provide a fail-safe mechanism for a situation where an authenticating server might fail, and the deployed IoT devices can self-organize to keep providing services with no human intervention. We find that our protocol works the fastest when using ring learning with errors. We prove the safety of our authentication protocol using the automated validation of Internet security protocols and applications tool. In conclusion, we propose a safe, hybrid, and fast authentication protocol for authenticating IoT devices in a fog computing environment.

物联网(IoT)在互联世界掀起了一场风暴。由于其巨大的适用性,物联网设备正在全球范围内以指数级的比例扩展。但是,人们却很少关注这些设备的安全问题。由于这些设备在许多方面受到限制,因此网络设计人员和管理员别无选择,只能在安全性极低或根本没有安全性的情况下部署这些设备。在 2016 年臭名昭著的 Mirai 僵尸网络攻击事件中,我们就曾看到利用此类设备发起的分布式拒绝服务攻击。因此,我们提出了一种轻量级身份验证协议,为此类设备提供适当的访问权限。我们在设计身份验证协议时考虑了几个方面,如可扩展性、移动性、用户注册、设备注册等。为了定义架构,我们使用了一个由云、雾和边缘设备组成的三层模型。我们还提出了几种基于后量子加密技术的现有密码套件,以供评估和使用。我们还为认证服务器可能出现故障的情况提供了故障安全机制,部署的物联网设备可以自组织,在没有人工干预的情况下继续提供服务。我们发现,在使用带误差的环形学习时,我们的协议运行速度最快。我们使用互联网安全协议和应用自动验证工具证明了我们验证协议的安全性。总之,我们提出了一种安全、混合、快速的认证协议,用于认证雾计算环境中的物联网设备。
{"title":"A novel hybrid authentication protocol utilizing lattice-based cryptography for IoT devices in fog networks","authors":"","doi":"10.1016/j.dcan.2022.12.003","DOIUrl":"10.1016/j.dcan.2022.12.003","url":null,"abstract":"<div><p>The Internet of Things (IoT) has taken the interconnected world by storm. Due to their immense applicability, IoT devices are being scaled at exponential proportions worldwide. But, very little focus has been given to securing such devices. As these devices are constrained in numerous aspects, it leaves network designers and administrators with no choice but to deploy them with minimal or no security at all. We have seen distributed denial-of-service attacks being raised using such devices during the infamous Mirai botnet attack in 2016. Therefore we propose a lightweight authentication protocol to provide proper access to such devices. We have considered several aspects while designing our authentication protocol, such as scalability, movement, user registration, device registration, etc. To define the architecture we used a three-layered model consisting of cloud, fog, and edge devices. We have also proposed several pre-existing cipher suites based on post-quantum cryptography for evaluation and usage. We also provide a fail-safe mechanism for a situation where an authenticating server might fail, and the deployed IoT devices can self-organize to keep providing services with no human intervention. We find that our protocol works the fastest when using ring learning with errors. We prove the safety of our authentication protocol using the automated validation of Internet security protocols and applications tool. In conclusion, we propose a safe, hybrid, and fast authentication protocol for authenticating IoT devices in a fog computing environment.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 989-1000"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002619/pdfft?md5=f8a2dd0f1aef52840fe8502a6ec294b5&pid=1-s2.0-S2352864822002619-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42631025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A compatible carbon efficiency information service framework based on the industrial internet identification 基于工业互联网识别的兼容碳效率信息服务框架
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.06.005

Green and low-carbon is a new development model that seeks balance between environmental sustainability and high economic growth. If explainable and available carbon emission data can be accurately obtained, it will help policy regulators and enterprise managers to more accurately implement this development strategy. A lot of research has been carried out, but it is still a difficult problem that how to accommodate and adapt the complex carbon emission data computing models and factor libraries developed by different regions, different industries and different enterprises. Meanwhile, with the rapid development of the Industrial Internet, it has not only been used for the supply chain optimization and intelligent scheduling of the manufacturing industry, but also been used by more and more industries as an important way of digital transformation. Especially in China, the Industrial Internet identification and resolution system is becoming an important digital infrastructure to uniquely identify objects and share data. Hence, a compatible carbon efficiency information service framework based on the Industrial Internet Identification is proposed in this paper to address the problem of computing and querying multi-source heterogeneous carbon emission data. We have defined a multi cooperation carbon emission data interaction model consisting of three roles and three basic operations. Further, the implementation of the framework includes carbon emission data identification, modeling, calculation, query and sharing. The practice results show that its capability and effectiveness in improving the responsiveness, accuracy, and credibility of compatible carbon efficiency data query and sharing services.

绿色低碳是一种新的发展模式,旨在寻求环境可持续性与经济高速增长之间的平衡。如果能够准确获取可解释、可利用的碳排放数据,将有助于政策监管者和企业管理者更准确地实施这一发展战略。虽然已经开展了大量研究,但如何适应不同地区、不同行业、不同企业开发的复杂碳排放数据计算模型和因子库仍是一个难题。同时,随着工业互联网的快速发展,它不仅被用于制造业的供应链优化和智能调度,还被越来越多的行业作为数字化转型的重要途径。特别是在中国,工业互联网识别与解析系统正成为唯一标识对象、共享数据的重要数字化基础设施。因此,本文提出了基于工业互联网识别的兼容碳效率信息服务框架,以解决多源异构碳排放数据的计算和查询问题。我们定义了由三个角色和三个基本操作组成的多合作碳排放数据交互模型。此外,该框架的实现包括碳排放数据的识别、建模、计算、查询和共享。实践结果表明,该框架能够有效提高兼容碳效率数据查询和共享服务的响应速度、准确性和可信度。
{"title":"A compatible carbon efficiency information service framework based on the industrial internet identification","authors":"","doi":"10.1016/j.dcan.2023.06.005","DOIUrl":"10.1016/j.dcan.2023.06.005","url":null,"abstract":"<div><p>Green and low-carbon is a new development model that seeks balance between environmental sustainability and high economic growth. If explainable and available carbon emission data can be accurately obtained, it will help policy regulators and enterprise managers to more accurately implement this development strategy. A lot of research has been carried out, but it is still a difficult problem that how to accommodate and adapt the complex carbon emission data computing models and factor libraries developed by different regions, different industries and different enterprises. Meanwhile, with the rapid development of the Industrial Internet, it has not only been used for the supply chain optimization and intelligent scheduling of the manufacturing industry, but also been used by more and more industries as an important way of digital transformation. Especially in China, the Industrial Internet identification and resolution system is becoming an important digital infrastructure to uniquely identify objects and share data. Hence, a compatible carbon efficiency information service framework based on the Industrial Internet Identification is proposed in this paper to address the problem of computing and querying multi-source heterogeneous carbon emission data. We have defined a multi cooperation carbon emission data interaction model consisting of three roles and three basic operations. Further, the implementation of the framework includes carbon emission data identification, modeling, calculation, query and sharing. The practice results show that its capability and effectiveness in improving the responsiveness, accuracy, and credibility of compatible carbon efficiency data query and sharing services.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 884-894"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823001116/pdfft?md5=60e7cc434d297bec59a0eb3964a06586&pid=1-s2.0-S2352864823001116-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47062330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Attention-relation network for mobile phone screen defect classification via a few samples 基于注意力关系网络的手机屏幕缺陷分类
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.008

How to use a few defect samples to complete the defect classification is a key challenge in the production of mobile phone screens. An attention-relation network for the mobile phone screen defect classification is proposed in this paper. The architecture of the attention-relation network contains two modules: a feature extract module and a feature metric module. Different from other few-shot models, an attention mechanism is applied to metric learning in our model to measure the distance between features, so as to pay attention to the correlation between features and suppress unwanted information. Besides, we combine dilated convolution and skip connection to extract more feature information for follow-up processing. We validate attention-relation network on the mobile phone screen defect dataset. The experimental results show that the classification accuracy of the attention-relation network is 0.9486 under the 5-way 1-shot training strategy and 0.9039 under the 5-way 5-shot setting. It achieves the excellent effect of classification for mobile phone screen defects and outperforms with dominant advantages.

如何利用少量缺陷样本完成缺陷分类是手机屏幕生产中的关键难题。本文提出了一种用于手机屏幕缺陷分类的注意力相关网络。注意力相关网络的架构包含两个模块:特征提取模块和特征度量模块。有别于其他几射模型,我们的模型在度量学习中采用了注意力机制,测量特征之间的距离,从而关注特征之间的相关性,抑制不需要的信息。此外,我们还结合了扩张卷积和跳转连接,以提取更多特征信息进行后续处理。我们在手机屏幕缺陷数据集上验证了注意力相关网络。实验结果表明,注意力相关网络的分类准确率在 5 路 1-shot 训练策略下为 0.9486,在 5 路 5-shot 设置下为 0.9039。它对手机屏幕缺陷的分类效果极佳,并以绝对优势胜出。
{"title":"Attention-relation network for mobile phone screen defect classification via a few samples","authors":"","doi":"10.1016/j.dcan.2023.01.008","DOIUrl":"10.1016/j.dcan.2023.01.008","url":null,"abstract":"<div><p>How to use a few defect samples to complete the defect classification is a key challenge in the production of mobile phone screens. An attention-relation network for the mobile phone screen defect classification is proposed in this paper. The architecture of the attention-relation network contains two modules: a feature extract module and a feature metric module. Different from other few-shot models, an attention mechanism is applied to metric learning in our model to measure the distance between features, so as to pay attention to the correlation between features and suppress unwanted information. Besides, we combine dilated convolution and skip connection to extract more feature information for follow-up processing. We validate attention-relation network on the mobile phone screen defect dataset. The experimental results show that the classification accuracy of the attention-relation network is 0.9486 under the 5-way 1-shot training strategy and 0.9039 under the 5-way 5-shot setting. It achieves the excellent effect of classification for mobile phone screen defects and outperforms with dominant advantages.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 1113-1120"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000214/pdfft?md5=0820732076ef7127cda7218776b1a772&pid=1-s2.0-S2352864823000214-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49669546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A dynamic algorithm for trust inference based on double DQN in the internet of things 物联网中基于双DQN的动态信任推理算法
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.010

The development of the Internet of Things (IoT) has brought great convenience to people. However, some information security problems such as privacy leakage are caused by communicating with risky users. It is a challenge to choose reliable users with which to interact in the IoT. Therefore, trust plays a crucial role in the IoT because trust may avoid some risks. Agents usually choose reliable users with high trust to maximize their own interests based on reinforcement learning. However, trust propagation is time-consuming, and trust changes with the interaction process in social networks. To track the dynamic changes in trust values, a dynamic trust inference algorithm named Dynamic Double DQN Trust (Dy-DDQNTrust) is proposed to predict the indirect trust values of two users without direct contact with each other. The proposed algorithm simulates the interactions among users by double DQN. Firstly, CurrentNet and TargetNet networks are used to select users for interaction. The users with high trust are chosen to interact in future iterations. Secondly, the trust value is updated dynamically until a reliable trust path is found according to the result of the interaction. Finally, the trust value between indirect users is inferred by aggregating the opinions from multiple users through a Modified Collaborative Filtering Average-based Similarity (SMCFAvg) aggregation strategy. Experiments are carried out on the FilmTrust and the Epinions datasets. Compared with TidalTrust, MoleTrust, DDQNTrust, DyTrust and Dynamic Weighted Heuristic trust path Search algorithm (DWHS), our dynamic trust inference algorithm has higher prediction accuracy and better scalability.

物联网(IoT)的发展给人们带来了极大的便利。然而,与有风险的用户通信会导致一些信息安全问题,如隐私泄露。在物联网中选择可靠的用户进行交互是一项挑战。因此,信任在物联网中起着至关重要的作用,因为信任可以避免一些风险。代理通常会基于强化学习选择高信任度的可靠用户,以实现自身利益最大化。然而,信任传播非常耗时,而且信任会随着社交网络中的交互过程而变化。为了跟踪信任值的动态变化,本文提出了一种名为 "动态双 DQN 信任(Dy-DDQNTrust)"的动态信任推断算法,用于预测两个没有直接接触的用户的间接信任值。该算法通过双 DQN 模拟用户之间的交互。首先,使用 CurrentNet 和 TargetNet 网络选择互动用户。信任度高的用户会被选中在未来的迭代中进行交互。其次,根据交互结果动态更新信任值,直到找到可靠的信任路径。最后,通过基于平均相似度的修正协同过滤聚合策略(SMCFAvg)聚合多个用户的意见,推断出间接用户之间的信任值。实验在 FilmTrust 和 Epinions 数据集上进行。与 TidalTrust、MoleTrust、DDQNTrust、DyTrust 和动态加权启发式信任路径搜索算法(DWHS)相比,我们的动态信任推理算法具有更高的预测精度和更好的可扩展性。
{"title":"A dynamic algorithm for trust inference based on double DQN in the internet of things","authors":"","doi":"10.1016/j.dcan.2022.12.010","DOIUrl":"10.1016/j.dcan.2022.12.010","url":null,"abstract":"<div><p>The development of the Internet of Things (IoT) has brought great convenience to people. However, some information security problems such as privacy leakage are caused by communicating with risky users. It is a challenge to choose reliable users with which to interact in the IoT. Therefore, trust plays a crucial role in the IoT because trust may avoid some risks. Agents usually choose reliable users with high trust to maximize their own interests based on reinforcement learning. However, trust propagation is time-consuming, and trust changes with the interaction process in social networks. To track the dynamic changes in trust values, a dynamic trust inference algorithm named Dynamic Double DQN Trust (Dy-DDQNTrust) is proposed to predict the indirect trust values of two users without direct contact with each other. The proposed algorithm simulates the interactions among users by double DQN. Firstly, CurrentNet and TargetNet networks are used to select users for interaction. The users with high trust are chosen to interact in future iterations. Secondly, the trust value is updated dynamically until a reliable trust path is found according to the result of the interaction. Finally, the trust value between indirect users is inferred by aggregating the opinions from multiple users through a Modified Collaborative Filtering Average-based Similarity (SMCFAvg) aggregation strategy. Experiments are carried out on the FilmTrust and the Epinions datasets. Compared with TidalTrust, MoleTrust, DDQNTrust, DyTrust and Dynamic Weighted Heuristic trust path Search algorithm (DWHS), our dynamic trust inference algorithm has higher prediction accuracy and better scalability.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 1024-1034"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002784/pdfft?md5=877c7e95575423a8e1eedc5ae6bcbe63&pid=1-s2.0-S2352864822002784-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49084507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secure transmission in backhaul NOMA systems: A physical layer security design with untrusted user and eavesdropper 回程NOMA系统中的安全传输:一种具有不可信用户和窃听者的物理层安全设计
IF 7.5 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.005

In order to improve the Physical Layer Security (PLS) perspective, this paper aims to empower function of PLS by considering a backhaul Non-Orthogonal Multiple Access (NOMA) system in two practical situations. In the proposed schemes, the untrusted user intercepts information transmitted to the far user, or the external eavesdropper overhears confidential information sent to the far user in the context of NOMA technique. Unlike the conventional NOMA systems, this paper emphasizes the actual situations of the existence of actual illegal users and legitimate users, especially the reasonable use of relay selection architecture to improve the confidentiality performance. To evaluate the security properties of the proposed scheme, a comprehensive analysis of the Security Outage Probability (SOP) performance is first performed, and then the corresponding SOP asymptotic expressions are derived for real scenarios related to eavesdroppers and untrusted users. Numerical results are performed to verify the analysis in terms of the secure performance metric.

为了从物理层安全(PLS)的角度改进物理层安全,本文旨在通过考虑两种实际情况下的回程非正交多址(NOMA)系统来增强物理层安全的功能。在所提出的方案中,在 NOMA 技术的背景下,不受信任的用户会截获传输到远端用户的信息,或者外部窃听者会窃听发送到远端用户的机密信息。与传统的 NOMA 系统不同,本文强调了非法用户和合法用户实际存在的实际情况,特别是合理使用中继选择架构来提高保密性能。为了评估所提方案的安全性能,本文首先对安全中断概率(SOP)性能进行了全面分析,然后针对窃听者和不信任用户的相关实际情况推导出了相应的 SOP 渐近表达式。通过数值结果来验证安全性能指标方面的分析。
{"title":"Secure transmission in backhaul NOMA systems: A physical layer security design with untrusted user and eavesdropper","authors":"","doi":"10.1016/j.dcan.2022.12.005","DOIUrl":"10.1016/j.dcan.2022.12.005","url":null,"abstract":"<div><p>In order to improve the Physical Layer Security (PLS) perspective, this paper aims to empower function of PLS by considering a backhaul Non-Orthogonal Multiple Access (NOMA) system in two practical situations. In the proposed schemes, the untrusted user intercepts information transmitted to the far user, or the external eavesdropper overhears confidential information sent to the far user in the context of NOMA technique. Unlike the conventional NOMA systems, this paper emphasizes the actual situations of the existence of actual illegal users and legitimate users, especially the reasonable use of relay selection architecture to improve the confidentiality performance. To evaluate the security properties of the proposed scheme, a comprehensive analysis of the Security Outage Probability (SOP) performance is first performed, and then the corresponding SOP asymptotic expressions are derived for real scenarios related to eavesdroppers and untrusted users. Numerical results are performed to verify the analysis in terms of the secure performance metric.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 4","pages":"Pages 1001-1013"},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002735/pdfft?md5=bfc1e5fb810dd61e8d8a8bab7ba18d7c&pid=1-s2.0-S2352864822002735-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48473347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1