首页 > 最新文献

Computer Communications最新文献

英文 中文
Learning optimal edge processing with offloading and energy harvesting 通过卸载和能量收集学习最佳边缘处理方法
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-24 DOI: 10.1016/j.comcom.2024.07.009
Andrea Fox , Francesco De Pellegrini , Eitan Altman

Modern portable devices can execute increasingly sophisticated AI models on sensed data. The complexity of such processing tasks is data-dependent and has relevant energy cost. This work develops an Age of Information Markovian model for a system where multiple battery-operated devices perform data processing and energy harvesting in parallel. Part of their computational burden is offloaded to an edge server which polls devices at given rate. The structural properties of an optimal policy for a single device-server system are derived. They permit to define a new model-free reinforcement learning method specialized for monotone policies, namely Ordered Q-Learning, providing a fast procedure to learn the optimal policy. The method is oblivious to the devices’ battery capacities, the cost and the value of data batch processing and to the dynamics of the energy harvesting process. Finally, the polling strategy of the server is optimized by combining this policy improvement technique with stochastic approximation methods. Extensive numerical results provide insight into the system properties and demonstrate that the proposed learning algorithms outperform existing baselines.

现代便携式设备可以对传感数据执行越来越复杂的人工智能模型。此类处理任务的复杂程度取决于数据,并涉及相关的能源成本。这项工作为一个系统开发了一个信息时代马尔可夫模型,在这个系统中,多个使用电池的设备并行执行数据处理和能量收集。它们的部分计算负担被卸载到以给定速率轮询设备的边缘服务器上。本文推导了单个设备-服务器系统最优策略的结构特性。它们允许定义一种专门针对单调策略的新型无模型强化学习方法,即有序 Q 学习法,它提供了一种快速学习最优策略的程序。该方法无需考虑设备的电池容量、数据批处理的成本和价值以及能量收集过程的动态。最后,通过将这种策略改进技术与随机近似方法相结合,优化了服务器的轮询策略。大量的数值结果提供了对系统特性的深入了解,并证明了所提出的学习算法优于现有的基线算法。
{"title":"Learning optimal edge processing with offloading and energy harvesting","authors":"Andrea Fox ,&nbsp;Francesco De Pellegrini ,&nbsp;Eitan Altman","doi":"10.1016/j.comcom.2024.07.009","DOIUrl":"10.1016/j.comcom.2024.07.009","url":null,"abstract":"<div><p>Modern portable devices can execute increasingly sophisticated AI models on sensed data. The complexity of such processing tasks is data-dependent and has relevant energy cost. This work develops an Age of Information Markovian model for a system where multiple battery-operated devices perform data processing and energy harvesting in parallel. Part of their computational burden is offloaded to an edge server which polls devices at given rate. The structural properties of an optimal policy for a single device-server system are derived. They permit to define a new model-free reinforcement learning method specialized for monotone policies, namely Ordered Q-Learning, providing a fast procedure to learn the optimal policy. The method is oblivious to the devices’ battery capacities, the cost and the value of data batch processing and to the dynamics of the energy harvesting process. Finally, the polling strategy of the server is optimized by combining this policy improvement technique with stochastic approximation methods. Extensive numerical results provide insight into the system properties and demonstrate that the proposed learning algorithms outperform existing baselines.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 324-338"},"PeriodicalIF":4.5,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002470/pdfft?md5=fde941168137e42a8b338b1edfd04ee3&pid=1-s2.0-S0140366424002470-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Eco-FL: Enhancing Federated Learning sustainability in edge computing through energy-efficient client selection Eco-FL:通过高能效客户端选择增强边缘计算中联合学习的可持续性
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-22 DOI: 10.1016/j.comcom.2024.07.014
Martina Savoia, Edoardo Prezioso, Valeria Mele, Francesco Piccialli

In the realm of edge cloud computing (ECC), Federated Learning (FL) revolutionizes the decentralization of machine learning (ML) models by enabling their training across multiple devices. In this way, FL preserves privacy and minimizes the need for centralized data by processing data near the source. From a communication standpoint, only the model weights are exchanged between devices. By avoiding the need to send data to a centralized location for processing, FL reduces the energy required for data transfer and supports more efficient use of computing resources at the edge. FL is particularly advantageous for resource-constrained devices, such as smartphones and IoT devices. However, this limited computational power and battery capacity and the challenge of energy consumption are critical aspects of FL systems. This paper introduces Eco-FL, an innovative methodology designed to optimize energy consumption in FL systems, in the field of Green Edge Cloud Computing (GECC). Our approach employs a device selection process that considers the entropy of the data held by the devices and their available energy reserves. This ensures that devices with lower energy availability are less likely to participate in the training rounds, prioritizing those with higher energy capacities. To evaluate the efficacy of our methodology, we utilize FedEntropy, an entropy-based aggregation method, alongside established aggregation methods such as FedAvg and FedProx for performance comparison. The effectiveness of Eco-FL in reducing energy consumption without compromising the accuracy of the FL process is demonstrated through analyses conducted on three distinct datasets. These analyses vary the β parameter of the Dirichlet distribution and account for scenarios with both homogeneous and heterogeneous initial device charges. Our findings validate Eco-FL’s potential to enhance the sustainability of FL systems by judiciously managing client participation based on energy criteria, presenting a significant step forward in the development of energy-efficient FL.

