Computer Communications最新文献

英文中文

MDTA: An efficient, scalable and fast Multiple Disjoint Tree Algorithm for dynamic environments MDTA：适用于动态环境的高效、可扩展且快速的多叉树算法

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

Computer Communications

Pub Date : 2024-11-02 DOI: 10.1016/j.comcom.2024.107989

Diego Lopez-Pajares , Elisa Rojas , Mankamana Prasad Mishra , Parveen Jindgar , Joaquin Alvarez-Horcajo , Nicolas Manso , Jonathan Desmarais

Emerging applications such as telemedicine, the tactile Internet or live streaming place high demands on low latency to ensure a satisfactory Quality of Experience (QoE). In these scenarios the use of trees can be particularly interesting to efficiently deliver traffic to groups of users because they further enhance network performance by providing redundancy and fault tolerance, ensuring service continuity when network failure or congestion scenarios occur. Furthermore, if trees are isolated from each other (they do not share common communication elements as links and/or nodes), their benefits are further enhanced since events such as failures or congestion in one tree do not affect others. However, the challenge of computing fully disjoint trees (both link- and node-disjoint) introduces significant mathematical complexity, resulting in longer computation times, which negatively impacts latency-sensitive applications.

In this article, we propose a novel algorithm designed to rapidly compute multiple fully (either link- or node-) disjoint trees while maintaining efficiency and scalability, specifically focused on targeting the low-latency requirements of emerging services and applications. The proposed algorithm addresses the complexity of ensuring disjointedness between trees without sacrificing performance. Our solution has been tested in a variety of network environments, including both wired and wireless scenarios.

The results showcase that our proposed method is approximately 100 times faster than existing techniques, while achieving a comparable success rate in terms of number of obtained disjoint trees. This significant improvement in computational speed makes our approach highly suitable for the low-latency requirements of next-generation networks.

远程医疗、触觉互联网或直播流媒体等新兴应用对低延迟提出了很高的要求，以确保令人满意的体验质量（QoE）。在这些应用场景中，使用树形网络向用户群有效传输流量尤为重要，因为树形网络可通过提供冗余和容错功能进一步提高网络性能，确保在网络故障或拥塞情况下服务的连续性。此外，如果树之间相互隔离（它们不共享链路和/或节点等共同通信元素），那么它们的优势就会进一步增强，因为一棵树发生故障或拥塞等事件不会影响到其他树。在本文中，我们提出了一种新型算法，旨在快速计算多个完全（链路或节点）互不相交的树，同时保持效率和可扩展性，特别是针对新兴服务和应用的低延迟要求。所提出的算法在不牺牲性能的前提下，解决了确保树之间不相交的复杂性问题。我们的解决方案已在各种网络环境（包括有线和无线场景）中进行了测试。结果表明，我们提出的方法比现有技术快约 100 倍，同时在获得的不相交树数量方面达到了相当的成功率。计算速度的大幅提升使我们的方法非常适合下一代网络对低延迟的要求。

