IEEE Transactions on Mobile Computing最新文献_第2页

AdapLDP-FL: An Adaptive Local Differential Privacy for Federated Learning AdapLDP-FL：用于联邦学习的自适应局部差分隐私

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-23 DOI: 10.1109/TMC.2025.3533090

Gaofeng Yue;Li Yan;Liuwang Kang;Chao Shen

{"title":"AdapLDP-FL: An Adaptive Local Differential Privacy for Federated Learning","authors":"Gaofeng Yue;Li Yan;Liuwang Kang;Chao Shen","doi":"10.1109/TMC.2025.3533090","DOIUrl":"https://doi.org/10.1109/TMC.2025.3533090","url":null,"abstract":"Federated Learning (FL) is a technique that allows multiple participants to co-train machine learning models, while also enhancing privacy by avoiding the exposure of local data. However, it is important to note that despite its effectiveness, there is still a potential risk of leaking users’ private information through weight analysis during FL updates. Local Differential Privacy (LDP) is a technique used to prevent individual information leakage by adding noise to the user's model parameters. However, FL based on LDP lacks dynamic optimization and adaptation considering privacy and data utility, especially regarding noise constraints. This paper investigates FL under the scenario of noise optimization with LDP. Specifically, given a certain privacy budget, we design the adaptive LDP method via a noise scaler, which adaptively optimizes the noise size of every client. Second, we dynamically tailor the model direction after adding noise by the designed a direction matrix, to overcome the model drift problem caused by adding noises to the client model. Finally, our method achieves higher accuracy than some existing works with the same privacy level and the convergence speed is significantly improved.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5569-5583"},"PeriodicalIF":7.7,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929724","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}

引用次数: 0

Predicting Mobile App Usage With Context-Aware Dynamic Hypergraphs 使用上下文感知的动态超图预测移动应用的使用情况

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-23 DOI: 10.1109/TMC.2025.3532992

Zihan Huang;Tong Li;Xing Wang;Kexin Yang;Chao Deng;Junlan Feng;Yong Li

{"title":"Predicting Mobile App Usage With Context-Aware Dynamic Hypergraphs","authors":"Zihan Huang;Tong Li;Xing Wang;Kexin Yang;Chao Deng;Junlan Feng;Yong Li","doi":"10.1109/TMC.2025.3532992","DOIUrl":"https://doi.org/10.1109/TMC.2025.3532992","url":null,"abstract":"App usage prediction aims to predict the next app most likely to be used based on historical behaviors, which is beneficial for smartphone system optimization, such as system resource management, battery energy optimization, and user experience enhancement. Existing studies have treated it as a simple time series prediction problem and overlooked the sessionization characteristic of mobile app usage, i.e., neglecting the intent context in which the user interacts with apps. In this paper, we explore the context of user intents and incorporate app sessionization features into prediction models to improve prediction accuracy. Specifically, we first extract the semantic meaning of spatio-temporal contextual information of app usage by constructing an urban knowledge graph. Second, we devise a hypergraph-based embedding model to extract the hyper-relations of intra-session apps. Third, we utilize a self-attention mechanism to fuse intra-session apps’ representations and combine spatio-temporal contextual embedding to form the session representation. We further leverage a transformer for inter-session intent transition modeling to extract users’ dynamic intent (i.e., the semantic meaning of sessions) for app usage. Finally, we jointly fuse dynamic intent and recently used app features using the MLP model for the prediction. The novelty of our method is that we are the first to leverage dynamic hypergraphs for modeling sessionization features, and we model both inter-session and intra-session relations. We evaluate our model based on two real-world datasets collected in Shanghai and Nanchang. In terms of prediction accuracy, mean reciprocal rank, and normalized discounted cumulative gain, our proposed framework outperforms state-of-the-art baselines by more than 30% in the Shanghai dataset and 20% in the Nanchang dataset, respectively.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5511-5524"},"PeriodicalIF":7.7,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929748","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}

引用次数: 0

ESPD-LP: Edge Service Pre-Deployment Based on Location Prediction in MEC 基于位置预测的MEC边缘服务预部署

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-23 DOI: 10.1109/TMC.2025.3533005

Liangjun Song;Gang Sun;Hongfang Yu;Dusit Niyato