在边缘云计算(ECC)领域,联合学习(FL)通过在多台设备上对机器学习(ML)模型进行训练,彻底改变了机器学习(ML)模型的分散性。通过这种方式,FL 可以保护隐私,并通过在源头附近处理数据,最大限度地减少对集中数据的需求。从通信的角度来看,设备之间只交换模型权重。通过避免将数据发送到集中位置进行处理,FL 减少了数据传输所需的能源,并支持更有效地利用边缘计算资源。对于资源有限的设备(如智能手机和物联网设备)来说,FL 尤其具有优势。然而,有限的计算能力和电池容量以及能耗挑战是 FL 系统的关键方面。本文在绿色边缘云计算(GECC)领域介绍了 Eco-FL,这是一种旨在优化 FL 系统能耗的创新方法。我们的方法采用了一种设备选择流程,该流程考虑了设备所持数据的熵及其可用能源储备。这确保了能量可用性较低的设备不太可能参与训练轮次,而能量容量较高的设备则优先参与训练轮次。为了评估我们方法的有效性,我们将基于熵的聚合方法 FedEntropy 与 FedAvg 和 FedProx 等成熟的聚合方法进行了性能比较。通过对三个不同数据集的分析,我们证明了 Eco-FL 在降低能耗的同时不影响 FL 流程的准确性的有效性。这些分析改变了 Dirichlet 分布的 β 参数,并考虑了同质和异质初始设备电荷的情况。我们的研究结果验证了 Eco-FL 根据能源标准对客户参与进行明智管理的潜力,从而提高了 FL 系统的可持续性,在开发节能 FL 方面迈出了重要一步。
{"title":"Eco-FL: Enhancing Federated Learning sustainability in edge computing through energy-efficient client selection","authors":"Martina Savoia,&nbsp;Edoardo Prezioso,&nbsp;Valeria Mele,&nbsp;Francesco Piccialli","doi":"10.1016/j.comcom.2024.07.014","DOIUrl":"10.1016/j.comcom.2024.07.014","url":null,"abstract":"<div><p>In the realm of edge cloud computing (ECC), Federated Learning (FL) revolutionizes the decentralization of machine learning (ML) models by enabling their training across multiple devices. In this way, FL preserves privacy and minimizes the need for centralized data by processing data near the source. From a communication standpoint, only the model weights are exchanged between devices. By avoiding the need to send data to a centralized location for processing, FL reduces the energy required for data transfer and supports more efficient use of computing resources at the edge. FL is particularly advantageous for resource-constrained devices, such as smartphones and IoT devices. However, this limited computational power and battery capacity and the challenge of energy consumption are critical aspects of FL systems. This paper introduces Eco-FL, an innovative methodology designed to optimize energy consumption in FL systems, in the field of Green Edge Cloud Computing (GECC). Our approach employs a device selection process that considers the entropy of the data held by the devices and their available energy reserves. This ensures that devices with lower energy availability are less likely to participate in the training rounds, prioritizing those with higher energy capacities. To evaluate the efficacy of our methodology, we utilize FedEntropy, an entropy-based aggregation method, alongside established aggregation methods such as FedAvg and FedProx for performance comparison. The effectiveness of Eco-FL in reducing energy consumption without compromising the accuracy of the FL process is demonstrated through analyses conducted on three distinct datasets. These analyses vary the <span><math><mi>β</mi></math></span> parameter of the Dirichlet distribution and account for scenarios with both homogeneous and heterogeneous initial device charges. Our findings validate Eco-FL’s potential to enhance the sustainability of FL systems by judiciously managing client participation based on energy criteria, presenting a significant step forward in the development of energy-efficient FL.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 156-170"},"PeriodicalIF":4.5,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002524/pdfft?md5=b4eceb1ea19f7cfd7afe280857901b6e&pid=1-s2.0-S0140366424002524-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141839972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mission-critical UAV swarm coordination and cooperative positioning using an integrated ROS-LoRa-based communications architecture 使用基于 ROS-LoRa 的集成通信架构进行关键任务无人机群协调与合作定位
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-20 DOI: 10.1016/j.comcom.2024.07.011
Nicolas Souli , Maria Karatzia , Christos Georgiades , Panayiotis Kolios , Georgios Ellinas

Over the recent years unmanned aerial vehicles (UAVs) have been utilized extensively in mission-critical operations, especially as it relates to disaster management scenarios. Clearly, during these missions, the UAVs should be able to communicate effectively (amongst themselves and with the ground control station (GCS)) in order to transmit and receive commands and other related information. Moreover, accurate positioning is paramount during this type of operations. This has motivated the exploration of a number of alternative navigation methods to address robustness issues that arise when the global positioning system (GPS) becomes unavailable, due to GNSS disruption or sensor malfunction. This work addresses these issues by initially developing and implementing an integrated LoRa-ROS-based (long range communication - robot operating system) system for UAV-to-X communications. Subsequently, it presents a novel cooperative positioning approach, where a group of autonomous UAVs employ various algorithms (detection, tracking, communication, and localization) for cooperative positioning in order to counter any GPS/sensor malfunction. For evaluation purposes, a prototype multi-agent system is designed and implemented, utilizing the proposed integrated ROS-LoRa-based communication architecture, as well as sensor (inertial measurement unit - IMU) fusion. Specifically, LoRA mesh networking (using a custom printed circuit board - BALORA), is incorporated to maintain communication and distribute the sensor information between the UAVs. The prototype of the proposed communications architecture and cooperative relative positioning system (CRPS) is subsequently tested in a real-world environment, demonstrating the feasibility and effectiveness of the proposed communications solution, as well as the robust and accurate localization that is analogous to the ground truth (GPS+IMU).