{"title":"MDTA: An efficient, scalable and fast Multiple Disjoint Tree Algorithm for dynamic environments","authors":"Diego Lopez-Pajares , Elisa Rojas , Mankamana Prasad Mishra , Parveen Jindgar , Joaquin Alvarez-Horcajo , Nicolas Manso , Jonathan Desmarais","doi":"10.1016/j.comcom.2024.107989","DOIUrl":"10.1016/j.comcom.2024.107989","url":null,"abstract":"<div><div>Emerging applications such as telemedicine, the tactile Internet or live streaming place high demands on low latency to ensure a satisfactory Quality of Experience (QoE). In these scenarios the use of trees can be particularly interesting to efficiently deliver traffic to groups of users because they further enhance network performance by providing redundancy and fault tolerance, ensuring service continuity when network failure or congestion scenarios occur. Furthermore, if trees are isolated from each other (they do not share common communication elements as links and/or nodes), their benefits are further enhanced since events such as failures or congestion in one tree do not affect others. However, the challenge of computing fully disjoint trees (both link- and node-disjoint) introduces significant mathematical complexity, resulting in longer computation times, which negatively impacts latency-sensitive applications.</div><div>In this article, we propose a novel algorithm designed to rapidly compute multiple fully (either link- or node-) disjoint trees while maintaining efficiency and scalability, specifically focused on targeting the low-latency requirements of emerging services and applications. The proposed algorithm addresses the complexity of ensuring disjointedness between trees without sacrificing performance. Our solution has been tested in a variety of network environments, including both wired and wireless scenarios.</div><div>The results showcase that our proposed method is approximately 100 times faster than existing techniques, while achieving a comparable success rate in terms of number of obtained disjoint trees. This significant improvement in computational speed makes our approach highly suitable for the low-latency requirements of next-generation networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107989"},"PeriodicalIF":4.5,"publicationDate":"2024-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Safe load balancing in software-defined-networking 软件定义网络的安全负载平衡

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

Computer Communications

Pub Date : 2024-10-29 DOI: 10.1016/j.comcom.2024.107985

Lam Dinh, Pham Tran Anh Quang, Jérémie Leguay

High performance, reliability and safety are crucial properties of any Software-Defined-Networking (SDN) system. Although the use of Deep Reinforcement Learning (DRL) algorithms has been widely studied to improve performance, their practical applications are still limited as they fail to ensure safe operations in exploration and decision-making. To fill this gap, we explore the design of a Control Barrier Function (CBF) on top of Deep Reinforcement Learning (DRL) algorithms for load-balancing. We show that our DRL-CBF approach is capable of meeting safety requirements during training and testing while achieving near-optimal performance in testing. We provide results using two simulators: a flow-based simulator, which is used for proof-of-concept and benchmarking, and a packet-based simulator that implements real protocols and scheduling. Thanks to the flow-based simulator, we compared the performance against the optimal policy, solving a Non Linear Programming (NLP) problem with the SCIP solver. Furthermore, we showed that pre-trained models in the flow-based simulator, which is faster, can be transferred to the packet simulator, which is slower but more accurate, with some fine-tuning. Overall, the results suggest that near-optimal Quality-of-Service (QoS) performance in terms of end-to-end delay can be achieved while safety requirements related to link capacity constraints are guaranteed. In the packet-based simulator, we also show that our DRL-CBF algorithms outperform non-RL baseline algorithms. When the models are fine-tuned over a few episodes, we achieved smoother QoS and safety in training, and similar performance in testing compared to the case where models have been trained from scratch.

高性能、可靠性和安全性是任何软件定义网络（SDN）系统的关键特性。虽然深度强化学习（DRL）算法的使用已被广泛研究，以提高性能，但其实际应用仍然有限，因为它们无法确保探索和决策过程中的安全操作。为了填补这一空白，我们探索在深度强化学习（DRL）算法的基础上设计一种用于负载平衡的控制障碍函数（CBF）。我们的研究表明，我们的 DRL-CBF 方法能够满足训练和测试期间的安全要求，同时在测试中实现接近最优的性能。我们使用两个模拟器提供了结果：一个是用于概念验证和基准测试的基于流量的模拟器，另一个是实现真实协议和调度的基于数据包的模拟器。借助基于流量的模拟器，我们使用 SCIP 解算器解决了一个非线性编程 (NLP) 问题，并与最优策略进行了性能比较。此外，我们还展示了在基于流量的模拟器中预先训练好的模型（速度更快）可以转移到数据包模拟器中（速度更慢但更精确），只需进行一些微调即可。总之，结果表明，在保证与链路容量限制相关的安全要求的同时，可以实现接近最优的端到端延迟服务质量（QoS）性能。在基于数据包的模拟器中，我们还显示 DRL-CBF 算法优于非 RL 基准算法。当模型经过几次微调后，我们在训练中实现了更平滑的服务质量和安全性，在测试中的表现与从头开始训练模型的情况类似。

