Vehicular Communications最新文献

{"title":"S-LDM: Server local dynamic map for 5G-based centralized enhanced collective perception","authors":"C.M. Risma Carletti ,&nbsp;F. Raviglione ,&nbsp;C. Casetti ,&nbsp;F. Stoffella ,&nbsp;G.M. Yilma ,&nbsp;F. Visintainer","doi":"10.1016/j.vehcom.2024.100819","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100819","url":null,"abstract":"<div><p>The automotive field is undergoing significant technological advances, which includes making the next generation of autonomous vehicles smarter, greener and safer through vehicular networks, which are often referred to as Vehicle-to-Everything (V2X) communications. Together with V2X, centralized maneuver management services for autonomous vehicles are increasingly gaining importance, as, thanks to their complete view over the road, they can optimally manage even the most complex maneuvers targeting L4 driving and beyond. These services face the challenge of strictly requiring a high reliability and low latency, which are tackled with the deployment at orchestrated Multi-Access Edge Computing (MEC) platforms. In order to properly manage safety-critical maneuvers, these services need to receive a large amount of data from vehicles, even though the useful subset of data is often related to a specific context on the road (e.g., to specific road users or geographical areas). Decoding and post-processing a large amount of raw messages, which are then for the most part filtered, increases the load on safety-critical services, which should instead focus on meeting the deadlines for the actual control and management operations. On this basis, we present an innovative open-source, 5G &amp; MEC enabled service, called Server Local Dynamic Map (S-LDM). The S-LDM is a service that collects information about vehicles and other non-connected road objects using standard-compliant messages. Its primary purpose is to create a centralized dynamic map of the road that can be shared efficiently with other services managing L4 automation, when needed. By doing so, the S-LDM enables these services to widely and precisely understand the current situation of sections of the road, offloading them from the need of quickly processing a large number of messages. After a detailed description of the service architecture, we validate it through extensive laboratory and pilot trials, involving the MEC platforms and production 5G networks of three major European network operations and two Stellantis vehicles equipped with V2X On-Board Units (OBUs). We show how it can efficiently handle high update rates and process each messages in less than few tenths of microseconds. We also provide a complete scalability analysis with details on deployment options, providing insights on where new instances should be created in practical 5G-based V2X scenarios.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":5.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214209624000949/pdfft?md5=150e5c867ceac116888efba68e0e6ff3&pid=1-s2.0-S2214209624000949-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141481658","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}

