Computer Communications最新文献

{"title":"Periodic data collection in hybrid energy-harvesting sensor networks","authors":"Dieter Fiems,&nbsp;Kishor Patil,&nbsp;Koen De Turck","doi":"10.1016/j.comcom.2025.108217","DOIUrl":"10.1016/j.comcom.2025.108217","url":null,"abstract":"<div><div>We investigate wireless sensor networks with energy harvesting and periodic data collection by mobile sinks. We propose a Markov model to study the trade-off between the value of information at the mobile sink and the cost of data collection. In particular, we focus on the impact of the limited ability of sensor nodes to collect energy by incorporating an energy buffer with discretised energy chunks as an abstraction of the battery and energy harvesting dynamics. We also use a value information framework that accounts for the timeliness of the data by discounting the value of the information at the sensor over time.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108217"},"PeriodicalIF":4.5,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144185701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Secrecy analysis of orthogonal/nonorthogonal multiple access in energy scavenging-enabled short-packet transmission","authors":"Toi Le-Thanh ,&nbsp;Khuong Ho-Van ,&nbsp;Thiem Do-Dac","doi":"10.1016/j.comcom.2025.108214","DOIUrl":"10.1016/j.comcom.2025.108214","url":null,"abstract":"<div><div>Energy scavenging (ES)-enabled short-packet transmission (SPT) aims to attain low latency, high energy efficiency, high reliability by combining radio frequency ES with SPT. However, ES-enabled SPT (ESSPT) is susceptible to malicious overhearing attributable to broadcast feature of wireless transmission. To have prompt insights into secrecy capability of nonorthogonal/orthogonal multiple access (NOMA/OMA) in ESSPT, this paper proposes an analytical framework under realistic imperfections, such as arbitrary fading severity, hardware imperfection (HWi), nonlinear ES (nlES), channel state information imperfection (CSIi), and successive interference cancellation imperfection (SICi). Monte-Carlo simulations validate the proposed framework and expose the significant degradation of the secrecy capability of NOMA/OMA in ESSPT due to these imperfections. Moreover, the secrecy capability of NOMA/OMA in ESSPT can be maximized by selecting properly the transmit power and ES duration. Remarkably, in ESSPT, average effective secrecy rate sum and average secrecy throughput sum of OMA are almost double those of NOMA, indicating a significant superiority of OMA over NOMA in terms of security.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108214"},"PeriodicalIF":4.5,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"CoDDoS: Detecting and mitigating diverse DDoS attacks with programmable switches","authors":"Jiqiang Xia ,&nbsp;Le Tian ,&nbsp;Yuxiang Hu ,&nbsp;Ziyong Li ,&nbsp;Penghao Sun ,&nbsp;Jianhua Peng","doi":"10.1016/j.comcom.2025.108215","DOIUrl":"10.1016/j.comcom.2025.108215","url":null,"abstract":"<div><div>Over the past decades, DDoS attacks have dramatically evolved in attack scale and patterns. However, state-of-the-art DDoS defenses encounter challenges in maintaining high performance while handling large-scale network traffic. Most require rerouting traffic to a centralized collector (or analyzer), introducing additional processing latency and cost. Emerging programmable switches have become a promising means for conducting flexible DDoS defense directly on the data plane. However, due to the limited resources on each device and the lack of monitoring statistics from a network-wide perspective, these works have not provided sufficient capabilities to detect and mitigate diverse DDoS attacks. In this paper, we propose CoDDoS, a Collaborative DDoS defense system that combines device-local and network-wide monitoring information to defend against diverse DDoS attacks with programmable switches. For device-local estimation, we propose a resource-efficient sketch DBMin, to recognize suspicious DDoS attack flows from tremendous ongoing traffic. It is fully deployed on the data plane and achieves much lower memory consumption than existing approaches. We further initiate an In-band Network Telemetry mechanism to perform the network-wide measurement on suspicious flows detected by DBMin sketch. To defend against diverse DDoS attacks, CoDDoS enables a comprehensive investigation of the collected statistics and sets appropriate mitigation strategies for different DDoS attacks. The experiment results show that CoDDoS can achieve high detection accuracy for endpoint-based DDoS defense referring to F1 score/FNR/FPR metrics and effectively detect and mitigate link-based DDoS attacks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108215"},"PeriodicalIF":4.5,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Disaster identification scheme based on federated learning and Cognitive Internet of Vehicles","authors":"Muhammad Junaid Anjum ,&nbsp;Muhammad Shoaib Farooq ,&nbsp;Tariq Umer ,&nbsp;Momina Shaheen","doi":"10.1016/j.comcom.2025.108216","DOIUrl":"10.1016/j.comcom.2025.108216","url":null,"abstract":"<div><div>The rate of disaster occurrences has been increasing over the last decade due to the alarming effects of global warming. A major challenge with such disasters is identifying their nature before substantial loss of lives and property occurs. Existing systems often fail to determine the type of disaster until significant damage has been done. This research proposes a novel scheme to identify disasters as they occur, leveraging Federated Learning (FL) and Cognitive Internet of Vehicles (CIoV) since vehicles are a common presence in disaster scenarios. The proposed scheme utilizes various machine learning (ML) and deep learning algorithms to predict disaster types in real-time. Additionally, it introduces a custom federated averaging algorithm to maintain result privacy. The research evaluated the scheme’s performance using a data set of recorded disasters from various countries, training different algorithms to determine optimal results. The results indicate that the proposed scheme can achieve a 90% accuracy in disaster-type identification using deep learning and random forest algorithms.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108216"},"PeriodicalIF":4.5,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144139246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Empowering disaster response: Advanced Network Slicing solutions for reliable Wi-Fi and 5G communications","authors":"Xhulio Limani ,&nbsp;Gilson Miranda Jr. ,&nbsp;Joao Nunes Pinheiro ,&nbsp;Xiaoman Shen ,&nbsp;Chun Pan ,&nbsp;Xingfeng Jiang ,&nbsp;Chi Zhang ,&nbsp;Johann M. Marquez-Barja ,&nbsp;Nina Slamnik-Kriještorac","doi":"10.1016/j.comcom.2025.108198","DOIUrl":"10.1016/j.comcom.2025.108198","url":null,"abstract":"<div><div>In the context of increasing global challenges, such as climate change, geopolitical unrest, and a range of natural disasters, the need for robust Public Protection and Disaster Relief (PPDR) management strategies has emerged to face phases such as risk mitigation, preparations, and recovery mechanisms. Within such a scenario, communication technologies are an essential part of emergency-response strategies. Both cellular and non-cellular networks, such as 5G and Wi-Fi, are crucial in supporting PPDR operations. 5G networks are essential for covering extensive areas, for instance, enabling video surveillance through drones, whereas Wi-Fi networks are better suited for localized applications, such as in temporary shelters or field hospitals. During environmental disasters, these networks often experience substantial traffic loads due to the high demand for diverse services, each with varying network requirements, such as enhanced Mobile Broadband (eMBB) and Ultra-Reliable Low-Latency Communications (URLLC). The increased network load poses a risk of impairing PPDR services, as the network may be unable to meet the stringent requirements necessary for first responders. Consequently, the implementation of Network Slicing techniques becomes critical to ensure flexibility, isolation, and dynamic prioritization of disaster management services, thereby guaranteeing the necessary network performance for effective emergency response. In this paper, we deploy real-life Network Slicing mechanism for Wi-Fi and 5G networks, to guarantee the network requirements for PPDR services. We evaluate the performance of Wi-Fi and 5G networks (throughput, latency, and packet loss), separately, for different scenarios. First, we introduce a dynamic Network Slicing mechanism for Wi-Fi networks. This mechanism, based on Software-Defined Networking (SDN) and In-band Network Telemetry (INT), incorporates an algorithm that mimics human-like reasoning to dynamically allocate network resources, such as airtime, using physical Wi-Fi equipment in real-world environments. Subsequently, we present a Network Slicing configuration for a real-world 5G network, deployed using actual hardware, utilizing a modular Open Radio Access Network (O-RAN) architecture.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108198"},"PeriodicalIF":4.5,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analysis of supervised machine-learning techniques in computer networks attack detection","authors":"Domingos S.F. Paes,&nbsp;Carlos H.V. de Moraes,&nbsp;Bruno G. Batista","doi":"10.1016/j.comcom.2025.108203","DOIUrl":"10.1016/j.comcom.2025.108203","url":null,"abstract":"<div><div>In an era marked by an increasing reliance on technology in our daily lives, the imperative to ensure the availability and security of infrastructures supporting system operations is evident. This commitment is crucial for guaranteeing service quality, delivering a positive end-user experience, and optimizing resource utilization. Against this backdrop, the integration of new technologies, such as artificial intelligence and machine-learning, becomes essential to enhance the agility of problem detection and mitigate potential impacts. The study presented in this paper delves into an analysis of various supervised classifier machine-learning methods applied to data collected from network equipment, specifically switches. The primary objective is to detect attacks within the network infrastructure of a higher education institution. The attacks were categorized into distinct signatures, forming datasets instrumental in the comparative assessment of machine-learning techniques. The models derived from these methods demonstrated promising results, achieving an impressive 99.88% in the Weighted F1 metric and 99.23% in Balanced Accuracy. Beyond traditional metrics, the study also considered critical factors such as training time, prediction time, and saved file size for a comprehensive evaluation of the methods. This multifaceted analysis aids in identifying the most suitable method, taking into account not only classification performance but also practical considerations associated with real-world deployment.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108203"},"PeriodicalIF":4.5,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive traffic splitting for transmission power minimization with QoS enhancement in 5G HetNets","authors":"Abdul Manan ,&nbsp;Syed Maaz Shahid ,&nbsp;Nam-I Kim ,&nbsp;Sungoh Kwon","doi":"10.1016/j.comcom.2025.108206","DOIUrl":"10.1016/j.comcom.2025.108206","url":null,"abstract":"<div><div>In this paper, we propose an adaptive data rate splitting algorithm for 5G HetNets comprised of both macro cells and small cells. Dual connectivity with data rate splitting has been considered a solution for achieving energy efficiency and enhancing network throughput. However, previous work did not optimize both transmission power and throughput for dual connectivity. For the minimization of transmission power with quality of service (QoS) enhancement, we employ a data rate splitting ratio for dual connectivity users. To that end, we formulate the problem of minimizing transmission power based on users’ minimum rates, and we derive a theoretical expression to obtain the optimal data rate splitting ratio. An algorithm is proposed for adaptive data rate splitting considering channel conditions and the UE data rate demands. The algorithm finds the data rate split ratio iteratively to minimize total transmission power and fulfill QoS requirements. Using NS-3, we verify the analysis and show that the proposed algorithm minimizes total transmission power while satisfying QoS requirements. In addition, we show the impact of user mobility and the number of small cells on the data rate splitting ratio.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108206"},"PeriodicalIF":4.5,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Time varying channel estimation for RIS assisted network with outdated CSI: Looking beyond coherence time","authors":"Souvik Deb,&nbsp;Sasthi C. Ghosh","doi":"10.1016/j.comcom.2025.108202","DOIUrl":"10.1016/j.comcom.2025.108202","url":null,"abstract":"<div><div>The channel estimation (CE) overhead for unstructured multipath-rich channels increases linearly with the number of reflective elements of reconfigurable intelligent surface (RIS). This results in a significant portion of the channel coherence time being spent on CE, reducing data communication time. Furthermore, due to the mobility of the user equipment (UE) and the time consumed during CE, the estimated channel state information (CSI) may become outdated during actual data communication. In recent studies, the timing for CE has been primarily determined based on the coherence time interval, which is dependent on the velocity of the UE. However, the effect of the current channel condition and pathloss of the UEs can also be utilized to control the duration between successive CE to reduce the overhead while still maintaining the quality of service. Furthermore, for multi-user systems, the appropriate coherence time intervals of different users may be different depending on their velocities. Therefore CE carried out ignoring the difference in coherence time of different UEs may result in the estimated CSI being detrimentally outdated for some users. In contrast, others may not have sufficient time for data communication. To this end, based on the throughput analysis on outdated CSI, an algorithm has been designed to dynamically predict the next time instant for CE after the current CSI acquisition. In the first step, optimal RIS phase shifts to maximize channel gain is computed. Based on this and the amount of degradation of signal to interference plus noise ratio due to outdated CSI, transmit powers and bandwidth are allocated for the UEs and finally the next time instant for CE is predicted such that the aggregated throughput is maximized. Simulation results confirm that our proposed algorithm outperforms the coherence time-based strategies and an existing algorithm that adaptively changes inter CE duration.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108202"},"PeriodicalIF":4.5,"publicationDate":"2025-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144070406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A methodology for extracting and decoding smart contracts data","authors":"Flavio Corradini,&nbsp;Alessandro Marcelletti,&nbsp;Andrea Morichetta,&nbsp;Barbara Re","doi":"10.1016/j.comcom.2025.108204","DOIUrl":"10.1016/j.comcom.2025.108204","url":null,"abstract":"<div><div>Blockchain technology has been widely adopted to enhance the security and the decentralisation of smart applications in large-scale pervasive systems. In such a context, data extraction is crucial as it provides a better understanding of the system’s behaviours. However, several challenges arise in automatically extracting data, due to the variety of data sources, such as transactions, events, contract storage, and the complexity of the blockchain structure. In particular, retrieving smart contract state changes remains unexplored despite its potential usage for discovering unexpected behaviour. For such reasons, in this work, we propose a novel methodology and a supporting application for extracting smart contract state changes and other execution-related data. The obtained data is then decoded and offered in a standard format to be easily reused. The methodology provides additional functionalities such as transaction filtering and capabilities for querying over extracted data. The effectiveness and the performance of the methodology were evaluated on three real-world projects from different EVM-based blockchains.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108204"},"PeriodicalIF":4.5,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143941702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An analysis of pervasive payment channel networks for Central Bank Digital Currencies","authors":"Marco Benedetti ,&nbsp;Francesco De Sclavis ,&nbsp;Marco Favorito ,&nbsp;Giuseppe Galano ,&nbsp;Sara Giammusso ,&nbsp;Antonio Muci ,&nbsp;Matteo Nardelli","doi":"10.1016/j.comcom.2025.108199","DOIUrl":"10.1016/j.comcom.2025.108199","url":null,"abstract":"<div><div>The recent advancement of blockchain technology presents interesting opportunities that are worth a systematic investigation for their potential use in a Central Bank Digital Currency (CBDC). A blockchain alone has known scalability issues that can be overcome by, e.g., a layer-2 payment channel network (PCN). However, not all aspects of such a PCN are easy to specify and optimize. Therefore, its overall behavior, given the multitude of decentralized and individually configured nodes, is challenging to fully comprehend. In this paper, we consider a two-layer hypothetical CBDC in which the wholesale layer utilizes a permissioned blockchain, which ensures high integrity and verifiability, while the retail layer leverages an off-ledger PCN model (with pervasive nodes distributed on a large-scale) that supports instant, privacy-preserving, and retail payments. We systematically analyze the performances of two families of PCNs, namely SF-PCNs and SH-PCNs, characterized respectively by a Scale-Free topology and a Semi-Hierarchical topology. Through extensive simulations and analyses, we offer insights into optimizing PCN structures for CBDCs by exploring the trade-offs among liquidity locked by market operators, payment success rate, throughput, payment completion time, as well as load on the underlying blockchain. Although both SH-PCNs and SF-PCNs can offer state-of-the-art guarantees of fault-tolerance and integrity, we demonstrate that SH-PCNs are better suited for handling large volumes of payments, scale better with the number of network nodes, are more aligned with the anatomy of the current monetary and financial system, and therefore should be preferred in CBDC designs.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"240 ","pages":"Article 108199"},"PeriodicalIF":4.5,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144070287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}