{"title":"Safe load balancing in software-defined-networking","authors":"Lam Dinh, Pham Tran Anh Quang, Jérémie Leguay","doi":"10.1016/j.comcom.2024.107985","DOIUrl":"10.1016/j.comcom.2024.107985","url":null,"abstract":"<div><div>High performance, reliability and safety are crucial properties of any Software-Defined-Networking (SDN) system. Although the use of Deep Reinforcement Learning (DRL) algorithms has been widely studied to improve performance, their practical applications are still limited as they fail to ensure safe operations in exploration and decision-making. To fill this gap, we explore the design of a Control Barrier Function (CBF) on top of Deep Reinforcement Learning (DRL) algorithms for load-balancing. We show that our DRL-CBF approach is capable of meeting safety requirements during training and testing while achieving near-optimal performance in testing. We provide results using two simulators: a flow-based simulator, which is used for proof-of-concept and benchmarking, and a packet-based simulator that implements real protocols and scheduling. Thanks to the flow-based simulator, we compared the performance against the optimal policy, solving a Non Linear Programming (NLP) problem with the SCIP solver. Furthermore, we showed that pre-trained models in the flow-based simulator, which is faster, can be transferred to the packet simulator, which is slower but more accurate, with some fine-tuning. Overall, the results suggest that near-optimal Quality-of-Service (QoS) performance in terms of end-to-end delay can be achieved while safety requirements related to link capacity constraints are guaranteed. In the packet-based simulator, we also show that our DRL-CBF algorithms outperform non-RL baseline algorithms. When the models are fine-tuned over a few episodes, we achieved smoother QoS and safety in training, and similar performance in testing compared to the case where models have been trained from scratch.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107985"},"PeriodicalIF":4.5,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578599","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 hierarchical adaptive federated reinforcement learning for efficient resource allocation and task scheduling in hierarchical IoT network 分层物联网网络中高效资源分配和任务调度的分层自适应联合强化学习

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

Computer Communications

Pub Date : 2024-10-29 DOI: 10.1016/j.comcom.2024.107969

A.S.M. Sharifuzzaman Sagar, Amir Haider, Hyung Seok Kim

The increasing demand for processing numerous data from IoT devices in a hierarchical IoT network drives researchers to propose different resource allocation methods in the edge hosts efficiently. Traditional approaches often compromise on one of these aspects: either prioritizing local decision-making at the edge, which lacks global system insights or centralizing decisions in cloud systems, which raises privacy concerns. Additionally, most solutions do not consider scheduling tasks at the same time to effectively complete the prioritized task accordingly. This study introduces the hierarchical adaptive federated reinforcement learning (HAFedRL) framework for robust resource allocation and task scheduling in hierarchical IoT networks. At the local edge host level, a primal–dual update based deep deterministic policy gradient (DDPG) method is introduced for effective individual task resource allocation and scheduling. Concurrently, the central server utilizes an adaptive multi-objective policy gradient (AMOPG) which integrates a multi-objective policy adaptation (MOPA) with dynamic federated reward aggregation (DFRA) method to allocate resources across connected edge hosts. An adaptive learning rate modulation (ALRM) is proposed for faster convergence and to ensure high performance output from HAFedRL. Our proposed HAFedRL enables the effective integration of reward from edge hosts, ensuring the alignment of local and global optimization goals. The experimental results of HAFedRL showcase its efficacy in improving system-wide utility, average task completion rate, and optimizing resource utilization, establishing it as a robust solution for hierarchical IoT networks.

