首页 > 最新文献

Computer Communications最新文献

英文 中文
Transformer-empowered receiver design of OFDM communication systems OFDM 通信系统的变压器供电接收器设计
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-24 DOI: 10.1016/j.comcom.2024.107960
Binglei Yue , Siyi Qiu , Chun Yang , Limei Peng , Yin Zhang
With deep learning, we perform channel estimation and signal detection in massive Multiple Input Multiple Output (MIMO)-Orthogonal Frequency Division Multiplexing (OFDM) systems in this paper. Specifically, we design and extend the basic framework of receivers for MIMO-OFDM systems in an end-to-end approach. A Transformer-based MIMO-OFDM receiver called TCD-Receiver is proposed, which introduces a multi-attention mechanism to learn the channel characteristics by introducing a generic and flexible Transformer network structure. The network parameters are updated based on the relationship between the received signal and the original signal, where the final signal information is obtained without explicit channel estimation and the predicted transmit bits are directly output. The experimental results show that the TCD-Receiver proposed can effectively solve the channel distortion and detect the transmitted signals compared with the traditional communication receivers, and its performance can be comparable to that of the traditional OFDM receivers, and it also has obvious advantages in combating the complex and difficult-to-model channel environment as well as the nonlinear interference factors.
通过深度学习,我们在本文中对大规模多输入多输出(MIMO)-正交频分复用(OFDM)系统进行了信道估计和信号检测。具体来说,我们采用端到端方法设计并扩展了 MIMO-OFDM 系统接收器的基本框架。本文提出了一种基于变压器的 MIMO-OFDM 接收器,称为 TCD-Receiver,它引入了一种多注意机制,通过引入通用灵活的变压器网络结构来学习信道特性。网络参数根据接收信号与原始信号之间的关系进行更新,无需明确的信道估计即可获得最终信号信息,并直接输出预测的发射比特。实验结果表明,与传统的通信接收机相比,所提出的 TCD 接收机能有效地解决信道失真和检测传输信号,其性能可与传统的 OFDM 接收机相媲美,而且在应对复杂、难以建模的信道环境和非线性干扰因素方面也具有明显的优势。
{"title":"Transformer-empowered receiver design of OFDM communication systems","authors":"Binglei Yue ,&nbsp;Siyi Qiu ,&nbsp;Chun Yang ,&nbsp;Limei Peng ,&nbsp;Yin Zhang","doi":"10.1016/j.comcom.2024.107960","DOIUrl":"10.1016/j.comcom.2024.107960","url":null,"abstract":"<div><div>With deep learning, we perform channel estimation and signal detection in massive Multiple Input Multiple Output (MIMO)-Orthogonal Frequency Division Multiplexing (OFDM) systems in this paper. Specifically, we design and extend the basic framework of receivers for MIMO-OFDM systems in an end-to-end approach. A Transformer-based MIMO-OFDM receiver called TCD-Receiver is proposed, which introduces a multi-attention mechanism to learn the channel characteristics by introducing a generic and flexible Transformer network structure. The network parameters are updated based on the relationship between the received signal and the original signal, where the final signal information is obtained without explicit channel estimation and the predicted transmit bits are directly output. The experimental results show that the TCD-Receiver proposed can effectively solve the channel distortion and detect the transmitted signals compared with the traditional communication receivers, and its performance can be comparable to that of the traditional OFDM receivers, and it also has obvious advantages in combating the complex and difficult-to-model channel environment as well as the nonlinear interference factors.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107960"},"PeriodicalIF":4.5,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142358352","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
Impact of network topology changes on information source localization 网络拓扑结构变化对信息源定位的影响
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-21 DOI: 10.1016/j.comcom.2024.107958
Piotr Machura, Robert Paluch
Well-established methods of locating the source of information in a complex network are usually derived with the assumption of complete and exact knowledge of network topology. We study the performance of three such algorithms (Limited Pinto–Thiran–Vetterli Algorithm — LPTVA, Gradient Maximum Likelihood Algorithm — GMLA and Pearson Correlation Algorithm — PCA) in scenarios that do not fulfill this assumption by modifying the network before localization. This is done by adding superfluous new links, hiding existing ones, or reattaching links following the network’s structural Hamiltonian. Our results show that GMLA is highly resilient to adding superfluous edges, as its precision falls by more than statistical uncertainty only when the number of links is approximately doubled. On the other hand, if the edge set is underestimated or reattachment has taken place, the performance of GMLA drops significantly. In such a scenario, PCA is preferable, retaining most of its performance when other simulation parameters favor successful localization (high density of observers, highly deterministic propagation). It is also generally more accurate than LPTVA and orders of magnitude faster. The differences between localization algorithms can be intuitively explained, although further theoretical research is needed.
在复杂网络中定位信息源的成熟方法通常都是在完全准确了解网络拓扑结构的前提下得出的。我们研究了三种此类算法(有限 Pinto-Thiran-Vetterli 算法 - LPTVA、梯度最大似然算法 - GMLA 和皮尔逊相关算法 - PCA)在不满足这一假设的情况下的性能,即在定位前修改网络。具体做法是添加多余的新链接、隐藏现有链接或按照网络结构哈密顿重新连接链接。我们的研究结果表明,GMLA 对添加多余的边缘具有很强的适应能力,因为只有当链接数量增加大约一倍时,其精度下降的幅度才会超过统计不确定性。另一方面,如果边缘集被低估或发生了重新连接,GMLA 的性能就会显著下降。在这种情况下,PCA 更为可取,当其他模拟参数有利于成功定位(观测者密度高、传播高度确定)时,它仍能保持大部分性能。一般来说,PCA 比 LPTVA 更精确,速度也快几个数量级。虽然还需要进一步的理论研究,但可以直观地解释定位算法之间的差异。
{"title":"Impact of network topology changes on information source localization","authors":"Piotr Machura,&nbsp;Robert Paluch","doi":"10.1016/j.comcom.2024.107958","DOIUrl":"10.1016/j.comcom.2024.107958","url":null,"abstract":"<div><div>Well-established methods of locating the source of information in a complex network are usually derived with the assumption of complete and exact knowledge of network topology. We study the performance of three such algorithms (Limited Pinto–Thiran–Vetterli Algorithm — LPTVA, Gradient Maximum Likelihood Algorithm — GMLA and Pearson Correlation Algorithm — PCA) in scenarios that do not fulfill this assumption by modifying the network before localization. This is done by adding superfluous new links, hiding existing ones, or reattaching links following the network’s structural Hamiltonian. Our results show that GMLA is highly resilient to adding superfluous edges, as its precision falls by more than statistical uncertainty only when the number of links is approximately doubled. On the other hand, if the edge set is underestimated or reattachment has taken place, the performance of GMLA drops significantly. In such a scenario, PCA is preferable, retaining most of its performance when other simulation parameters favor successful localization (high density of observers, highly deterministic propagation). It is also generally more accurate than LPTVA and orders of magnitude faster. The differences between localization algorithms can be intuitively explained, although further theoretical research is needed.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107958"},"PeriodicalIF":4.5,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322717","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
Open RAN testbeds with controlled air mobility 具有可控空中机动性的开放式 RAN 测试平台
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-21 DOI: 10.1016/j.comcom.2024.107955
Magreth Mushi , Yuchen Liu , Shreyas Sreenivasa , Ozgur Ozdemir , Ismail Guvenc , Mihail Sichitiu , Rudra Dutta , Russ Gyurek
With its promise of increasing softwarization, improving disaggregability, and creating an open-source based ecosystem in the area of Radio Access Networks, the idea of Open RAN has generated rising interest in the community. Even as the community races to provide and verify complete Open RAN systems, the importance of verification of systems based on Open RAN under real-world conditions has become clear, and testbed facilities for general use have been envisioned, in addition to private testing facilities. Aerial robots, including autonomous ones, are among the increasingly important and interesting clients of RAN systems, but also present a challenge for testbeds. Based on our experience in architecting and operating an advanced wireless testbed with aerial robots as a primary citizen, we present considerations relevant to the design of Open RAN testbeds, with particular attention to making such a testbed capable of controlled experimentation with aerial clients. We also present representative results from the NSF AERPAW testbed on Open RAN slicing, programmable vehicles, and programmable radios.
开放式 RAN 有望提高软化程度、改善可分离性,并在无线接入网领域创建一个基于开源的生态系统。就在业界争相提供和验证完整的开放式 RAN 系统的同时,在真实世界条件下验证基于开放式 RAN 的系统的重要性也变得显而易见,除了私人测试设施外,人们还设想建立通用的测试平台设施。空中机器人(包括自主机器人)是 RAN 系统日益重要和有趣的客户之一,但也对测试平台提出了挑战。根据我们以空中机器人为主要用户构建和运行先进无线测试平台的经验,我们介绍了与开放 RAN 测试平台设计相关的注意事项,尤其关注如何使此类测试平台能够与空中客户进行受控实验。我们还介绍了美国国家科学基金会 AERPAW 试验台在开放 RAN 切片、可编程飞行器和可编程无线电方面取得的代表性成果。
{"title":"Open RAN testbeds with controlled air mobility","authors":"Magreth Mushi ,&nbsp;Yuchen Liu ,&nbsp;Shreyas Sreenivasa ,&nbsp;Ozgur Ozdemir ,&nbsp;Ismail Guvenc ,&nbsp;Mihail Sichitiu ,&nbsp;Rudra Dutta ,&nbsp;Russ Gyurek","doi":"10.1016/j.comcom.2024.107955","DOIUrl":"10.1016/j.comcom.2024.107955","url":null,"abstract":"<div><div>With its promise of increasing softwarization, improving disaggregability, and creating an open-source based ecosystem in the area of Radio Access Networks, the idea of Open RAN has generated rising interest in the community. Even as the community races to provide and verify complete Open RAN systems, the importance of verification of systems based on Open RAN under real-world conditions has become clear, and testbed facilities for general use have been envisioned, in addition to private testing facilities. Aerial robots, including autonomous ones, are among the increasingly important and interesting clients of RAN systems, but also present a challenge for testbeds. Based on our experience in architecting and operating an advanced wireless testbed with aerial robots as a primary citizen, we present considerations relevant to the design of Open RAN testbeds, with particular attention to making such a testbed capable of controlled experimentation with aerial clients. We also present representative results from the NSF AERPAW testbed on Open RAN slicing, programmable vehicles, and programmable radios.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107955"},"PeriodicalIF":4.5,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315689","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
Model-based reinforcement learning approach for federated learning resource allocation and parameter optimization 基于模型的强化学习方法,用于联合学习资源分配和参数优化
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-20 DOI: 10.1016/j.comcom.2024.107957
Farzan Karami, Babak Hossein Khalaj
In this paper, we investigate the performance of a model-based approach for solving resource allocation and parameter adjustment problems in federated learning (FL) within a wireless network. Given the existence of models for energy, communication channels, and accuracy, such models can be leveraged to achieve improved performance. Additionally, machine learning techniques can be employed to identify known parts of the model and also exploit training data for unknown parts of the model, enabling the creation of complex policies. Model-based reinforcement learning (RL) methods have the potential to offer such solutions, particularly in resource allocation and parameter optimization settings where the model can be partially derived mathematically. Our results demonstrate that the use of such a method in FL scenarios leads to improvements in both performance and the number of iterations required to identify the desired policy. Our simulations demonstrate the significance of allocating appropriate resources for FL applications through proper consideration of inherent tradeoffs, as performance will not improve beyond a certain saturation point. Additionally, our proposed FL model takes intelligently into account the presence of slow users to propose efficient policies for users that may have access to more abundant resources.
在本文中,我们研究了基于模型的方法在无线网络联合学习(FL)中解决资源分配和参数调整问题的性能。鉴于能量、通信信道和准确性模型的存在,可以利用这些模型来提高性能。此外,还可以采用机器学习技术来识别模型的已知部分,并利用模型未知部分的训练数据,从而创建复杂的策略。基于模型的强化学习(RL)方法有可能提供这样的解决方案,尤其是在资源分配和参数优化设置中,因为模型可以部分地通过数学方法推导出来。我们的研究结果表明,在 FL 场景中使用这种方法可以提高性能,并减少确定所需策略所需的迭代次数。我们的模拟证明了通过适当考虑内在权衡为 FL 应用分配适当资源的重要性,因为超过一定的饱和点,性能就不会提高。此外,我们提出的 FL 模型还智能地考虑到了慢速用户的存在,从而为可以访问更丰富资源的用户提出了高效的策略。
{"title":"Model-based reinforcement learning approach for federated learning resource allocation and parameter optimization","authors":"Farzan Karami,&nbsp;Babak Hossein Khalaj","doi":"10.1016/j.comcom.2024.107957","DOIUrl":"10.1016/j.comcom.2024.107957","url":null,"abstract":"<div><div>In this paper, we investigate the performance of a model-based approach for solving resource allocation and parameter adjustment problems in federated learning (FL) within a wireless network. Given the existence of models for energy, communication channels, and accuracy, such models can be leveraged to achieve improved performance. Additionally, machine learning techniques can be employed to identify known parts of the model and also exploit training data for unknown parts of the model, enabling the creation of complex policies. Model-based reinforcement learning (RL) methods have the potential to offer such solutions, particularly in resource allocation and parameter optimization settings where the model can be partially derived mathematically. Our results demonstrate that the use of such a method in FL scenarios leads to improvements in both performance and the number of iterations required to identify the desired policy. Our simulations demonstrate the significance of allocating appropriate resources for FL applications through proper consideration of inherent tradeoffs, as performance will not improve beyond a certain saturation point. Additionally, our proposed FL model takes intelligently into account the presence of slow users to propose efficient policies for users that may have access to more abundant resources.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107957"},"PeriodicalIF":4.5,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315687","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
Learning-based visibility prediction for terahertz communications in 6G networks 基于学习的能见度预测,用于 6G 网络中的太赫兹通信
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-19 DOI: 10.1016/j.comcom.2024.107956
Pablo Fondo-Ferreiro, Cristina López-Bravo, Francisco Javier González-Castaño, Felipe Gil-Castiñeira, David Candal-Ventureira
Terahertz communications are envisioned as a key enabler for 6G networks. The abundant spectrum available in such ultra high frequencies has the potential to increase network capacity to huge data rates. However, they are extremely affected by blockages, to the point of disrupting ongoing communications. In this paper, we elaborate on the relevance of predicting visibility between users and access points (APs) to improve the performance of THz-based networks by minimizing blockages, that is, maximizing network availability, while at the same time keeping a low reconfiguration overhead. We propose a novel approach to address this problem, by combining a neural network (NN) for predicting future user–AP visibility probability, with a probability threshold for AP reselection to avoid unnecessary reconfigurations. Our experimental results demonstrate that current state-of-the-art handover mechanisms based on received signal strength are not adequate for THz communications, since they are ill-suited to handle hard blockages. Our proposed NN-based solution significantly outperforms them, demonstrating the interest of our strategy as a research line.
太赫兹通信被视为 6G 网络的关键推动因素。这种超高频率的丰富频谱有可能将网络容量提高到巨大的数据传输速率。然而,它们受阻塞的影响极大,甚至会中断正在进行的通信。在本文中,我们详细阐述了预测用户和接入点(AP)之间可见性的相关性,以通过最大限度地减少阻塞(即最大限度地提高网络可用性)来提高基于太赫兹的网络性能,同时保持较低的重新配置开销。我们提出了一种解决这一问题的新方法,即把用于预测未来用户-接入点可见性概率的神经网络(NN)与用于重新选择接入点以避免不必要的重新配置的概率阈值相结合。我们的实验结果表明,目前最先进的基于接收信号强度的切换机制并不适合太赫兹通信,因为它们不适合处理硬阻塞。我们提出的基于 NN 的解决方案明显优于它们,这表明了我们的策略作为研究方向的意义所在。
{"title":"Learning-based visibility prediction for terahertz communications in 6G networks","authors":"Pablo Fondo-Ferreiro,&nbsp;Cristina López-Bravo,&nbsp;Francisco Javier González-Castaño,&nbsp;Felipe Gil-Castiñeira,&nbsp;David Candal-Ventureira","doi":"10.1016/j.comcom.2024.107956","DOIUrl":"10.1016/j.comcom.2024.107956","url":null,"abstract":"<div><div>Terahertz communications are envisioned as a key enabler for 6G networks. The abundant spectrum available in such ultra high frequencies has the potential to increase network capacity to huge data rates. However, they are extremely affected by blockages, to the point of disrupting ongoing communications. In this paper, we elaborate on the relevance of predicting visibility between users and access points (APs) to improve the performance of THz-based networks by minimizing blockages, that is, maximizing network availability, while at the same time keeping a low reconfiguration overhead. We propose a novel approach to address this problem, by combining a neural network (NN) for predicting future user–AP visibility probability, with a probability threshold for AP reselection to avoid unnecessary reconfigurations. Our experimental results demonstrate that current state-of-the-art handover mechanisms based on received signal strength are not adequate for THz communications, since they are ill-suited to handle hard blockages. Our proposed NN-based solution significantly outperforms them, demonstrating the interest of our strategy as a research line.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107956"},"PeriodicalIF":4.5,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0140366424003037/pdfft?md5=1b02f6a50f8b2c04910c39254482c9e7&pid=1-s2.0-S0140366424003037-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142310910","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
DRL-assisted task offloading in enhanced time-expanded graph (eTEG)-modeled aerial computing 增强型时间扩展图(eTEG)建模航空计算中的 DRL 辅助任务卸载
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-19 DOI: 10.1016/j.comcom.2024.107954
Jiang Mo , Ke Zhao , Limei Peng , Jiyeon Lee , Li Ma , Lixin Pu , Jipeng Fan
Space–air–ground integrated networks (SAGINs), categorized under aerial computing (AC), are emerging as a promising hierarchical platform designed to meet the seamless connectivity demands of the forthcoming 6G era. However, efficiently offloading ground tasks to space entities via SAGINs presents unprecedented challenges, primarily due to the mobility of these networks. In response, an enhanced time-expanded graph (eTEG) is proposed to model the dynamic distribution of heterogeneous SAGIN resources, including transmission bandwidth, computation, and storage, thereby optimizing task offloading and resource allocation by employing eTEG. Specifically, this optimization challenge is addressed using a deep reinforcement learning (DRL) approach, aimed at streamlining decision-making for task offloading and resource management to significantly reduce end-to-end delay and enhance network performance. Simulation experiments conducted to evaluate the proposed DRL-based method demonstrate its effectiveness in reducing energy consumption and improving stability, thereby outperforming other methods by achieving reduced delays and satisfying user requirements.
天-空-地一体化网络(SAGINs)被归类为空中计算(AC),正在成为一种前景广阔的分层平台,旨在满足即将到来的 6G 时代的无缝连接需求。然而,通过 SAGINs 将地面任务有效卸载到空间实体面临着前所未有的挑战,这主要是由于这些网络的移动性。为此,我们提出了一种增强型时间扩展图(eTEG)来模拟异构 SAGIN 资源(包括传输带宽、计算和存储)的动态分配,从而利用 eTEG 优化任务卸载和资源分配。具体来说,该优化挑战采用了一种深度强化学习(DRL)方法,旨在简化任务卸载和资源管理的决策,从而显著降低端到端延迟并提高网络性能。为评估所提出的基于 DRL 的方法而进行的仿真实验表明,该方法在降低能耗和提高稳定性方面非常有效,因此在减少延迟和满足用户需求方面优于其他方法。
{"title":"DRL-assisted task offloading in enhanced time-expanded graph (eTEG)-modeled aerial computing","authors":"Jiang Mo ,&nbsp;Ke Zhao ,&nbsp;Limei Peng ,&nbsp;Jiyeon Lee ,&nbsp;Li Ma ,&nbsp;Lixin Pu ,&nbsp;Jipeng Fan","doi":"10.1016/j.comcom.2024.107954","DOIUrl":"10.1016/j.comcom.2024.107954","url":null,"abstract":"<div><div>Space–air–ground integrated networks (SAGINs), categorized under aerial computing (AC), are emerging as a promising hierarchical platform designed to meet the seamless connectivity demands of the forthcoming 6G era. However, efficiently offloading ground tasks to space entities via SAGINs presents unprecedented challenges, primarily due to the mobility of these networks. In response, an enhanced time-expanded graph (eTEG) is proposed to model the dynamic distribution of heterogeneous SAGIN resources, including transmission bandwidth, computation, and storage, thereby optimizing task offloading and resource allocation by employing eTEG. Specifically, this optimization challenge is addressed using a deep reinforcement learning (DRL) approach, aimed at streamlining decision-making for task offloading and resource management to significantly reduce end-to-end delay and enhance network performance. Simulation experiments conducted to evaluate the proposed DRL-based method demonstrate its effectiveness in reducing energy consumption and improving stability, thereby outperforming other methods by achieving reduced delays and satisfying user requirements.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107954"},"PeriodicalIF":4.5,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142322718","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
Collaborative IoT learning with secure peer-to-peer federated approach 采用安全的点对点联盟方式进行物联网协作学习
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-12 DOI: 10.1016/j.comcom.2024.107948
Neveen Mohammad Hijazi, Moayad Aloqaily, Mohsen Guizani

