Computer Communications最新文献_第3页

An efficient master head selection for multi-EEG to multi-fog IoT network using 6G-driven FaaS 基于6g驱动FaaS的多eeg到多雾物联网的高效主头选择

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-15 Epub Date: 2026-01-15 DOI: 10.1016/j.comcom.2026.108429

Rupalin Nanda , Sakthivel P. , Rama Krushna Rath , Abhishek Hazra

An Electroencephalogram (EEG) signal plays a vital role in a healthcare communication system for recording the electrical activities of the human brain from the scalp. In recent times, the conventional IoT-based healthcare system uses the cloud computing paradigm to manage time-critical healthcare data. Moreover, switching to the fog computing, the fog-assisted EEG systems are for single EEG applications. However, the use of a fog computing paradigm for a single EEG system is not an efficient solution in terms of resource management and time consumption. Therefore, we introduce a Fog-enabled EEG architecture where multiple fog devices collaboratively process the data in a single integrated IoT platform. As the proposed architecture is new, we focus on developing the mathematical model of the architecture and discuss the crucial aspects. Additionally, we devise a dynamic optimal fog head selection within the network using a weighted multi-criteria decision-making approach. From the simulation, we observe that the average propagation delay is reduced by approximately 95% using 6G-enabled fog computing as compared to the cloud. Further, our method reduces the total delay by 83.87% compared to the existing baseline KCHE technique, showing the effectiveness of this work.

脑电图（EEG）信号在医疗保健通信系统中起着至关重要的作用，用于记录来自头皮的人脑电活动。最近，传统的基于物联网的医疗保健系统使用云计算范式来管理时间关键型医疗保健数据。此外，转向雾计算，雾辅助脑电图系统适用于单脑电图应用。然而，就资源管理和时间消耗而言，对单个EEG系统使用雾计算范式并不是一种有效的解决方案。因此，我们引入了一种支持雾的EEG架构，其中多个雾设备在单个集成物联网平台中协同处理数据。由于所建议的体系结构是新的，我们将重点放在开发体系结构的数学模型并讨论关键方面。此外，我们使用加权多准则决策方法设计了网络内动态最优雾头选择。从模拟中，我们观察到与云计算相比，使用支持6g的雾计算，平均传播延迟减少了约95%。此外，与现有的基线KCHE技术相比，我们的方法减少了83.87%的总延迟，表明了这项工作的有效性。

{"title":"An efficient master head selection for multi-EEG to multi-fog IoT network using 6G-driven FaaS","authors":"Rupalin Nanda , Sakthivel P. , Rama Krushna Rath , Abhishek Hazra","doi":"10.1016/j.comcom.2026.108429","DOIUrl":"10.1016/j.comcom.2026.108429","url":null,"abstract":"<div><div>An Electroencephalogram (EEG) signal plays a vital role in a healthcare communication system for recording the electrical activities of the human brain from the scalp. In recent times, the conventional IoT-based healthcare system uses the cloud computing paradigm to manage time-critical healthcare data. Moreover, switching to the fog computing, the fog-assisted EEG systems are for single EEG applications. However, the use of a fog computing paradigm for a single EEG system is not an efficient solution in terms of resource management and time consumption. Therefore, we introduce a Fog-enabled EEG architecture where multiple fog devices collaboratively process the data in a single integrated IoT platform. As the proposed architecture is new, we focus on developing the mathematical model of the architecture and discuss the crucial aspects. Additionally, we devise a dynamic optimal fog head selection within the network using a weighted multi-criteria decision-making approach. From the simulation, we observe that the average propagation delay is reduced by approximately 95% using 6G-enabled fog computing as compared to the cloud. Further, our method reduces the total delay by 83.87% compared to the existing baseline KCHE technique, showing the effectiveness of this work.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"248 ","pages":"Article 108429"},"PeriodicalIF":4.3,"publicationDate":"2026-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145980580","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}

引用次数: 0

Performance analysis and optimisation of wireless sensor networks with startup times and (V,N)-policy sleep scheduling 具有启动时间和（V，N）策略睡眠调度的无线传感器网络性能分析与优化

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-15 Epub Date: 2026-01-20 DOI: 10.1016/j.comcom.2026.108427

Yongcong Mou , Yinghui Tang , Miaomiao Yu

To effectively conserve energy in wireless sensor networks (WSNs) and reduce packet delay, we propose a (

V, N

)-policy sleep scheme for each sensor node, functioning in four distinct states. We model the sensor node, which incorporates the sleep mechanism, as a discrete-time

G e o / G / 1

vacation queueing system that accounts for startup times and an activation threshold. We first employ a probabilistic analysis technique to conduct a transient analysis of the system, aiming to derive recursive formulas for the steady-state distribution of the number of packets. We further obtain explicit expressions for several essential system performance metrics, including the expected number of packets, mean delay, and average energy cost of the node. The simulation experiments on models with various service time distributions confirm the analytical results, and extensive numerical experiments evaluate the sensitivity of system performance to several parameters. A weighted-sum cost function integrating mean delay and average energy consumption is formulated, and optimal sleep-wake strategies that minimise the weighted sum cost are evaluated across diverse sleep time distributions, service time distributions, weight coefficients, and delay constraints. The results demonstrate the advantages of the