在分层物联网网络中处理来自物联网设备的大量数据的需求日益增长，促使研究人员提出了在边缘主机中有效分配资源的不同方法。传统方法通常会在其中一个方面做出妥协：要么优先考虑边缘的本地决策，缺乏对全局系统的洞察力；要么将决策集中在云系统中，引发隐私问题。此外，大多数解决方案都没有考虑同时调度任务，以有效完成相应的优先任务。本研究介绍了分层自适应联合强化学习（HAFedRL）框架，用于在分层物联网网络中进行稳健的资源分配和任务调度。在本地边缘主机层面，引入了一种基于原始-双重更新的深度确定性策略梯度（DDPG）方法，以实现有效的单个任务资源分配和调度。与此同时，中央服务器利用自适应多目标策略梯度（AMOPG），将多目标策略自适应（MOPA）与动态联合奖励聚合（DFRA）方法相结合，在连接的边缘主机间分配资源。为了加快收敛速度并确保 HAFedRL 的高性能输出，我们提出了自适应学习率调制 (ALRM)。我们提出的 HAFedRL 能够有效整合来自边缘主机的奖励，确保局部和全局优化目标的一致性。HAFedRL 的实验结果展示了其在提高全系统效用、平均任务完成率和优化资源利用率方面的功效，并将其确立为分层物联网网络的稳健解决方案。

{"title":"A hierarchical adaptive federated reinforcement learning for efficient resource allocation and task scheduling in hierarchical IoT network","authors":"A.S.M. Sharifuzzaman Sagar, Amir Haider, Hyung Seok Kim","doi":"10.1016/j.comcom.2024.107969","DOIUrl":"10.1016/j.comcom.2024.107969","url":null,"abstract":"<div><div>The increasing demand for processing numerous data from IoT devices in a hierarchical IoT network drives researchers to propose different resource allocation methods in the edge hosts efficiently. Traditional approaches often compromise on one of these aspects: either prioritizing local decision-making at the edge, which lacks global system insights or centralizing decisions in cloud systems, which raises privacy concerns. Additionally, most solutions do not consider scheduling tasks at the same time to effectively complete the prioritized task accordingly. This study introduces the hierarchical adaptive federated reinforcement learning (HAFedRL) framework for robust resource allocation and task scheduling in hierarchical IoT networks. At the local edge host level, a primal–dual update based deep deterministic policy gradient (DDPG) method is introduced for effective individual task resource allocation and scheduling. Concurrently, the central server utilizes an adaptive multi-objective policy gradient (AMOPG) which integrates a multi-objective policy adaptation (MOPA) with dynamic federated reward aggregation (DFRA) method to allocate resources across connected edge hosts. An adaptive learning rate modulation (ALRM) is proposed for faster convergence and to ensure high performance output from HAFedRL. Our proposed HAFedRL enables the effective integration of reward from edge hosts, ensuring the alignment of local and global optimization goals. The experimental results of HAFedRL showcase its efficacy in improving system-wide utility, average task completion rate, and optimizing resource utilization, establishing it as a robust solution for hierarchical IoT networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107969"},"PeriodicalIF":4.5,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655117","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

5G core network control plane: Network security challenges and solution requirements 5G 核心网络控制平面：网络安全挑战和解决方案要求

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

Computer Communications

Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107982

Rajendra Patil , Zixu Tian , Mohan Gurusamy , Joshua McCloud

The control plane of the 5G Core Network (5GCN) is essential for ensuring reliable and high-performance 5G communication. It provides critical network services such as authentication, user credentials, and privacy-sensitive signaling. However, the security threat landscape of the 5GCN control plane has largely expanded and it faces serious security threats from various sources and interfaces. In this paper, we analyze the new features and vulnerabilities of the 5GCN service-based architecture (SBA) with a focus on the control plane. We investigate the network threat surface in the 5GCN and outline potential vulnerabilities in the control plane. We develop a threat model to illustrate the potential threat sources, vulnerable interfaces, possible threats and their impacts. We provide a comprehensive survey of the existing security solutions, identify their challenges and propose possible solution requirements to address the network security challenges in the control plane of 5GCN and beyond.