Federated Learning (FL) has emerged as a powerful model for training collaborative machine learning (ML) models while maintaining the privacy of participants’ data. However, traditional FL methods can exhibit limitations such as increased communication overhead, vulnerability to poisoning attacks, and reliance on a central server, which can impede their practicality in certain IoT applications. In such cases, the necessity of a central server to oversee the learning process may be infeasible, particularly in situations with limited connectivity and energy management. To address these challenges, peer-to-peer FL (P2PFL) offers an alternative approach, providing greater adaptability by enabling participants to collaboratively train their own models alongside their peers. This paper introduces an original framework that combines P2PFL and Homomorphic Encryption (HE), enabling secure computations on encrypted data. Furthermore, a defense approach against poisoning attacks based on cosine similarity is introduced These techniques enable users to collectively learn while preserving data privacy and accounting for ideal energy optimization. The proposed approach has demonstrated superior performance metrics in terms of accuracy, F-scores, and loss when compared to other similar approaches. Furthermore, it offers robust privacy and security measures, leading to an enhanced security level, with improvements ranging from 5.5% to 14.6%. Moreover, we demonstrate that the proposed approach effectively reduces the communication overhead. The proposed approach resulted in impressive reductions in communication overhead ranging from 63.8% to 79.6%. The implementation of these security models was cumbersome, but we have made the code publicly available for your reference 1.

