Journal of Network and Computer Applications最新文献

筛选
英文 中文
C-PFL: A committee-based personalized federated learning framework C-PFL:基于委员会的个性化联邦学习框架
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-16 DOI: 10.1016/j.jnca.2025.104327
Lifan Pan , Hao Guo , Wanxin Li
{"title":"C-PFL: A committee-based personalized federated learning framework","authors":"Lifan Pan ,&nbsp;Hao Guo ,&nbsp;Wanxin Li","doi":"10.1016/j.jnca.2025.104327","DOIUrl":"10.1016/j.jnca.2025.104327","url":null,"abstract":"<div><div>Federated Learning (FL) is an emerging machine learning paradigm that enables multiple parties to train a shared model while preserving data privacy collaboratively. However, malicious clients pose a significant threat to FL systems. This interference not only deteriorates model performance but also exacerbates the unfairness of the global model caused by data heterogeneity, leading to inconsistent performance across clients. We propose C-PFL, a committee-based personalized FL framework that improves both robustness and personalization. In contrast to prior approaches such as FedProto (which relies on the exchange of class prototypes), Ditto (which employs regularization between global and local models), and FedBABU (which freezes the classifier head during federated training), C-PFL introduces two principal innovations. C-PFL adopts a split-model design, updating only a shared backbone during global training while fine-tuning a personalized head locally. A dynamic committee of high-contribution clients validates submitted updates without public data, filtering low-quality or adversarial contributions before aggregation. Experiments on MNIST, Fashion-MNIST, CIFAR-10, CIFAR-100, and AGNews show that C-PFL outperforms six state-of-the-art personalized FL baselines by up to 2.89% in non-adversarial settings, and by as much as 6.96% under 40% malicious clients. These results demonstrate C-PFL’s ability to sustain high accuracy and stability across diverse non-IID scenarios, even with significant adversarial participation.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104327"},"PeriodicalIF":8.0,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145094150","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 connectivity-oriented efficient shielding for robustness enhancement in large-scale networks 面向混合连接的大规模网络鲁棒性增强有效屏蔽
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-14 DOI: 10.1016/j.jnca.2025.104325
Wei Wei , Jie Huang , Qinghui Zhang , Tao Ma , Peng Li
{"title":"Hybrid connectivity-oriented efficient shielding for robustness enhancement in large-scale networks","authors":"Wei Wei ,&nbsp;Jie Huang ,&nbsp;Qinghui Zhang ,&nbsp;Tao Ma ,&nbsp;Peng Li","doi":"10.1016/j.jnca.2025.104325","DOIUrl":"10.1016/j.jnca.2025.104325","url":null,"abstract":"<div><div>Network infrastructure protection is critical for ensuring robustness against attacks and failures, yet existing approaches fundamentally limit their scope by addressing either node or edge vulnerabilities in isolation — an unrealistic assumption given real-world scenarios where both element types may fail simultaneously. Our work makes three key advances beyond current state-of-the-art: First, we introduce the novel concept of hybrid connectivity as a unified robustness metric that properly accounts for concurrent node-edge failures, demonstrating through theoretical analysis that traditional single-element metrics require prohibitively high connectivity thresholds. Second, we develop the first practical solution for large-scale networks via our hybrid cut-tree mapping algorithm, which employs an extended node cut formulation with dynamic programming to identify all vulnerable node-edge combinations in linear time — a dramatic complexity reduction from the exponential scaling of existing linear programming methods. Third, we prove and exploit a fundamental structural property that shielding any edge spanning tree plus leaf edges guarantees target hybrid connectivity, enabling our edge spanning tree algorithm to deliver near-optimal solutions at unprecedented scale. Experimental validation confirms our approach maintains 100% protection effectiveness (with no more than 6% cost overhead versus optimal) in small graphs while achieving 99.9% protection coverage in large-scale networks — outperforming all existing heuristics in protection cost while providing a <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>5</mn></mrow></msup></mrow></math></span> times speedup over traditional methods.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104325"},"PeriodicalIF":8.0,"publicationDate":"2025-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145093955","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
5G slicing under the hood: An in-depth analysis of 5G RAN features and configurations 5G切片:5G RAN特性和配置的深入分析
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-13 DOI: 10.1016/j.jnca.2025.104298
André Perdigão, José Quevedo, Rui L. Aguiar
{"title":"5G slicing under the hood: An in-depth analysis of 5G RAN features and configurations","authors":"André Perdigão,&nbsp;José Quevedo,&nbsp;Rui L. Aguiar","doi":"10.1016/j.jnca.2025.104298","DOIUrl":"10.1016/j.jnca.2025.104298","url":null,"abstract":"<div><div>There has been extensive discussion on the benefits and improvements that 5G networks can bring to industry operations, particularly with network slicing. However, to fully realize network slices, it is essential to thoroughly understand the mechanisms available within a 5G network that can be used to adapt network performance. This paper surveys and describes existing 5G network configurations and assesses the performance impact of several configurations using a real-world commercial standalone (SA) 5G network, bringing the challenges between purely theoretical mathematical models into realizations with existing equipment. The paper discusses how these features impact communication performance according to industrial requirements.</div><div>The survey describes and demonstrates the performance impact of various 5G configurations, enabling readers to understand the capabilities of current 5G networks and learn how to leverage 5G technology to enhance industrial operations. This knowledge is also crucial to fully realize network slices tailored to industrial requirements.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104298"},"PeriodicalIF":8.0,"publicationDate":"2025-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145059766","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
Reinforcement learning based mobile charging sequence scheduling algorithm for optimal stochastic event detection in wireless rechargeable sensor networks 基于强化学习的无线可充电传感器网络随机事件最优检测移动充电序列调度算法
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-13 DOI: 10.1016/j.jnca.2025.104301
Jinglin Li , Haoran Wang , Sen Zhang , Peng-Yong Kong , Wendong Xiao
{"title":"Reinforcement learning based mobile charging sequence scheduling algorithm for optimal stochastic event detection in wireless rechargeable sensor networks","authors":"Jinglin Li ,&nbsp;Haoran Wang ,&nbsp;Sen Zhang ,&nbsp;Peng-Yong Kong ,&nbsp;Wendong Xiao","doi":"10.1016/j.jnca.2025.104301","DOIUrl":"10.1016/j.jnca.2025.104301","url":null,"abstract":"<div><div>Mobile charging provides a new way for energy replenishment in Wireless Rechargeable Sensor Network (WRSN), where the Mobile Charger (MC) is employed for charging sensor nodes sequentially according to the mobile charging sequence scheduling result. Event detection is an essential application of WRSN, but when the events occur stochastically, Mobile Charging Sequence Scheduling for Optimal Stochastic Event Detection (MCSS-OSED) is difficult and challenging, and the non-deterministic detection property of the sensor makes MCSS-OSED complicated further. This paper proposes a novel Multistage Exploration Q-learning Algorithm (MEQA) for MCSS-OSED based on reinforcement learning. In MEQA, MC is taken as the agent to explore the space of the mobile charging sequences via the interactions with the environment for the optimal Quality of Event Detection (QED) evaluated by both considering the sensing probability of the sensor and the probability that events may occur in the monitoring region. Particularly, a new multistage exploration policy is designed for MC to improve the exploration efficiency by selecting the current suboptimal actions with a certain probability, and a novel reward function is presented to evaluate the MC charging action according to the real-time detection contribution of the sensor. Simulation results show that MEQA is efficient for MCSS-OSED and superior to the existing classical algorithms.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104301"},"PeriodicalIF":8.0,"publicationDate":"2025-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145120317","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
RoamML distributed continual learning: Adaptive and flexible data-driven response for disaster recovery operations RoamML分布式持续学习:用于灾难恢复操作的自适应和灵活的数据驱动响应
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-09 DOI: 10.1016/j.jnca.2025.104322
Simon Dahdal , Sara Cavicchi , Alessandro Gilli , Filippo Poltronieri , Mauro Tortonesi , Niranjan Suri , Cesare Stefanelli
{"title":"RoamML distributed continual learning: Adaptive and flexible data-driven response for disaster recovery operations","authors":"Simon Dahdal ,&nbsp;Sara Cavicchi ,&nbsp;Alessandro Gilli ,&nbsp;Filippo Poltronieri ,&nbsp;Mauro Tortonesi ,&nbsp;Niranjan Suri ,&nbsp;Cesare Stefanelli","doi":"10.1016/j.jnca.2025.104322","DOIUrl":"10.1016/j.jnca.2025.104322","url":null,"abstract":"<div><div>In the aftermath of natural disasters, Human Assistance &amp; Disaster Recovery (HADR) operations have to deal with disrupted communication networks and constrained resources. Such harsh conditions make high-communication-overhead ML approaches — either centralized or distributed — impractical, thus hindering the adoption of AI solutions to implement a critical function for HADR operations: building accurate and up-to-date situational awareness. To address this issue we developed Roaming Machine Learning (RoamML), a novel Distributed Continual Learning Framework designed for HADR operations and based on the premise that moving an ML model is more efficient and robust than either large dataset transfers or frequent model parameter updates. RoamML deploys a mobile AI agent that incrementally train models across network nodes containing yet unprocessed data; at each stop, the agent initiate a local training phase to update its internal ML model parameters. To prioritize the processing of strategically valuable data, RoamML Agents follow a navigation system based upon the concept of Data Gravity, leveraging Multi-Criteria Decision Making techniques to simultaneously consider many objectives for Agent routing optimization, including model learning efficiency and network resource utilization, while seamlessly blending subjective insights from expert judgments with objective metrics derived from quantifiable data to determine each next hop. We conducted extensive experiments to evaluate RoamML, demonstrating the framework’s efficiency to train ML models under highly dynamic, resource-constrained environments. RoamML achieves similar performance to centralized ML training under ideal network conditions and outperforms it in a more realistic scenario with reduced network resources, ultimately saving up to 75% in bandwidth utilization across all experiments.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104322"},"PeriodicalIF":8.0,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049037","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
Spectrum allocation method for millimeter-wave train-ground communication in high-speed rail based on multi-agent attention 基于多智能体关注的高速铁路毫米波车地通信频谱分配方法
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-08 DOI: 10.1016/j.jnca.2025.104293
Yong Chen, Jiaojiao Yuan, Huaju Liu, Zhaofeng Xin
{"title":"Spectrum allocation method for millimeter-wave train-ground communication in high-speed rail based on multi-agent attention","authors":"Yong Chen,&nbsp;Jiaojiao Yuan,&nbsp;Huaju Liu,&nbsp;Zhaofeng Xin","doi":"10.1016/j.jnca.2025.104293","DOIUrl":"10.1016/j.jnca.2025.104293","url":null,"abstract":"<div><div>With the advancement of high-speed railways toward intelligent systems, a large number of IoT devices have been deployed in both onboard and trackside systems. The resulting surge in data transmission has intensified competition for spectrum resources, thereby significantly increasing the demand for train-ground communication systems with high capacity, low latency, and strong interference resilience.The millimeter wave (mmWave) frequency band provides a large bandwidth to support massive data transmission from IoT devices. Aiming at addressing the issues of low network capacity, high interference, and low spectral efficiency in mmWave train-ground communication systems under 5G-R for high-speed railways, we propose a multi-agent attention mechanism for mmWave spectrum allocation in train-ground communication. First, we analyzed the spectrum requirements of mmWave BS and onboard MRS, constructed a spectrum resource allocation model with the optimization objective of maximizing system network capacity, and transformed it into a Markov decision process (MDP) model. Next, considering the need for coordinated spectrum allocation and interference suppression between mmWave BS and MRS, we develop a resource optimization strategy using the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm. Specifically, we combine multi head attention mechanism to improve the Critic network of MADDPG algorithm. This enhancement enables coordinated global–local strategy optimization through attention weight computation, thereby improving decision-making efficiency. Simulation results demonstrate that compared to existing methods, our algorithm achieves superior spectrum allocation performance, significantly increases network capacity while reducing interference levels, and meets the spectrum requirements of HSR communication systems.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104293"},"PeriodicalIF":8.0,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049036","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
Energy-efficient optimal relay design for wireless sensor network in underground mines 矿井无线传感器网络节能优化中继设计
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-06 DOI: 10.1016/j.jnca.2025.104303
Md Zahangir Alam , Mohamed Lassaad Ammari , Abbas Jamalipour , Paul Fortier
{"title":"Energy-efficient optimal relay design for wireless sensor network in underground mines","authors":"Md Zahangir Alam ,&nbsp;Mohamed Lassaad Ammari ,&nbsp;Abbas Jamalipour ,&nbsp;Paul Fortier","doi":"10.1016/j.jnca.2025.104303","DOIUrl":"10.1016/j.jnca.2025.104303","url":null,"abstract":"<div><div>The transceiver design for multi-hop multiple-input multiple-output (MIMO) relay is very challenging, and for a large scale network, it is not economical to send the signal through all possible links. Instead, we can find the best path from source-to-destination that gives the highest end-to-end signal-to-noise ratio (SNR). In this paper, we provide a linear minimum mean squared error (MMSE) based multi-hop multi-terminal MIMO non-regenerative half-duplex amplify-and-forward (AF) parallel relay design for a wireless sensor network (WSN) in an underground mines. The transceiver design of such a network becomes very complex. We can simplify a complex multi-terminal parallel relay system into a series of links using selection relaying, where transmission from the source to the relay, relay to relay, and finally relay to the destination will take place using the best relay that provides the best link performance among others. The best relay selection using the traditional technique in our case is not easy, and we need a strategy to find the best path from a large number of hidden paths. We first find the set of simplified series multi-hop MIMO best relays from source to destination using the optimum path selection technique found in the literature. Then we develop a joint optimum design of the source precoder, the relay amplifier, and the receiver matrices using the full channel diagonalizing technique followed by the Lagrange strong duality principle with known channel state information (CSI). Finally, simulation results show an excellent agreement with numerical analysis demonstrating the effectiveness of the proposed framework.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104303"},"PeriodicalIF":8.0,"publicationDate":"2025-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049249","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
From cloud to edge: dynamic placement optimization of business processes in IIoT networks 从云端到边缘:工业物联网网络中业务流程的动态布局优化
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-02 DOI: 10.1016/j.jnca.2025.104317
Md Razon Hossain , Alistair Barros , Colin Fidge
{"title":"From cloud to edge: dynamic placement optimization of business processes in IIoT networks","authors":"Md Razon Hossain ,&nbsp;Alistair Barros ,&nbsp;Colin Fidge","doi":"10.1016/j.jnca.2025.104317","DOIUrl":"10.1016/j.jnca.2025.104317","url":null,"abstract":"<div><div>Breakthroughs in edge computing offer new prospects for businesses to extend Industrial Internet of Things (IIoT) networks beyond analytics to actionable processing. In particular, cloud-based business processes, which provide administrative actions and rules through workflow-sequenced activities, can be streamlined on the edge for low-latency access in physical spaces. Although this advances business controls, particularly for critical events of industrial applications, it faces operational barriers. Edge devices, which support high volume and competing demands from a large number of sensors, vary in capacity, reliability, and proximity to sensors and cloud gateways. This warrants a highly efficient placement of process activities, from cloud to edge, given a variety of constraints, including resource demand, capacity, and compatibility, to satisfy timeliness constraints. In contrast to the related IIoT optimization research underway, including those of singleton service placements, business processes pose new challenges. Not only do sets of dependent activities have to be considered for co-deployment, but the meaning of timing constraints needs to be respected, given alternative, parallel, and iterative control-flow paths in processes. In addition, instantiation (replication) to scale activities for increasing data volumes poses further deployment constraints, i.e., on sets of nodes supporting dynamic instantiation of order-dependent activities. Here we present an optimization strategy for business processes that addresses these challenges. We first conceptualize processes in coherent fragments to precisely derive both responsiveness and throughput execution time heuristics and formulate a multi-objective process placement problem. Next, we develop a genetic algorithm-based process placement procedure. To adapt to fluctuating event frequencies, we support an interplay between scaling algorithms for service instances and process placement optimization. Validation through an industrial safety monitoring use case drawn from the construction industry shows that our approach improves timeliness responses by almost one-third and more than doubles execution throughput compared to existing methods.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104317"},"PeriodicalIF":8.0,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145009289","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
NoRDEx: A decentralized optimistic non-repudiation protocol for data exchanges NoRDEx:用于数据交换的去中心化乐观不可否认协议
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-02 DOI: 10.1016/j.jnca.2025.104291
Fernando Román-García, Juan Hernández-Serrano, Oscar Esparza
{"title":"NoRDEx: A decentralized optimistic non-repudiation protocol for data exchanges","authors":"Fernando Román-García,&nbsp;Juan Hernández-Serrano,&nbsp;Oscar Esparza","doi":"10.1016/j.jnca.2025.104291","DOIUrl":"10.1016/j.jnca.2025.104291","url":null,"abstract":"<div><div>This article introduces the Non-Repudiable Data Exchange (NoRDEx) protocol, designed to ensure non-repudiation in data exchanges. Unlike traditional non-repudiation and fair exchange protocols, NoRDEx can be considered decentralized as it eliminates the need for a centralized Trusted Third Party (TTP) by using a Distributed Ledger Technology (DLT) to store cryptographic proofs without revealing the exchanged message. NoRDEx is an optimistic non-repudiation protocol, as it only uses the DLT in case of a dispute. The protocol has been implemented and tested in real-world environments, with performance assessments covering cost, overhead, and execution time. A formal security analysis using the Syverson Van Oorschot (SVO) logical model demonstrates NoRDEx’s ability to resolve disputes securely.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104291"},"PeriodicalIF":8.0,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145059796","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
A realistic trust model evaluation platform for the Social Internet of Things (REACT-SIoT) 面向社会物联网的现实信任模型评估平台
IF 8 2区 计算机科学
Journal of Network and Computer Applications Pub Date : 2025-09-02 DOI: 10.1016/j.jnca.2025.104302
Marius Becherer , Omar K. Hussain , Frank den Hartog , Yu Zhang , Michael Zipperle
{"title":"A realistic trust model evaluation platform for the Social Internet of Things (REACT-SIoT)","authors":"Marius Becherer ,&nbsp;Omar K. Hussain ,&nbsp;Frank den Hartog ,&nbsp;Yu Zhang ,&nbsp;Michael Zipperle","doi":"10.1016/j.jnca.2025.104302","DOIUrl":"10.1016/j.jnca.2025.104302","url":null,"abstract":"<div><div>The Social Internet of Things (SIoT) enables cross-organisational collaboration for various industrial applications. However, evaluating trust models within such environments remains challenging due to context-dependent dynamics in SIoT environments. Existing evaluation platforms often rely on overly domain-specific or generic datasets, overlooking the inherent uncertainty and dynamicity of real-world SIoT settings. Additionally, there is a lack of practical platforms to assess the feasibility and effectiveness of trust models across diverse scenarios. In this study, we present the Realistic Trust Model Evaluation Platform for the Social Internet of Things (REACT-SIoT) to rigorously assess trust models in SIoT environments, thereby facilitating trustworthy collaboration for sustainable IoT transformations. REACT-SIoT addresses 21 identified requirements essential for simulating a realistic SIoT environment, including categories of heterogeneity, dynamicity, incompleteness, uncertainty, interdependency, and authentic real-world dynamics. We developed a configurable evaluation procedure that mitigates dataset bias and supports the assessment of both existing and newly developed trust models under various scenario-dependent settings. A real-world example demonstrates the platform’s capability to satisfy these requirements effectively. Our analysis reveals that REACT-SIoT meets all defined requirements and outperforms existing evaluation environments based on accuracy, trust convergence, and robustness criteria. The platform has been successfully applied to existing trust models, showcasing its applicability and enabling comparative assessments that were previously constrained by disparate evaluation settings and datasets. In conclusion, REACT-SIoT offers a highly- adaptable evaluation framework that ensures unbiased and comprehensive trust model assessments in SIoT environments. This platform bridges a critical gap in trust evaluation research, enabling the comparison and validation of trust models across diverse, realistic scenarios, thereby supporting the development of more resilient and trustworthy collaborative SIoT systems.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"243 ","pages":"Article 104302"},"PeriodicalIF":8.0,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145007485","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
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学术文献互助群
群 号:604180095
Book学术官方微信