5G 核心网（5GCN）的控制平面对于确保可靠和高性能的 5G 通信至关重要。它提供关键的网络服务，如身份验证、用户凭证和隐私敏感信令。然而，5GCN 控制平面的安全威胁范围已大大扩展，面临着来自各种来源和接口的严重安全威胁。在本文中，我们分析了 5GCN 基于服务的架构（SBA）的新功能和漏洞，重点关注控制平面。我们调查了 5GCN 中的网络威胁面，并概述了控制平面中的潜在漏洞。我们建立了一个威胁模型来说明潜在的威胁源、易受攻击的接口、可能的威胁及其影响。我们对现有的安全解决方案进行了全面调查，确定了它们所面临的挑战，并提出了可能的解决方案要求，以应对 5GCN 控制平面及其他方面的网络安全挑战。

引用次数: 0

Assessing the Impact of the Burst Size in the FTM Ranging Procedure in COTS Wi-Fi Devices 评估 COTS Wi-Fi 设备 FTM 测距程序中突发大小的影响

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

Computer Communications

Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107980

Enrica Zola, Israel Martin-Escalona

The wide availability of the Wi-Fi infrastructure together with the recent integration of the IEEE 802.11mc capability in common-off-the-shelf (COTS) devices, have contributed to increasing the interest of the research community in the fine time measurement (FTM) technique, which allows two Wi-Fi devices to estimate distances between each other. However, one of the main issues yet to be solved is how it scales with an increasing number of Wi-Fi devices injecting location-specific traffic in the shared medium. While the recently released IEEE 802.11az standard will still take time before being integrated in COTS devices, this paper aims at assessing the impact of the burst size on the ranging performance of COTS Wi-Fi Android devices running release 12. While increasing the burst size is expected to bring higher stability in the observed distance, on the other hand a longer transmission period for location-only purposes may jeopardize the transmission of data traffic among Wi-Fi users. Several models of smartphones and APs, and different frequency bands, have been considered in order to evaluate the behavior of the FTM procedure in real devices, showing that not always the newest or most expensive ones perform better. Also, it is shown that using the minimum burst size significantly decreases the performance and it is thus not recommended. While bursts longer than 8 may no be always supported by all the models and/or frequency bands, the small improvements in ranging estimations obtained when they are used do not always justify the increased location traffic injected in the network.

Wi-Fi 基础设施的广泛应用，以及最近在通用现成（COTS）设备中集成的 IEEE 802.11mc 功能，都有助于提高研究界对精细时间测量（FTM）技术的兴趣，该技术允许两个 Wi-Fi 设备估算彼此间的距离。然而，该技术尚未解决的一个主要问题是，当越来越多的 Wi-Fi 设备在共享介质中注入特定位置的流量时，如何进行扩展。虽然最近发布的 IEEE 802.11az 标准还需要一段时间才能集成到 COTS 设备中，但本文旨在评估突发大小对运行第 12 版的 COTS Wi-Fi Android 设备测距性能的影响。虽然增大突发大小有望提高观测距离的稳定性，但另一方面，出于定位目的而延长传输时间可能会损害 Wi-Fi 用户之间的数据流量传输。为了评估 FTM 程序在实际设备中的表现，我们考虑了多种型号的智能手机和接入点以及不同的频段，结果表明并非最新或最昂贵的设备总是表现更好。此外，研究还表明，使用最小突发大小会大大降低性能，因此不建议使用。虽然所有型号和/或频段可能都不支持长度超过 8 的突发，但在使用这些突发时，测距估算的微小改进并不总能证明在网络中注入的定位流量的增加是合理的。