联盟学习(FL)已成为训练协作式机器学习(ML)模型的一种强大模式,同时还能维护参与者的数据隐私。然而,传统的联合学习方法可能会表现出一些局限性,例如通信开销增加、易受中毒攻击以及依赖中央服务器,这可能会阻碍其在某些物联网应用中的实用性。在这种情况下,需要中央服务器来监督学习过程可能是不可行的,尤其是在连接和能源管理有限的情况下。为应对这些挑战,点对点 FL(P2PFL)提供了另一种方法,通过让参与者与同伴一起协作训练自己的模型,提供更强的适应性。本文介绍了一个将 P2PFL 和同态加密(HE)相结合的原创框架,从而实现对加密数据的安全计算。此外,本文还介绍了一种基于余弦相似性的中毒攻击防御方法。这些技术使用户能够在集体学习的同时保护数据隐私并实现理想的能量优化。与其他类似方法相比,所提出的方法在准确性、F 分数和损失方面都表现出了卓越的性能指标。此外,它还提供了强大的隐私和安全措施,从而提高了安全级别,改进幅度从 5.5% 到 14.6%。此外,我们还证明了所提出的方法能有效减少通信开销。所提出的方法显著降低了 63.8% 到 79.6% 的通信开销。这些安全模型的实现过程非常繁琐,但我们已经公开了代码,供大家参考1。
{"title":"Collaborative IoT learning with secure peer-to-peer federated approach","authors":"Neveen Mohammad Hijazi,&nbsp;Moayad Aloqaily,&nbsp;Mohsen Guizani","doi":"10.1016/j.comcom.2024.107948","DOIUrl":"10.1016/j.comcom.2024.107948","url":null,"abstract":"<div><p>Federated Learning (FL) has emerged as a powerful model for training collaborative machine learning (ML) models while maintaining the privacy of participants’ data. However, traditional FL methods can exhibit limitations such as increased communication overhead, vulnerability to poisoning attacks, and reliance on a central server, which can impede their practicality in certain IoT applications. In such cases, the necessity of a central server to oversee the learning process may be infeasible, particularly in situations with limited connectivity and energy management. To address these challenges, peer-to-peer FL (P2PFL) offers an alternative approach, providing greater adaptability by enabling participants to collaboratively train their own models alongside their peers. This paper introduces an original framework that combines P2PFL and Homomorphic Encryption (HE), enabling secure computations on encrypted data. Furthermore, a defense approach against poisoning attacks based on cosine similarity is introduced These techniques enable users to collectively learn while preserving data privacy and accounting for ideal energy optimization. The proposed approach has demonstrated superior performance metrics in terms of accuracy, F-scores, and loss when compared to other similar approaches. Furthermore, it offers robust privacy and security measures, leading to an enhanced security level, with improvements ranging from 5.5% to 14.6%. Moreover, we demonstrate that the proposed approach effectively reduces the communication overhead. The proposed approach resulted in impressive reductions in communication overhead ranging from 63.8% to 79.6%. The implementation of these security models was cumbersome, but we have made the code publicly available for your reference <span><span><sup>1</sup></span></span>.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107948"},"PeriodicalIF":4.5,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142172555","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
Resource allocation in RISs-assisted UAV-enabled MEC network with computation capacity improvement 提高计算能力的 RISs 辅助无人机 MEC 网络的资源分配
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-12 DOI: 10.1016/j.comcom.2024.107953
Long Jiao , Ling Gao , Jie Zheng , Peiqing Yang , Wei Xue