近年来,无人驾驶飞行器(UAV)被广泛应用于关键任务行动中,特别是与灾害管理相关的场景。显然,在执行这些任务时,无人飞行器应能有效通信(相互之间以及与地面控制站(GCS)),以便收发指令和其他相关信息。此外,在这类行动中,精确定位至关重要。这就促使人们探索一些替代导航方法,以解决全球定位系统(GPS)因全球导航卫星系统中断或传感器故障而无法使用时出现的稳健性问题。为解决这些问题,本研究首先开发并实施了基于 LoRa-ROS(远程通信-机器人操作系统)的无人机对 X 通信集成系统。随后,它提出了一种新颖的合作定位方法,即一组自主无人机采用各种算法(探测、跟踪、通信和定位)进行合作定位,以应对任何 GPS/传感器故障。为了进行评估,我们设计并实施了一个多代理系统原型,利用了所提出的基于 ROS-LoRa 的集成通信架构以及传感器(惯性测量单元 - IMU)融合。具体来说,LoRA 网状网络(使用定制印刷电路板 - BALORA)被纳入其中,以保持无人机之间的通信并分发传感器信息。随后,在实际环境中测试了拟议通信架构和合作相对定位系统(CRPS)的原型,证明了拟议通信解决方案的可行性和有效性,以及与地面实况(GPS+IMU)类似的稳健而准确的定位。
{"title":"Mission-critical UAV swarm coordination and cooperative positioning using an integrated ROS-LoRa-based communications architecture","authors":"Nicolas Souli ,&nbsp;Maria Karatzia ,&nbsp;Christos Georgiades ,&nbsp;Panayiotis Kolios ,&nbsp;Georgios Ellinas","doi":"10.1016/j.comcom.2024.07.011","DOIUrl":"10.1016/j.comcom.2024.07.011","url":null,"abstract":"<div><p>Over the recent years unmanned aerial vehicles (UAVs) have been utilized extensively in mission-critical operations, especially as it relates to disaster management scenarios. Clearly, during these missions, the UAVs should be able to communicate effectively (amongst themselves and with the ground control station (GCS)) in order to transmit and receive commands and other related information. Moreover, accurate positioning is paramount during this type of operations. This has motivated the exploration of a number of alternative navigation methods to address robustness issues that arise when the global positioning system (GPS) becomes unavailable, due to GNSS disruption or sensor malfunction. This work addresses these issues by initially developing and implementing an integrated LoRa-ROS-based (long range communication - robot operating system) system for UAV-to-X communications. Subsequently, it presents a novel cooperative positioning approach, where a group of autonomous UAVs employ various algorithms (detection, tracking, communication, and localization) for cooperative positioning in order to counter any GPS/sensor malfunction. For evaluation purposes, a prototype multi-agent system is designed and implemented, utilizing the proposed integrated ROS-LoRa-based communication architecture, as well as sensor (inertial measurement unit - IMU) fusion. Specifically, LoRA mesh networking (using a custom printed circuit board - BALORA), is incorporated to maintain communication and distribute the sensor information between the UAVs. The prototype of the proposed communications architecture and cooperative relative positioning system (CRPS) is subsequently tested in a real-world environment, demonstrating the feasibility and effectiveness of the proposed communications solution, as well as the robust and accurate localization that is analogous to the ground truth (GPS+IMU).</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 205-216"},"PeriodicalIF":4.5,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141849998","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
Progressive updates of convolutional neural networks for enhanced reliability in small satellite applications 逐步更新卷积神经网络,提高小型卫星应用的可靠性
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-19 DOI: 10.1016/j.comcom.2024.07.012
Olga Kondrateva , Stefan Dietzel , Maximilian Schambach , Johannes Otterbach , Björn Scheuermann

Small satellites enable many important applications for both economic and scientific purposes. Many of these applications are inherently data-centric and rely on large amounts of high-resolution satellite imagery to be delivered in a timely manner. However, communicating this data to Earth is challenging due to intermittent connectivity, high packet losses, low data rates, and similar issues. Therefore, efficient onboard prioritization and data processing are essential for future satellite missions. Machine learning methods, such as deep neural networks, are very suitable for such prioritization, as they are already used extensively for satellite imagery processing and they can be deployed onboard of satellites. However, updating them to support new classification requirements when the satellite is already in orbit is difficult, as often multiple passes are required to complete model transmission due to the communication challenges. To cope with this issue, we propose a progressive transmission mechanism for model updates, which leverages vector quantization and arithmetic coding. Our mechanism allows to achieve high accuracies even with partially updated models. Evaluation results show that our mechanism significantly outperforms other less optimized transmission schemes.