{"title":"Assessing the Impact of the Burst Size in the FTM Ranging Procedure in COTS Wi-Fi Devices","authors":"Enrica Zola, Israel Martin-Escalona","doi":"10.1016/j.comcom.2024.107980","DOIUrl":"10.1016/j.comcom.2024.107980","url":null,"abstract":"<div><div>The wide availability of the Wi-Fi infrastructure together with the recent integration of the IEEE 802.11mc capability in common-off-the-shelf (COTS) devices, have contributed to increasing the interest of the research community in the fine time measurement (FTM) technique, which allows two Wi-Fi devices to estimate distances between each other. However, one of the main issues yet to be solved is how it scales with an increasing number of Wi-Fi devices injecting location-specific traffic in the shared medium. While the recently released IEEE 802.11az standard will still take time before being integrated in COTS devices, this paper aims at assessing the impact of the burst size on the ranging performance of COTS Wi-Fi Android devices running release 12. While increasing the burst size is expected to bring higher stability in the observed distance, on the other hand a longer transmission period for location-only purposes may jeopardize the transmission of data traffic among Wi-Fi users. Several models of smartphones and APs, and different frequency bands, have been considered in order to evaluate the behavior of the FTM procedure in real devices, showing that not always the newest or most expensive ones perform better. Also, it is shown that using the minimum burst size significantly decreases the performance and it is thus not recommended. While bursts longer than 8 may no be always supported by all the models and/or frequency bands, the small improvements in ranging estimations obtained when they are used do not always justify the increased location traffic injected in the network.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107980"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142571857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Communication-efficient heterogeneous multi-UAV task allocation based on clustering 基于聚类的通信高效异构多无人机任务分配

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

Computer Communications

Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107986

Na Dong, Shuai Liu, Xiaoming Mai

The heterogeneous unmanned aerial vehicle (UAV) system aims to achieve higher-level task coordination and execution by integrating UAVs of different types, functionalities, and scales. Addressing the diverse and complex requirements of tasks, the allocation algorithm for decentralized multi-UAV systems often encounters communication redundancy, leading to the issue of excessive communication overhead. This paper proposes a clustering-based Consensus-Based Bundle Algorithm (Clustering-CBBA), which introduces a novel bundle construction, an improved consensus strategy, and a distance-based UAV grouping approach. Specifically, utilizing the k-means++ method based on distance factors, UAVs are initially partitioned into different clusters, breaking down the large-scale problem into smaller ones. Subsequently, the first UAV in each cluster is designated as the leader UAV. The proposed algorithm can handle multi-UAV tasks by improving the task bundle construction method and consensus algorithm. Additionally, intra-cluster UAVs employ an internal conflict resolution method to gather the latest information, while inter-cluster UAVs use an external conflict resolution method to ensure conflict-free task allocation, continuing until the algorithm converges. Experimental results demonstrate that the proposed method, compared to DMCHBA, G-CBBA, and baseline CBBA, significantly reduces communication overhead across different task scales and UAV quantities. Moreover, it maintains ideal performance regarding task completion and global task reward, showcasing higher efficiency and practicality.

异构无人飞行器（UAV）系统旨在通过整合不同类型、功能和规模的无人飞行器，实现更高层次的任务协调和执行。针对任务需求的多样性和复杂性，分散式多无人机系统的分配算法往往会遇到通信冗余的问题，导致通信开销过大。本文提出了一种基于聚类的共识捆绑算法（Clustering-CBBA），它引入了一种新颖的捆绑构造、一种改进的共识策略和一种基于距离的无人机分组方法。具体来说，利用基于距离因子的 k-means++ 方法，最初将无人飞行器划分为不同的群组，从而将大规模问题分解为更小的问题。随后，每个簇中的第一架无人机被指定为领头无人机。通过改进任务束构建方法和共识算法，拟议算法可以处理多无人机任务。此外，簇内无人机采用内部冲突解决方法收集最新信息，而簇间无人机则采用外部冲突解决方法确保无冲突任务分配，直至算法收敛。实验结果表明，与 DMCHBA、G-CBBA 和基线 CBBA 相比，所提出的方法显著降低了不同任务规模和无人机数量下的通信开销。此外，它在任务完成和全局任务奖励方面保持了理想的性能，展示了更高的效率和实用性。

{"title":"Communication-efficient heterogeneous multi-UAV task allocation based on clustering","authors":"Na Dong, Shuai Liu, Xiaoming Mai","doi":"10.1016/j.comcom.2024.107986","DOIUrl":"10.1016/j.comcom.2024.107986","url":null,"abstract":"<div><div>The heterogeneous unmanned aerial vehicle (UAV) system aims to achieve higher-level task coordination and execution by integrating UAVs of different types, functionalities, and scales. Addressing the diverse and complex requirements of tasks, the allocation algorithm for decentralized multi-UAV systems often encounters communication redundancy, leading to the issue of excessive communication overhead. This paper proposes a clustering-based Consensus-Based Bundle Algorithm (Clustering-CBBA), which introduces a novel bundle construction, an improved consensus strategy, and a distance-based UAV grouping approach. Specifically, utilizing the k-means++ method based on distance factors, UAVs are initially partitioned into different clusters, breaking down the large-scale problem into smaller ones. Subsequently, the first UAV in each cluster is designated as the leader UAV. The proposed algorithm can handle multi-UAV tasks by improving the task bundle construction method and consensus algorithm. Additionally, intra-cluster UAVs employ an internal conflict resolution method to gather the latest information, while inter-cluster UAVs use an external conflict resolution method to ensure conflict-free task allocation, continuing until the algorithm converges. Experimental results demonstrate that the proposed method, compared to DMCHBA, G-CBBA, and baseline CBBA, significantly reduces communication overhead across different task scales and UAV quantities. Moreover, it maintains ideal performance regarding task completion and global task reward, showcasing higher efficiency and practicality.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107986"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593858","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

Achieving manet protection without the use of superfluous fictitious nodes 在不使用多余虚构节点的情况下实现 manet 保护

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

Computer Communications

Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107978

Nadav Schweitzer , Liad Cohen , Tirza Hirst , Amit Dvir , Ariel Stulman

Mobile ad-hoc networks (manets) are everywhere. They are the basis for many current technologies (including vanets, iot, etc.), and used in multiple domains (including military, disaster zones, etc.). For them to function, routing protocols have been defined, taking into account the high mobility of network nodes. These protocols, however, are vulnerable to devastating attacks. Many solutions have been proposed for various attacks, including dcfm (Denial Contradictions with Fictitious nodes Mechanism) for the node isolation and gray-hole variants. In this work we present a refinement for dcfm, calculate its cost, and compare alternative algorithms. It will be shown that the entire fictitious mechanism is superfluous for some required security level. Examination of the results when under attack show that using dcfm’s contradiction rules alone achieves the best cost-benefit ratio for networks with and without movement. In terms of packet delivery ratio (pdr), however, the proposed algorithm achieves 93% for a 50-node static network, stabilizing on 100% for 90 nodes and above. When movement is present, the success drops to 67%, which is slightly better than the alternatives examined.

移动 ad-hoc 网络（manets）无处不在。它们是当前许多技术（包括万维网、物联网等）的基础，并应用于多个领域（包括军事、灾区等）。考虑到网络节点的高流动性，路由协议已被定义，以确保其正常运行。然而，这些协议很容易受到毁灭性攻击。针对各种攻击提出了许多解决方案，包括针对节点隔离和灰洞变体的 dcfm（虚构节点拒绝矛盾机制）。在这项工作中，我们提出了 dcfm 的改进方案，计算了其成本，并比较了其他算法。我们将证明，对于某些所需的安全级别，整个虚构机制是多余的。对受到攻击时的结果的研究表明，在有移动和无移动的网络中，仅使用 dcfm 的矛盾规则就能达到最佳的成本效益比。然而，就数据包传送率（pdr）而言，所提出的算法在 50 个节点的静态网络中达到了 93%，在 90 个节点及以上的网络中稳定在 100%。当出现移动时，成功率下降到 67%，略好于所研究的其他算法。

{"title":"Achieving manet protection without the use of superfluous fictitious nodes","authors":"Nadav Schweitzer , Liad Cohen , Tirza Hirst , Amit Dvir , Ariel Stulman","doi":"10.1016/j.comcom.2024.107978","DOIUrl":"10.1016/j.comcom.2024.107978","url":null,"abstract":"<div><div>Mobile ad-hoc networks (<span>manet</span>s) are everywhere. They are the basis for many current technologies (including <span>vanet</span>s, <span>i</span>o<span>t</span>, etc.), and used in multiple domains (including military, disaster zones, etc.). For them to function, routing protocols have been defined, taking into account the high mobility of network nodes. These protocols, however, are vulnerable to devastating attacks. Many solutions have been proposed for various attacks, including <span>dcfm</span> (Denial Contradictions with Fictitious nodes Mechanism) for the node isolation and gray-hole variants. In this work we present a refinement for <span>dcfm</span>, calculate its cost, and compare alternative algorithms. It will be shown that the entire fictitious mechanism is superfluous for some required security level. Examination of the results when under attack show that using <span>dcfm</span>’s contradiction rules alone achieves the best cost-benefit ratio for networks with and without movement. In terms of packet delivery ratio (<span>pdr</span>), however, the proposed algorithm achieves 93% for a 50-node static network, stabilizing on 100% for 90 nodes and above. When movement is present, the success drops to 67%, which is slightly better than the alternatives examined.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107978"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578598","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

Supporting critical downlink traffic in LoRaWAN 支持 LoRaWAN 中的关键下行链路流量

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

Computer Communications

Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107981

Dimitrios Zorbas, Aruzhan Sabyrbek

LoRaWAN, a low-power wide-area network (LPWAN) technology, has been successfully used in the Internet of Things (IoT) industry over the last decade. It is an easy-to-use, long-distance communication protocol combined with minimal power consumption. Supporting critical downlink traffic in LoRaWAN networks is crucial for ensuring the reliable and efficient delivery of essential data in certain actuating applications. However, challenges arise when prioritizing critical downlink traffic, including commands, alerts, and emergency notifications that demand immediate attention from actuating devices. This paper explores strategies to improve downlink traffic delivery in LoRaWAN networks, focusing on enhancing reliability, fairness, and energy efficiency through prioritization techniques and network parameter configurations in the EU868 spectrum. Theoretical as well as simulation results provide insights into the effectiveness of the available solutions for supporting critical downlink traffic in LoRaWAN networks.

LoRaWAN 是一种低功耗广域网（LPWAN）技术，在过去十年中已成功应用于物联网（IoT）行业。它是一种易于使用的长距离通信协议，功耗极低。在某些执行应用中，支持 LoRaWAN 网络中的关键下行链路流量对于确保可靠、高效地传输重要数据至关重要。然而，在确定关键下行链路流量（包括需要执行设备立即关注的命令、警报和紧急通知）的优先级时，会出现一些挑战。本文探讨了改善 LoRaWAN 网络下行链路流量传输的策略，重点是通过 EU868 频谱中的优先级技术和网络参数配置来提高可靠性、公平性和能效。理论和仿真结果有助于深入了解现有解决方案在 LoRaWAN 网络中支持关键下行链路流量的有效性。

引用次数: 0

Editorial special issue: Extended papers from the 18th wireless on-demand Network Systems and Services “WONS 2023” conference 编辑特刊：第 18 届无线按需网络系统与服务 "WONS 2023 "会议的扩展论文

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

Computer Communications

Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107988

Renato Lo Cigno, Stefano Basagni, Paolo Casari

引用次数: 0

Special issue of IFIP Networking 2023 IFIP Networking 2023》特刊

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

Computer Communications

Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107987

Mun Choon Chan, Xavier Gelabert, Violet R. Syrotiuk

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Computer Communications

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