Unmanned aerial vehicle (UAV)-enabled mobile edge computing (MEC) networks have recently been considered to be a support for ground MEC networks to enhance their computation capability. However, the line-of-sight (LOS) channels between the UAV and Internet of Things (IoT) devices can be interfered by various obstacles, such as trees and buildings, resulting in a considerable reduction in the capacity of MEC networks. To solve this issue, a system that combines multiple reconfigurable intelligence surfaces (RISs) with a UAV-enabled MEC network is proposed in this study. A UAV equipped with edge servers is treated as an aerial computing platform for IoT devices, and multi-RISs are utilized to simultaneously improve the communication quality between enhanced UAV and IoT devices. To maximize the sum computation bits of the system, a problem that jointly optimizes the time slot partition, local computation frequency, transmit power of the devices, UAV receive beamforming vectors, phase shifts of the RISs, and the trajectory of the UAV is formulated. The problem is a typical nonconvex optimization problem; therefore, we propose a recursive algorithm based on the successive convex approximation (SCA) and block coordinate descent (BCD) technology to find an approximate optimal solution. Simulation results demonstrate the effectiveness of the proposed algorithm compared with various benchmark schemes.

支持无人飞行器(UAV)的移动边缘计算(MEC)网络最近被认为是对地面 MEC 网络的支持,以增强其计算能力。然而,无人飞行器与物联网(IoT)设备之间的视线(LOS)信道可能会受到树木和建筑物等各种障碍物的干扰,导致 MEC 网络的容量大大降低。为解决这一问题,本研究提出了一种将多个可重构智能表面(RIS)与无人机支持的 MEC 网络相结合的系统。配备边缘服务器的无人机被视为物联网设备的空中计算平台,利用多个可重构智能表面可同时提高增强型无人机与物联网设备之间的通信质量。为了最大化系统的总计算比特,提出了一个联合优化时隙划分、本地计算频率、设备发射功率、无人机接收波束成形向量、RIS 相移和无人机轨迹的问题。该问题是一个典型的非凸优化问题;因此,我们提出了一种基于连续凸近似(SCA)和块坐标下降(BCD)技术的递归算法,以找到近似最优解。仿真结果表明,与各种基准方案相比,所提算法非常有效。
{"title":"Resource allocation in RISs-assisted UAV-enabled MEC network with computation capacity improvement","authors":"Long Jiao ,&nbsp;Ling Gao ,&nbsp;Jie Zheng ,&nbsp;Peiqing Yang ,&nbsp;Wei Xue","doi":"10.1016/j.comcom.2024.107953","DOIUrl":"10.1016/j.comcom.2024.107953","url":null,"abstract":"<div><p>Unmanned aerial vehicle (UAV)-enabled mobile edge computing (MEC) networks have recently been considered to be a support for ground MEC networks to enhance their computation capability. However, the line-of-sight (LOS) channels between the UAV and Internet of Things (IoT) devices can be interfered by various obstacles, such as trees and buildings, resulting in a considerable reduction in the capacity of MEC networks. To solve this issue, a system that combines multiple reconfigurable intelligence surfaces (RISs) with a UAV-enabled MEC network is proposed in this study. A UAV equipped with edge servers is treated as an aerial computing platform for IoT devices, and multi-RISs are utilized to simultaneously improve the communication quality between enhanced UAV and IoT devices. To maximize the sum computation bits of the system, a problem that jointly optimizes the time slot partition, local computation frequency, transmit power of the devices, UAV receive beamforming vectors, phase shifts of the RISs, and the trajectory of the UAV is formulated. The problem is a typical nonconvex optimization problem; therefore, we propose a recursive algorithm based on the successive convex approximation (SCA) and block coordinate descent (BCD) technology to find an approximate optimal solution. Simulation results demonstrate the effectiveness of the proposed algorithm compared with various benchmark schemes.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107953"},"PeriodicalIF":4.5,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142239365","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
Malware containment with immediate response in IoT networks: An optimal control approach 物联网网络中即时响应的恶意软件遏制:优化控制方法
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-12 DOI: 10.1016/j.comcom.2024.107951
Mousa Tayseer Jafar , Lu-Xing Yang , Gang Li , Qingyi Zhu , Chenquan Gan , Xiaofan Yang