小型卫星可实现许多重要的经济和科学应用。其中许多应用本质上以数据为中心,依赖于大量高分辨率卫星图像的及时传输。然而,由于间歇性连接、高数据包丢失、低数据传输速率和类似问题,将这些数据传输到地球具有挑战性。因此,高效的机载优先级排序和数据处理对于未来的卫星任务至关重要。深度神经网络等机器学习方法非常适合这种优先级排序,因为它们已被广泛用于卫星图像处理,而且可以部署在卫星上。然而,当卫星已在轨道上运行时,要更新它们以支持新的分类要求是很困难的,因为由于通信方面的挑战,往往需要多次传递才能完成模型传输。为了解决这个问题,我们提出了一种利用矢量量化和算术编码的渐进式模型更新传输机制。我们的机制即使在部分更新模型的情况下也能达到很高的精度。评估结果表明,我们的机制明显优于其他优化程度较低的传输方案。
{"title":"Progressive updates of convolutional neural networks for enhanced reliability in small satellite applications","authors":"Olga Kondrateva ,&nbsp;Stefan Dietzel ,&nbsp;Maximilian Schambach ,&nbsp;Johannes Otterbach ,&nbsp;Björn Scheuermann","doi":"10.1016/j.comcom.2024.07.012","DOIUrl":"10.1016/j.comcom.2024.07.012","url":null,"abstract":"<div><p>Small satellites enable many important applications for both economic and scientific purposes. Many of these applications are inherently data-centric and rely on large amounts of high-resolution satellite imagery to be delivered in a timely manner. However, communicating this data to Earth is challenging due to intermittent connectivity, high packet losses, low data rates, and similar issues. Therefore, efficient onboard prioritization and data processing are essential for future satellite missions. Machine learning methods, such as deep neural networks, are very suitable for such prioritization, as they are already used extensively for satellite imagery processing and they can be deployed onboard of satellites. However, updating them to support new classification requirements when the satellite is already in orbit is difficult, as often multiple passes are required to complete model transmission due to the communication challenges. To cope with this issue, we propose a progressive transmission mechanism for model updates, which leverages vector quantization and arithmetic coding. Our mechanism allows to achieve high accuracies even with partially updated models. Evaluation results show that our mechanism significantly outperforms other less optimized transmission schemes.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 185-194"},"PeriodicalIF":4.5,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424002500/pdfft?md5=0f984f65eb462578d5e1f879f226338c&pid=1-s2.0-S0140366424002500-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141839916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
QUIC Congestion Control Algorithm characteristics in mixed satellite–terrestrial emergency communication scenarios QUIC 拥塞控制算法在星地混合应急通信场景中的特点
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-19 DOI: 10.1016/j.comcom.2024.07.013
Armir Bujari , Mirko Franco , Claudio E. Palazzi , Mattia Quadrini , Cesare Roseti , Francesco Zampognaro

Reliable communications play a pivotal role in ensuring an efficient response and the coordination of recovery and rescue efforts. However, conventional communication methods may not always be accessible or dependable in such situations. In such circumstances, constellations of Low Earth Orbit (LEO) satellites can provide high bandwidth capabilities with relatively low latency, making them well-suited for supporting on-the-ground disaster management teams. Satellites can either complement or replace terrestrial telecommunication infrastructures. In this context, reliance on the recently defined QUIC protocol allows for a seamless transition from terrestrial to satellite communication as needed. Therefore, we investigate the possible use of a dual-stack node architecture along with the employment of the QUIC transport protocol for emergency communications, assuming that the backhaul link used to transfer users’ applications data may need to be changed (seamlessly). We conduct an extensive emulation study, evaluating the performance of QUIC under varying queuing policies and Congestion Control Algorithm (CCA) behaviour, providing practical insights and recommendations to enhance the protocol’s efficiency and robustness. The key aspects and configurations of QUIC protocol stack are identified, presenting optimal communication configurations leveraging CoDel and BBR CCA.