{"title":"ESPD-LP: Edge Service Pre-Deployment Based on Location Prediction in MEC","authors":"Liangjun Song;Gang Sun;Hongfang Yu;Dusit Niyato","doi":"10.1109/TMC.2025.3533005","DOIUrl":"https://doi.org/10.1109/TMC.2025.3533005","url":null,"abstract":"The rise of real-time applications, services has made Multi-access Edge Computing (MEC) essential for delivering low-latency, high-performance computing. The effectiveness of MEC, however, is largely contingent on the efficient pre-deployment of services. Despite its importance, efficient service pre-deployment is challenged by the inherent unpredictability of user mobility, the fluctuating conditions of network environments. Accurately predicting user locations, dynamically optimizing resource allocation across geographically distributed MEC servers are complex tasks that are essential to minimizing latency, maximizing data transmission efficiency. The variability in user movement patterns, network bandwidth further exacerbates these challenges, often leading to increased latency, diminished performance, which can negate the advantages offered by MEC. To address these challenges, this paper introduces a novel edge service pre-deployment scheme based on location prediction (ESPD-LP). The ESPD-LP scheme leverages historical user trajectory data to predict future locations, facilitating proactive, strategic resource allocation via a user-centric bidirectional matching algorithm across multiple MEC servers. By pre-deploying services in anticipation of user needs, this approach optimizes data transmission rates, reduces pre-deployment latency, significantly enhancing the overall performance of MEC systems. A comprehensive analysis reveals that the ESPD-LP scheme consistently outperforms similar approaches, with a 41% increase in data transmission rates, a 31% reduction in pre-deployment latency compared to the JO-CDSD, MEC-RDESN schemes, demonstrating consistently superior performance.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5551-5568"},"PeriodicalIF":7.7,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929765","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}

引用次数: 0

Task Offloading in Internet of Vehicles: A DRL-Based Approach With Representation Learning for DAG Scheduling 车联网任务分流：基于drl的DAG调度表示学习方法

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-21 DOI: 10.1109/TMC.2025.3531887

Xiaoheng Deng;Haoyu Yang;Jingjing Zhang;Jinsong Gui;Siyu Lin;Xin Wang;Geyong Min

引用次数: 0

Service Function Chain Deployment With Intrinsic Dynamic Defense Capability 具有内在动态防御能力的业务功能链部署

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-21 DOI: 10.1109/TMC.2025.3532210

Ran Wang;Lundan Cai;Qiang Wu;Dusit Niyato

{"title":"Service Function Chain Deployment With Intrinsic Dynamic Defense Capability","authors":"Ran Wang;Lundan Cai;Qiang Wu;Dusit Niyato","doi":"10.1109/TMC.2025.3532210","DOIUrl":"https://doi.org/10.1109/TMC.2025.3532210","url":null,"abstract":"The Service Function Chain (SFC) leverages Network Function Virtualization (NFV) and Software-Defined Networking (SDN) for flexible deployment, creating customized service chains tailored to specific applications. As NFV and SDN technologies play crucial roles in the SFC implementation, any security risk that arises in an NFV/SDN network can potentially pose a threat to SFC. Thus, SFC becomes vulnerable to network security attacks. To address this, intrinsic security technologies, including moving target defense and mimic defense, offer proactive protection against both known and unknown threats. It is expected to break through traditional security protection mechanisms such as “enhanced”, “plug-in” and “passive” defense. This paper proposes an intrinsic dynamic defense architecture to equip SFC with active defense capabilities, shifting from passive reactive mechanism based on prior knowledge to an active defense against various attacks. The architecture comprises two models and five modules, including a sub-pool partitioning algorithm that enhances heterogeneity across sub-pools by splitting the heterogeneous replica pool into several sub-pools among replica VNFs. To meet Quality of Service (QoS) requirements like latency, cost, and security, we formulate a multi-objective optimization problem with three objectives: latency, cost, and defense success rate. Following that, we propose a dynamic Deep Reinforcement Learning (DRL)-based deployment algorithm. This algorithm selects appropriate VNFs based on heterogeneity and historical information, improving SFC and VNF security against external attacks. Extensive experiments validate that our architecture significantly enhances network security, provided that this improvement comes at the expense of limited cost and latency.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5418-5432"},"PeriodicalIF":7.7,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929764","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}

引用次数: 0

Real-Time Cross-Domain Gesture and User Identification via COTS WiFi 基于COTS WiFi的实时跨域手势和用户识别

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-21 DOI: 10.1109/TMC.2025.3532295

Chenhong Cao;Yue Ding;Miaoling Dai;Wei Gong;Xibin Zhao