The exponential growth of Internet of Things (IoT) devices has triggered a substantial increase in cyber-attacks targeting these systems. Recent statistics show a surge of over 100 percent in such attacks, underscoring the urgent need for robust cybersecurity measures. When a cyber-attack breaches an IoT network, it initiates the dissemination of malware across the network. However, to counteract this threat, an immediate installation of a new patch becomes imperative. The time frame for developing and deploying the patch can vary significantly, contingent upon the specifics of the cyber-attack. This paper aims to address the challenge of pre-emptively mitigating cyber-attacks prior to the installation of a new patch. The main novelties of our work include: (1) A well-designed node-level model known as Susceptible, Infected High, Infected Low, Recover First, and Recover Complete (SIHILRFRC). It categorizes the infected node states into infected high and infected low, according to the categorization of infection states for IoT devices, to accelerate containment strategies for malware propagation and improve mitigation of cyber-attacks targeting IoT networks by incorporating immediate response within a restricted environment. (2) Development of an optimal immediate response strategy (IRS) by modeling and analyzing the associated optimal control problem. This model aims to enhance the containment of malware propagation across IoT networks by swiftly responding to cyber threats. Finally, several numerical analyses were performed to fully illustrate the main findings. In addition, a dataset has been constructed for experimental purposes to simulate real-world scenarios within IoT networks, particularly in smart home environments.