(V, N)

-policy in achieving an ideal equilibrium between energy efficiency and mean delay in WSNs.

为了有效地节省无线传感器网络（WSNs）的能量并降低数据包延迟，我们提出了一种（V，N）策略休眠方案，每个传感器节点在四种不同的状态下工作。我们将包含睡眠机制的传感器节点建模为考虑启动时间和激活阈值的离散时间Geo/G/1假期排队系统。我们首先采用概率分析技术对系统进行暂态分析，旨在推导出包数稳态分布的递归公式。我们进一步得到了几个基本系统性能指标的显式表达式，包括期望的数据包数量、平均延迟和节点的平均能量成本。对不同服役时间分布的模型进行了仿真实验，验证了分析结果，并进行了大量的数值实验，评估了系统性能对多个参数的敏感性。建立了一个积分平均延迟和平均能量消耗的加权和成本函数，并在不同的睡眠时间分布、服务时间分布、权重系数和延迟约束下评估了最小化加权和成本的最佳睡眠-觉醒策略。结果表明，（V，N）策略在WSNs中实现能量效率和平均延迟之间的理想平衡方面具有优势。

{"title":"Performance analysis and optimisation of wireless sensor networks with startup times and (V,N)-policy sleep scheduling","authors":"Yongcong Mou , Yinghui Tang , Miaomiao Yu","doi":"10.1016/j.comcom.2026.108427","DOIUrl":"10.1016/j.comcom.2026.108427","url":null,"abstract":"<div><div>To effectively conserve energy in wireless sensor networks (WSNs) and reduce packet delay, we propose a (<span><math><mrow><mi>V</mi><mo>,</mo><mi>N</mi></mrow></math></span>)-policy sleep scheme for each sensor node, functioning in four distinct states. We model the sensor node, which incorporates the sleep mechanism, as a discrete-time <span><math><mrow><mi>G</mi><mi>e</mi><mi>o</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></mrow></math></span> vacation queueing system that accounts for startup times and an activation threshold. We first employ a probabilistic analysis technique to conduct a transient analysis of the system, aiming to derive recursive formulas for the steady-state distribution of the number of packets. We further obtain explicit expressions for several essential system performance metrics, including the expected number of packets, mean delay, and average energy cost of the node. The simulation experiments on models with various service time distributions confirm the analytical results, and extensive numerical experiments evaluate the sensitivity of system performance to several parameters. A weighted-sum cost function integrating mean delay and average energy consumption is formulated, and optimal sleep-wake strategies that minimise the weighted sum cost are evaluated across diverse sleep time distributions, service time distributions, weight coefficients, and delay constraints. The results demonstrate the advantages of the <span><math><mrow><mo>(</mo><mi>V</mi><mo>,</mo><mi>N</mi><mo>)</mo></mrow></math></span>-policy in achieving an ideal equilibrium between energy efficiency and mean delay in WSNs.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"248 ","pages":"Article 108427"},"PeriodicalIF":4.3,"publicationDate":"2026-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146024173","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}

引用次数: 0

Applying NovaGenesis: A service-oriented, self-organizing, and programmable IoT architecture for LoRa and Wi-Fi-based environmental monitoring 应用NovaGenesis：面向服务、自组织、可编程的物联网架构，用于基于LoRa和wi - fi的环境监测

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-15 Epub Date: 2026-01-10 DOI: 10.1016/j.comcom.2026.108423

Antonio M. Alberti , Epper Bonomo , Rodrigo H. Santos , Victor A. de J. Alberti , Marcelo E. Pellenz , Rodrigo da Rosa Righi

This work integrates NovaGenesis (NG), a clean-slate IoT architecture, with LoRa technology within low-power wide-area networks (LPWAN), extending previous efforts on NG connectivity with Wi-Fi. The research aims to update the embedded version of NG and develop devices for seamless LoRa and Wi-Fi IoT operation. It evaluates NG’s performance on LoRa and Wi-Fi, focusing on throughput, delay, and packet loss. Despite LPWAN limitations, the results show that the NG deployment is feasible, validating its self-organizing IoT life cycle to maintain service continuity between an ESP-32 and a data client. Performance meets the needs of IoT applications in agribusiness, logistics, and smart monitoring. In addition, a 24-hour environmental monitoring experiment was conducted in Santa Rita do Sapucaí(SRS), Minas Gerais, Brazil, where a commercial weather station was modified to integrate NG, allowing accurate collection of temperature, humidity, atmospheric pressure, wind conditions, solar radiation and UV index. The results met expected diurnal patterns in SRS, proving the reliability and precision of the sensors and communication infrastructure. This solution overcomes common IETF IoT stack limitations in devices naming, information provenance, entities identification, programmability via digital twins, programmability, services and devices self-organization, and trust formation, offering a robust platform for varied IoT scenarios in LPWAN environments. These are the key benefits of applying NovaGenesis for LoRa and Wi-Fi-based environmental monitoring.