可靠的通信在确保高效响应以及协调恢复和救援工作方面发挥着关键作用。然而,在这种情况下,传统的通信方法并不总是可以使用或可靠的。在这种情况下,低地球轨道(LEO)卫星群可提供高带宽能力,延迟时间相对较短,非常适合为实地灾害管理团队提供支持。卫星可以补充或取代地面电信基础设施。在这种情况下,依靠最近定义的 QUIC 协议可以根据需要从地面通信无缝过渡到卫星通信。因此,假定用于传输用户应用数据的回程链路可能需要改变(无缝),我们研究了在应急通信中使用 QUIC 传输协议的双栈节点架构的可能性。我们进行了广泛的模拟研究,评估了 QUIC 在不同队列策略和拥塞控制算法(CCA)行为下的性能,为提高协议的效率和稳健性提供了实用的见解和建议。研究确定了 QUIC 协议栈的关键方面和配置,提出了利用 CoDel 和 BBR CCA 的最佳通信配置。
{"title":"QUIC Congestion Control Algorithm characteristics in mixed satellite–terrestrial emergency communication scenarios","authors":"Armir Bujari ,&nbsp;Mirko Franco ,&nbsp;Claudio E. Palazzi ,&nbsp;Mattia Quadrini ,&nbsp;Cesare Roseti ,&nbsp;Francesco Zampognaro","doi":"10.1016/j.comcom.2024.07.013","DOIUrl":"10.1016/j.comcom.2024.07.013","url":null,"abstract":"<div><p>Reliable communications play a pivotal role in ensuring an efficient response and the coordination of recovery and rescue efforts. However, conventional communication methods may not always be accessible or dependable in such situations. In such circumstances, constellations of Low Earth Orbit (LEO) satellites can provide high bandwidth capabilities with relatively low latency, making them well-suited for supporting on-the-ground disaster management teams. Satellites can either complement or replace terrestrial telecommunication infrastructures. In this context, reliance on the recently defined QUIC protocol allows for a seamless transition from terrestrial to satellite communication as needed. Therefore, we investigate the possible use of a dual-stack node architecture along with the employment of the QUIC transport protocol for emergency communications, assuming that the backhaul link used to transfer users’ applications data may need to be changed (seamlessly). We conduct an extensive emulation study, evaluating the performance of QUIC under varying queuing policies and Congestion Control Algorithm (CCA) behaviour, providing practical insights and recommendations to enhance the protocol’s efficiency and robustness. The key aspects and configurations of QUIC protocol stack are identified, presenting optimal communication configurations leveraging CoDel and BBR CCA.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 239-249"},"PeriodicalIF":4.5,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141849705","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
BTMDS: Blockchain trusted medical data sharing scheme with privacy protection and access control BTMDS:具有隐私保护和访问控制功能的区块链可信医疗数据共享方案
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-18 DOI: 10.1016/j.comcom.2024.07.007
Liqiu Chen, Tao Feng, Rong Ma, Jianming Shi

With the development of smart healthcare, eliminating information silos through trusted data sharing has become a social consensus, but there are still many problems that need to be solved. The multi-party sharing process of medical data usually occurs in an untrusted network environment, and the separation of data ownership and usage rights can result in the leakage of patients’ private information. Meanwhile, the communication and computation overheads of existing medical data sharing schemes are too large, resulting in inefficient data sharing. To address the above problems, we propose a blockchain-based trusted medical data sharing scheme (BTMDS) with privacy protection and access control. In it, we subdivided patient privacy into identity and data privacy, and designed a privacy protection mechanism for blockchain medical data sharing using local differential privacy technology and searchable encryption technology. The cloud server acts as a proxy server, and the on-chain-off-chain storage structure of the blockchain and the cloud server implements fine-grained access control to prevent conspiracy attacks. Security analysis proves the security of BTMDS and prioritizes it over other schemes. In terms of performance, BTMDS saves 30% and 48% in the decryption phase compared to Feng and Chen schemes, which is more suitable for digital healthcare data sharing services.

随着智慧医疗的发展,通过可信数据共享消除信息孤岛已成为社会共识,但仍有许多问题亟待解决。医疗数据的多方共享过程通常发生在不信任的网络环境中,数据所有权和使用权的分离可能导致患者隐私信息的泄露。同时,现有医疗数据共享方案的通信和计算开销过大,导致数据共享效率低下。针对上述问题,我们提出了一种具有隐私保护和访问控制功能的基于区块链的可信医疗数据共享方案(BTMDS)。其中,我们将患者隐私细分为身份隐私和数据隐私,并利用本地差分隐私技术和可搜索加密技术设计了区块链医疗数据共享的隐私保护机制。云服务器作为代理服务器,区块链和云服务器的链上-链下存储结构实现了细粒度访问控制,防止共谋攻击。安全分析证明了 BTMDS 的安全性,并将其优先于其他方案。在性能方面,BTMDS 与 Feng 和 Chen 方案相比,在解密阶段分别节省了 30% 和 48%,更适合数字医疗数据共享服务。
{"title":"BTMDS: Blockchain trusted medical data sharing scheme with privacy protection and access control","authors":"Liqiu Chen,&nbsp;Tao Feng,&nbsp;Rong Ma,&nbsp;Jianming Shi","doi":"10.1016/j.comcom.2024.07.007","DOIUrl":"10.1016/j.comcom.2024.07.007","url":null,"abstract":"<div><p>With the development of smart healthcare, eliminating information silos through trusted data sharing has become a social consensus, but there are still many problems that need to be solved. The multi-party sharing process of medical data usually occurs in an untrusted network environment, and the separation of data ownership and usage rights can result in the leakage of patients’ private information. Meanwhile, the communication and computation overheads of existing medical data sharing schemes are too large, resulting in inefficient data sharing. To address the above problems, we propose a blockchain-based trusted medical data sharing scheme (BTMDS) with privacy protection and access control. In it, we subdivided patient privacy into identity and data privacy, and designed a privacy protection mechanism for blockchain medical data sharing using local differential privacy technology and searchable encryption technology. The cloud server acts as a proxy server, and the on-chain-off-chain storage structure of the blockchain and the cloud server implements fine-grained access control to prevent conspiracy attacks. Security analysis proves the security of BTMDS and prioritizes it over other schemes. In terms of performance, BTMDS saves 30% and 48% in the decryption phase compared to Feng and Chen schemes, which is more suitable for digital healthcare data sharing services.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 279-288"},"PeriodicalIF":4.5,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141839377","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
Secure communication of intelligent reflecting surface-aided NOMA in massive MIMO networks 大规模多输入多输出网络中智能反射面辅助 NOMA 的安全通信
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-18 DOI: 10.1016/j.comcom.2024.07.003
Bahar Hazrati