物联网(IoT)设备的指数式增长引发了针对这些系统的网络攻击大幅增加。最近的统计数据显示,此类攻击激增了 100%以上,突出表明迫切需要采取强有力的网络安全措施。当网络攻击侵入物联网网络时,就会在整个网络中传播恶意软件。然而,要应对这种威胁,必须立即安装新补丁。根据网络攻击的具体情况,开发和部署补丁的时间框架可能会有很大差异。本文旨在解决在安装新补丁之前先发制人地减轻网络攻击的难题。我们工作的主要创新点包括(1) 一个精心设计的节点级模型,称为 "易受感染、高感染、低感染、先恢复和完全恢复(SIHILRFRC)"。该模型根据物联网设备感染状态的分类,将受感染节点状态分为高感染和低感染,通过在受限环境中纳入即时响应,加快遏制恶意软件传播的策略,改善针对物联网网络攻击的缓解效果。(2) 通过对相关最优控制问题进行建模和分析,制定最优即时响应策略(IRS)。该模型旨在通过快速响应网络威胁,加强遏制恶意软件在物联网网络中的传播。最后,还进行了几项数值分析,以充分说明主要发现。此外,还构建了一个数据集,用于模拟物联网网络中的真实场景,尤其是智能家居环境中的真实场景。
{"title":"Malware containment with immediate response in IoT networks: An optimal control approach","authors":"Mousa Tayseer Jafar ,&nbsp;Lu-Xing Yang ,&nbsp;Gang Li ,&nbsp;Qingyi Zhu ,&nbsp;Chenquan Gan ,&nbsp;Xiaofan Yang","doi":"10.1016/j.comcom.2024.107951","DOIUrl":"10.1016/j.comcom.2024.107951","url":null,"abstract":"<div><p>The exponential growth of Internet of Things (IoT) devices has triggered a substantial increase in cyber-attacks targeting these systems. Recent statistics show a surge of over 100 percent in such attacks, underscoring the urgent need for robust cybersecurity measures. When a cyber-attack breaches an IoT network, it initiates the dissemination of malware across the network. However, to counteract this threat, an immediate installation of a new patch becomes imperative. The time frame for developing and deploying the patch can vary significantly, contingent upon the specifics of the cyber-attack. This paper aims to address the challenge of pre-emptively mitigating cyber-attacks prior to the installation of a new patch. The main novelties of our work include: (1) A well-designed node-level model known as Susceptible, Infected High, Infected Low, Recover First, and Recover Complete <span><math><mrow><mo>(</mo><msub><mrow><mi>SI</mi></mrow><mrow><mi>H</mi></mrow></msub><msub><mrow><mi>I</mi></mrow><mrow><mi>L</mi></mrow></msub><msub><mrow><mi>R</mi></mrow><mrow><mi>F</mi></mrow></msub><msub><mrow><mi>R</mi></mrow><mrow><mi>C</mi></mrow></msub><mo>)</mo></mrow></math></span>. It categorizes the infected node states into infected high and infected low, according to the categorization of infection states for IoT devices, to accelerate containment strategies for malware propagation and improve mitigation of cyber-attacks targeting IoT networks by incorporating immediate response within a restricted environment. (2) Development of an optimal immediate response strategy (IRS) by modeling and analyzing the associated optimal control problem. This model aims to enhance the containment of malware propagation across IoT networks by swiftly responding to cyber threats. Finally, several numerical analyses were performed to fully illustrate the main findings. In addition, a dataset has been constructed for experimental purposes to simulate real-world scenarios within IoT networks, particularly in smart home environments.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107951"},"PeriodicalIF":4.5,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142239364","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
On construction of quality virtual backbone in wireless networks using cooperative communication 论利用合作通信在无线网络中构建高质量虚拟骨干网
IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-12 DOI: 10.1016/j.comcom.2024.107952
Junhao Wang , Jiarong Liang , Qingnian Li

