Computer Communications最新文献

{"title":"Adaptive layer-wise personalized federated learning via dual delay update in future communication networks","authors":"Haowen Xu ,&nbsp;Yingchi Mao ,&nbsp;Si Chen ,&nbsp;Yi Rong ,&nbsp;Tasiu Muazu ,&nbsp;Xiaoming He","doi":"10.1016/j.comcom.2025.108195","DOIUrl":"10.1016/j.comcom.2025.108195","url":null,"abstract":"<div><div>The future communication networks refers to large-scale mass-connected networks consisting of billions of cloud, edge, and end devices, which are expected to support the ever-growing communication demands. In the future communication networks, billions of end devices generate massive amount of data that needs to be processed and analyzed (<em>e.g.</em>, model training). Artificial Intelligence of Things (AIoT) is a groundbreaking technology that leverages artificial intelligence models to process and analyze data generated by a large number of internet of things devices. As an emerging AIoT method, personalized Federated Learning (pFL) has emerged prominently in distributed model training using massive data from the future communication networks. However, it is challenging to accomplish high-performance and communication-efficient model training by existing pFL methods in the future communication networks, due to the following limitations. a) Dynamic role differences in each layer of a multi-layer model are neglected, leading to poor accuracy in customized models deployed on end devices. b) Owing to numerous end devices in the future communication networks, the communication frequency between a cloud server and end devices is extremely high in each communication round, resulting in expensive communication cost. To solve these two limitations, this paper presents a novel pFL framework for distributed model training in the future communication networks, called <em>Adaptive Layer-wise personalized Federated Learning via Dual Delay Update</em> (ALpFLDDU). First, in end devices, a layer-wise aggregation scheme based on an adaptive weight calculation mechanism is designed to capture the dynamic role differences of model layers. Second, in each communication round, we develop a dual delay update strategy to reduce communication frequency between a cloud server and end devices while ensuring model performance. Simulation experiments on text and image classification datasets are conducted. The experimental results show that ALpFLDDU realizes higher classification precision and lower communication cost than advanced pFL benchmarks on various classification tasks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108195"},"PeriodicalIF":4.5,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918540","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":"FedBH: Efficient federated learning through shared base and adaptive hyperparameters in heterogeneous systems","authors":"Zediao Liu ,&nbsp;Yayu Luo ,&nbsp;Tongzhijun Zhu ,&nbsp;Ziyi Chen ,&nbsp;Tenglong Mao ,&nbsp;Huan Pi ,&nbsp;Ying Lin","doi":"10.1016/j.comcom.2025.108190","DOIUrl":"10.1016/j.comcom.2025.108190","url":null,"abstract":"<div><div>Federated learning is a distributed learning framework that protects client data privacy. However, in real-world applications, due to the significant differences in data distribution among different clients, a single global model often fails to meet personalized needs. Moreover, existing personalized federated learning methods often struggle to balance computational efficiency and model personalization while inadequately addressing the heterogeneous computational capabilities of clients. To address these challenges, we propose FedBH—an innovative personalized federated learning method that combines the feature extraction capabilities of deep learning with an adaptive dynamic training mechanism. FedBH decomposes each client’s model into a global base layer and client-specific local heads, enhancing both computational efficiency and personalized training. To further optimize learning, FedBH incorporates a dynamic adjustment mechanism that adapts training parameters based on each client’s specific conditions. In each local training round, the algorithm samples a subset of the dataset and explores different configurations of local head and global base training rounds. The optimal configuration is determined based on validation loss and then applied for full training. This adaptive mechanism enables FedBH to dynamically adjust to varying client demands, ensuring efficient utilization of computational resources while maintaining robust personalization. Experimental results across multiple benchmark datasets and diverse data distribution scenarios show that FedBH achieves faster convergence and higher accuracy in most cases. These findings demonstrate that FedBH not only effectively adapts to heterogeneous data environments but also significantly improves training efficiency, showing great potential in addressing issues related to diverse and non-IID data distributions.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108190"},"PeriodicalIF":4.5,"publicationDate":"2025-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918539","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 reproducible and portable experiment workflows","authors":"Henning Stubbe,&nbsp;Sebastian Gallenmüller,&nbsp;Georg Carle","doi":"10.1016/j.comcom.2025.108178","DOIUrl":"10.1016/j.comcom.2025.108178","url":null,"abstract":"<div><div>Testbeds allow the creation of research prototypes to test new ideas through practical experiments. This central role in validating ideas makes them irreplaceable tools for data-driven research in computer science. Various testbeds were created to provide testbeds for the scientific community. To simplify testbed usage, frameworks help to authenticate users, allocate resources, and run experiments. Each testbed typically implements its own framework using a specific API to realize experiments. Such an experiment design impedes the portability of experiments between different testbeds. In this paper, we present a solution where we port the pos experiment controller to the Chameleon and CloudLab testbed. The well-structured pos experiment workflow allows the creation of inherently reproducible experiments. Previously, the experiments using the pos workflow were only possible in dedicated testbeds. By introducing the portability feature, these experiments can run on Chameleon and CloudLab. We demonstrate that experiments can be executed on any of the mentioned platforms without changing the experiment definition. Based on these results, we discuss how the portability feature will be used in the upcoming SLICES-RI testbeds to create reproducible and easily-shareable experiments.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108178"},"PeriodicalIF":4.5,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894582","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":"VESPACE: A verifiable blockchain-based data space solution to empower the data economy","authors":"Andrea Roberta Costagliola ,&nbsp;Carlo Mazzocca ,&nbsp;Armir Bujari ,&nbsp;Rebecca Montanari ,&nbsp;Paolo Bellavista","doi":"10.1016/j.comcom.2025.108180","DOIUrl":"10.1016/j.comcom.2025.108180","url":null,"abstract":"<div><div>In the rapidly evolving data economy, the ability to securely and efficiently share data between organizations has become paramount, unlocking new opportunities for innovation and growth. In this context, different initiatives have worked on conceptual proposals and enabling technological building blocks, addressing design aspects of data spaces. However, the current landscape lacks practical implementations and integration of secure data-sharing primitives supporting a decentralized data ecosystem. To this end, we conduct an analysis of previous efforts and initiatives, identifying gaps. We then introduce <span>VESPACE</span>, a blockchain-based platform for data spaces that enables participants to selectively and securely share verifiable data with authorized users while maintaining control over their access. Our framework incorporates data sovereignty principles implemented through Decentralized Identifiers (DIDs), Verifiable Credentials (VCs), and blockchain technology, qualifying decentralized identity and access control as key features to establish user trust in decentralized data ecosystems. We present a prototype system implementation of <span>VESPACE</span>, evaluating the design choices, showcasing the feasibility of our proposal.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108180"},"PeriodicalIF":4.5,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899605","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":"Deterministic Networking (DetNet): Performance evaluation of the Packet Ordering Functions","authors":"Juan-Cruz Piñero ,&nbsp;Alberto Blanc ,&nbsp;José Ignacio Alvarez-Hamelin ,&nbsp;Georgios Z. Papadopoulos","doi":"10.1016/j.comcom.2025.108171","DOIUrl":"10.1016/j.comcom.2025.108171","url":null,"abstract":"<div><div>Industrial Internet of Things applications need strict Quality of Service guarantees, including when they use wireless networks. While existing standardization efforts, such as Deterministic Networks (IETF) and Time-Sensitive Networking (TSN), have focused mainly on wired networks, more recent activities address wireless networks, like the Reliable and Available Wireless (RAW) Working Group of the IETF. Duplicating packets over multiple paths can improve availability and reliability, but this can potentially result in more out-of-order packets. Existing reordering algorithms, including two recently standardized by the IETF, are not always well suited to wireless networks. As a result, guaranteeing a bounded end-to-end latency and/or maximum consecutive packet losses is still particularly challenging. We propose a novel packet reordering algorithm for deterministic networking that includes wireless segments to achieve lower end-to-end latency while providing high end-to-end reliability. We simulate a 6TiSCH wireless network to compare its performance with the existing ones. Furthermore, we also extend existing Network Calculus bounds on the reordering timer to obtain path-dependent values that can reduce the average latency. We also introduce a probabilistic model to compute the reordering ratio when there are no retransmissions that fits the simulation results.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108171"},"PeriodicalIF":4.5,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143904425","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 novel energy-efficient cross-layer design for scheduling and routing in 6TiSCH networks","authors":"Ahlam Hannachi ,&nbsp;Wael Jaafar ,&nbsp;Salim Bitam ,&nbsp;Nabil Ouazene","doi":"10.1016/j.comcom.2025.108173","DOIUrl":"10.1016/j.comcom.2025.108173","url":null,"abstract":"<div><div>The 6TiSCH protocol stack plays a vital role in enabling reliable and energy-efficient communications for the Industrial Internet of Things (IIoT). However, it faces challenges, including prolonged network formation, inefficient parent switching, high control packet overhead, and suboptimal resource utilization. To tackle these issues, we propose in this paper a novel cross-layer optimization framework aiming to enhance the coordination between the Scheduling Function (SF), the Routing Protocol for Low-Power and Lossy Networks (RPL), and queue management. Our solution introduces a slot-aware parent switching mechanism, early slot reservation to mitigate queue overflow, and a refined slot locking strategy to improve slot availability. To reduce control overhead, the proposed method merges 6P cell reservation information into RPL control packets (DIO/DAO), thus minimizing control exchanges during parent switching and node joining. Optimized slot selection further reduces latency and jitter. Through extensive simulations on the 6TiSCH simulator and under varying network densities and traffic loads, we demonstrate significant improvements over the standard 6TiSCH benchmark in terms of traffic load, joining time, latency, and energy efficiency. These enhancements make the proposed solution suitable for time-sensitive IIoT applications.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108173"},"PeriodicalIF":4.5,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143886573","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 novel joint short-packet transmission in satellite–terrestrial NOMA networks","authors":"Huu Q. Tran","doi":"10.1016/j.comcom.2025.108174","DOIUrl":"10.1016/j.comcom.2025.108174","url":null,"abstract":"<div><div>This paper proposes an innovative communication framework that integrates Non-Orthogonal Multiple Access (NOMA) with satellite and short-packet technologies, addressing the emerging demands of Sixth-Generation (6G) networks. A dedicated transmission channel model for short-packets in Satellite–Terrestrial NOMA networks is introduced, which tackles the unique challenges presented by these environments. Through a comprehensive performance analysis, key metrics such as Block Error Rate (BLER), throughput, and goodput are evaluated, enhancing the understanding of system performance under varying conditions. Extensive Monte-Carlo simulations validate the theoretical models, confirming their applicability in real-world scenarios. The findings demonstrate that an increase in the Signal-to-Noise Ratio (SNR) significantly reduces both outage probability and average BLER, highlighting the critical role of SNR in enhancing system reliability. Furthermore, the study reveals that increasing the number of satellite antennas substantially improves system performance, underscoring the importance of antenna configuration. The analysis of blocklength and hardware noise provides essential insights for optimizing system design. Overall, this work offers valuable perspectives for the design and optimization of future communication systems, emphasizing the potential of combining NOMA with satellite and short-packet technologies to enhance performance in next-generation 6G networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108174"},"PeriodicalIF":4.5,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143881543","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":"Community-Oriented Edge Computing Platform","authors":"Abdalla A. Moustafa ,&nbsp;Sara A. Elsayed ,&nbsp;Hossam S. Hassanein","doi":"10.1016/j.comcom.2025.108179","DOIUrl":"10.1016/j.comcom.2025.108179","url":null,"abstract":"<div><div>Democratizing the edge by capitalizing the underutilized computational resources of end devices, referred to as Extreme Edge Devices (EEDs), can foster various IoT applications. In this paper, we propose the Community Edge Platform (CEP). CEP is the first platform that exploits business, institutional, and social relationships to build communities of requesters and EEDs to eliminate recruitment costs and preserve privacy in EED-enabled environments. CEP promotes service-for-service exchange and utilizes a hierarchical control paradigm to prioritize the enrollment of nearby devices as workers. CEP also considers the fact that community-imposed constraints can lead to unbalanced work distribution. To alleviate this issue, we propose the Community-Oriented Resource Allocation (CORA) scheme. CORA accounts for community restrictions and strives to minimize the execution time and makespan while retaining a reasonable scheduler runtime. Towards that end, we formulate the resource allocation problem as a Bipartite Graph Matching problem. Comprehensive qualitative evaluations demonstrate the superiority of CEP compared to 12 prominent edge computing platforms in terms of various system architecture and performance features. Additionally, extensive simulations show that CORA outperforms six prominent resource allocation schemes by up to 44% and 7% in terms of makespan and execution time, respectively, while achieving a much faster runtime, outperforming the best of the six baseline resource allocation schemes by a factor of six.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"239 ","pages":"Article 108179"},"PeriodicalIF":4.5,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143906240","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":"Exploiting O-RAN neutral hosting for first responders connectivity in emergency scenarios","authors":"A. Piccioni ,&nbsp;A. Marotta ,&nbsp;C. Rinaldi ,&nbsp;C. Centofanti ,&nbsp;K. Kondepu ,&nbsp;D. Cassioli ,&nbsp;F. Graziosi","doi":"10.1016/j.comcom.2025.108188","DOIUrl":"10.1016/j.comcom.2025.108188","url":null,"abstract":"<div><div>Ensuring seamless connectivity for first responders represents a critical issue in emergency scenarios, where disrupted infrastructures and network congestion can significantly hinder the communication. Open Radio Access Network (O-RAN) promises a level of openness in Radio Access Networks (RANs) that could be advantageous under such critical conditions, allowing for enhanced integration across different operators’ networks to mitigate resource scarcity. This paper introduces an architectural solution based on O-RAN that leverages neutral hosting to provide a unified gateway to RAN infrastructures. Our approach facilitates seamless access for emergency responders and optimizes the allocation of resources at both the RAN and Core levels within a specified area by exploiting the deployment of near-real-time Applications (xApps) and non-real-time Applications (rApps) managed by the neutral host. The results demonstrate the effectiveness of O-RAN neutral hosting in enhancing first responders’ connectivity, showcasing significant improvements in throughput and latency, especially under disaster scenarios.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108188"},"PeriodicalIF":4.5,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143881545","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":"Allocation of computing resources based on multi-objective strategy and performance improvement in 5G networks","authors":"Qinghui Yuan,&nbsp;Zhiyong Liu,&nbsp;Xueying Jiang,&nbsp;Huijin Hu,&nbsp;Yunpeng Yang,&nbsp;Juxiao Li","doi":"10.1016/j.comcom.2025.108197","DOIUrl":"10.1016/j.comcom.2025.108197","url":null,"abstract":"<div><div>The increase in mobile communication has escalated network load, necessitating more intelligent resource management in 5G and forthcoming networks. This research introduces a novel methodology to enhance network performance by integrating bird swarm optimization (BSO) with deep learning (DL). We investigate a configuration in which several users inside a single cell solicit services from proximate edge servers and remote cloud servers, employing Non-Orthogonal Multiple Access (NOMA) to optimize radio spectrum utilization. BSO, influenced by avian flocking patterns, aggregates users and distributes workloads among servers to reduce energy consumption, service latency, and operational expenses. Simultaneously, DL examines historical network data to forecast traffic and user requirements, enabling BSO to make immediate, educated decisions. We utilize queuing theory to model this system, addressing a complicated optimization problem that concurrently reduces energy, latency, and costs. In contrast to conventional solutions, our technology dynamically adjusts to fluctuating network conditions, providing an effective remedy for the requirements of 5G. Simulations demonstrate that the integrated BSO-DL approach diminishes energy usage, delays, and expenses by around 54 %, substantiating its efficacy in improving broadband performance. This research facilitates the development of more efficient and sustainable 5G networks, addressing the increasing demands of contemporary mobile communication through a scalable and intelligent approach.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"238 ","pages":"Article 108197"},"PeriodicalIF":4.5,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894918","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}