Digital Communications and Networks最新文献

筛选
英文 中文
Scheduling optimization for UAV communication coverage using virtual force-based PSO model 基于虚拟兵力PSO模型的无人机通信覆盖调度优化
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.007
{"title":"Scheduling optimization for UAV communication coverage using virtual force-based PSO model","authors":"","doi":"10.1016/j.dcan.2023.01.007","DOIUrl":"10.1016/j.dcan.2023.01.007","url":null,"abstract":"<div><p>When the ground communication base stations in the target area are severely destroyed, the deployment of Unmanned Aerial Vehicle (UAV) ad hoc networks can provide people with temporary communication services. Therefore, it is necessary to design a multi-UAVs cooperative control strategy to achieve better communication coverage and lower energy consumption. In this paper, we propose a multi-UAVs coverage model based on Adaptive Virtual Force-directed Particle Swarm Optimization (AVF-PSO) strategy. In particular, we first introduce the gravity model into the traditional Particle Swarm Optimization (PSO) algorithm so as to increase the probability of full coverage. Then, the energy consumption is included in the calculation of the fitness function so that maximum coverage and energy consumption can be balanced. Finally, in order to reduce the communication interference between UAVs, we design an adaptive lift control strategy based on the repulsion model to reduce the repeated coverage of multi-UAVs. Experimental results show that the proposed coverage strategy based on gravity model outperforms the existing state-of-the-art approaches. For example, in the target area of any size, the coverage rate and the repeated coverage rate of the proposed multi-UAVs scheduling are improved by 6.9–29.1%, and 2.0–56.1%, respectively. Moreover, the proposed scheduling algorithm is high adaptable to diverse execution environments.© 2022 Published by Elsevier Ltd.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000202/pdfft?md5=291b743db1543baa3206b2f6159d1259&pid=1-s2.0-S2352864823000202-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41811143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel hybrid authentication protocol utilizing lattice-based cryptography for IoT devices in fog networks 一种用于雾网络中物联网设备的基于格密码的新型混合认证协议
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.003
{"title":"A novel hybrid authentication protocol utilizing lattice-based cryptography for IoT devices in fog networks","authors":"","doi":"10.1016/j.dcan.2022.12.003","DOIUrl":"10.1016/j.dcan.2022.12.003","url":null,"abstract":"<div><p>The Internet of Things (IoT) has taken the interconnected world by storm. Due to their immense applicability, IoT devices are being scaled at exponential proportions worldwide. But, very little focus has been given to securing such devices. As these devices are constrained in numerous aspects, it leaves network designers and administrators with no choice but to deploy them with minimal or no security at all. We have seen distributed denial-of-service attacks being raised using such devices during the infamous Mirai botnet attack in 2016. Therefore we propose a lightweight authentication protocol to provide proper access to such devices. We have considered several aspects while designing our authentication protocol, such as scalability, movement, user registration, device registration, etc. To define the architecture we used a three-layered model consisting of cloud, fog, and edge devices. We have also proposed several pre-existing cipher suites based on post-quantum cryptography for evaluation and usage. We also provide a fail-safe mechanism for a situation where an authenticating server might fail, and the deployed IoT devices can self-organize to keep providing services with no human intervention. We find that our protocol works the fastest when using ring learning with errors. We prove the safety of our authentication protocol using the automated validation of Internet security protocols and applications tool. In conclusion, we propose a safe, hybrid, and fast authentication protocol for authenticating IoT devices in a fog computing environment.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002619/pdfft?md5=f8a2dd0f1aef52840fe8502a6ec294b5&pid=1-s2.0-S2352864822002619-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42631025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A compatible carbon efficiency information service framework based on the industrial internet identification 基于工业互联网识别的兼容碳效率信息服务框架
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.06.005
{"title":"A compatible carbon efficiency information service framework based on the industrial internet identification","authors":"","doi":"10.1016/j.dcan.2023.06.005","DOIUrl":"10.1016/j.dcan.2023.06.005","url":null,"abstract":"<div><p>Green and low-carbon is a new development model that seeks balance between environmental sustainability and high economic growth. If explainable and available carbon emission data can be accurately obtained, it will help policy regulators and enterprise managers to more accurately implement this development strategy. A lot of research has been carried out, but it is still a difficult problem that how to accommodate and adapt the complex carbon emission data computing models and factor libraries developed by different regions, different industries and different enterprises. Meanwhile, with the rapid development of the Industrial Internet, it has not only been used for the supply chain optimization and intelligent scheduling of the manufacturing industry, but also been used by more and more industries as an important way of digital transformation. Especially in China, the Industrial Internet identification and resolution system is becoming an important digital infrastructure to uniquely identify objects and share data. Hence, a compatible carbon efficiency information service framework based on the Industrial Internet Identification is proposed in this paper to address the problem of computing and querying multi-source heterogeneous carbon emission data. We have defined a multi cooperation carbon emission data interaction model consisting of three roles and three basic operations. Further, the implementation of the framework includes carbon emission data identification, modeling, calculation, query and sharing. The practice results show that its capability and effectiveness in improving the responsiveness, accuracy, and credibility of compatible carbon efficiency data query and sharing services.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823001116/pdfft?md5=60e7cc434d297bec59a0eb3964a06586&pid=1-s2.0-S2352864823001116-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47062330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Attention-relation network for mobile phone screen defect classification via a few samples 基于注意力关系网络的手机屏幕缺陷分类
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.008
{"title":"Attention-relation network for mobile phone screen defect classification via a few samples","authors":"","doi":"10.1016/j.dcan.2023.01.008","DOIUrl":"10.1016/j.dcan.2023.01.008","url":null,"abstract":"<div><p>How to use a few defect samples to complete the defect classification is a key challenge in the production of mobile phone screens. An attention-relation network for the mobile phone screen defect classification is proposed in this paper. The architecture of the attention-relation network contains two modules: a feature extract module and a feature metric module. Different from other few-shot models, an attention mechanism is applied to metric learning in our model to measure the distance between features, so as to pay attention to the correlation between features and suppress unwanted information. Besides, we combine dilated convolution and skip connection to extract more feature information for follow-up processing. We validate attention-relation network on the mobile phone screen defect dataset. The experimental results show that the classification accuracy of the attention-relation network is 0.9486 under the 5-way 1-shot training strategy and 0.9039 under the 5-way 5-shot setting. It achieves the excellent effect of classification for mobile phone screen defects and outperforms with dominant advantages.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000214/pdfft?md5=0820732076ef7127cda7218776b1a772&pid=1-s2.0-S2352864823000214-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49669546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A dynamic algorithm for trust inference based on double DQN in the internet of things 物联网中基于双DQN的动态信任推理算法
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.010
{"title":"A dynamic algorithm for trust inference based on double DQN in the internet of things","authors":"","doi":"10.1016/j.dcan.2022.12.010","DOIUrl":"10.1016/j.dcan.2022.12.010","url":null,"abstract":"<div><p>The development of the Internet of Things (IoT) has brought great convenience to people. However, some information security problems such as privacy leakage are caused by communicating with risky users. It is a challenge to choose reliable users with which to interact in the IoT. Therefore, trust plays a crucial role in the IoT because trust may avoid some risks. Agents usually choose reliable users with high trust to maximize their own interests based on reinforcement learning. However, trust propagation is time-consuming, and trust changes with the interaction process in social networks. To track the dynamic changes in trust values, a dynamic trust inference algorithm named Dynamic Double DQN Trust (Dy-DDQNTrust) is proposed to predict the indirect trust values of two users without direct contact with each other. The proposed algorithm simulates the interactions among users by double DQN. Firstly, CurrentNet and TargetNet networks are used to select users for interaction. The users with high trust are chosen to interact in future iterations. Secondly, the trust value is updated dynamically until a reliable trust path is found according to the result of the interaction. Finally, the trust value between indirect users is inferred by aggregating the opinions from multiple users through a Modified Collaborative Filtering Average-based Similarity (SMCFAvg) aggregation strategy. Experiments are carried out on the FilmTrust and the Epinions datasets. Compared with TidalTrust, MoleTrust, DDQNTrust, DyTrust and Dynamic Weighted Heuristic trust path Search algorithm (DWHS), our dynamic trust inference algorithm has higher prediction accuracy and better scalability.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002784/pdfft?md5=877c7e95575423a8e1eedc5ae6bcbe63&pid=1-s2.0-S2352864822002784-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49084507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Radio resource management in energy harvesting cooperative cognitive UAV assisted IoT networks: A multi-objective approach 协同认知无人机辅助物联网网络中的无线电资源管理:一种多目标方法
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.01.006
{"title":"Radio resource management in energy harvesting cooperative cognitive UAV assisted IoT networks: A multi-objective approach","authors":"","doi":"10.1016/j.dcan.2023.01.006","DOIUrl":"10.1016/j.dcan.2023.01.006","url":null,"abstract":"<div><p>Cooperative communication through energy harvested relays in Cognitive Internet of Things (CIoT) has been envisioned as a promising solution to support massive connectivity of Cognitive Radio (CR) based IoT devices and to achieve maximal energy and spectral efficiency in upcoming wireless systems. In this work, a cooperative CIoT system is contemplated, in which a source acts as a satellite, communicating with multiple CIoT devices over numerous relays. Unmanned Aerial Vehicles (UAVs) are used as relays, which are equipped with onboard Energy Harvesting (EH) facility. We adopted a Power Splitting (PS) method for EH at relays, which are harvested from the Radio frequency (RF) signals. In conjunction with this, the Decode and Forward (DF) relaying strategy is used at UAV relays to transmit the messages from the satellite source to the CIoT devices. We developed a Multi-Objective Optimization (MOO) framework for joint optimization of source power allocation, CIoT device selection, UAV relay assignment, and PS ratio determination. We formulated three objectives: maximizing the sum rate and the number of admitted CIoT in the network and minimizing the carbon dioxide emission. The MOO formulation is a Mixed-Integer Non-Linear Programming (MINLP) problem, which is challenging to solve. To address the joint optimization problem for an epsilon optimal solution, an Outer Approximation Algorithm (OAA) is proposed with reduced complexity. The simulation results show that the proposed OAA is superior in terms of CIoT device selection and network utility maximization when compared to those obtained using the Nonlinear Optimization with Mesh Adaptive Direct-search (NOMAD) algorithm.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000196/pdfft?md5=35992e09f0780c9486494c630304b78f&pid=1-s2.0-S2352864823000196-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44677438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secure transmission in backhaul NOMA systems: A physical layer security design with untrusted user and eavesdropper 回程NOMA系统中的安全传输:一种具有不可信用户和窃听者的物理层安全设计
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.005
{"title":"Secure transmission in backhaul NOMA systems: A physical layer security design with untrusted user and eavesdropper","authors":"","doi":"10.1016/j.dcan.2022.12.005","DOIUrl":"10.1016/j.dcan.2022.12.005","url":null,"abstract":"<div><p>In order to improve the Physical Layer Security (PLS) perspective, this paper aims to empower function of PLS by considering a backhaul Non-Orthogonal Multiple Access (NOMA) system in two practical situations. In the proposed schemes, the untrusted user intercepts information transmitted to the far user, or the external eavesdropper overhears confidential information sent to the far user in the context of NOMA technique. Unlike the conventional NOMA systems, this paper emphasizes the actual situations of the existence of actual illegal users and legitimate users, especially the reasonable use of relay selection architecture to improve the confidentiality performance. To evaluate the security properties of the proposed scheme, a comprehensive analysis of the Security Outage Probability (SOP) performance is first performed, and then the corresponding SOP asymptotic expressions are derived for real scenarios related to eavesdroppers and untrusted users. Numerical results are performed to verify the analysis in terms of the secure performance metric.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002735/pdfft?md5=bfc1e5fb810dd61e8d8a8bab7ba18d7c&pid=1-s2.0-S2352864822002735-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48473347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fast UAV path planning in urban environments based on three-step experience buffer sampling DDPG 基于三步经验缓冲采样DDPG的城市无人机快速路径规划
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2023.02.016
{"title":"Fast UAV path planning in urban environments based on three-step experience buffer sampling DDPG","authors":"","doi":"10.1016/j.dcan.2023.02.016","DOIUrl":"10.1016/j.dcan.2023.02.016","url":null,"abstract":"<div><p>The path planning of Unmanned Aerial Vehicle (UAV) is a critical issue in emergency communication and rescue operations, especially in adversarial urban environments. Due to the continuity of the flying space, complex building obstacles, and the aircraft's high dynamics, traditional algorithms cannot find the optimal collision-free flying path between the UAV station and the destination. Accordingly, in this paper, we study the fast UAV path planning problem in a 3D urban environment from a source point to a target point and propose a Three-Step Experience Buffer Deep Deterministic Policy Gradient (TSEB-DDPG) algorithm. We first build the 3D model of a complex urban environment with buildings and project the 3D building surface into many 2D geometric shapes. After transformation, we propose the Hierarchical Learning Particle Swarm Optimization (HL-PSO) to obtain the empirical path. Then, to ensure the accuracy of the obtained paths, the empirical path, the collision information and fast transition information are stored in the three experience buffers of the TSEB-DDPG algorithm as dynamic guidance information. The sampling ratio of each buffer is dynamically adapted to the training stages. Moreover, we designed a reward mechanism to improve the convergence speed of the DDPG algorithm for UAV path planning. The proposed TSEB-DDPG algorithm has also been compared to three widely used competitors experimentally, and the results show that the TSEB-DDPG algorithm can archive the fastest convergence speed and the highest accuracy. We also conduct experiments in real scenarios and compare the real path planning obtained by the HL-PSO algorithm, DDPG algorithm, and TSEB-DDPG algorithm. The results show that the TSEB-DDPG algorithm can archive almost the best in terms of accuracy, the average time of actual path planning, and the success rate.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864823000512/pdfft?md5=8f83499de11cc603253e177c24317cc0&pid=1-s2.0-S2352864823000512-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47389233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hierarchical blockchain-enabled security-threat assessment architecture for IoV 面向车联网的分层区块链安全威胁评估架构
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.12.019
{"title":"A hierarchical blockchain-enabled security-threat assessment architecture for IoV","authors":"","doi":"10.1016/j.dcan.2022.12.019","DOIUrl":"10.1016/j.dcan.2022.12.019","url":null,"abstract":"<div><p>In Internet of Vehicles (IoV), the security-threat information of various traffic elements can be exploited by hackers to attack vehicles, resulting in accidents, privacy leakage. Consequently, it is necessary to establish security-threat assessment architectures to evaluate risks of traffic elements by managing and sharing security-threat information. Unfortunately, most assessment architectures process data in a centralized manner, causing delays in query services. To address this issue, in this paper, a Hierarchical Blockchain-enabled Security threat Assessment Architecture (HBSAA) is proposed, utilizing edge chains and global chains to share data. In addition, data virtualization technology is introduced to manage multi-source heterogeneous data, and a metadata association model based on attribute graph is designed to deal with complex data relationships. In order to provide high-speed query service, the ant colony optimization of key nodes is designed, and the HBSAA prototype is also developed and the performance is tested. Experimental results on the large-scale vulnerabilities data gathered from NVD demonstrate that the HBSAA not only shields data heterogeneity, but also reduces service response time.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002875/pdfft?md5=141dc87d9d0b1ee551a0d83890655a88&pid=1-s2.0-S2352864822002875-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44959688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient signal detector design for OTFS with index modulation 索引调制OTFS的高效信号检测器设计
IF 7.5 2区 计算机科学
Digital Communications and Networks Pub Date : 2024-08-01 DOI: 10.1016/j.dcan.2022.10.026
{"title":"Efficient signal detector design for OTFS with index modulation","authors":"","doi":"10.1016/j.dcan.2022.10.026","DOIUrl":"10.1016/j.dcan.2022.10.026","url":null,"abstract":"<div><p>In this paper, efficient signal detectors are designed for Orthogonal Time Frequency Space (OTFS) modulation with Index Modulation (IM) systems. Firstly, the Minimum Mean Squared Error (MMSE) based linear equalizer and its corresponding soft-aided decision are studied for OTFS-IM. To further improve the performance, a Vector-by-Vector-aided Message Passing (VV-MP) detector and its associated soft-decision are proposed, where each IM symbol is considered an entire vector utilized for message calculation and passing. Simulation results are shown that the OTFS-IM system relying on the proposed detectors is capable of providing considerable Bit Error Rate (BER) performance gains over the OTFS and Orthogonal Frequency Division Multiplex (OFDM) with IM systems.</p></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":null,"pages":null},"PeriodicalIF":7.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352864822002358/pdfft?md5=c2818753bde23a42975fafe58f08ae0b&pid=1-s2.0-S2352864822002358-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46327047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信