An extended connected dominating set (ECDS) in a wireless network with cooperative communication (CC) is a subset of nodes such that its induced subgraph is connected and each node outside the ECDS is covered by either one neighbor or several quasineighbors in the ECDS. Traditionality, the size of virtual backbone (VB) is the only factor considered in the problem of CDS construction. However, diameter is also an important factor to evaluate VB. In this paper we consider the problem of constructing quality ECDSs in unit disk graphs under CC with both of these two factors. We propose a two-phase centralized algorithm BD-ECDS to construct an ECDS for a given UDG with CC, which has a constant performance ratio (PR) and diameter. To obtain the PR of this two-phase centralized algorithm, we first give an upper bound of the EDS and use this upper bound to prove that the size of the ECDS under CC generated by the centralized algorithm is no greater than 120|ECDSopt|2, where ECDSopt is the size of the minimum ECDS. Furthermore, our theoretical analysis and simulation results show that our algorithm BD-ECDS is superior to previous approaches.

合作通信(CC)无线网络中的扩展连通支配集(ECDS)是这样一个节点子集:它的诱导子图是连通的,ECDS 以外的每个节点都被 ECDS 中的一个邻居或几个准邻居覆盖。传统上,虚拟骨干网(VB)的大小是 CDS 构建问题中唯一要考虑的因素。然而,直径也是评估 VB 的一个重要因素。在本文中,我们考虑了在 CC 下的单位盘图中构建高质量 ECDS 的问题,同时考虑了这两个因素。我们提出了一种两阶段集中算法 BD-ECDS,用于为具有 CC 的给定 UDG 构建具有恒定性能比(PR)和直径的 ECDS。为了得到这种两阶段集中算法的 PR,我们首先给出了 EDS 的上界,并利用这个上界证明了集中算法生成的 CC 下 ECDS 的大小不大于 120|ECDSopt|-2,其中 ECDSopt 是最小 ECDS 的大小。此外,我们的理论分析和仿真结果表明,我们的算法 BD-ECDS 优于之前的方法。
{"title":"On construction of quality virtual backbone in wireless networks using cooperative communication","authors":"Junhao Wang ,&nbsp;Jiarong Liang ,&nbsp;Qingnian Li","doi":"10.1016/j.comcom.2024.107952","DOIUrl":"10.1016/j.comcom.2024.107952","url":null,"abstract":"<div><p>An extended connected dominating set (ECDS) in a wireless network with cooperative communication (CC) is a subset of nodes such that its induced subgraph is connected and each node outside the ECDS is covered by either one neighbor or several quasineighbors in the ECDS. Traditionality, the size of virtual backbone (VB) is the only factor considered in the problem of CDS construction. However, diameter is also an important factor to evaluate VB. In this paper we consider the problem of constructing quality ECDSs in unit disk graphs under CC with both of these two factors. We propose a two-phase centralized algorithm BD-ECDS to construct an ECDS for a given UDG with CC, which has a constant performance ratio (PR) and diameter. To obtain the PR of this two-phase centralized algorithm, we first give an upper bound of the EDS and use this upper bound to prove that the size of the ECDS under CC generated by the centralized algorithm is no greater than <span><math><mrow><mn>120</mn><mrow><mo>|</mo><mi>E</mi><mi>C</mi><mi>D</mi><msub><mrow><mi>S</mi></mrow><mrow><mi>o</mi><mi>p</mi><mi>t</mi></mrow></msub><mo>|</mo></mrow><mo>−</mo><mn>2</mn></mrow></math></span>, where <span><math><mrow><mi>E</mi><mi>C</mi><mi>D</mi><msub><mrow><mi>S</mi></mrow><mrow><mi>o</mi><mi>p</mi><mi>t</mi></mrow></msub></mrow></math></span> is the size of the minimum ECDS. Furthermore, our theoretical analysis and simulation results show that our algorithm BD-ECDS is superior to previous approaches.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107952"},"PeriodicalIF":4.5,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272491","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