{"title":"GASBO: User grouping–based gradient average subtraction–based optimisation for NOMA-based fog computing vehicular network","authors":"C Kumara Narayana Swamy,&nbsp;T Velmurugan","doi":"10.1016/j.vehcom.2024.100824","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100824","url":null,"abstract":"<div><p>The Internet of Vehicles (IoV) for fog computing (FC) addresses issues such as traffic congestion, transportation efficiency, and privacy. Non-orthogonal multiple access (NOMA) is a popular technology that enhances spectral efficiency and increases the network's access capability. The synchronisation between NOMA and FC radio access networks extends the application of augmented or vehicular networking and other promising uses. However, with the rapid increase in user vehicles and mobile data, the existing IoV has not succeeded in meeting the real-world and dependable communication needs of modern intelligent transportation due to its limited flexibility. To overcome this, we propose a user grouping-based hybrid optimistic framework for resource allocation in NOMA-based FC vehicular networks (FCVR), named the gradient average subtraction-based optimisation (GASBO). Initially, the NOMA-based FCVR is simulated. User grouping is performed based on GASBO using the signal-to-interference-plus-noise ratio and user distance. Finally, resource allocation is achieved using the proposed GASBO, which combines gradient descent optimisation and average subtraction-based optimisation. The analytic measures obtained for energy efficiency, throughput, sub-channel utility, capacity, and penalty function are 5,366,844,362.870 bits/joule, 883.411 Mbps, 82.031, 2316.337, and 0.011, respectively.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":5.8,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141541722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An identity authentication and key agreement protocol for the internet of vehicles based on trusted cloud-edge-terminal architecture","authors":"Jun-feng Tian ,&nbsp;Rui Ni","doi":"10.1016/j.vehcom.2024.100825","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100825","url":null,"abstract":"<div><p>The continuous progression in cloud computing, edge computing, and associated technologies has notably hastened the progress of vehicle networking technology. This advancement is increasingly assuming a crucial role in enhancing driving safety, optimizing traffic management, and revolutionizing traffic control methodologies. The principal aim of Internet of Vehicles (IoV) technology is to establish a secure, convenient, and efficient novel driving paradigm, enabling intelligent transportation through wireless communication connecting roadside units and vehicles. Nevertheless, this wireless communication method is susceptible to potential attacks, including remote control, information monitoring, and identity simulation. Given this situation, effective authentication is required to address this security concern. Thus, this study proposes an identity authentication and key negotiation protocol grounded in a trusted cloud-edge-terminal architecture. This protocol facilitates mutual authentication, generates secure session keys for communication, guarantees the security of vehicle communication, and supports functionalities including privacy protection and password alteration for vehicle users. Time tree technology is employed for managing the edge nodes, facilitating the sharing of vehicle certification information among these nodes, and enhancing certification efficiency. Formal security analysis and informal security analysis are conducted to demonstrate the security of the proposed protocol, evaluating its security and practicality. Theoretical comparisons and experimental results demonstrate the outstanding computational and communication performance of the proposed protocol.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":5.8,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141541720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An intelligent clustering scheme based on whale optimization algorithm in flying ad hoc networks","authors":"Mehdi Hosseinzadeh ,&nbsp;Jawad Tanveer ,&nbsp;Faisal Alanazi ,&nbsp;Khursheed Aurangzeb ,&nbsp;Mohammad Sadegh Yousefpoor ,&nbsp;Efat Yousefpoor ,&nbsp;Aso Darwesh ,&nbsp;Sang-Woong Lee ,&nbsp;Amir Masoud Rahmani","doi":"10.1016/j.vehcom.2024.100805","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100805","url":null,"abstract":"<div><p>Due to the progress of unmanned aerial vehicles (UAVs), this new technology is widely applied in military and civilian areas. Multi-UAV networks are often known as flying ad hoc networks (FANETs). Due to these applications, FANET must ensure communication stability and have high scalability. These goals are achieved by presenting clustering techniques in FANETs. However, the characteristics of these networks, like high-mobility nodes, limited energy, and dynamic topology, have created great challenges in two important processes of clustering protocols, namely cluster construction and the selection of cluster heads. In this paper, an intelligent clustering scheme based on the whale optimization algorithm called ICW is suggested in flying ad hoc networks. Firstly, each UAV specifies its hello interval based on the lifespan of adjacent links to guarantee the adaptability of ICW to FANET. Then, a centralized clustering process is done using a whale optimization algorithm (WOA) to find the best cluster centers on the network. To determine the membership of each UAV in a cluster, ICW employs a new criterion, i.e. closeness ratio, so that each UAV joins a cluster with the best closeness ratio. In addition, the evaluation of each whale is carried out based on a fitness function, consisting of three components, namely the number of isolated clusters, the ratio of inter-cluster distance to intra-cluster distance, and cluster size. Then, a cluster head is selected for each cluster based on a score value. This score is dependent on the weighted sum of four metrics, namely remaining energy, the average link lifespan between each UAV and its neighbors, neighbor degree, and the average distance between each UAV and its neighbors. In the last step, two routing processes, namely intra-cluster routing and inter-cluster routing, are introduced in FANET. Then, the evaluation and implementation of ICW is performed through the NS2 simulator. After completing the simulation process, ICW is compared to MWCRSF, DCM, and GWO, and the evaluation results are presented in two scenarios, namely network evaluation in the clustering process and network evaluation in the routing process. Accordingly, in the first scenario, ICW has low clustering time and a high cluster lifetime. In the second scenario, ICW optimizes energy consumption, network longevity, packet delivery rate, routing overhead, and delay compared to other approaches. However, throughput in ICW is about 3.9% lower than that in MWCRSF.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141325587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A lossless quantization approach for physical-layer key generation in vehicular ad hoc networks based on received signal strength","authors":"Ibraheem Abdelazeem ,&nbsp;Weibin Zhang ,&nbsp;Abdeldime Mohamedsalih ,&nbsp;Mohamed Abdalwohab ,&nbsp;Ahmedalmansour Abuobida","doi":"10.1016/j.vehcom.2024.100809","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100809","url":null,"abstract":"<div><p>Vehicular Ad Hoc Networks (VANETs) provide various benefits and play a crucial role in improving efficiency and ensuring human safety across different applications. However, these advantages also give rise to security challenges and privacy concerns, necessitating a thorough examination of security attacks. Current key generation schemes, particularly those based on the Physical-Layer Model (PLM), face limitations such as low key generation rates and inadequate randomness. This paper introduces an innovative key generation method that utilizes adaptive physical-layer techniques and lossless quantization. The method involves an eight-level quantization process, which enables precise granularity and adaptive selection of quantization thresholds to tailor the computation of Received Signal Strength (RSS) measurements to individual needs. The adaptive approach ensures the retention of information within RSS measurements, resulting in reduced bit disagreement rates and enhanced randomness of the generated keys. Simulated evaluations demonstrate the effectiveness of the proposed method, showing superior performance in terms of bit generation, entropy, and secrecy rates, while also minimizing the occurrence of unnecessary measurements. This advancement holds significant promise for strengthening the security framework within VANETs.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141303831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fully distributed multi-agent processing strategy applied to vehicular networks","authors":"Vladimir R. de Lima,&nbsp;Marcello L.R. de Campos","doi":"10.1016/j.vehcom.2024.100806","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100806","url":null,"abstract":"<div><p>This work explores distributed processing techniques, together with recent advances in multi-agent reinforcement learning (MARL) to implement a fully decentralized reward and decision-making scheme to efficiently allocate resources (spectrum and power). The method targets processes with strong dynamics and stringent requirements such as cellular vehicle-to-everything networks (C-V2X). In our approach, the C-V2X is seen as a strongly connected network of intelligent agents which adopt a distributed reward scheme in a cooperative and decentralized manner, taking into consideration their channel conditions and selected actions in order to achieve their goals cooperatively. The simulation results demonstrate the effectiveness of the developed algorithm, named Distributed Multi-Agent Reinforcement Learning (DMARL), achieving performances very close to that of a centralized reward design, with the advantage of not having the limitations and vulnerabilities inherent to a fully or partially centralized solution.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141303833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Cost-aware task offloading in vehicular edge computing: A Stackelberg game approach","authors":"Shujuan Wang,&nbsp;Dongxue He,&nbsp;Mulin Yang,&nbsp;Lin Duo","doi":"10.1016/j.vehcom.2024.100807","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100807","url":null,"abstract":"<div><p>With the popularity of vehicular communication systems and mobile edge vehicle networking, intelligent transportation applications arise in Internet of Vehicles (IoVs), which are latency-sensitive, computation-intensive, and requiring sufficient computing and communication resources. To satisfy the requirements of these applications, computation offloading emerges as a new paradigm to utilize idle resources on vehicles to cooperatively complete tasks. However, there exist several obstacles for realizing successful task offloading among vehicles. For one thing, extra cost such as communication overhead and energy consumption occurs when a task is offloaded on a service vehicle, it is unlikely to expect the service vehicle will contribute its resources without any reward. For another, since there are many vehicles around, both user vehicles and service vehicles are trying to strike a balance between cost and profit, through matching the perfect service/user vehicles and settled with optimal offloading plan that is beneficial to all parties. To solve these issues, this work focuses on the design of effective incentive mechanisms to stimulate vehicles with idle resources to actively participate in the offloading process. A fuzzy logic-based dynamic pricing strategy is proposed to accurately evaluate the cost of a vehicle for processing the task, which provides insightful guidance for finding the optimal offloading decision. Meanwhile, the competitive and cooperation relations among vehicles are thoroughly investigated and modeled as a two-stage Stackelberg game. Particularly, this work emphasizes the social attributes of vehicles and their effect on the offloading decision making process, multiple key properties such as the willingness of UV to undertake the task locally, the reputation of UV and the satisfaction of SV for the allocated task proportion, are carefully integrated in the design of the optimization problem. A distributed algorithm with applicable complexity is proposed to solve the problem and to find the optimal task offloading strategy. Extensive simulations are conducted on real-world scenarios and results show that the proposed mechanism achieves significant performance advantages in terms of vehicles' utilities, cost, completion delay under varied network and channel environment, which justifies the effectiveness and efficiency of this work.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141289992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Vehicular network anomaly detection based on 2-step deep learning framework","authors":"Nur Cahyono Kushardianto ,&nbsp;Soheyb Ribouh ,&nbsp;Yassin El Hillali ,&nbsp;Charles Tatkeu","doi":"10.1016/j.vehcom.2024.100802","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100802","url":null,"abstract":"<div><p>Intelligent Transportation System (ITS) is one of the newest technologies in the transportation sector that will give hope for better driving safety. Not only in terms of driving safety, but ITS will give also hope for driving comfort. Smart vehicles perchance better versatile to the street circumstances through trade data among vehicles. In case, they can maintain a strategic distance from activity blockage, perilous deterrents, or see activity mishaps prior. The innovation which is meticulously associated with the security of the driver must get extraordinary consideration. V2V-Vehicle-to-Vehicle connection can undermine impedance and indeed attack or anomaly. Many studies have been carried out to address this problem. The primary step is to reinforce the system's capacity to identify anomalies on Vehicular Network. Further, the growing development of machine learning seems to bring hope to support these steps. Within the proposed method, the original of our approach consists in utilizing 2-Step of anomaly detection. This framework is utilizing two classifiers machine learning from two altered preparing data-sets. We appear that the proposed method can make strides essentially attack detection achievement, compared to arrangements depending on a single detection step.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141314641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Discharging driven energy sharing protocol for V2V communication in vehicular energy networks","authors":"Qinghua Tang ,&nbsp;Demin Li ,&nbsp;Yihong Zhang ,&nbsp;Xuemin Chen","doi":"10.1016/j.vehcom.2024.100801","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100801","url":null,"abstract":"<div><p>With the growing concern over range anxiety among electric vehicle (EV) owners due to limited battery capacity and sparse charging infrastructure, EV-to-EV (V2V) energy sharing emerges as a crucial solution to extend driving range. Leveraging the vehicular energy network (VEN) enabled by dynamic wireless power transfer (DWPT) technology, energy sharing among EVs in motion becomes feasible. However, the effective establishment of communication and identification of suitable V2V energy sharing pairs pose significant challenges, particularly for EVs with discharging demands. To address this challenge, we propose a new discharging driven energy sharing protocol based on vehicular ad-hoc networks (VANETs). Firstly, we present a routing approach for transmitting discharging information through VANETs, considering key factors such as distance, state of charge, number of neighbor vehicles, and vehicle speed. This routing scheme facilitates efficient relay node selection on road segments and intersections, ensuring optimal communication paths. Subsequently, we formulate a charging requester selection model to identify the most suitable requester for energy sharing. This model optimizes individual utility while accounting for the state of charge of the requesters, ensuring a comprehensive and inclusive approach to V2V energy sharing. Finally, we develop an acknowledgment message transmission scheme to ensure the completion of selection acknowledgment between discharging EVs and charging EVs. This scheme includes provisions for recovery in case of forwarding link failures, ensuring robust communication in dynamic vehicular environments. Extensive simulations conducted using network simulator 2 (NS-2) demonstrate the superior performance of the proposed protocol in terms of packet delivery ratio, end-to-end delay, and overall V2V energy sharing efficiency.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141313120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An efficient heterogeneous online/offline anonymous certificateless signcryption with proxy re-encryption for Internet of Vehicles","authors":"Negalign Wake Hundera ,&nbsp;Muhammad Umar Aftab ,&nbsp;Dagmawit Mesfin ,&nbsp;Fatene Dioubi ,&nbsp;Huiying Xu ,&nbsp;Xinzhong Zhu","doi":"10.1016/j.vehcom.2024.100811","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100811","url":null,"abstract":"<div><p>In the Internet of Vehicles (IoV) domain, the collection of traffic data is executed by intelligent devices and stored within a cloud-assisted IoV system. However, ensuring confidentiality and authorized access to data are the main problems of data storage. To address these problems, this paper proposes an efficient heterogeneous online/offline certificateless signcryption with a proxy re-encryption scheme (HOOCLS-PRE). This scheme enables IoV nodes in a certificateless cryptosystem (CLC) environment to store encrypted IoV-related data in the cloud. When an authorized user from an identity-based cryptosystem (IBC) wishes to access the data, the IoV node delegates the task of re-encrypting the data to the cloud, and only an authorized user can decrypt the data and verify its integrity and authenticity. The cloud cannot obtain any plaintext details about the data. In the proposed scheme, the signcryption process is split into offline and online phases. Most heavy computations are conducted without knowledge of the message during the offline phase. Only light computations are performed in the online phase when a message is available. The scheme protects the privacy and anonymity of vehicles by preventing adversaries from linking vehicle identities and locations. Moreover, a formal security proof is provided in the random oracle model. Finally, the performance analysis reveals that HOOCLS-PRE outperforms existing relevant schemes. Hence, HOOCLS-PRE is ideal for cloud-assisted IoV environments.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":null,"pages":null},"PeriodicalIF":6.7,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141303832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}