首页 > 最新文献

Computer Communications最新文献

英文 中文
Clustered federated learning with heterogeneous differential privacy on Non-IID data 非iid数据异构差分隐私的聚类联邦学习
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-10-20 DOI: 10.1016/j.comcom.2025.108339
Ping Guo , Cheng Bai , Mingxing Zhang , Puwadol Oak Dusadeerungsikul
Federated Learning (FL) has emerged as a promising technology that has garnered significant attention in the Internet of Things (IoT) domain. However, the non-independent and identically distributed (Non-IID) nature of IoT data, coupled with the vulnerability of gradient transmission in traditional federated learning frameworks, limits its broader applicability. Heterogeneous differential privacy offers tailored privacy protection for individual clients, making it particularly well-suited for the diverse functional requirements of IoT devices. This study proposes a clustered federated learning method with heterogeneous differential privacy (FedCDP) to balance model utility and privacy preservation on Non-IID data. Specifically, we employed a two-stage clustering technique to enhance clustering accuracy amidst noise perturbations, and implement a client verification procedure to mitigate the detrimental effects of erroneous clustering and malicious data injection. To solve the problem of noise accumulation in cluster models, we introduced an intra-cluster privacy budget weighting mechanism, and used model shuffling to prevent the server from obtaining the cluster identity corresponding to the local model. We conducted experimental evaluations under multiple data distribution scenarios, and these experimental results show that our method effectively improves robustness to noise and significantly improves model performance compared to the baseline methods. In addition, we perform ablation experiments on each module to further analyze the impact of each module on the method. These findings underscore the usability and robustness of the proposed method.
联邦学习(FL)作为一项有前途的技术在物联网(IoT)领域引起了极大的关注。然而,物联网数据的非独立和同分布(Non-IID)性质,加上传统联邦学习框架中梯度传输的脆弱性,限制了其更广泛的适用性。异构差分隐私为个人客户提供量身定制的隐私保护,特别适合物联网设备的多样化功能需求。本文提出了一种基于异构差分隐私(FedCDP)的聚类联邦学习方法,以平衡非iid数据的模型效用和隐私保护。具体来说,我们采用了一种两阶段聚类技术来提高噪声干扰下的聚类精度,并实现了一个客户端验证程序来减轻错误聚类和恶意数据注入的有害影响。为了解决集群模型中的噪声积累问题,引入了集群内隐私预算加权机制,并利用模型变换防止服务器获取与本地模型对应的集群身份。我们在多个数据分布场景下进行了实验评估,实验结果表明,与基线方法相比,我们的方法有效地提高了对噪声的鲁棒性,显著提高了模型性能。此外,我们对每个模块进行烧蚀实验,进一步分析各个模块对方法的影响。这些发现强调了所提出方法的可用性和鲁棒性。
{"title":"Clustered federated learning with heterogeneous differential privacy on Non-IID data","authors":"Ping Guo ,&nbsp;Cheng Bai ,&nbsp;Mingxing Zhang ,&nbsp;Puwadol Oak Dusadeerungsikul","doi":"10.1016/j.comcom.2025.108339","DOIUrl":"10.1016/j.comcom.2025.108339","url":null,"abstract":"<div><div>Federated Learning (FL) has emerged as a promising technology that has garnered significant attention in the Internet of Things (IoT) domain. However, the non-independent and identically distributed (Non-IID) nature of IoT data, coupled with the vulnerability of gradient transmission in traditional federated learning frameworks, limits its broader applicability. Heterogeneous differential privacy offers tailored privacy protection for individual clients, making it particularly well-suited for the diverse functional requirements of IoT devices. This study proposes a clustered federated learning method with heterogeneous differential privacy (FedCDP) to balance model utility and privacy preservation on Non-IID data. Specifically, we employed a two-stage clustering technique to enhance clustering accuracy amidst noise perturbations, and implement a client verification procedure to mitigate the detrimental effects of erroneous clustering and malicious data injection. To solve the problem of noise accumulation in cluster models, we introduced an intra-cluster privacy budget weighting mechanism, and used model shuffling to prevent the server from obtaining the cluster identity corresponding to the local model. We conducted experimental evaluations under multiple data distribution scenarios, and these experimental results show that our method effectively improves robustness to noise and significantly improves model performance compared to the baseline methods. In addition, we perform ablation experiments on each module to further analyze the impact of each module on the method. These findings underscore the usability and robustness of the proposed method.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"244 ","pages":"Article 108339"},"PeriodicalIF":4.3,"publicationDate":"2025-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145366113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
M2M group-based AI routing protocol for IoT networks 物联网网络中基于M2M组的AI路由协议
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-10-17 DOI: 10.1016/j.comcom.2025.108338
Jaime Lloret , Jesús Tomás , Pedro Luis González Ramírez , Martín Jiménez-Piedrahita , Milos Stojmenovic
Internet of Things (IoT) networks are heterogeneous networks that offer different services depending on their application environment through smart devices (also called nodes). Machine-to-Machine (M2M) routing protocols provide interconnection between nodes. However, IoT and Internet of Everything (IoE) networks are limited to constraints defined by the scenario of the services they implement. For this reason, in this paper, we propose a new routing protocol that uses Artificial intelligence (AI) to interconnect the nodes of an IoT network efficiently. The AI decides the routes based on the tables created by the Publish/Subscribe (Pub/Sub) communication system, relating it to the dataset of features of each device connected in the network (content-based filtering). Consequently, the IoT gateway selects the best node that can provide it without compromising the performance of the network. We performed a routing protocol simulation between the machine that requests resources and who provides them. The proposal is based on a multi-objective optimization technique that uses evolutionary algorithms. The results show that the algorithm selects the most optimal node that can provide the requested resources without any constraint violation and evaluates the most efficient criteria. Consequently, the proposed algorithm can be applied to provide IoT services attending to several constraints derived from the scenarios where the system is implemented.
物联网(IoT)网络是一种异构网络,通过智能设备(也称为节点)根据其应用环境提供不同的服务。机器对机器(M2M)路由协议提供节点之间的互连。然而,物联网和万物互联(IoE)网络受限于它们实现的服务场景所定义的约束。因此,在本文中,我们提出了一种新的路由协议,该协议使用人工智能(AI)有效地互连物联网网络的节点。AI根据发布/订阅(Pub/Sub)通信系统创建的表来决定路由,并将其与网络中连接的每个设备的特征数据集(基于内容的过滤)相关联。因此,物联网网关选择可以在不影响网络性能的情况下提供它的最佳节点。我们在请求资源的机器和提供资源的机器之间执行了路由协议模拟。该方案基于一种采用进化算法的多目标优化技术。结果表明,该算法在不违反约束的情况下选择最优节点,并评估最有效的准则。因此,所提出的算法可以应用于提供物联网服务,以满足来自系统实施场景的几个约束。
{"title":"M2M group-based AI routing protocol for IoT networks","authors":"Jaime Lloret ,&nbsp;Jesús Tomás ,&nbsp;Pedro Luis González Ramírez ,&nbsp;Martín Jiménez-Piedrahita ,&nbsp;Milos Stojmenovic","doi":"10.1016/j.comcom.2025.108338","DOIUrl":"10.1016/j.comcom.2025.108338","url":null,"abstract":"<div><div>Internet of Things (IoT) networks are heterogeneous networks that offer different services depending on their application environment through smart devices (also called nodes). Machine-to-Machine (M2M) routing protocols provide interconnection between nodes. However, IoT and Internet of Everything (IoE) networks are limited to constraints defined by the scenario of the services they implement. For this reason, in this paper, we propose a new routing protocol that uses Artificial intelligence (AI) to interconnect the nodes of an IoT network efficiently. The AI decides the routes based on the tables created by the Publish/Subscribe (Pub/Sub) communication system, relating it to the dataset of features of each device connected in the network (content-based filtering). Consequently, the IoT gateway selects the best node that can provide it without compromising the performance of the network. We performed a routing protocol simulation between the machine that requests resources and who provides them. The proposal is based on a multi-objective optimization technique that uses evolutionary algorithms. The results show that the algorithm selects the most optimal node that can provide the requested resources without any constraint violation and evaluates the most efficient criteria. Consequently, the proposed algorithm can be applied to provide IoT services attending to several constraints derived from the scenarios where the system is implemented.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"244 ","pages":"Article 108338"},"PeriodicalIF":4.3,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145366116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FANT: Flexible active in-band network telemetry FANT:灵活的主动带内网络遥测
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-10-17 DOI: 10.1016/j.comcom.2025.108336
Mingwei Cui, Yufan Peng, Ying Wang, Tianyuan Niu, Fan Yang
With the ever-increasing complexity of networks, the need for fine-grained and comprehensive network monitoring has become crucial. In order to provide higher precision and multidimensional network status, In-band Network Telemetry (INT) has been incorporated into certain modern merchant silicon devices. INT, specifically active INT (ANT), in conjunction with SDN, enables network-wide visibility by capturing device-internal status along probe traces. However, as network management applications require more measurements from different perspectives to identify potential network issues, switch vendors are continuously expanding the scope of telemetry measurements available on their devices. The proliferation of telemetry items results in increased overhead for the network and places a heavier processing load on the INT analyzer. In this paper, we introduce a novel approach called Flexible Active in-band Network Telemetry (FANT) that enhances the measurement capabilities of the system by decoupling it into a mechanism and a probe-switching policy. FANT divides the measurement space into basic and detailed parts based on the relationship between INT metadata. The mechanism of FANT leverages a combination of ANT and Software-Defined Networking (SDN) to perform network-wide basic measurements. By centrally analyzing these measurements, FANT dynamically adjusts certain port measurements from basic to detailed. Additionally, we propose two probe-switching policies to generate low-redundant Detail Probes that cover all abnormal ports. In the first policy, we present an optimized Iterative deepening A algorithm that provides near-optimal solutions in low measurement frequency scenarios. The second policy achieves improved performance and reduced overcontrol using the random cover algorithm in high measurement frequency scenarios. To validate the effectiveness of the proposed mechanism, we implement a FANT prototype system. Furthermore, we extensively evaluate FANT’s performance in various topologies, including wide area networks and data center networks of different scales.
随着网络复杂性的不断增加,对细粒度和全面的网络监控的需求变得至关重要。为了提供更高的精度和多维网络状态,带内网络遥测(INT)已被纳入某些现代商用硅器件中。INT,特别是活动INT (ANT),与SDN结合,通过沿着探针跟踪捕获设备内部状态来实现网络范围的可见性。然而,由于网络管理应用程序需要从不同的角度进行更多的测量以识别潜在的网络问题,交换机供应商正在不断扩大其设备上可用的遥测测量范围。遥测项目的激增导致了网络开销的增加,并给INT分析器带来了更重的处理负载。在本文中,我们介绍了一种称为柔性有源带内网络遥测(FANT)的新方法,该方法通过将系统解耦为机制和探针交换策略来增强系统的测量能力。FANT根据INT元数据之间的关系将度量空间划分为基本部分和详细部分。FANT的机制利用ANT和软件定义网络(SDN)的组合来执行全网范围的基本测量。通过集中分析这些测量值,FANT动态调整某些端口测量值,从基本到详细。此外,我们提出了两种探针交换策略来生成覆盖所有异常端口的低冗余细节探针。在第一个策略中,我们提出了一个优化的迭代深化A *算法,该算法在低测量频率的情况下提供了接近最优的解决方案。第二种策略在高测量频率场景下使用随机覆盖算法提高了性能并减少了过度控制。为了验证所提出机制的有效性,我们实现了一个FANT原型系统。此外,我们广泛评估了FANT在各种拓扑结构中的性能,包括不同规模的广域网和数据中心网络。
{"title":"FANT: Flexible active in-band network telemetry","authors":"Mingwei Cui,&nbsp;Yufan Peng,&nbsp;Ying Wang,&nbsp;Tianyuan Niu,&nbsp;Fan Yang","doi":"10.1016/j.comcom.2025.108336","DOIUrl":"10.1016/j.comcom.2025.108336","url":null,"abstract":"<div><div>With the ever-increasing complexity of networks, the need for fine-grained and comprehensive network monitoring has become crucial. In order to provide higher precision and multidimensional network status, In-band Network Telemetry (INT) has been incorporated into certain modern merchant silicon devices. INT, specifically active INT (ANT), in conjunction with SDN, enables network-wide visibility by capturing device-internal status along probe traces. However, as network management applications require more measurements from different perspectives to identify potential network issues, switch vendors are continuously expanding the scope of telemetry measurements available on their devices. The proliferation of telemetry items results in increased overhead for the network and places a heavier processing load on the INT analyzer. In this paper, we introduce a novel approach called Flexible Active in-band Network Telemetry (FANT) that enhances the measurement capabilities of the system by decoupling it into a mechanism and a probe-switching policy. FANT divides the measurement space into basic and detailed parts based on the relationship between INT metadata. The mechanism of FANT leverages a combination of ANT and Software-Defined Networking (SDN) to perform network-wide basic measurements. By centrally analyzing these measurements, FANT dynamically adjusts certain port measurements from basic to detailed. Additionally, we propose two probe-switching policies to generate <em>low-redundant</em> Detail Probes that cover all abnormal ports. In the first policy, we present an optimized <em>Iterative deepening</em> <span><math><msup><mrow><mi>A</mi></mrow><mrow><mo>∗</mo></mrow></msup></math></span> algorithm that provides near-optimal solutions in low measurement frequency scenarios. The second policy achieves improved performance and reduced overcontrol using the <em>random cover</em> algorithm in high measurement frequency scenarios. To validate the effectiveness of the proposed mechanism, we implement a FANT prototype system. Furthermore, we extensively evaluate FANT’s performance in various topologies, including wide area networks and data center networks of different scales.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"244 ","pages":"Article 108336"},"PeriodicalIF":4.3,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145467570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An effective method for Data Aggregation Point placement in LoRaWAN network for smart metering service 一种用于智能计量服务的LoRaWAN网络数据汇聚点的有效布置方法
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-10-09 DOI: 10.1016/j.comcom.2025.108335
Thiago A.R. da Silva , Geraldo A. Sarmento N. , Luís H. de O. Mendes , Pedro F. de Abreu , Artur F. da S. Veloso , Fernando J.V. Santos , José Valdemir dos R. Júnior
Electric grids have been restructured with Smart Grids (SGs), and the deployment of Advanced Metering Infrastructure (AMI) systems is a fundamental part of this process. An AMI system consists of Smart Meters (SMs) that collect energy consumption data and send it to the utility company through Data Aggregation Points (DAPs). Thus, methods to determine the appropriate quantity and positions of DAPs become necessary. In this context, this paper proposes a method called DAP Placement (DPlace), which determines the minimum number of DAPs and applies the Fuzzy C-Means algorithm to position the DAPs at coordinates that enhance the successful reception of packets, ensuring that smart metering applications can adequately transmit data through a Long Range Wide-Area Network (LoRaWAN) network. The proposed method is compared to three state-of-the-art solutions through simulations, and the results show that the DPlace method reduces the required number of DAPs by up to 37.04% while achieving communication performance – evaluated through metrics such as packet delivery ratio and delay – similar to related methods, even with less DAPs.
电网已经通过智能电网(SGs)进行了重组,而先进计量基础设施(AMI)系统的部署是这一过程的基本组成部分。AMI系统由智能电表(SMs)组成,它收集能源消耗数据并通过数据聚合点(dap)将其发送给公用事业公司。因此,确定适当数量和位置的方法是必要的。在此背景下,本文提出了一种称为DAP放置(DPlace)的方法,该方法确定DAP的最小数量,并应用模糊C-Means算法将DAP定位在增强数据包成功接收的坐标上,确保智能计量应用可以通过远程广域网(LoRaWAN)网络充分传输数据。通过仿真将所提出的方法与三种最先进的解决方案进行了比较,结果表明,DPlace方法在实现通信性能(通过数据包传输比和延迟等指标进行评估)的同时,将所需的dap数量减少了37.04%,与相关方法相似,即使dap更少。
{"title":"An effective method for Data Aggregation Point placement in LoRaWAN network for smart metering service","authors":"Thiago A.R. da Silva ,&nbsp;Geraldo A. Sarmento N. ,&nbsp;Luís H. de O. Mendes ,&nbsp;Pedro F. de Abreu ,&nbsp;Artur F. da S. Veloso ,&nbsp;Fernando J.V. Santos ,&nbsp;José Valdemir dos R. Júnior","doi":"10.1016/j.comcom.2025.108335","DOIUrl":"10.1016/j.comcom.2025.108335","url":null,"abstract":"<div><div>Electric grids have been restructured with Smart Grids (SGs), and the deployment of Advanced Metering Infrastructure (AMI) systems is a fundamental part of this process. An AMI system consists of Smart Meters (SMs) that collect energy consumption data and send it to the utility company through Data Aggregation Points (DAPs). Thus, methods to determine the appropriate quantity and positions of DAPs become necessary. In this context, this paper proposes a method called DAP Placement (DPlace), which determines the minimum number of DAPs and applies the Fuzzy C-Means algorithm to position the DAPs at coordinates that enhance the successful reception of packets, ensuring that smart metering applications can adequately transmit data through a Long Range Wide-Area Network (LoRaWAN) network. The proposed method is compared to three state-of-the-art solutions through simulations, and the results show that the DPlace method reduces the required number of DAPs by up to 37.04% while achieving communication performance – evaluated through metrics such as packet delivery ratio and delay – similar to related methods, even with less DAPs.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108335"},"PeriodicalIF":4.3,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Requirement-driven multi-workflow scheduling based on improved evolutionary multitasking embedded bi-level optimization 基于改进进化多任务嵌入式双级优化的需求驱动多工作流调度
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-10-06 DOI: 10.1016/j.comcom.2025.108334
Mengxia Li , Linjie Wu , Yan Zhang , Xingjuan Cai
When multiple users share the same cloud service resources, cloud computing makes it more difficult for workflow applications to schedule tasks. Therefore, it is important to design an appropriate scheme that benefits both users and cloud service providers. We create a bi-level optimization model to explain cloud client cooperation in order to address this issue. In order to ensure fairness while vying for resources across several processes, users combine execution time and cost as a goal for user satisfaction. They also coordinate resource allocation to minimize the error between the time and cost of a single workflow execution. Cloud service providers maximize their profits by rationally and dynamically adjusting prices. In the solution method to maintain the diversity of the population in the optimization process, adaptive cross-variance probability and population local replacement strategy are proposed, which reduces the poorly adapted individuals to play the game and accelerates the convergence of the population. The experimental findings demonstrate that the model’s algorithm’s validity is confirmed by various datasets and that the user’s service quality and the cloud service provider’s interests are balanced.
当多个用户共享相同的云服务资源时,云计算使工作流应用程序更难调度任务。因此,设计一个对用户和云服务提供商都有利的合适方案非常重要。为了解决这个问题,我们创建了一个双层优化模型来解释云客户端的合作。为了确保在多个进程之间争夺资源时的公平性,用户将执行时间和成本结合起来作为用户满意度的目标。它们还协调资源分配,以最大限度地减少单个工作流执行的时间和成本之间的错误。云服务提供商通过合理、动态地调整价格,实现利润最大化。在优化过程中保持种群多样性的求解方法中,提出了自适应交叉方差概率和种群局部替代策略,减少了适应性差的个体参与博弈,加速了种群的收敛。实验结果表明,该模型算法的有效性得到了各种数据集的验证,用户的服务质量和云服务提供商的利益得到了平衡。
{"title":"Requirement-driven multi-workflow scheduling based on improved evolutionary multitasking embedded bi-level optimization","authors":"Mengxia Li ,&nbsp;Linjie Wu ,&nbsp;Yan Zhang ,&nbsp;Xingjuan Cai","doi":"10.1016/j.comcom.2025.108334","DOIUrl":"10.1016/j.comcom.2025.108334","url":null,"abstract":"<div><div>When multiple users share the same cloud service resources, cloud computing makes it more difficult for workflow applications to schedule tasks. Therefore, it is important to design an appropriate scheme that benefits both users and cloud service providers. We create a bi-level optimization model to explain cloud client cooperation in order to address this issue. In order to ensure fairness while vying for resources across several processes, users combine execution time and cost as a goal for user satisfaction. They also coordinate resource allocation to minimize the error between the time and cost of a single workflow execution. Cloud service providers maximize their profits by rationally and dynamically adjusting prices. In the solution method to maintain the diversity of the population in the optimization process, adaptive cross-variance probability and population local replacement strategy are proposed, which reduces the poorly adapted individuals to play the game and accelerates the convergence of the population. The experimental findings demonstrate that the model’s algorithm’s validity is confirmed by various datasets and that the user’s service quality and the cloud service provider’s interests are balanced.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108334"},"PeriodicalIF":4.3,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145325768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
META: Multi-classified encrypted traffic anomaly detection with fine-grained flow and interaction analysis META:具有细粒度流和交互分析的多分类加密流量异常检测
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-09-30 DOI: 10.1016/j.comcom.2025.108333
Boyu Kuang , Yuchi Chen , Yansong Gao , Yaqian Xu , Anmin Fu , Willy Susilo
The pervasive implementation of encryption mechanisms has introduced considerable obstacles to anomalous traffic detection, rendering conventional attack detection methodologies that rely on packet payload characteristics ineffectual. In the absence of plaintext information, current anomaly encrypted traffic detection mainly relies on traffic data analysis to identify and characterize anomalous attack patterns in encrypted traffic, employing machine learning or deep learning models. However, the existing methods still suffer from limited detection capabilities, especially the ability to classify multi-class attacks due to insufficient internal and external features. In this paper, we propose a Multi-classified Encrypted Traffic Anomaly Detection (META) method. META refines and extends the available feature dimensions in encrypted traffic by leveraging two key aspects: the internal interaction behavior information within the traffic and the external interaction behavior information in network topology. Specifically, an in-depth examination of the internal packet interaction features is undertaken, resulting in a novel feature set, designated as META-Features, encompassing 278 fine-grained statistical features. Furthermore, a Graph Neural Network (GNN) is employed to learn the external interaction behavior in the network topology from the embedding of the IP node graph and flow edge graph. The results of the experiments demonstrate that the refined feature set META-Features significantly enhances the model’s detection capabilities. Thereby, the META-GNN model exhibits superior performance compared to the traditional approaches, with an accuracy of 91.90% and an F1-score of 87.41%.
加密机制的普遍实现为异常流量检测带来了相当大的障碍,使得依赖数据包有效负载特征的传统攻击检测方法无效。在没有明文信息的情况下,目前的异常加密流量检测主要依靠流量数据分析来识别和表征加密流量中的异常攻击模式,采用机器学习或深度学习模型。但是,现有方法的检测能力仍然有限,特别是由于内部和外部特征不足,无法对多类攻击进行分类。本文提出了一种多分类加密流量异常检测(META)方法。META通过利用流量内部交互行为信息和网络拓扑中的外部交互行为信息这两个关键方面,对加密流量中可用的特征维度进行细化和扩展。具体来说,对内部数据包交互特征进行了深入的检查,产生了一个新的特征集,称为META-Features,包含278个细粒度统计特征。此外,利用图神经网络(GNN)从IP节点图和流边图的嵌入中学习网络拓扑中的外部交互行为。实验结果表明,改进后的META-Features特征集显著提高了模型的检测能力。因此,META-GNN模型的准确率为91.90%,f1得分为87.41%,优于传统方法。
{"title":"META: Multi-classified encrypted traffic anomaly detection with fine-grained flow and interaction analysis","authors":"Boyu Kuang ,&nbsp;Yuchi Chen ,&nbsp;Yansong Gao ,&nbsp;Yaqian Xu ,&nbsp;Anmin Fu ,&nbsp;Willy Susilo","doi":"10.1016/j.comcom.2025.108333","DOIUrl":"10.1016/j.comcom.2025.108333","url":null,"abstract":"<div><div>The pervasive implementation of encryption mechanisms has introduced considerable obstacles to anomalous traffic detection, rendering conventional attack detection methodologies that rely on packet payload characteristics ineffectual. In the absence of plaintext information, current anomaly encrypted traffic detection mainly relies on traffic data analysis to identify and characterize anomalous attack patterns in encrypted traffic, employing machine learning or deep learning models. However, the existing methods still suffer from limited detection capabilities, especially the ability to classify multi-class attacks due to insufficient internal and external features. In this paper, we propose a Multi-classified Encrypted Traffic Anomaly Detection (META) method. META refines and extends the available feature dimensions in encrypted traffic by leveraging two key aspects: the internal interaction behavior information within the traffic and the external interaction behavior information in network topology. Specifically, an in-depth examination of the internal packet interaction features is undertaken, resulting in a novel feature set, designated as META-Features, encompassing 278 fine-grained statistical features. Furthermore, a Graph Neural Network (GNN) is employed to learn the external interaction behavior in the network topology from the embedding of the IP node graph and flow edge graph. The results of the experiments demonstrate that the refined feature set META-Features significantly enhances the model’s detection capabilities. Thereby, the META-GNN model exhibits superior performance compared to the traditional approaches, with an accuracy of 91.90% and an F1-score of 87.41%.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108333"},"PeriodicalIF":4.3,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Evaluating scalability of median-based ADR under different mobility conditions 评估不同移动条件下基于中值的ADR的可扩展性
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-09-24 DOI: 10.1016/j.comcom.2025.108322
Geraldo A. Sarmento Neto , Thiago A.R. da Silva , Artur F. da S. Veloso , Pedro Felipe de Abreu , Luis H. de O. Mendes , J. Valdemir dos Reis Jr
The LoRaWAN protocol is widely used in Internet of Things (IoT) applications due to its ability to provide long-range, low-power communication. The Adaptive Data Rate (ADR) mechanism dynamically adjusts transmission parameters to optimize energy consumption. However, ADR is primarily designed for static devices, which limits its effectiveness in mobile environments, where fluctuating signal conditions can degrade performance. To address this limitation, the Median-Based ADR (MB-ADR) scheme was introduced, leveraging statistical measures to improve ADR adaptability to changing channel conditions. This study evaluates the scalability of MB-ADR in networks with up to 1,000 end devices and node speeds of up to 20 m/s, considering mobility models such as Random Walk and Gauss–Markov. The results show that MB-ADR demonstrates superior performance in scenarios with realistic mobility patterns, particularly under the Steady-State Random Waypoint model, resulting in improvements of up to 15% in Packet Delivery Ratio (PDR) and 55% in energy efficiency compared to a Kalman filter-based scheme under the same mobility model. Additionally, the analysis demonstrates the effectiveness of MB-ADR in improving throughput and reducing collisions by promoting an efficient distribution of spreading factors. Overall, the study confirms the potential of MB-ADR to enhance communication reliability and energy efficiency in mobile IoT networks, making it a viable solution for large-scale, high-density IoT deployments with variable mobility.
LoRaWAN协议广泛应用于物联网(IoT)应用,因为它能够提供远程、低功耗的通信。自适应数据速率(ADR)机制动态调整传输参数以优化能耗。然而,ADR主要是为静态设备设计的,这限制了其在移动环境中的有效性,在移动环境中,波动的信号条件会降低性能。为了解决这一限制,引入了基于中位数的ADR (MB-ADR)方案,利用统计措施来提高ADR对不断变化的信道条件的适应性。本研究评估了MB-ADR在多达1000个终端设备、节点速度高达20m /s的网络中的可扩展性,考虑了随机漫步和高斯-马尔可夫等移动模型。结果表明,MB-ADR在具有实际移动模式的场景中表现出优异的性能,特别是在稳态随机路点模型下,与基于卡尔曼滤波的方案相比,在相同的移动模型下,分组投递率(PDR)提高了15%,能源效率提高了55%。此外,分析还证明了MB-ADR通过促进传播因子的有效分布,在提高吞吐量和减少冲突方面的有效性。总体而言,该研究证实了MB-ADR在提高移动物联网网络通信可靠性和能效方面的潜力,使其成为具有可变移动性的大规模高密度物联网部署的可行解决方案。
{"title":"Evaluating scalability of median-based ADR under different mobility conditions","authors":"Geraldo A. Sarmento Neto ,&nbsp;Thiago A.R. da Silva ,&nbsp;Artur F. da S. Veloso ,&nbsp;Pedro Felipe de Abreu ,&nbsp;Luis H. de O. Mendes ,&nbsp;J. Valdemir dos Reis Jr","doi":"10.1016/j.comcom.2025.108322","DOIUrl":"10.1016/j.comcom.2025.108322","url":null,"abstract":"<div><div>The LoRaWAN protocol is widely used in Internet of Things (IoT) applications due to its ability to provide long-range, low-power communication. The Adaptive Data Rate (ADR) mechanism dynamically adjusts transmission parameters to optimize energy consumption. However, ADR is primarily designed for static devices, which limits its effectiveness in mobile environments, where fluctuating signal conditions can degrade performance. To address this limitation, the Median-Based ADR (MB-ADR) scheme was introduced, leveraging statistical measures to improve ADR adaptability to changing channel conditions. This study evaluates the scalability of MB-ADR in networks with up to 1,000 end devices and node speeds of up to 20 m/s, considering mobility models such as Random Walk and Gauss–Markov. The results show that MB-ADR demonstrates superior performance in scenarios with realistic mobility patterns, particularly under the Steady-State Random Waypoint model, resulting in improvements of up to 15% in Packet Delivery Ratio (PDR) and 55% in energy efficiency compared to a Kalman filter-based scheme under the same mobility model. Additionally, the analysis demonstrates the effectiveness of MB-ADR in improving throughput and reducing collisions by promoting an efficient distribution of spreading factors. Overall, the study confirms the potential of MB-ADR to enhance communication reliability and energy efficiency in mobile IoT networks, making it a viable solution for large-scale, high-density IoT deployments with variable mobility.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108322"},"PeriodicalIF":4.3,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Revisiting the problem of optimizing spreading factor allocations in LoRaWAN: From theory to practice 再论LoRaWAN中扩散因子分配的优化问题:从理论到实践
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-09-23 DOI: 10.1016/j.comcom.2025.108321
Dimitrios Zorbas , Aruzhan Sabyrbek , Luigi Di Puglia Pugliese
This paper revisits the problem of optimizing LoRa network success probability by proposing an optimized allocation strategy for Spreading Factors (SFs) under both uniform and Gaussian network deployments with a single or multiple gateways. More specifically, we solve the problem of finding the best SF allocations in dense network deployments whose EDs are first assigned with the minimum SF. Theoretical models are developed to quantify the success probability of transmissions, considering the capture effect as well as intra- and inter-SF interference. A mathematical optimization framework is introduced to determine the optimal SF distribution that maximizes the average probability of packet reception. The problem is solved using Mixed Integer Linear Programming (MILP), and then evaluated using simulations. Even though optimal SF allocation strategies have been proposed in the literature, no practical insights have been discovered and no real-world deployments have been considered. To this extent, the practical benefits of using improved or optimal SF settings are discovered in this paper. Simulation results confirm the theoretical findings while they demonstrate an up to 10 percentage points improvements in Packet Reception Ratio (PRR) in the real-world use-case.
本文通过提出一种具有单个或多个网关的均匀和高斯网络部署下的扩散因子(SFs)优化分配策略,重新研究了优化LoRa网络成功概率的问题。更具体地说,我们解决了在密集网络部署中寻找最佳SF分配的问题,这些网络部署的ed首先被分配最小SF。考虑到捕获效应以及sf内部和sf之间的干扰,建立了理论模型来量化传输的成功概率。引入数学优化框架来确定使分组接收平均概率最大化的最优SF分布。利用混合整数线性规划(MILP)方法求解了该问题,并用仿真对其进行了评价。尽管在文献中提出了最优的SF分配策略,但没有发现实际的见解,也没有考虑到实际的部署。在这种程度上,本文发现了使用改进或最佳SF设置的实际好处。仿真结果证实了理论发现,同时它们在实际用例中展示了高达10个百分点的数据包接收比(PRR)改进。
{"title":"Revisiting the problem of optimizing spreading factor allocations in LoRaWAN: From theory to practice","authors":"Dimitrios Zorbas ,&nbsp;Aruzhan Sabyrbek ,&nbsp;Luigi Di Puglia Pugliese","doi":"10.1016/j.comcom.2025.108321","DOIUrl":"10.1016/j.comcom.2025.108321","url":null,"abstract":"<div><div>This paper revisits the problem of optimizing LoRa network success probability by proposing an optimized allocation strategy for Spreading Factors (SFs) under both uniform and Gaussian network deployments with a single or multiple gateways. More specifically, we solve the problem of finding the best SF allocations in dense network deployments whose EDs are first assigned with the minimum SF. Theoretical models are developed to quantify the success probability of transmissions, considering the capture effect as well as intra- and inter-SF interference. A mathematical optimization framework is introduced to determine the optimal SF distribution that maximizes the average probability of packet reception. The problem is solved using Mixed Integer Linear Programming (MILP), and then evaluated using simulations. Even though optimal SF allocation strategies have been proposed in the literature, no practical insights have been discovered and no real-world deployments have been considered. To this extent, the practical benefits of using improved or optimal SF settings are discovered in this paper. Simulation results confirm the theoretical findings while they demonstrate an up to 10 percentage points improvements in Packet Reception Ratio (PRR) in the real-world use-case.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108321"},"PeriodicalIF":4.3,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Beyond performance comparing the costs of applying Deep and Shallow Learning 除了性能比较应用深度学习和浅学习的成本
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-09-22 DOI: 10.1016/j.comcom.2025.108312
Rafael Teixeira, Leonardo Almeida, Pedro Rodrigues, Mário Antunes, Diogo Gomes, Rui L. Aguiar
The rapid growth of mobile network traffic and the emergence of complex applications, such as self-driving cars and augmented reality, demand ultra-low latency, high throughput, and massive device connectivity, which traditional network design approaches struggle to meet. These issues were initially addressed in Fifth-Generation (5G) and Beyond-5G (B5G) networks, where Artificial Intelligence (AI), particularly Deep Learning (DL), is proposed to optimize the network and to meet these demanding requirements. However, the resource constraints and time limitations inherent in telecommunication networks raise questions about the practicality of deploying large Deep Neural Networks (DNNs) in these contexts. This paper analyzes the costs of implementing DNNs by comparing them with shallow ML models across multiple datasets and evaluating factors such as execution time and model interpretability. Our findings demonstrate that shallow ML models offer comparable performance to DNNs, with significantly reduced training and inference times, achieving up to 90% acceleration. Moreover, shallow models are more interpretable, as explainability metrics struggle to agree on feature importance values even for high-performing DNNs.
移动网络流量的快速增长以及自动驾驶汽车和增强现实等复杂应用的出现,要求超低延迟、高吞吐量和大规模设备连接,这是传统网络设计方法难以满足的。这些问题最初是在第五代(5G)和超5G (B5G)网络中解决的,其中提出了人工智能(AI),特别是深度学习(DL)来优化网络并满足这些苛刻的要求。然而,电信网络固有的资源约束和时间限制对在这些环境中部署大型深度神经网络(dnn)的实用性提出了质疑。本文通过将dnn与跨多个数据集的浅ML模型进行比较,并评估执行时间和模型可解释性等因素,分析了实现dnn的成本。我们的研究结果表明,浅层机器学习模型提供了与dnn相当的性能,显著减少了训练和推理时间,实现了高达90%的加速。此外,浅模型更具可解释性,因为即使对于高性能dnn,可解释性指标也难以就特征重要性值达成一致。
{"title":"Beyond performance comparing the costs of applying Deep and Shallow Learning","authors":"Rafael Teixeira,&nbsp;Leonardo Almeida,&nbsp;Pedro Rodrigues,&nbsp;Mário Antunes,&nbsp;Diogo Gomes,&nbsp;Rui L. Aguiar","doi":"10.1016/j.comcom.2025.108312","DOIUrl":"10.1016/j.comcom.2025.108312","url":null,"abstract":"<div><div>The rapid growth of mobile network traffic and the emergence of complex applications, such as self-driving cars and augmented reality, demand ultra-low latency, high throughput, and massive device connectivity, which traditional network design approaches struggle to meet. These issues were initially addressed in Fifth-Generation (5G) and Beyond-5G (B5G) networks, where Artificial Intelligence (AI), particularly Deep Learning (DL), is proposed to optimize the network and to meet these demanding requirements. However, the resource constraints and time limitations inherent in telecommunication networks raise questions about the practicality of deploying large Deep Neural Networks (DNNs) in these contexts. This paper analyzes the costs of implementing DNNs by comparing them with shallow ML models across multiple datasets and evaluating factors such as execution time and model interpretability. Our findings demonstrate that shallow ML models offer comparable performance to DNNs, with significantly reduced training and inference times, achieving up to 90% acceleration. Moreover, shallow models are more interpretable, as explainability metrics struggle to agree on feature importance values even for high-performing DNNs.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108312"},"PeriodicalIF":4.3,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RIS-assisted LoRa networks with diversity: Impact of hardware impairments and phase noise 具有多样性的ris辅助LoRa网络:硬件损伤和相位噪声的影响
IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2025-09-20 DOI: 10.1016/j.comcom.2025.108319
Thi-Phuong-Anh Hoang , Thien Huynh-The , Tien Hoa Nguyen , Trong-Thua Huynh , Nguyen-Son Vo , Lam-Thanh Tu
This paper investigates the performance of downlink LoRa networks assisted by reconfigurable intelligent surfaces (RIS) and diversity techniques. We derive closed-form expressions for the coverage probability (Pcov) under four scenarios: phase noise at the RIS only, hardware impairments at both the gateway and end devices (EDs), the combined effect of both impairments, and an ideal benchmark case. The analysis is carried out within a unified framework that is valid for any number of RIS elements, providing key insights into the influence of hardware impairment levels, gateway transmit power, and the diversity order as the number of RIS elements grows large. The results reveal that coverage probability improves with transmit power but deteriorates under more severe hardware impairments, while the diversity order scales directly with the number of RIS elements. Monte Carlo simulations validate the analytical findings and confirm that the ideal scenario achieves the best performance, followed in order by the phase noise, hardware impairment, and combined impairment cases.
本文研究了可重构智能面(RIS)和分集技术辅助下行LoRa网络的性能。我们推导了四种情况下覆盖概率(Pcov)的封闭表达式:仅RIS处的相位噪声、网关和终端设备(ed)处的硬件损伤、两种损伤的综合影响以及理想基准情况。该分析是在一个统一的框架内进行的,该框架适用于任何数量的RIS元素,提供了硬件损伤水平、网关传输功率以及RIS元素数量增加时的分集顺序的影响的关键见解。结果表明,覆盖概率随发射功率的增加而增加,但在更严重的硬件损伤下会下降,而分集顺序与RIS元素的数量成正比。蒙特卡罗模拟验证了分析结果,并确认理想情况下实现了最佳性能,其次是相位噪声、硬件损伤和综合损伤情况。
{"title":"RIS-assisted LoRa networks with diversity: Impact of hardware impairments and phase noise","authors":"Thi-Phuong-Anh Hoang ,&nbsp;Thien Huynh-The ,&nbsp;Tien Hoa Nguyen ,&nbsp;Trong-Thua Huynh ,&nbsp;Nguyen-Son Vo ,&nbsp;Lam-Thanh Tu","doi":"10.1016/j.comcom.2025.108319","DOIUrl":"10.1016/j.comcom.2025.108319","url":null,"abstract":"<div><div>This paper investigates the performance of downlink LoRa networks assisted by reconfigurable intelligent surfaces (RIS) and diversity techniques. We derive closed-form expressions for the coverage probability (Pcov) under four scenarios: phase noise at the RIS only, hardware impairments at both the gateway and end devices (EDs), the combined effect of both impairments, and an ideal benchmark case. The analysis is carried out within a unified framework that is valid for any number of RIS elements, providing key insights into the influence of hardware impairment levels, gateway transmit power, and the diversity order as the number of RIS elements grows large. The results reveal that coverage probability improves with transmit power but deteriorates under more severe hardware impairments, while the diversity order scales directly with the number of RIS elements. Monte Carlo simulations validate the analytical findings and confirm that the ideal scenario achieves the best performance, followed in order by the phase noise, hardware impairment, and combined impairment cases.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"243 ","pages":"Article 108319"},"PeriodicalIF":4.3,"publicationDate":"2025-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145222639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Computer Communications
全部 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