A Non-Orthogonal Multiple Access (NOMA) network, in which the base station (BS) incorporates massive Multiple-Input Multiple-Output (MIMO) technology, is considered in this paper. This research study focuses on investigating physical layer security in this network when a jammer is present, leveraging intelligent Reflecting Surface (IRS) technology. The IRS is an innovative approach strategically implemented to enhance communication quality by assisting distant users in establishing a reliable connection with the BS. Two key metrics in physical layer security are evaluated: the secrecy rate (SR) for pairs of NOMA users and the secrecy outage probability (SOP). Additionally, the impact of using a jammer is assessed by comparing the network’s performance with and without a jammer. The results indicate that by increasing in the antenna numbers, the rate of secrecy is improved, and the SOP is decreased. Moreover, as the transmit signal-to-noise ratio (SNR) increases, the SR is enhanced, but the SOP is degraded. However, the increase in the IRS element numbers results in a tendency for the SOP to rise. Furthermore, it is evident that incorporating a jammer improves the network’s performance.

本文考虑的是一种非正交多址接入(NOMA)网络,其中基站(BS)采用了大规模多输入多输出(MIMO)技术。本研究的重点是利用智能反射面 (IRS) 技术,调查干扰器存在时该网络的物理层安全性。IRS 是一种战略性的创新方法,通过协助远方用户与 BS 建立可靠连接来提高通信质量。对物理层安全性的两个关键指标进行了评估:NOMA 用户对的保密率 (SR) 和保密中断概率 (SOP)。此外,通过比较有干扰器和无干扰器时的网络性能,评估了使用干扰器的影响。结果表明,随着天线数量的增加,保密率得到提高,SOP 下降。此外,随着发射信噪比(SNR)的增加,SR 得到提高,但 SOP 下降。然而,随着 IRS 信元数量的增加,SOP 有上升的趋势。此外,加入干扰器显然能提高网络性能。
{"title":"Secure communication of intelligent reflecting surface-aided NOMA in massive MIMO networks","authors":"Bahar Hazrati","doi":"10.1016/j.comcom.2024.07.003","DOIUrl":"10.1016/j.comcom.2024.07.003","url":null,"abstract":"<div><p>A Non-Orthogonal Multiple Access (NOMA) network, in which the base station (BS) incorporates massive Multiple-Input Multiple-Output (MIMO) technology, is considered in this paper. This research study focuses on investigating physical layer security in this network when a jammer is present, leveraging intelligent Reflecting Surface (IRS) technology. The IRS is an innovative approach strategically implemented to enhance communication quality by assisting distant users in establishing a reliable connection with the BS. Two key metrics in physical layer security are evaluated: the secrecy rate (SR) for pairs of NOMA users and the secrecy outage probability (SOP). Additionally, the impact of using a jammer is assessed by comparing the network’s performance with and without a jammer. The results indicate that by increasing in the antenna numbers, the rate of secrecy is improved, and the SOP is decreased. Moreover, as the transmit signal-to-noise ratio (SNR) increases, the SR is enhanced, but the SOP is degraded. However, the increase in the IRS element numbers results in a tendency for the SOP to rise. Furthermore, it is evident that incorporating a jammer improves the network’s performance.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 229-238"},"PeriodicalIF":4.5,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141849299","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
Training a Graph Neural Network to solve URLLC and eMBB coexisting in 5G networks 训练图神经网络以解决 5G 网络中并存的 URLLC 和 eMBB 问题
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-18 DOI: 10.1016/j.comcom.2024.07.008
Seyyed Mohammad Mahdi Hosseini Daneshvar, Sayyed Majid Mazinani

Coexistence of enhanced mobile broadband and ultra-reliable low latency communication in 5G networks is a challenging problem due to the conflicting requirements. In this paper, we decompose the problem into eMBB and URLLC resource allocation phases. For the first phase we propose a heuristic algorithm with O(n) runtime and prove its efficiency and optimality under min–max fairness paradigm. For the URLLC resource allocation, the puncturing framework is adopted and a novel approach using the Graph Neural Networks is proposed to maximize eMBB data rates and fairness while minimizing URLLC outage probability. We show that the runtime of this GNN-based algorithm is also O(n). To train the GNN, an application-specific loss function is designed and empirically shown to be convergent. Our simulation results show that our proposed approach performs very well in terms of eMBB data rates, fairness, and URLLC outage probability in comparison to a number of thoughtfully chosen baselines. We also demonstrate that the proposed GNN is robust to changes in network topology and traffic volume. As we show our algorithm has O(n) runtime, it is fully practical for solving the resource allocation problem in the very short time spans that are required by 5G and future generation networks.