{"title":"Real-Time Cross-Domain Gesture and User Identification via COTS WiFi","authors":"Chenhong Cao;Yue Ding;Miaoling Dai;Wei Gong;Xibin Zhao","doi":"10.1109/TMC.2025.3532295","DOIUrl":"https://doi.org/10.1109/TMC.2025.3532295","url":null,"abstract":"WiFi-based gesture recognition has emerged as a promising alternative to computer vision, enabling seamless integration and enhanced interaction in human-computer interaction systems. Simultaneously identifying users during gesture recognition is vital for improving security and personalization. However, existing WiFi-based dual-task recognition approaches often rely on handcrafted features, which hinder precision and introduce delays in cross-domain scenarios. To address these challenges, we propose WiDual, a real-time system for cross-domain gesture recognition and user identification using WiFi signals. By integrating spatial and channel attention mechanisms, WiDual adaptively extracts crucial features for dual-task recognition. The system employs Channel State Information (CSI) visualization to convert WiFi signals into images, facilitating efficient feature extraction and minimizing information loss and latency. Furthermore, a collaborative module fuses gesture and user identity features, enhancing recognition performance. Experimental evaluations on a public dataset with six gestures and six users across diverse environments demonstrate WiDual's effectiveness. It achieves 96% accuracy in cross-domain gesture recognition and 91.27% in user identification. Compared to state-of-the-art methods, WiDual improves user identification accuracy by 26%, gesture recognition by 8%, and reduces processing time sixfold, showcasing its potential for real-time applications.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5124-5137"},"PeriodicalIF":7.7,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918803","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}

引用次数: 0

Online Energy and Interference Management for Dynamic Target Tracking With Cellular-Connected UAV 蜂窝互联无人机动态目标跟踪的在线能量与干扰管理

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-21 DOI: 10.1109/TMC.2025.3532276

Cheng Zhan;Huan Yan;Rongfei Fan;Han Hu;Shubin Xu;Jian Yang

{"title":"Online Energy and Interference Management for Dynamic Target Tracking With Cellular-Connected UAV","authors":"Cheng Zhan;Huan Yan;Rongfei Fan;Han Hu;Shubin Xu;Jian Yang","doi":"10.1109/TMC.2025.3532276","DOIUrl":"https://doi.org/10.1109/TMC.2025.3532276","url":null,"abstract":"Cellular-connected Unmanned Aerial Vehicles (UAVs) have significant potential for target tracking in future cellular networks due to their broad coverage and operational flexibility. In this paper, we consider a multi-cell cellular network with a cellular-connected UAV for target tracking, which encounters challenges such as unpredictable flight energy consumption from the stochastic movements of the tracking target and severe uplink interference from ground devices (GDs). To tackle these challenges, we propose a multi-stage stochastic optimization framework focused on energy-efficient target tracking with interference coordination. Our objective is to optimize the long-term average uplink throughput of both aerial users and GDs by jointly optimizing the UAV's trajectory, power allocation, and cell association across multiple orthogonal communication resource blocks (RBs). The formulated stochastic non-convex problem is first transformed into a deterministic problem for each time slot by using the Lyapunov optimization framework. An online optimization strategy is proposed, utilizing the optimal structure, alternative optimization, and successive convex approximation (SCA) techniques. Simulation results show that the proposed approach significantly enhances network throughput and UAV energy queue stability compared to existing baseline schemes.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5496-5510"},"PeriodicalIF":7.7,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929780","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}

引用次数: 0

Hybrid Transformer Based Multi-Agent Reinforcement Learning for Multiple Unpiloted Aerial Vehicle Coordination in Air Corridors 基于混合变压器的多智能体强化学习的空中走廊多无人机协调

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-21 DOI: 10.1109/TMC.2025.3532204

Liangkun Yu;Zhirun Li;Nirwan Ansari;Xiang Sun

{"title":"Hybrid Transformer Based Multi-Agent Reinforcement Learning for Multiple Unpiloted Aerial Vehicle Coordination in Air Corridors","authors":"Liangkun Yu;Zhirun Li;Nirwan Ansari;Xiang Sun","doi":"10.1109/TMC.2025.3532204","DOIUrl":"https://doi.org/10.1109/TMC.2025.3532204","url":null,"abstract":"Advanced Air Mobility (AAM) seeks to establish a next-generation air transportation system by leveraging autonomous unpiloted aerial vehicles (UAVs) to transport passengers and cargo between locations previously underserved or unserved by traditional aviation. Achieving AAM at scale requires overcoming significant challenges in airspace management, classification, and traffic control to safely accommodate the increasing volume of UAV operations. This paper presents a comprehensive design for air corridors to facilitate efficient aerial transport and formulates a multi-UAV coordination problem within these corridors. The objective is to enable each UAV to autonomously make control decisions based on local observations gathered from onboard sensors. This decentralized control approach is modeled as a multi-agent partially observable Markov decision process (POMDP), aiming at minimizing UAV travel time while ensuring adherence to corridor boundaries and collision avoidance. To address the complexities posed by varying state dimensions and types, we propose a novel Hybrid Transformer-based Multi-agent Reinforcement Learning (HTransRL) architecture. HTransRL integrates a customized transformer model into an actor-critic network, effectively processing both sequential and non-sequential observed states of varying sizes while capturing their correlations. This enables safe and efficient UAV navigation. Simulation results show that in test environments similar to or simpler than training scenarios, HTransRL achieves a successful arrival rate exceeding 90% in worst-case test scenarios. In test environments more complex than training scenarios, HTransRL demonstrates superior scalability compared to two baseline methods, achieving higher arrival rates and comparable travel times.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5482-5495"},"PeriodicalIF":7.7,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929726","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}