这项工作将NovaGenesis （NG）这一全新的物联网架构与低功耗广域网（LPWAN）中的LoRa技术集成在一起，扩展了之前在NG连接Wi-Fi方面的努力。该研究旨在更新NG的嵌入式版本，并开发无缝LoRa和Wi-Fi物联网操作的设备。它评估了NG在LoRa和Wi-Fi上的性能，重点关注吞吐量、延迟和数据包丢失。尽管有LPWAN的限制，但结果表明，NG部署是可行的，验证了其自组织物联网生命周期，以保持ESP-32和数据客户端之间的服务连续性。性能满足物联网在农业综合企业、物流和智能监控领域的应用需求。此外，在巴西米纳斯吉拉斯州Santa Rita do Sapucaí（SRS）进行了一项24小时环境监测实验，在那里对一个商业气象站进行了改造，以整合NG，从而能够准确收集温度、湿度、大气压、风况、太阳辐射和紫外线指数。结果符合SRS的预期日模式，证明了传感器和通信基础设施的可靠性和精度。该解决方案克服了常见的IETF物联网堆栈在设备命名、信息来源、实体识别、通过数字双胞胎可编程性、可编程性、服务和设备自组织以及信任形成方面的限制，为LPWAN环境中的各种物联网场景提供了一个强大的平台。这些是将NovaGenesis应用于LoRa和基于wi - fi的环境监测的主要好处。

{"title":"Applying NovaGenesis: A service-oriented, self-organizing, and programmable IoT architecture for LoRa and Wi-Fi-based environmental monitoring","authors":"Antonio M. Alberti , Epper Bonomo , Rodrigo H. Santos , Victor A. de J. Alberti , Marcelo E. Pellenz , Rodrigo da Rosa Righi","doi":"10.1016/j.comcom.2026.108423","DOIUrl":"10.1016/j.comcom.2026.108423","url":null,"abstract":"<div><div>This work integrates NovaGenesis (NG), a clean-slate IoT architecture, with LoRa technology within low-power wide-area networks (LPWAN), extending previous efforts on NG connectivity with Wi-Fi. The research aims to update the embedded version of NG and develop devices for seamless LoRa and Wi-Fi IoT operation. It evaluates NG’s performance on LoRa and Wi-Fi, focusing on throughput, delay, and packet loss. Despite LPWAN limitations, the results show that the NG deployment is feasible, validating its self-organizing IoT life cycle to maintain service continuity between an ESP-32 and a data client. Performance meets the needs of IoT applications in agribusiness, logistics, and smart monitoring. In addition, a 24-hour environmental monitoring experiment was conducted in Santa Rita do Sapucaí(SRS), Minas Gerais, Brazil, where a commercial weather station was modified to integrate NG, allowing accurate collection of temperature, humidity, atmospheric pressure, wind conditions, solar radiation and UV index. The results met expected diurnal patterns in SRS, proving the reliability and precision of the sensors and communication infrastructure. This solution overcomes common IETF IoT stack limitations in devices naming, information provenance, entities identification, programmability via digital twins, programmability, services and devices self-organization, and trust formation, offering a robust platform for varied IoT scenarios in LPWAN environments. These are the key benefits of applying NovaGenesis for LoRa and Wi-Fi-based environmental monitoring.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"248 ","pages":"Article 108423"},"PeriodicalIF":4.3,"publicationDate":"2026-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145980584","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}

引用次数: 0

E-SPLIT: A hierarchical genetic algorithm for energy-efficient distributed AI services E-SPLIT：一种用于节能分布式人工智能服务的分层遗传算法

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2025-11-22 DOI: 10.1016/j.comcom.2025.108371

Lina Magoula, Nikolaos Koursioumpas, Ioannis Stavrakakis, Nancy Alonistioti

As we progress toward a new era of Artificial Intelligence (AI)-enabled wireless networks, the focus shifts to deploying distributed intelligence to enhance network automation, scalability, and responsiveness. Despite its merits, it often leads to resource-intensive deployments, which raise energy concerns. These concerns are further amplified by the limited availability of resource orchestration strategies capable of addressing the multi-faceted nature of distributed AI. This work targets energy consumption minimization of distributed AI services by proposing a custom meta-heuristic, two-tier hierarchical genetic algorithm (HGA) that integrates a divide-and-conquer strategy to provide effective chained decision-making. The first tier of HGA determines the optimal placement of model partitions within an AI service on the underlying network, while the second tier focuses on strategic resource allocation for each partition, ensuring that service latency requirements are met. A safe strategy selection is proposed, applying a custom repair mechanism and a penalty function that discourages constraints violation. Evaluation results show the effectiveness and robustness of the proposed HGA, compared to two state-of-the-art baseline solutions, on different network environments and evaluation scenarios. HGA achieves up to 94.1% decrease in the total energy consumption per service compared to the baselines, while entirely eliminating infeasible strategies.