在 5G 网络中,增强型移动宽带和超可靠低延迟通信的共存是一个具有挑战性的问题,因为两者的要求相互冲突。在本文中,我们将问题分解为 eMBB 和 URLLC 资源分配阶段。对于第一阶段,我们提出了一种运行时间为 O(n) 的启发式算法,并证明了该算法在最小-最大公平范式下的效率和最优性。对于 URLLC 资源分配,我们采用了穿刺框架,并提出了一种使用图神经网络的新方法,以最大化 eMBB 数据速率和公平性,同时最小化 URLLC 中断概率。我们证明,这种基于图神经网络的算法的运行时间也是 O(n)。为了训练 GNN,我们设计了一个针对特定应用的损失函数,并通过经验证明该函数具有收敛性。我们的仿真结果表明,与一些经过深思熟虑选择的基线相比,我们提出的方法在 eMBB 数据速率、公平性和 URLLC 中断概率方面表现非常出色。我们还证明,所提出的 GNN 对网络拓扑和流量的变化具有鲁棒性。由于我们的算法运行时间为 O(n),因此完全可以在 5G 和下一代网络所需的极短时间内解决资源分配问题。
{"title":"Training a Graph Neural Network to solve URLLC and eMBB coexisting in 5G networks","authors":"Seyyed Mohammad Mahdi Hosseini Daneshvar,&nbsp;Sayyed Majid Mazinani","doi":"10.1016/j.comcom.2024.07.008","DOIUrl":"10.1016/j.comcom.2024.07.008","url":null,"abstract":"<div><p>Coexistence of enhanced mobile broadband and ultra-reliable low latency communication in 5G networks is a challenging problem due to the conflicting requirements. In this paper, we decompose the problem into eMBB and URLLC resource allocation phases. For the first phase we propose a heuristic algorithm with <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> runtime and prove its efficiency and optimality under min–max fairness paradigm. For the URLLC resource allocation, the puncturing framework is adopted and a novel approach using the Graph Neural Networks is proposed to maximize eMBB data rates and fairness while minimizing URLLC outage probability. We show that the runtime of this GNN-based algorithm is also <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>. To train the GNN, an application-specific loss function is designed and empirically shown to be convergent. Our simulation results show that our proposed approach performs very well in terms of eMBB data rates, fairness, and URLLC outage probability in comparison to a number of thoughtfully chosen baselines. We also demonstrate that the proposed GNN is robust to changes in network topology and traffic volume. As we show our algorithm has <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> runtime, it is fully practical for solving the resource allocation problem in the very short time spans that are required by 5G and future generation networks.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 171-184"},"PeriodicalIF":4.5,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141840694","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
Locating multiple rumor sources in social networks using partial information of monitors 利用监控者的部分信息定位社交网络中的多个谣言源
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-14 DOI: 10.1016/j.comcom.2024.07.004
Ravi Kishore Devarapalli, Soumita Das, Anupam Biswas

Rumors in social media platforms and the identification of their sources is a challenging issue in modern-day computer communication. Existing approaches mostly fail to localize the source node accurately due to the lack of complete network information or timestamps. Besides, most of the techniques focused on single-source identification only, while sometimes multiple sources exist in the network. In this paper, we designed a new algorithm called Multi Snowballing with Partial Timestamps (MSPT) to find multiple sources utilizing partial timestamps available to monitors. We have explored the snowballing technique to determine the vulnerable radius that may contain the rumor source based on the partial timestamps of a few nodes. The overall complexity of the algorithm is O(NS(NS+ES)), where NS is the set of snowball nodes and ES represents edges in between snowball nodes. Extensive empirical analysis is performed on a variety of networks, which include small-scale, large-scale, and artificial networks. Empirical outcomes demonstrate that the presented algorithm is efficient in terms of error distance and execution time compared to baseline algorithms.

社交媒体平台上的谣言及其来源的识别是现代计算机通信中一个具有挑战性的问题。由于缺乏完整的网络信息或时间戳,现有方法大多无法准确定位源节点。此外,大多数技术只关注单一来源的识别,而有时网络中存在多个来源。在本文中,我们设计了一种名为 "带部分时间戳的多雪球算法(MSPT)"的新算法,利用监控器可用的部分时间戳来查找多个源。我们探索了 "滚雪球 "技术,根据几个节点的部分时间戳来确定可能包含谣言源的脆弱半径。该算法的总体复杂度为 O(NS∗(NS+ES)),其中 NS 是滚雪球节点集,ES 代表滚雪球节点之间的边。对各种网络(包括小型网络、大型网络和人工网络)进行了广泛的实证分析。实证结果表明,与基线算法相比,所提出的算法在误差距离和执行时间方面都很有效。
{"title":"Locating multiple rumor sources in social networks using partial information of monitors","authors":"Ravi Kishore Devarapalli,&nbsp;Soumita Das,&nbsp;Anupam Biswas","doi":"10.1016/j.comcom.2024.07.004","DOIUrl":"10.1016/j.comcom.2024.07.004","url":null,"abstract":"<div><p>Rumors in social media platforms and the identification of their sources is a challenging issue in modern-day computer communication. Existing approaches mostly fail to localize the source node accurately due to the lack of complete network information or <em>timestamps</em>. Besides, most of the techniques focused on single-source identification only, while sometimes multiple sources exist in the network. In this paper, we designed a new algorithm called Multi Snowballing with Partial Timestamps (MSPT) to find multiple sources utilizing partial <em>timestamps</em> available to monitors. We have explored the snowballing technique to determine the vulnerable radius that may contain the rumor source based on the partial <em>timestamps</em> of a few nodes. The overall complexity of the algorithm is <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>∗</mo><mrow><mo>(</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>+</mo><msub><mrow><mi>E</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>)</mo></mrow><mo>)</mo></mrow></mrow></math></span>, where <span><math><msub><mrow><mi>N</mi></mrow><mrow><mi>S</mi></mrow></msub></math></span> is the set of snowball nodes and <span><math><msub><mrow><mi>E</mi></mrow><mrow><mi>S</mi></mrow></msub></math></span> represents edges in between snowball nodes. Extensive empirical analysis is performed on a variety of networks, which include small-scale, large-scale, and artificial networks. Empirical outcomes demonstrate that the presented algorithm is efficient in terms of error distance and execution time compared to baseline algorithms.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 126-140"},"PeriodicalIF":4.5,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141700572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A robust multi-key authority system for privacy-preserving distribution and access control of healthcare data 用于医疗保健数据隐私保护分发和访问控制的稳健多密钥授权系统
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-07-14 DOI: 10.1016/j.comcom.2024.07.005
Amitesh Singh Rajput , Arnav Agarwal , Kiran B. Raja