引用次数: 0

Causal Analysis and Risk Assessment for Batch Crowdsourcing 批量众包的原因分析与风险评估

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-21 DOI: 10.1109/TMC.2025.3532285

Ke Chao;Shengling Wang;Hongwei Shi;Jianhui Huang;Xiuzhen Cheng

{"title":"Causal Analysis and Risk Assessment for Batch Crowdsourcing","authors":"Ke Chao;Shengling Wang;Hongwei Shi;Jianhui Huang;Xiuzhen Cheng","doi":"10.1109/TMC.2025.3532285","DOIUrl":"https://doi.org/10.1109/TMC.2025.3532285","url":null,"abstract":"The way of task posting serves as the main pillar in achieving an efficient crowdsourcing market. Pioneer solutions on task posting can be categorized as retail task posting and batch task posting. Unlike retail task posting, which simply matches the most suitable worker to tasks, batch task posting considers the collaborations not only between workers and tasks but also among tasks, which brings high efficiency, low costs, and satisfactory task completion rates. However, the state of the arts on batch task posting leverage specific attributes to combine tasks as bundles for posting, leading to limited scalability. Hence, we propose a causal analysis framework for batch crowdsourcing to achieve an attribute-independent batch crowdsourcing solution that disentangles multi-factors to uncover the posting merits of tasks bundled at optimal prices, based on which an approximately optimal algorithm is further introduced to form reasonable bundles for posting. Since batch crowdsourcing may incur losses due to short-term profit fluctuation, a risk assessment method is proposed to encourage the requestor to act properly for loss mitigations. Our work explores the causal analysis and risk assessment in batch crowdsourcing for the first time, with the following highlights: 1) <italic>generality. It proposes a composite metric for gauging task bundles which avoids the issue of attribute dependence in the state of the arts, resulting in better universality; 2) <italic>synergy. By collaboratively considering the “value” and “relative position” of variables, our work derives results reflecting causal relationships rather than naive correlations; and 3) <italic>precision. We not only elucidate the probability of risk in batch crowdsourcing but also delineate the rate function governing its probability decay. This allows a requestor to know when and how fast to halt batch task posting.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5312-5323"},"PeriodicalIF":7.7,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918681","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}

引用次数: 0

Cost-Effective Edge Data Caching With Failure Tolerance and Popularity Awareness 具有容错和流行意识的经济有效的边缘数据缓存

IF 7.7 2区计算机科学

IEEE Transactions on Mobile Computing Pub Date : 2025-01-20 DOI: 10.1109/TMC.2025.3531967

Ruikun Luo;Zujia Zhang;Qiang He;Mengxi Xu;Feifei Chen;Xiaohai Dai;Song Wu;Hai Jin

{"title":"Cost-Effective Edge Data Caching With Failure Tolerance and Popularity Awareness","authors":"Ruikun Luo;Zujia Zhang;Qiang He;Mengxi Xu;Feifei Chen;Xiaohai Dai;Song Wu;Hai Jin","doi":"10.1109/TMC.2025.3531967","DOIUrl":"https://doi.org/10.1109/TMC.2025.3531967","url":null,"abstract":"In the mobile edge computing environment, caching data in edge storage systems can significantly reduce data retrieval latency for users while saving the costs incurred by cloud-edge data transmissions for app vendors. Existing <italic>edge data caching (EDC) methods prioritize popular data and aim to minimize users’ data retrieval latency and system storage costs jointly. However, these EDC methods often rely on the assumption that data popularity always follows certain distributions. As a result, they cannot properly adapt to the fluctuations in data popularity due to user mobility or unexpected increases in user demands. Meanwhile, unlike cloud data centers, complex and fragile edge servers are more likely to experience physical failures or network outages, presenting new challenges for EDC strategies. Specifically, when an edge server fails or experiences an outage, cached data may become temporarily unavailable, leading to increased latency as requests are redirected to alternative servers or the cloud. In this paper, to enable <italic>uncertainty-aware edge data caching (uEDC), we first model the problem as a robust optimization problem and propose an optimal algorithm named uEDC-B to find the optimal uEDC solution. To address the high computational complexity of uEDC-B, we introduce an approximate algorithm named uEDC-L based on linear decision rules. Theoretical analysis and extensive experiments on a real-world dataset demonstrate that the proposed methods outperform two state-of-the-art approaches in handling the uncertainties in data popularity and edge server failure with a significant performance improvement of 59.27% in data retrieval latency and 55.07% in data caching cost.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 6","pages":"5357-5369"},"PeriodicalIF":7.7,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10847869","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918776","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