随着我们向支持人工智能（AI）的无线网络的新时代迈进，重点转移到部署分布式智能以增强网络自动化、可扩展性和响应能力。尽管有其优点，但它经常导致资源密集型部署，从而引起能源问题。能够解决分布式AI的多面性的资源编排策略的有限可用性进一步放大了这些问题。本研究提出了一种自定义的元启发式、两层分层遗传算法（HGA），该算法集成了分而治之的策略，以提供有效的链式决策，以实现分布式人工智能服务的能耗最小化。HGA的第一层确定底层网络上AI服务中模型分区的最佳位置，而第二层侧重于每个分区的战略资源分配，确保满足服务延迟要求。提出了一种安全的策略选择，采用自定义修复机制和惩罚函数来阻止约束的违反。评估结果表明，在不同的网络环境和评估场景下，与两种最先进的基线解决方案相比，所提出的HGA具有有效性和鲁棒性。与基线相比，HGA实现了每次服务总能耗降低94.1%，同时完全消除了不可行的策略。

{"title":"E-SPLIT: A hierarchical genetic algorithm for energy-efficient distributed AI services","authors":"Lina Magoula, Nikolaos Koursioumpas, Ioannis Stavrakakis, Nancy Alonistioti","doi":"10.1016/j.comcom.2025.108371","DOIUrl":"10.1016/j.comcom.2025.108371","url":null,"abstract":"<div><div>As we progress toward a new era of Artificial Intelligence (AI)-enabled wireless networks, the focus shifts to deploying distributed intelligence to enhance network automation, scalability, and responsiveness. Despite its merits, it often leads to resource-intensive deployments, which raise energy concerns. These concerns are further amplified by the limited availability of resource orchestration strategies capable of addressing the multi-faceted nature of distributed AI. This work targets energy consumption minimization of distributed AI services by proposing a custom meta-heuristic, two-tier hierarchical genetic algorithm (HGA) that integrates a divide-and-conquer strategy to provide effective chained decision-making. The first tier of HGA determines the optimal placement of model partitions within an AI service on the underlying network, while the second tier focuses on strategic resource allocation for each partition, ensuring that service latency requirements are met. A safe strategy selection is proposed, applying a custom repair mechanism and a penalty function that discourages constraints violation. Evaluation results show the effectiveness and robustness of the proposed HGA, compared to two state-of-the-art baseline solutions, on different network environments and evaluation scenarios. HGA achieves up to 94.1% decrease in the total energy consumption per service compared to the baselines, while entirely eliminating infeasible strategies.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"246 ","pages":"Article 108371"},"PeriodicalIF":4.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145618716","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}

引用次数: 0

Scalable FSO-enhanced data center networks: A hybrid-optimized topology and expansion path 可扩展的fso增强数据中心网络：混合优化的拓扑和扩展路径

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2025-11-29 DOI: 10.1016/j.comcom.2025.108374

Qian Kong , Jianning Su , Xiaowei Lu , Liming Liu , Guiyuan Zhang , Haijun Yuan

To address the growing traffic demands and scalability challenges in next-generation Data Center Networks (DCNs), this paper proposes and validates a scalable multi-layer topology enhanced with Free-Space Optical (FSO) links and introduces a hybrid strategy framework for its optimization. This framework integrates two complementary strategies: a Deep Reinforcement Learning (DRL)-based Dynamic Degree-Aware Free-Space Optics (DDA-FSO) policy and a greedy heuristic. Building upon this topology and framework, we establish and validate an “Optimal Expansion Path”, a data-driven roadmap for the scalable expansion of DCNs. Packet-level simulations in OMNeT++ confirm that following this path significantly reduces network delay. By validating that the Average Shortest Path Length (ASPL) can serve as an effective proxy for network delay, this study provides a theoretical value for the design and optimization of reconfigurable and scalable DCNs.

为了解决下一代数据中心网络（DCNs）日益增长的流量需求和可扩展性挑战，本文提出并验证了一种可扩展的多层拓扑结构，并引入了一种用于优化的混合策略框架。该框架集成了两种互补策略：基于深度强化学习（DRL）的动态度感知自由空间光学（DDA-FSO）策略和贪婪启发式策略。在此拓扑和框架的基础上，我们建立并验证了“最优扩展路径”，这是一个数据驱动的dcn可扩展路线图。omnet++中的包级模拟证实，遵循此路径可显著减少网络延迟。通过验证平均最短路径长度（ASPL）可以作为网络延迟的有效代理，本研究为可重构和可扩展的DCNs的设计和优化提供了理论价值。

引用次数: 0

User Plane Performance in Beyond 5G Networks: Comprehensive Analysis and Evaluation 超5G网络中的用户平面性能：综合分析与评估

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2025-12-05 DOI: 10.1016/j.comcom.2025.108397

Fridolin Siegmund , Ralf Kundel , Tobias Meuser , Ralf Steinmetz

Emerging applications such as autonomous driving, virtual reality, and smart factories place greater demands on the Quality of Service of existing network infrastructure, particularly radio networks. The current 5th and new 6th generation of cellular networks aim to meet these requirements and provide ubiquitous connectivity to devices with diverse demands. These networks comprise a control plane and a user plane. While the control plane is responsible for managing the network and its devices, the user plane forwards data and directly influences the experienced Quality of Service. A key network function in the user plane is the User Plane Function (UPF), which forwards packets between cellular network devices and the data network, such as the Internet or an edge data center. However, the extent to which existing UPF implementations can provide sufficient Quality of Service for emerging applications remains largely unexplored. In this work, we analyze and compare various UPF implementations from both theoretical and practical perspectives. We consider both software-based and hardware-accelerated implementations and compare them in terms of performance and latency under load. The setup enables up to 10,000 subscriber sessions while enforcing QoS mechanisms such as rate limiting. The evaluation demonstrates that three of the four investigated UPFs provide QoS enforcement, while their latency behavior differs by orders of magnitude depending on the employed technology.

自动驾驶、虚拟现实和智能工厂等新兴应用对现有网络基础设施（尤其是无线网络）的服务质量提出了更高的要求。目前的第5代和新的第6代蜂窝网络旨在满足这些要求，并为具有不同需求的设备提供无处不在的连接。这些网络包括控制平面和用户平面。控制平面负责管理网络及其设备，而用户平面负责转发数据，并直接影响体验到的服务质量。用户平面的一个关键网络功能是UPF (user plane function)，它负责蜂窝网络设备与数据网络（如Internet或边缘数据中心）之间的报文转发。然而，现有的UPF实现在多大程度上能够为新兴的应用程序提供足够的服务质量，这在很大程度上仍未得到探索。在这项工作中，我们从理论和实践的角度分析和比较了各种UPF实现。我们考虑了基于软件和硬件加速的实现，并比较了它们在负载下的性能和延迟。该设置支持多达10,000个订阅者会话，同时强制执行速率限制等QoS机制。评估表明，四个被调查的upf中有三个提供QoS强制，而它们的延迟行为因所采用的技术而异。

{"title":"User Plane Performance in Beyond 5G Networks: Comprehensive Analysis and Evaluation","authors":"Fridolin Siegmund , Ralf Kundel , Tobias Meuser , Ralf Steinmetz","doi":"10.1016/j.comcom.2025.108397","DOIUrl":"10.1016/j.comcom.2025.108397","url":null,"abstract":"<div><div>Emerging applications such as autonomous driving, virtual reality, and smart factories place greater demands on the Quality of Service of existing network infrastructure, particularly radio networks. The current 5th and new 6th generation of cellular networks aim to meet these requirements and provide ubiquitous connectivity to devices with diverse demands. These networks comprise a control plane and a user plane. While the control plane is responsible for managing the network and its devices, the user plane forwards data and directly influences the experienced Quality of Service. A key network function in the user plane is the User Plane Function (UPF), which forwards packets between cellular network devices and the data network, such as the Internet or an edge data center. However, the extent to which existing UPF implementations can provide sufficient Quality of Service for emerging applications remains largely unexplored. In this work, we analyze and compare various UPF implementations from both theoretical and practical perspectives. We consider both software-based and hardware-accelerated implementations and compare them in terms of performance and latency under load. The setup enables up to 10,000 subscriber sessions while enforcing QoS mechanisms such as rate limiting. The evaluation demonstrates that three of the four investigated UPFs provide QoS enforcement, while their latency behavior differs by orders of magnitude depending on the employed technology.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"247 ","pages":"Article 108397"},"PeriodicalIF":4.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145738563","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}

引用次数: 0

A cooperative distributed model to evaluate and optimize task offloading in Mobile Edge Computing 移动边缘计算中任务卸载评估与优化的协作分布式模型

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2025-12-20 DOI: 10.1016/j.comcom.2025.108403

Fabrizio Messina , Domenico Rosaci

This paper proposes a cooperative and distributed framework to evaluate and optimize task offloading in Mobile Edge Computing (MEC). Each agent, representing either a user device or an edge domain, autonomously interacts with others through trust-driven recommendations and cluster formation. The proposed algorithm exploits this information to iteratively increase – and asymptotically converge over time to – the configuration that maximizes the collective utility of edge servers and user devices, i.e., the Average Performance (

A P

), which corresponds to a Nash equilibrium where only reliable agents are rewarded. Two synthetic indicators are introduced to model the main aspects of MEC collaboration: the Quality of Experience (

Q o E

), representing the perceived user-side performance, and the Convenience (

C

), expressing the server-side efficiency and resource cost. Experimental validation, performed over a simulated MEC environment with up to 1000 agents, shows a rapid convergence (within 20 iterations), a stable equilibrium with

A P \approx 0.92

, and robustness to variations in the simulated values of agents’ reliability. The results demonstrate that the proposed distributed algorithm achieves efficient, self-organized coordination among heterogeneous edge entities while maintaining scalability and fairness.

提出了一种协作式分布式框架来评估和优化移动边缘计算（MEC）中的任务卸载。每个代理代表一个用户设备或一个边缘域，通过信任驱动的建议和集群形成自主地与其他代理交互。所提出的算法利用这些信息迭代地增加-并随着时间的推移渐近收敛-最大化边缘服务器和用户设备的集体效用的配置，即平均性能（AP），这对应于纳什均衡，其中只有可靠的代理得到奖励。引入了两个综合指标来对MEC协作的主要方面进行建模：体验质量（QoE），代表感知到的用户端性能，以及便利性(C)，表示服务器端效率和资源成本。在多达1000个代理的模拟MEC环境中进行的实验验证表明，该方法具有快速收敛（在20次迭代内）、稳定的平衡（AP≈0.92）以及对代理可靠性模拟值变化的鲁棒性。结果表明，该算法在保持可扩展性和公平性的同时，实现了异构边缘实体之间高效、自组织的协调。

{"title":"A cooperative distributed model to evaluate and optimize task offloading in Mobile Edge Computing","authors":"Fabrizio Messina , Domenico Rosaci","doi":"10.1016/j.comcom.2025.108403","DOIUrl":"10.1016/j.comcom.2025.108403","url":null,"abstract":"<div><div>This paper proposes a cooperative and distributed framework to evaluate and optimize task offloading in Mobile Edge Computing (MEC). Each agent, representing either a user device or an edge domain, autonomously interacts with others through trust-driven recommendations and cluster formation. The proposed algorithm exploits this information to iteratively increase – and asymptotically converge over time to – the configuration that maximizes the collective utility of edge servers and user devices, i.e., the Average Performance (<span><math><mrow><mi>A</mi><mi>P</mi></mrow></math></span>), which corresponds to a Nash equilibrium where only reliable agents are rewarded. Two synthetic indicators are introduced to model the main aspects of MEC collaboration: the Quality of Experience (<span><math><mrow><mi>Q</mi><mi>o</mi><mi>E</mi></mrow></math></span>), representing the perceived user-side performance, and the Convenience (<span><math><mi>C</mi></math></span>), expressing the server-side efficiency and resource cost. Experimental validation, performed over a simulated MEC environment with up to 1000 agents, shows a rapid convergence (within 20 iterations), a stable equilibrium with <span><math><mrow><mi>A</mi><mi>P</mi><mo>≈</mo><mn>0</mn><mo>.</mo><mn>92</mn></mrow></math></span>, and robustness to variations in the simulated values of agents’ reliability. The results demonstrate that the proposed distributed algorithm achieves efficient, self-organized coordination among heterogeneous edge entities while maintaining scalability and fairness.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"247 ","pages":"Article 108403"},"PeriodicalIF":4.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840944","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}

引用次数: 0

CISF: Consensus-based Information Sharing Framework for robust consistency in UAVs swarm disaster response 基于共识的无人机群灾响应鲁棒一致性信息共享框架

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2026-01-02 DOI: 10.1016/j.comcom.2025.108408

Xuefeng Du , Yanqi Cheng , Li Yin , Ning Tong , Fengqiang Xu , Fengqi Li

In disaster response scenarios, distributed unmanned aerial vehicle (UAV) swarms face substantial challenges in maintaining real-time information consistency due to network instability, communication delays, and potential Byzantine faults. Traditional approaches often fail to balance fault tolerance, communication latency, and task execution efficiency under such dynamic and adversarial conditions. This paper proposes the Consensus-based Information Sharing Framework (CISF), a novel solution specifically designed to ensure information consistency in dynamic disaster environments. CISF integrates a Stratified Parallel Byzantine Fault Tolerance (SPBFT) mechanism — optimized via a dynamic capability-reputation evaluation model — with a Multi-Round Search and Patrol Model (MSPM) based on an improved Cuckoo Search algorithm. MSPM employs a multi-objective fitness function to jointly optimize temporal efficiency, spatial coverage, and task priority, enabling comprehensive area exploration and continuous information validation. Theoretical analysis derives the optimal hierarchical ratio and the maximum fault tolerance threshold for CISF. Simulation results show that CISF maintains 93.8% consistency under Byzantine interference and reduces consensus latency by up to 56.2%, while remaining effective in highly dynamic environments. Overall, this study establishes a robust and efficient framework for achieving real-time, fault-tolerant information consistency in interference-prone UAV networks, offering broad applicability for future swarm-based disaster response systems.

在灾难响应场景中，由于网络不稳定、通信延迟和潜在的拜占庭故障，分布式无人机（UAV）群在保持实时信息一致性方面面临着巨大的挑战。在这种动态和对抗的条件下，传统的方法往往无法平衡容错性、通信延迟和任务执行效率。本文提出了基于共识的信息共享框架（CISF），这是一种专门用于确保动态灾难环境下信息一致性的新解决方案。CISF集成了分层并行拜占庭容错（SPBFT）机制（通过动态能力-声誉评估模型优化）和基于改进布谷鸟搜索算法的多轮搜索和巡逻模型（MSPM）。MSPM采用多目标适应度函数，共同优化时间效率、空间覆盖和任务优先级，实现区域的综合勘探和信息的持续验证。理论分析得出了CISF的最优层次比和最大容错阈值。仿真结果表明，CISF算法在拜占庭干扰下保持了93.8%的一致性，减少了56.2%的共识延迟，同时在高动态环境下仍然有效。总体而言，本研究建立了一个鲁棒且高效的框架，用于在易受干扰的无人机网络中实现实时、容错的信息一致性，为未来基于群体的灾害响应系统提供了广泛的适用性。

{"title":"CISF: Consensus-based Information Sharing Framework for robust consistency in UAVs swarm disaster response","authors":"Xuefeng Du , Yanqi Cheng , Li Yin , Ning Tong , Fengqiang Xu , Fengqi Li","doi":"10.1016/j.comcom.2025.108408","DOIUrl":"10.1016/j.comcom.2025.108408","url":null,"abstract":"<div><div>In disaster response scenarios, distributed unmanned aerial vehicle (UAV) swarms face substantial challenges in maintaining real-time information consistency due to network instability, communication delays, and potential Byzantine faults. Traditional approaches often fail to balance fault tolerance, communication latency, and task execution efficiency under such dynamic and adversarial conditions. This paper proposes the Consensus-based Information Sharing Framework (CISF), a novel solution specifically designed to ensure information consistency in dynamic disaster environments. CISF integrates a Stratified Parallel Byzantine Fault Tolerance (SPBFT) mechanism — optimized via a dynamic capability-reputation evaluation model — with a Multi-Round Search and Patrol Model (MSPM) based on an improved Cuckoo Search algorithm. MSPM employs a multi-objective fitness function to jointly optimize temporal efficiency, spatial coverage, and task priority, enabling comprehensive area exploration and continuous information validation. Theoretical analysis derives the optimal hierarchical ratio and the maximum fault tolerance threshold for CISF. Simulation results show that CISF maintains 93.8% consistency under Byzantine interference and reduces consensus latency by up to 56.2%, while remaining effective in highly dynamic environments. Overall, this study establishes a robust and efficient framework for achieving real-time, fault-tolerant information consistency in interference-prone UAV networks, offering broad applicability for future swarm-based disaster response systems.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"247 ","pages":"Article 108408"},"PeriodicalIF":4.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145925932","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}

引用次数: 0

MetaHeart: Metasurface enabled biometrics camouflage MetaHeart: metassurface启用生物识别伪装

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2025-12-27 DOI: 10.1016/j.comcom.2025.108405

Dora Zivanovic , Jy-Chin Liao , Zhambyl Shaikhanov , Hou-Tong Chen , Chun-Chieh Chang , Sadhvikas Addamane , Daniel M. Mittleman , Edward W. Knightly

Privacy-invading biometrics monitoring is becoming a prominent security threat as modern sensing systems move to higher operating frequencies (mmWave, sub-THz), increasing sensing resolution and accuracy. As such, developing systems that can protect or obfuscate biometrics from adversarial intrusion becomes pivotal to preserving user privacy. In this work, we develop and implement MetaHeart, a real-time biometrics misinformation system based on reflective, programmable metasurfaces and dynamic phase-front manipulation of radar inferences. MetaHeart’s key goal is to prevent the leakage of a legitimate user’s heartbeat biometrics by spoofing fake heartbeat signals at a malicious, radar-equipped, heart rate sensing intruder. We experimentally demonstrate MetaHeart’s ability to fake Alice’s presence when she is not there and to fool Trudy’s inferences even when Alice is present, achieving an overall accuracy above 98%. Finally, we conduct a robustness analysis to determine MetaHeart’s required spatial placement within the intruder’s monitoring area that would allow for effective spoofing.

随着现代传感系统向更高的工作频率（毫米波、次太赫兹）移动，传感分辨率和精度不断提高，侵犯隐私的生物识别监测正成为一个突出的安全威胁。因此，开发能够保护或混淆生物识别技术免受敌对入侵的系统对于保护用户隐私至关重要。在这项工作中，我们开发并实现了MetaHeart，这是一个基于反射、可编程元表面和雷达推断的动态相位前操作的实时生物识别错误信息系统。MetaHeart的主要目标是通过欺骗伪造的心跳信号，防止合法用户的心跳生物识别信息泄露给恶意的、配备雷达的心率感应入侵者。我们通过实验证明，MetaHeart能够在爱丽丝不在场的时候假装她的存在，即使在爱丽丝在场的时候也能欺骗特鲁迪的推断，总体准确率超过98%。最后，我们进行了鲁棒性分析，以确定MetaHeart在入侵者监控区域内所需的空间位置，从而允许有效的欺骗。

{"title":"MetaHeart: Metasurface enabled biometrics camouflage","authors":"Dora Zivanovic , Jy-Chin Liao , Zhambyl Shaikhanov , Hou-Tong Chen , Chun-Chieh Chang , Sadhvikas Addamane , Daniel M. Mittleman , Edward W. Knightly","doi":"10.1016/j.comcom.2025.108405","DOIUrl":"10.1016/j.comcom.2025.108405","url":null,"abstract":"<div><div>Privacy-invading biometrics monitoring is becoming a prominent security threat as modern sensing systems move to higher operating frequencies (mmWave, sub-THz), increasing sensing resolution and accuracy. As such, developing systems that can protect or obfuscate biometrics from adversarial intrusion becomes pivotal to preserving user privacy. In this work, we develop and implement MetaHeart, a real-time biometrics misinformation system based on reflective, programmable metasurfaces and dynamic phase-front manipulation of radar inferences. MetaHeart’s key goal is to prevent the leakage of a legitimate user’s heartbeat biometrics by spoofing fake heartbeat signals at a malicious, radar-equipped, heart rate sensing intruder. We experimentally demonstrate MetaHeart’s ability to fake Alice’s presence when she is not there and to fool Trudy’s inferences even when Alice is present, achieving an overall accuracy above 98%. Finally, we conduct a robustness analysis to determine MetaHeart’s required spatial placement within the intruder’s monitoring area that would allow for effective spoofing.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"247 ","pages":"Article 108405"},"PeriodicalIF":4.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884355","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}

引用次数: 0

Joint design of resource allocation and QoS enhancement via serial optimization in UAV-NOMA communications 基于串行优化的无人机- noma通信资源分配与QoS增强联合设计

IF 4.3 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS

Computer Communications

Pub Date : 2026-02-01 Epub Date: 2025-12-30 DOI: 10.1016/j.comcom.2025.108409

Zhongyu Wang , Yanan Lian , Jie Zeng , Zheng Chang , Tiejun Lv

We investigate the challenges of user pairing, power allocation, and bandwidth allocation problems in unmanned aerial vehicle (UAV) systems that employ nonorthogonal multiple access (NOMA) for communication with multiple ground users. The primary objective is to maximize the system’s achievable transmission rate while ensuring the users’ quality of service (QoS) requirements under a constrained total power budget. Considering the nonconvexity of the original problem and the interdependencies among multiple optimization variables, the problem is decomposed into three subproblems to optimize power and bandwidth allocation. To increase resource utilization and address user pairing challenges, a serial-optimized communication scheme is proposed, which leverages an optimized block coordinate descent (OP-BCD) method to sequentially solve the subproblems. Specifically, the power allocation strategy is optimized using an optimized deep Q-network (DQN) combined with a gradient ascent approach, whereas the intergroup bandwidth is optimized via a sequential least squares programming (SLSQP). Simulation results demonstrate that the proposed group matching method significantly enhances resource utilization and fairness compared to other user pairing strategies. Moreover, the proposed scheme effectively increases the system transmission rate and resource efficiency.

本文研究了采用非正交多址（NOMA）与多个地面用户通信的无人机系统中的用户配对、功率分配和带宽分配问题。主要目标是在有限的总功率预算下，在保证用户服务质量（QoS）需求的同时，最大限度地提高系统可实现的传输速率。考虑到原问题的非凸性和多个优化变量之间的相互依赖性，将问题分解为三个子问题，对功率和带宽分配进行优化。为了提高资源利用率和解决用户配对难题，提出了一种串行优化通信方案，该方案利用优化块坐标下降（OP-BCD）方法对子问题进行顺序求解。具体而言，采用优化的深度q网络（DQN）和梯度上升方法对功率分配策略进行优化，而通过顺序最小二乘规划（SLSQP）对群间带宽进行优化。仿真结果表明，与其他用户配对策略相比，所提出的分组匹配方法显著提高了资源利用率和公平性。此外，该方案有效地提高了系统传输速率和资源效率。

{"title":"Joint design of resource allocation and QoS enhancement via serial optimization in UAV-NOMA communications","authors":"Zhongyu Wang , Yanan Lian , Jie Zeng , Zheng Chang , Tiejun Lv","doi":"10.1016/j.comcom.2025.108409","DOIUrl":"10.1016/j.comcom.2025.108409","url":null,"abstract":"<div><div>We investigate the challenges of user pairing, power allocation, and bandwidth allocation problems in unmanned aerial vehicle (UAV) systems that employ nonorthogonal multiple access (NOMA) for communication with multiple ground users. The primary objective is to maximize the system’s achievable transmission rate while ensuring the users’ quality of service (QoS) requirements under a constrained total power budget. Considering the nonconvexity of the original problem and the interdependencies among multiple optimization variables, the problem is decomposed into three subproblems to optimize power and bandwidth allocation. To increase resource utilization and address user pairing challenges, a serial-optimized communication scheme is proposed, which leverages an optimized block coordinate descent (OP-BCD) method to sequentially solve the subproblems. Specifically, the power allocation strategy is optimized using an optimized deep Q-network (DQN) combined with a gradient ascent approach, whereas the intergroup bandwidth is optimized via a sequential least squares programming (SLSQP). Simulation results demonstrate that the proposed group matching method significantly enhances resource utilization and fairness compared to other user pairing strategies. Moreover, the proposed scheme effectively increases the system transmission rate and resource efficiency.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"247 ","pages":"Article 108409"},"PeriodicalIF":4.3,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145884353","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}

引用次数: 0