Computer Networks最新文献

{"title":"Privacy-preserving worker recruitment scheme with MAB and reverse auction in crowdsensing to improve truth discovery performance","authors":"Yanming Fu ,&nbsp;Linfeng Peng ,&nbsp;Ruikang Guo ,&nbsp;Xian Zhang ,&nbsp;Lin Li ,&nbsp;Wei Wei","doi":"10.1016/j.comnet.2025.111526","DOIUrl":"10.1016/j.comnet.2025.111526","url":null,"abstract":"<div><div>Mobile Crowdsensing (MCS) is an emerging sensing paradigm that utilizes mobile devices to collect data, where an MCS platform recruits workers to perform data collection tasks. In practice, truth discovery is commonly employed to aggregate sensing data from multiple workers to obtain accurate results. However, existing studies often overlook critical conditions including dynamic worker participation, budget constraints, unknown prior sensing quality, and unknown sensing costs. Moreover, since MCS tasks are typically location-dependent, matching nearby workers while protecting their location privacy remains a significant challenge. To address these challenges, this paper proposes a worker <strong>r</strong>ecruitment <strong>s</strong>cheme (RS-MABRA) based on Multi-Armed Bandit (<strong>MAB</strong>) and <strong>r</strong>everse <strong>a</strong>uction with location privacy protection. The scheme achieves privacy-preserving task matching through homomorphic encryption technology. Furthermore, inspired by the Upper Confidence Bound (UCB) principle in MAB algorithms, we design a <strong>d</strong>ynamic <strong>UCB</strong> recruitment algorithm with a <strong>l</strong>imited number of recruitments (DUCB-L). By integrating DUCB-L with a reverse auction mechanism, we develop a recruitment and payment strategy that effectively addresses the recruitment of high-quality workers under budget constraints, dynamic worker participation, and unknown prior sensing quality. Theoretical analysis demonstrates that the proposed RS-MABRA scheme not only preserves worker location privacy but also satisfies truthfulness, individual rationality, and computational efficiency. Additionally, we provide a comprehensive regret analysis for the proposed scheme. Extensive evaluations on real datasets show that, compared to existing approaches, our scheme achieves superior accuracy in aggregated results while maintaining truthfulness and individual rationality.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111526"},"PeriodicalIF":4.6,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144723545","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":"IoTGeM: Generalizable models for behaviour-based IoT attack detection","authors":"Kahraman Kostas ,&nbsp;Mike Just ,&nbsp;Michael A. Lones","doi":"10.1016/j.comnet.2025.111550","DOIUrl":"10.1016/j.comnet.2025.111550","url":null,"abstract":"<div><div>Previous research on behaviour-based attack detection for networks of IoT devices has resulted in machine learning models whose ability to adapt to unseen data is limited and often not demonstrated. This paper presents IoTGeM, an approach for modelling IoT network attacks that focuses on generalizability, yet also leads to better detection and performance. We first introduce an improved rolling window approach for feature extraction. To reduce overfitting, we then apply a multi-step feature selection process where a Genetic Algorithm (GA) is uniquely guided by exogenous feedback from a separate, independent dataset. To prevent common data leaks that have limited previous models, we build and test our models using strictly isolated train and test datasets. The resulting models are rigorously evaluated using a diverse portfolio of machine learning algorithms and datasets. Our window-based models demonstrate superior generalization compared to traditional flow-based models, particularly when tested on unseen datasets. On these stringent, cross-dataset tests, IoTGeM achieves F1 scores of 99% for ACK, HTTP, SYN, MHD, and PS attacks, as well as a 94% F1 score for UDP attacks. Finally, we build confidence in the models by using the SHAP (SHapley Additive exPlanations) explainable AI technique, allowing us to identify the specific features that underlie the accurate detection of attacks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111550"},"PeriodicalIF":4.6,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144739684","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":"Mobility-Aware Predictive Split Federated Learning for 6G vehicular networks with ultra-low latency guarantees","authors":"Iftikhar Rasheed ,&nbsp;Hala Mostafa","doi":"10.1016/j.comnet.2025.111553","DOIUrl":"10.1016/j.comnet.2025.111553","url":null,"abstract":"<div><div>The integration of distributed learning in 6G vehicular networks faces significant challenges due to high mobility, stringent latency requirements, and resource constraints at the network edge. This paper proposes MAPSFL, a novel mobility-aware predictive split federated learning framework that seamlessly integrates mobility prediction, dynamic model splitting, and hierarchical learning architectures to enable efficient distributed learning in highly mobile vehicular environments. Our framework employs a predictive mobility model to optimize resource allocation and model splitting decisions while maintaining ultra-low latency guarantees through adaptive compression and selective parameter transmission mechanisms. Theoretical analysis provides convergence guarantees under dynamic network conditions, while extensive experimental results demonstrate that MAPSFL achieves 31% reduction in CPU utilization, 28% lower bandwidth consumption, and 34% reduction in end-to-end training latency compared to state-of-the-art approaches. The proposed work achieved 85% efficiency at large scales of vehicles, i.e. 5000, while ensuring the required latency of 100ms, thus making it particularly suitable for safety-critical vehicular applications. The comprehensive evaluation of the proposed method validates its effectiveness in addressing the challenges of high mobility, resource constraints, and network dynamics in 6G vehicular networks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111553"},"PeriodicalIF":4.4,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144704134","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":"STAR-RIS-assisted UAV-enabled MEC network: Minimizing long-term latency and system stability optimization","authors":"Yaoping Zeng,&nbsp;Shisen Chen,&nbsp;Yimeng Ge","doi":"10.1016/j.comnet.2025.111563","DOIUrl":"10.1016/j.comnet.2025.111563","url":null,"abstract":"<div><div>Unmanned aerial vehicle (UAV)-assisted wireless power transfer (WPT) is a promising technology for delivering sustainable energy to energy-constrained ground users (GUs) in mobile edge computing (MEC) networks. Nevertheless, the network performance is severely limited by channel fading. Compared with the conventional reconfigurable intelligent surface (RIS) limited to half-space coverage, the simultaneously transmitting and reflecting (STAR)-RIS achieves full-space coverage, thereby enhancing both WPT efficiency and computational task offloading performance. To fully investigate the potential of STAR-RIS, this paper proposes a STAR-RIS-assisted UAV-enabled MEC system aiming to minimize long-term latency while ensuring system stability by jointly optimizing time slot allocation, STAR-RIS coefficient matrices, and UAV trajectory. By leveraging the Lyapunov optimization method, the original long-term stochastic optimization problem is transformed into tractable deterministic sub-problems, which are then solved by using successive convex approximation, penalty functions, and convex optimization techniques. Simulation results demonstrate that the proposed scheme effectively balances long-term latency reduction and system stability, achieving significant performance gains compared with baseline schemes.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111563"},"PeriodicalIF":4.4,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711244","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":"Efficient intrusion detection via heterogeneous graph attention networks and parallel provenance analysis","authors":"Lin Wu ,&nbsp;Yu-Lai Xie ,&nbsp;Shi-Xun Zhao ,&nbsp;Pan Zhou ,&nbsp;Dan Feng ,&nbsp;Avani Wildani ,&nbsp;Ya-Feng Wu","doi":"10.1016/j.comnet.2025.111552","DOIUrl":"10.1016/j.comnet.2025.111552","url":null,"abstract":"<div><div>In recent years, Advanced Persistent Threats (APTs) have emerged as a significant and pervasive form of cyber attack that uses sophisticated, covert techniques to infiltrate and persist in vulnerable systems, posing a significant threat to businesses and organizations. Recent studies have highlighted the potential of using provenance for APT detection. Provenance is a kind of data that records the history and dependencies of system objects (such as files, processes, and sockets) and is usually converted into a provenance graph for analysis. However, the previous methods have several limitations : (1) The large amount of data generated by long-term APT attacks has a great storage overhead and reduces the analysis efficiency. (2) Requires prior attack knowledge and cannot cope with unknown attacks. (3) It fails to consider the rich semantic information in the provenance graph fully. In this paper, we propose IDS-HGAT, a novel intrusion detection system based on a heterogeneous graph attention network. The system can reduce the number of nodes by preprocessing while retaining the graph structure information. IDS-HGAT can consider the semantic information of different types of nodes and edges and the structure information of the provenance graph, and effectively aggregate the semantic information to build a classification model without constructing a rule base. In order to improve the detection efficiency, IDS-HGAT employs the Stream data type in Redis to build a message queue to support parallel storage and acquisition of provenance data. The experimental results show that IDS-HGAT is better than the existing state-of-the-art methods in terms of precision rate, false alarm rate, and time cost.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111552"},"PeriodicalIF":4.4,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144714130","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":"Betastack: Enhancing base station traffic prediction with network-specific Large Language Models","authors":"Quanfeng Lv ,&nbsp;Yuan Chang ,&nbsp;Tong Li ,&nbsp;Jingguo Ge","doi":"10.1016/j.comnet.2025.111557","DOIUrl":"10.1016/j.comnet.2025.111557","url":null,"abstract":"<div><div>Accurate traffic forecasting in base station networks is crucial for efficient network management, resource allocation, and ensuring quality of service. This paper introduces BetaStack, a novel network-specific Large Language Model (LLM) designed to enhance base station traffic prediction. Unlike existing approaches, BetaStack incorporates physical constraints and a specialized network protocol embedding layer that captures the hierarchical structure of network traffic data. Through fine-tuning with these network-specific adaptations and a self-regressive prediction mechanism, BetaStack effectively leverages the powerful sequence modeling capabilities of LLMs to address the intricacies of network traffic. Extensive experiments on real-world data from base station cells in Guangdong, China demonstrate that BetaStack achieves significant performance improvements over both state-of-the-art time-series forecasting models and specialized network traffic prediction models. These results underscore the potential of BetaStack to improve the accuracy of network traffic prediction, enabling more efficient network management. The code can be found in <span><span>https://github.com/lqf0624/BetaStack.git</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111557"},"PeriodicalIF":4.4,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144686301","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":"Energy-efficient and reliable data collection in receiver-initiated wake-up radio enabled IoT networks","authors":"Syed Luqman Shah ,&nbsp;Ziaul Haq Abbas ,&nbsp;Ghulam Abbas ,&nbsp;Nurul Huda Mahmood","doi":"10.1016/j.comnet.2025.111548","DOIUrl":"10.1016/j.comnet.2025.111548","url":null,"abstract":"<div><div>In unmanned aerial vehicle (UAV)-assisted wake-up radio (WuR)-enabled internet of things (IoT) networks, UAVs can instantly activate the main radios (MRs) of the sensor nodes (SNs) with a wake-up call (WuC) for efficient data collection in mission-driven data collection scenarios. However, the spontaneous response of numerous SNs to the UAV’s WuC can lead to significant packet loss and collisions, as WuR does not exhibit its superiority for high-traffic loads. To address this challenge, we propose an innovative receiver-initiated WuR UAV-assisted clustering (RI-WuR-UAC) medium access control (MAC) protocol to achieve low latency and high reliability in ultra-low power consumption applications. We model the proposed protocol using the <span><math><mrow><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn><mo>/</mo><mn>2</mn></mrow></math></span> queuing framework and derive expressions for key performance metrics, i.e., channel busyness probability, probability of successful clustering, average SN energy consumption, and average transmission delay. The RI-WuR-UAC protocol employs three distinct data flow models, tailored to different network traffic scenarios, which perform three different MAC mechanisms: channel assessment (CCA) clustering for light traffic loads, backoff plus CCA clustering for dense and heavy traffic, and adaptive clustering for variable traffic loads. Simulation results demonstrate that the RI-WuR-UAC protocol significantly outperforms the benchmark sub-carrier modulation clustering protocol. By varying the network load, we capture the trade-offs among the performance metrics, showcasing the superior efficiency and reliability of the RI-WuR-UAC protocol.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111548"},"PeriodicalIF":4.4,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144696465","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":"Permissioned blockchain architecture enabling bounded-time PBFT consensus over deterministic networks","authors":"Wenwei Huang ,&nbsp;Tianyu Kang ,&nbsp;Li Guo ,&nbsp;Luo Deng","doi":"10.1016/j.comnet.2025.111547","DOIUrl":"10.1016/j.comnet.2025.111547","url":null,"abstract":"<div><div>With the advent of next-generation network, the demand for time-sensitive services in fields such as the IoT the IoD has been increasing. Meanwhile, integrating blockchain technology is becoming increasingly meaningful in IoT scenario due to its enhanced security, transparency and fault tolerance. At this point, to enable blockchain systems to provide time-sensitive services in scenarios such as IIoT, this study proposes an permissioned blockchain architecture based on deterministic network aimed at reaching PBFT consensus in bounded time, referred to as confidence duration (CD). However, congestion can compromise the validity of the CD. To address this, we leverage the PBFT consensus model. This model demonstrates the architecture’s effectiveness by breaking down the consensus process into a series of finite, bounded-latency transmissions, thereby allowing for the calculation of the CD even under potential network congestion. Then, based on this model, this paper proposes a STA scheduling mechanism to address the congestion problem in the PBFT consensus. Finally, our simulations found that the architecture is effective, the computation of CD is correct and the STA scheduling mechanism can effectively address congestion to ensure functionality of CD.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111547"},"PeriodicalIF":4.4,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144686297","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 modular system for real-time intrusion detection on local area networks","authors":"Ilhan Firat Kilincer","doi":"10.1016/j.comnet.2025.111577","DOIUrl":"10.1016/j.comnet.2025.111577","url":null,"abstract":"<div><div>Resistance to cyber-attacks is critical for local networks, which are responsible for the smooth operation of many processes such as data sharing, communication, data storage and application access. In this study, a modular system is proposed to detect attacks that may occur in local networks. The proposed model is designed to detect local network attacks using two different methods. The first method aims to detect Spanning Tree Protocol (STP) Root Bridge, MAC Flood, Man in the Middle (MiTM) and Rogue DHCP attacks that are common in local area networks. The Layer 2 Discovery (L2D) application has been developed to detect these attacks in real time, which can lead to major service interruptions and data breaches in local networks. In addition, the developed application offers brand-independent security configurations to network administrators with GPT- 4o support. The another module of the proposed method, a feature selection and machine learning based method is presented for the detection of Distributed Denial of Service (DDoS) attacks occurring in local networks. In the proposed method, the most effective features in the CIC-DDoS2019 dataset are iteratively ranked with the default parameters of the Information Gain Attribute (IGA) algorithm and the Light Gradient Boosting Machine (LGBM) algorithm. A median filter is applied to the best selected features, and then new features are created with time series. The newly obtained data set was classified with the default parameters of the K-NN, RF, 1D-CNN, MLP and LGBM classifiers and the classifier with the highest accuracy result was selected. As a result of the process, the best hyper-parameters of the LGBM classifier that gave the highest result were determined with 10-K cross validation. As a result, the proposed method achieved 95.98 % accuracy and 96 % F1 Score value on the 13-class CIC-DDoS2019 dataset. In the last step of the study, classes consisting of similar characteristics in the dataset were combined and the CIC_DDoS2019 dataset was reduced to 12 classes. The proposed method was applied to the 12-class CIC_DDoS2019 dataset and achieved an accuracy 99.14 % and 99 % F1 Score. In addition to the detection capability of DDoS attacks, the study brings a new perspective to intrusion detection studies with the detection of real-time STP Root Bridge, MAC Flood, Man in the Middle (MiTM) and Rogue DHCP attacks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111577"},"PeriodicalIF":4.4,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144703506","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 survey of existing attacks on 5G SA","authors":"Mengyi Gong,&nbsp;Ziling Wei,&nbsp;Shuhui Chen,&nbsp;Wanrong Yu,&nbsp;Fei Wang","doi":"10.1016/j.comnet.2025.111545","DOIUrl":"10.1016/j.comnet.2025.111545","url":null,"abstract":"<div><div>Since the release of the Fifth Generation (5G) Stand-alone (SA) standard in 2018, there is a swift and widespread global adoption of 5G SA mobile network. For the present and foreseeable future, 5G technology will remain the core of mobile networks. Like previous generations of mobile networks, 5G networks have encountered numerous security issues during actual deployment and service provision, which have led to various serious impacts. Based on this, this paper systematically analyzes existing attacks targeting the User Equipment (UE), Radio Access Network (RAN), and core network of 5G networks. We propose a simple and effective method to investigate attacks on various parts of 5G networks, classify these attacks, and discuss their implications, causes, and defense solutions in detail. We find that most security issues have been theoretically addressed through defense solutions proposed in academic literature and 3rd Generation Partnership Project (3GPP) specifications. However, whether these solutions have been implemented in existing 5G networks remains to be verified. Through a deep analysis of existing 5G network security issues, this paper also proposes potential directions for future 5G security research, aiming to promote further research in the field of 5G security and enhance the overall security of future mobile networks.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111545"},"PeriodicalIF":4.4,"publicationDate":"2025-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144696466","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}