IEEE Open Journal of the Communications Society最新文献

{"title":"MIMO-OFDM Imaging Using Shared Time and Bandwidth","authors":"Mehmet Yazgan;Hüseyin Arslan;Stavros Vakalis","doi":"10.1109/OJCOMS.2025.3573583","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3573583","url":null,"abstract":"Multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) radar imaging has emerged as a promising approach for high-resolution environmental sensing, particularly in spectrally congested wireless environments. This paper presents a novel MIMO-OFDM imaging framework that enables simultaneous transmission from multiple antennas without relying on conventional time-division multiplexing (TDM) or frequency-division multiplexing (FDM) techniques. The proposed method preserves the standard OFDM communication waveform, eliminating the need for additional interference mitigation strategies. Two transmit (Tx) and two receive (Rx) antennas operate within a 400 MHz bandwidth at carrier frequencies of 2.4 GHz and 2.415 GHz, each transmitting independently modulated quadrature amplitude modulation (QAM) symbols. Theoretical analysis, simulations, and experimental measurements demonstrate that high-fidelity object reconstruction is achieved despite overlapping spectral and temporal resources. The results validate the feasibility of this approach for efficient spectral and temporal resource utilization in wireless sensing applications, making it favorable for existing and upcoming wireless applications with a massive number of active sensing devices, such as joint-radar and communications (JRC) and the Internet of Everything (IoE).","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"4885-4893"},"PeriodicalIF":6.3,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11015606","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144472677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Probabilistic Interference Prediction for Dynamic 6G In-X Sub-Networks","authors":"Pramesh Gautam;Carsten Bockelmann;Armin Dekorsy","doi":"10.1109/OJCOMS.2025.3554993","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3554993","url":null,"abstract":"In-X Subnetworks (SNs) face significant challenges in meeting extremely heterogeneous requirements due to interference resulting from dynamic mobility, hyper-dense deployment, and limited available channel bandwidth. To address these challenges, we introduce novel probabilistic interference prediction techniques that enable proactive interference management by allocating resources based on predicted interference, thereby preventing performance degradation in SNs. However, interference prediction is challenging due to complex, dynamic interference associated with randomness in the propagation environment, mobility, and traffic patterns. We propose and evaluate two categories of probabilistic predictors to model the tail statistics of interference: a Bayesian framework-based Variational Inference Sparse Gaussian Process Regression (VISPGPR) and a Quantile Bidirectional Long Short-Term Memory (QBiLSTM) predictor for direct quantile estimation. Additionally, we introduce a Matérn kernel-based Student-t process to effectively capture interference dynamics characterized by outliers and rapid fluctuations. This approach outperforms traditional methods, including VISPGPR with the commonly used exponential square kernel and Gaussian prior, by better modeling heavy-tailed interference distributions. However, model mismatch has been identified as a major bottleneck for optimal performance. To address this, we propose an Attention-based modified QBiLSTM (Atten-MQBiLSTM), which further enhances performance by leveraging temporal correlations without making assumptions about the underlying distribution of target variables-an aspect not captured by VISPGPR. The effectiveness of the proposed predictors is evaluated using a spatially consistent 3GPP channel model incorporating realistic mobility and two distinct extreme traffic models. Simulation results show that the proposed predictors outperform the baseline method in terms of coverage probability, with improvements ranging from 22–33% and 4–13% over VISPGPR for Bernoulli random and deterministic traffic, respectively. This helps achieve target reliability close to Genie resource allocation (RA) in both extreme traffic modeling scenarios while ensuring scalability within the predictive interference management framework.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"2454-2473"},"PeriodicalIF":6.3,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10939016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Over-the-Air Multi-User Convolutional Code for URLLC","authors":"Rafael Santos;Daniel Castanheira;Adão Silva;Atílio Gameiro","doi":"10.1109/OJCOMS.2025.3573437","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3573437","url":null,"abstract":"URLLC applications impose stringent latency and reliability requirements, making its compliance challenging due to the inherent trade-off between them. These applications typically involve the exchange of small information blocks. Convolutional codes (CC) exhibit near-optimal performance when encoding short blocks. To enable packet-based transmissions, CCs require some kind of termination. A zero-terminated CC (ZTCC) enables efficient maximum likelihood (ML) decoding through the Viterbi algorithm, but suffers from a rate-loss particularly prominent in short blocks. A tail-biting CC (TBCC) avoids rate-loss but entails significantly higher ML decoding complexity. Despite the ZTCC having lower ML decoding complexity and similar error performance, TBCC has received preference by wireless standards, essentially due to ZTCC rate-loss. This work proposes a novel distributed multi-user ZTCC (MU-ZTCC) coding scheme, which eliminates rate-loss by encoding multiple physically separated users over-the-air. Local user data undergoes standard ZTCC encoding followed by multi-user encoding via over-the-air summation. Due to its zero termination, ML decoding of MU-ZTCC is accomplished with a single Viterbi execution. Simulation results show that MU-ZTCC approaches the performance of orthogonal transmissions as SNR increases, while increasing the transmission rate by up to 47% for the selected parameters. This scheme can be viewed as a non-orthogonal multiple access scheme, whose structure enables ML joint detection and decoding with the complexity of standard Viterbi algorithm.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"4718-4730"},"PeriodicalIF":6.3,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11015616","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144308486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Defining Intent-Based Service Management Automation for 6G Multi-Stakeholders Scenarios","authors":"Pol Alemany;Raul Muñoz;Josue Castaneda Cisneros;Mehmet Karaca;Pawani Porambage;Huy Q. Tran;Pietro G. Giardina;Ioannis Tzanettis;Xose R. Sousa;José María Jorquera Valero;Behnam Ojaghi;Ricard Vilalta;Patrik Rugeland;Mathieu Boussard;Giada Landi;Anastasios Zafeiropoulos;Santiago Rodríguez;Manuel Gil Pérez;Sokratis Barmpounakis;Mikko A. Uusitalo;Diego Lopez;Sylvaine Kerboeuf","doi":"10.1109/OJCOMS.2025.3554250","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3554250","url":null,"abstract":"This article aims to explore the requirements and challenges that Intent-Based Management (IBM) systems should look towards to deliver proper automation management in multi-stakeholder 6G scenarios. To do so, the evolution of the telecommunications actors is presented to identify how they will interact with the use of intents and what IBM systems must face to fulfil with the tenants expectations while interacting among other IBM domains (aggregation vs. federation models). In a second step, this article presents how the IBM systems functionalities should be organized (based on standards research and comparative) and a set of enablers using them to properly deliver the automation needed to accomplish the requests done by the tenants. On a third step, a set of End-to-End (E2E) intent-based services are described to illustrate how the different enablers (and the functionalities they use) may work to reach the E2E service goal. Finally, a set of experimental results related to how intent conflicts should be manage is presented, followed by the conclusions.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"2373-2396"},"PeriodicalIF":6.3,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10938233","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Low-Latency and Energy-Efficient Federated Learning Over Cell-Free Networks: A Trade-Off Analysis","authors":"Afsaneh Mahmoudi;Mahmoud Zaher;Emil Björnson","doi":"10.1109/OJCOMS.2025.3553593","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3553593","url":null,"abstract":"Federated learning (FL) enables distributed model training by exchanging models rather than raw data, preserving privacy and reducing communication overhead. However, as the number of FL users grows, traditional wireless networks with orthogonal access face increasing latency due to limited scalability. Cell-free massive multiple-input multiple-output (CFmMIMO) networks offer a promising solution by allowing many users to share the same time-frequency resources. While CFmMIMO enhances energy efficiency through spatial multiplexing and collaborative beamforming, it remains crucial to adapt its physical layer operation to meticulously allocate uplink transmission powers to the FL users. To this aim, we study the problem of uplink power allocation to maximize the number of global FL iterations while jointly optimizing uplink energy and latency. The key challenge lies in balancing the opposing effects of transmission power: increasing power reduces latency but increases energy consumption, and vice versa. Therefore, we propose two power allocation schemes: one minimizes a weighted sum of uplink energy and latency to manage the trade-off, while the other maximizes the achievable number of FL iterations within given energy and latency constraints. We solve these problems using a combination of Brent’s method, coordinate gradient descent, the bisection method, and Sequential Quadratic Programming (SQP) with BFGS updates. Numerical results demonstrate that our proposed approaches outperform state-of-the-art power allocation schemes, increasing the number of achievable FL iterations by up to 62%, 93%, and 142% compared to Dinkelbach, max-sum rate, and joint communication and computation optimization methods, respectively.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"2274-2292"},"PeriodicalIF":6.3,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10937196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Entanglement-Based Artificial Topology: Neighboring Remote Network Nodes","authors":"Si-Yi Chen;Jessica Illiano;Angela Sara Cacciapuoti;Marcello Caleffi","doi":"10.1109/OJCOMS.2025.3554052","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3554052","url":null,"abstract":"Entanglement is unanimously recognized as the key communication resource of the Quantum Internet. Thus, the possibility of implementing unparalleled network functionalities by exploiting entanglement is gaining huge attention. However, the research efforts in this context are mainly focused on <italic>bipartite entanglement</i>, often discarding the wide unexplored classes of entanglement shared among more than two parties, known as <italic>multipartite entanglement</i>. In this paper, we aim at exploiting multipartite entanglement as <italic>inter-network resource</i>. Specifically, we consider the interconnection of different Quantum Local Area Networks (QLANs), and we show that multipartite entanglement allows to dynamically generate an inter-QLAN <italic>artificial</i> topology, by means of local operations only, that overcomes the limitations of the physical QLAN topologies. To this aim, we first design the multipartite entangled state to be distributed within each QLAN. Then, we show how such a state can be engineered to: i) interconnect nodes belonging to different QLANs, and ii) dynamically adapt to different inter-QLAN traffic demands. Our contribution aims at providing the network engineering community with a hands-on guideline towards the concept of artificial topology and artificial neighborhood.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"2220-2238"},"PeriodicalIF":6.3,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10937972","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143818000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Extending the LoRa Direct-to-Satellite Limits: Doppler Shift Pre-Compensation","authors":"Muhammad Asad Ullah;Richard Demo Souza;Gianni Pasolini;Jean Michel de Souza Sant’Ana;Marko Höyhtyä;Konstantin Mikhaylov;Hirley Alves;Enrico Paolini;Akram Al-Hourani","doi":"10.1109/OJCOMS.2025.3554077","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3554077","url":null,"abstract":"Earlier studies and field tests have extensively investigated Long Range (LoRa) direct-to-satellite (DtS) communications, confirming the feasibility of integration with Low Earth Orbit (LEO) satellites. These works identify the Doppler effect as one of the primary challenges. Therefore, there is a need for a robust solution to mitigate the impact of this phenomenon in order to improve the performance of LoRa DtS communications in a LEO scenario. This paper addresses this shortcoming by developing a solution to pre-compensate the Doppler shift. Specifically, we propose a method that allows end devices to estimate and pre-compensate the Doppler shift before initiating an uplink transmission. This framework, which requires satellites to broadcast Doppler Beacons, ensures compatibility with existing LoRaWAN end devices without requiring any hardware modifications. We leverage data from real-world LoRa satellites’ empirical telemetry to validate our proposed method. We analytically study packet losses due to Doppler shift across different carrier frequencies, specifically 401.5 MHz, 868 MHz, and 2 GHz. Our analysis also considers different satellite orbital heights, specifically 200 km and 518 km, as well as channel bandwidths of 31.25 kHz, 62.5 kHz, and 125 kHz. Our results demonstrate that the proposed solution effectively pre-compensates for the Doppler shift and mitigates the packet losses, extending the passing satellites’ effective visibility window duration. We examine the maximum Doppler shift in the communication channel and the calculate required Doppler Beacon bandwidth for different orbital altitudes, minimum elevation angles, and carrier frequencies. This study also investigates how the proposed framework affects the battery lifetime of the end device, showing a marginal decrease of 2.5% compared to traditional LoRaWAN operation.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"2256-2273"},"PeriodicalIF":6.3,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10937974","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Geometric Mean Rate Maximization in RIS-Aided mmWave ISAC Systems Relying on a Non-Diagonal Phase Shift Matrix","authors":"Jitendra Singh;Aditya K. Jagannatham;Lajos Hanzo","doi":"10.1109/OJCOMS.2025.3573196","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3573196","url":null,"abstract":"The joint optimization of the hybrid transmit precoders (HTPCs) and reflective elements of a millimeter wave (mmWave) integrated sensing and communication (ISAC) system is considered. The system also incorporates a reconfigurable intelligent surface (RIS) relying on a non-diagonal RIS (NDRIS) phase shift matrix. Specifically, we consider a hybrid architecture at the ISAC base station (BS) that serves multiple downlink communication users (CUs) via the reflected links from the RIS, while concurrently detecting multiple radar targets (RTs). We formulate an optimization problem that aims for maximizing the geometric mean (GM) rate of the CUs, subject to the sensing requirement for each RT. Additional specifications related to the limited transmit power and unit modulus (UM) constraints for both the HTPCs and the reflective elements of the NDRIS phase shift matrix make the problem challenging. To solve this problem, we first transform the intractable GM rate expression to a tractable weighted sum rate objective and next split the transformed problem into sub-problems. Consequently, we propose an iterative alternating optimization approach that leverages the majorization-minimization (MM) framework and block coordinate descent (BCD) method to solve each sub-problem. Furthermore, to tackle the UM constraints in the sub-problem of the HTPC design, we propose a penalty-based Riemannian manifold optimization (PRMO) algorithm, which optimizes the HTPCs on the Riemannian manifold. Similarly, the phases of the reflective elements of the NDRIS are optimized by employing the Riemannian manifold, and the locations of the non-zero entries of the NDRIS phase shift matrix are obtained by the maximal ratio combining (MRC) criterion. Finally, we present our simulation results, which show that deploying an NDRIS achieves additional gains for the CUs over a conventional RIS, further enhancing both the communication efficiency and sensing reliability. Furthermore, we compare the results to the pertinent benchmarks, which validate the effectiveness of our proposed algorithms.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"4756-4771"},"PeriodicalIF":6.3,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11012749","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Generative AI in Intrusion Detection Systems for Internet of Things: A Systematic Literature Review","authors":"Zhe Deng;Ants Torim;Sadok Ben Yahia;Hayretdin Bahsi","doi":"10.1109/OJCOMS.2025.3573194","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3573194","url":null,"abstract":"The ubiquitous data streaming through the Internet of Things (IoT) creates security risks. Intrusion detection systems (IDS) based on machine learning can support user security. Generative Artificial Intelligence (GenAI) demonstrates strong capabilities in generating synthetic data based on realistic distributions and learning complex patterns from high-dimensional data. By harnessing the capabilities of generative AI, it is feasible to augment intrusion detection models, allowing for more robust and adaptive security solutions in IoT environments. This paper introduces a systematic literature review of recent GenAI applications in IoT IDS and analyzes the architectures and techniques in the models. We classify the common usages such as data augmentation and class balancing, data reconstruction, and adversarial attack generation. We outline the commonly used datasets and evaluation metrics and compare the performances of each model under these conditions. The study identifies current challenges and emerging research trends in various technologies for applying GenAI in IoT IDS.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"4689-4717"},"PeriodicalIF":6.3,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11012727","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144255646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Real-Time Status Update System in a Parallel Blocking Queue","authors":"Zhengchuan Chen;Junyao Zhu;Nikolaos Pappas;Lyutianyang Zhang;Min Wang;Chaowei Tang;Tony Q. S. Quek","doi":"10.1109/OJCOMS.2025.3572613","DOIUrl":"https://doi.org/10.1109/OJCOMS.2025.3572613","url":null,"abstract":"Multi-path transmission is promising in improving the freshness of information received in status-updating systems. However, multi-path transmission results in out-of-order arrivals at the monitoring point, which poses significant challenges to the analysis of freshness. This work analyzes the age of information (AoI) of a multi-path transmission non-preemptive system where multiple servers can deliver the information generated from a source to a common monitor. Two systems are considered: the homogeneous M/M/n/n non-preemptive system, where the arrival rates and service rates are identical across servers, and the heterogeneous M/M/2/2 non-preemptive system, where the service rates of all servers are different. We employ the stochastic hybrid systems (SHS) approach to characterize the average AoI of the systems and derive an explicit expression for the average AoI in both homogeneous and heterogeneous cases. Numerical results verify the effectiveness of the analysis. It is shown that when the number of servers increases in powers of 2, the most significant reduction in the average AoI occurs when the number of servers changes from 1 to 2. Besides, the numerical results confirm that the M/M/2/2 non-preemptive system is superior to the M/M/1/1 dual-queue system in terms of average AoI.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"6 ","pages":"4608-4623"},"PeriodicalIF":6.3,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11010107","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}