Innovation in medical technology and communication has rapidly empowered the development of smart healthcare devices. This has led to privacy breaches, threats and vulnerabilities to sensitive patient data that result in unwanted or targeted advertising. Previous research has focused on protecting access to sensitive patient data from unauthorized entities, especially by defining roles of healthcare entities in the overall system with their access privileges. However, such efforts need to be further robust due to the involvement of a single key authority that may lead to a critical point of failure. In this paper, this vulnerability has been addressed by developing a novel approach to crucially increase the number of key authorities using homomorphic encryption. The proposed approach ensures genuine access to the verified entity by forming a subsystem of t key authorities from a total of n authorities (t<n). This creates rigorous challenge to a malicious attacker, obfuscating the selection and functioning of key access packets in a multi-key authority setup. The results of the proposed approach achieve medical data confidentiality, entity authentication, and strategic data sharing. The security of the proposed approach is assessed for different vulnerabilities of the overall system using a challenge–response game model. Moreover, the proposed approach is found to be better and secure as compared to existing schemes.

医疗技术和通信领域的创新迅速推动了智能医疗设备的发展。这导致了敏感患者数据的隐私泄露、威胁和漏洞,从而产生了不需要的或有针对性的广告。以往的研究侧重于保护未经授权的实体访问敏感的患者数据,特别是通过定义医疗实体在整个系统中的角色及其访问权限。然而,由于单个密钥机构的参与可能会导致关键故障点,因此这些工作需要进一步加强。本文通过开发一种新方法,利用同态加密技术大幅增加密钥授权的数量,从而解决了这一漏洞。所提出的方法通过从总共 n 个密钥机构(t<n)中组成一个由 t 个密钥机构组成的子系统,确保对已验证实体的真正访问。这对恶意攻击者提出了严峻的挑战,混淆了多密钥机构设置中密钥访问数据包的选择和功能。所提方法的结果实现了医疗数据保密、实体身份验证和战略数据共享。利用挑战-响应博弈模型,针对整个系统的不同漏洞评估了所提方法的安全性。此外,与现有方案相比,发现所提出的方法更好、更安全。
{"title":"A robust multi-key authority system for privacy-preserving distribution and access control of healthcare data","authors":"Amitesh Singh Rajput ,&nbsp;Arnav Agarwal ,&nbsp;Kiran B. Raja","doi":"10.1016/j.comcom.2024.07.005","DOIUrl":"10.1016/j.comcom.2024.07.005","url":null,"abstract":"<div><p>Innovation in medical technology and communication has rapidly empowered the development of smart healthcare devices. This has led to privacy breaches, threats and vulnerabilities to sensitive patient data that result in unwanted or targeted advertising. Previous research has focused on protecting access to sensitive patient data from unauthorized entities, especially by defining roles of healthcare entities in the overall system with their access privileges. However, such efforts need to be further robust due to the involvement of a single key authority that may lead to a critical point of failure. In this paper, this vulnerability has been addressed by developing a novel approach to crucially increase the number of key authorities using homomorphic encryption. The proposed approach ensures genuine access to the verified entity by forming a subsystem of <em>t</em> key authorities from a total of <em>n</em> authorities <span><math><mrow><mo>(</mo><mi>t</mi><mo>&lt;</mo><mi>n</mi><mo>)</mo></mrow></math></span>. This creates rigorous challenge to a malicious attacker, obfuscating the selection and functioning of key access packets in a multi-key authority setup. The results of the proposed approach achieve medical data confidentiality, entity authentication, and strategic data sharing. The security of the proposed approach is assessed for different vulnerabilities of the overall system using a challenge–response game model. Moreover, the proposed approach is found to be better and secure as compared to existing schemes.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"225 ","pages":"Pages 195-204"},"PeriodicalIF":4.5,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141706767","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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1