Computer Communications最新文献_第3页

HMLB: Holonic multi-agent approach for preventive controllers load-balancing in SDN-enabled smart grid HMLB：用于 SDN 智能电网中预防性控制器负载平衡的整体多代理方法

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

Computer Communications

Pub Date : 2024-10-22 DOI: 10.1016/j.comcom.2024.107984

Marjan Keramati, Sauleh Etemedi, Nasser Mozayani

Smart grid networks present advantages like improving reliability, security, scalability, etc. However, designing an efficient communication infrastructure for smart grid networks is a great challenge. This is because of its dependency on proprietary protocols and specific vendors. Software-defined-enabled smart grid (SDN-SG) tackles this problem by incorporating diverse protocols and standards including open source platforms. One of the most important questions in Software-defined Networking (SDN) is the controller placement problem being NP-Hard in nature. Therefore, the predominant goal of this paper is to diminish the time complexity by modeling the controller placement problem based on the holonic multi-agent system. The hierarchical structure of a holonic organization improves the computational complexity through the divide and conquer mechanism. Such an idea also decreases the distributed controllers' synchronization overhead which is an issue in the realm of SDN. On the other hand, the proper functioning of the smart grid has a strict dependency on time-critical services. Accordingly, the controller placement is supposed to be a Quality of Service-aware (QoS-aware) one. Also, intermittent topology changes in the smart grid and the occasional joining and leaving of members result in an unsteady traffic pattern and dynamicity of controller load. This research is a pioneer in providing a QoS-aware and dynamic controller placement mechanism for SDN-SG. Experimental results certify the preponderance of the approach over similar ones concerning computational complexity, packet loss, controllers’ synchronization overhead, and also load-balancing overhead.

智能电网网络具有提高可靠性、安全性和可扩展性等优势。然而，为智能电网网络设计高效的通信基础设施是一项巨大的挑战。这是因为它依赖于专有协议和特定的供应商。软件定义的智能电网（SDN-SG）通过整合各种协议和标准（包括开源平台）来解决这一问题。软件定义网络（SDN）中最重要的问题之一是控制器的安置问题，其本质是 NP-Hard。因此，本文的主要目标是通过对基于整体多代理系统的控制器放置问题建模来降低时间复杂性。整体组织的分层结构通过分而治之的机制提高了计算复杂度。这种想法还能减少分布式控制器的同步开销，而同步开销是 SDN 领域的一个问题。另一方面，智能电网的正常运行严格依赖于时间关键型服务。因此，控制器的布置应该是服务质量感知（QoS-aware）的。此外，智能电网中拓扑结构的间歇性变化以及成员的间歇性加入和退出导致了流量模式的不稳定性和控制器负载的动态性。这项研究开创性地为 SDN-SG 提供了 QoS 感知和动态控制器放置机制。实验结果证明，该方法在计算复杂性、数据包丢失、控制器同步开销以及负载平衡开销方面优于同类方法。

{"title":"HMLB: Holonic multi-agent approach for preventive controllers load-balancing in SDN-enabled smart grid","authors":"Marjan Keramati, Sauleh Etemedi, Nasser Mozayani","doi":"10.1016/j.comcom.2024.107984","DOIUrl":"10.1016/j.comcom.2024.107984","url":null,"abstract":"<div><div>Smart grid networks present advantages like improving reliability, security, scalability, etc. However, designing an efficient communication infrastructure for smart grid networks is a great challenge. This is because of its dependency on proprietary protocols and specific vendors. Software-defined-enabled smart grid (SDN-SG) tackles this problem by incorporating diverse protocols and standards including open source platforms. One of the most important questions in Software-defined Networking (SDN) is the controller placement problem being NP-Hard in nature. Therefore, the predominant goal of this paper is to diminish the time complexity by modeling the controller placement problem based on the holonic multi-agent system. The hierarchical structure of a holonic organization improves the computational complexity through the divide and conquer mechanism. Such an idea also decreases the distributed controllers' synchronization overhead which is an issue in the realm of SDN. On the other hand, the proper functioning of the smart grid has a strict dependency on time-critical services. Accordingly, the controller placement is supposed to be a Quality of Service-aware (QoS-aware) one. Also, intermittent topology changes in the smart grid and the occasional joining and leaving of members result in an unsteady traffic pattern and dynamicity of controller load. This research is a pioneer in providing a QoS-aware and dynamic controller placement mechanism for SDN-SG. Experimental results certify the preponderance of the approach over similar ones concerning computational complexity, packet loss, controllers’ synchronization overhead, and also load-balancing overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107984"},"PeriodicalIF":4.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142551834","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

DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning DAR-DRL：基于深度强化学习的动态自适应路由方法

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

Computer Communications

Pub Date : 2024-10-22 DOI: 10.1016/j.comcom.2024.107983

Zheheng Rao , Yanyan Xu , Ye Yao , Weizhi Meng

Mobile-centric wireless networks offer users a diverse range of services and experiences. However, existing intelligent routing methods often struggle to make suitable routing decisions during dynamic network changes, significantly limiting transmission performance. This paper proposes a dynamic adaptive routing method based on Deep Reinforcement Learning (DAR-DRL) to effectively address these challenges. First, to accurately model network state information in complex and dynamically changing routing tasks, we introduce a link-aware graph learning model (LA-GNN) that efficiently senses network information of varying structures through a hierarchical aggregated message-passing neural network. Second, to ensure routing reliability in dynamic environments, we design a hop-by-hop routing strategy featuring a large acceptance domain and a reliability guarantee reward function. This mechanism adaptively avoids routing holes and loops across various network scenarios while enhancing the robustness of routing under dynamic conditions. Experimental results demonstrate that the proposed DAR-DRL method achieves the network routing task with shorter end-to-end delays, lower packet loss rates, and higher throughput compared to existing mainstream methods across common dynamic network scenarios, including cases with dynamic traffic variations, random link failures (small topology changes), and significant topology alterations.

以移动为中心的无线网络为用户提供了多种多样的服务和体验。然而，现有的智能路由方法往往难以在网络动态变化时做出合适的路由决策，从而大大限制了传输性能。本文提出了一种基于深度强化学习（DAR-DRL）的动态自适应路由方法，以有效应对这些挑战。首先，为准确模拟复杂动态变化路由任务中的网络状态信息，我们引入了链路感知图学习模型（LA-GNN），通过分层聚合消息传递神经网络高效感知不同结构的网络信息。其次，为了确保动态环境中的路由可靠性，我们设计了一种逐跳路由策略，具有较大的接受域和可靠性保证奖励函数。这种机制能在各种网络场景中自适应地避免路由漏洞和环路，同时增强路由在动态条件下的鲁棒性。实验结果表明，与现有的主流方法相比，所提出的 DAR-DRL 方法能在常见的动态网络场景中以更短的端到端延迟、更低的丢包率和更高的吞吐量完成网络路由任务，这些场景包括动态流量变化、随机链路故障（小的拓扑变化）和显著的拓扑变化。

{"title":"DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning","authors":"Zheheng Rao , Yanyan Xu , Ye Yao , Weizhi Meng","doi":"10.1016/j.comcom.2024.107983","DOIUrl":"10.1016/j.comcom.2024.107983","url":null,"abstract":"<div><div>Mobile-centric wireless networks offer users a diverse range of services and experiences. However, existing intelligent routing methods often struggle to make suitable routing decisions during dynamic network changes, significantly limiting transmission performance. This paper proposes a dynamic adaptive routing method based on Deep Reinforcement Learning (DAR-DRL) to effectively address these challenges. First, to accurately model network state information in complex and dynamically changing routing tasks, we introduce a link-aware graph learning model (LA-GNN) that efficiently senses network information of varying structures through a hierarchical aggregated message-passing neural network. Second, to ensure routing reliability in dynamic environments, we design a hop-by-hop routing strategy featuring a large acceptance domain and a reliability guarantee reward function. This mechanism adaptively avoids routing holes and loops across various network scenarios while enhancing the robustness of routing under dynamic conditions. Experimental results demonstrate that the proposed DAR-DRL method achieves the network routing task with shorter end-to-end delays, lower packet loss rates, and higher throughput compared to existing mainstream methods across common dynamic network scenarios, including cases with dynamic traffic variations, random link failures (small topology changes), and significant topology alterations.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107983"},"PeriodicalIF":4.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526125","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 machine learning approach to forecast 5G metrics in a commercial and operational 5G platform: 5G and mobility 预测商用和运营 5G 平台中 5G 指标的机器学习方法：5G 和移动性

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

Computer Communications

Pub Date : 2024-10-21 DOI: 10.1016/j.comcom.2024.107974

Ana Almeida , Pedro Rito , Susana Brás , Filipe Cabral Pinto , Susana Sargento

The demand for more secure, available, reliable, and fast networks emerges in a more interconnected society. In this context, 5G networks aim to transform how we communicate and interact. However, studies using 5G data are sparse since there are only a few number of publicly available 5G datasets (especially about commercial 5G network metrics with real users).

In this work, we analyze the data of a commercial 5G deployment with real users, and propose forecasting techniques to help understand the trends and to manage 5G networks. We propose the creation of a metric to measure the traffic load. We forecast the metric using several machine learning models, and we choose LightGBM as the best approach. We observe that this approach obtains results with a good accuracy, and better than other machine learning approaches, but its performance decreases if the patterns contain unexpected events. Taking advantage of the lower accuracy in the performance, this is used to detect changes in the patterns and manage the network in real-time, supporting network resource elasticity by generating alarms and automating the scaling during these unpredictable fluctuations.

Moreover, we introduce mobility data and integrate it with the previously traffic load metric, understanding its correlation and the prediction of 5G metrics through the use of the mobility data. We show again that LightGBM is the best model in predicting both types of 5G handovers, intra- and inter-gNB handovers, using the mobility information through Radars in the several roads, and lanes, near the 5G cells.

在互联性更强的社会中，对更安全、可用、可靠和快速网络的需求不断涌现。在此背景下，5G 网络旨在改变我们的通信和互动方式。在这项工作中，我们分析了商用 5G 部署的真实用户数据，并提出了预测技术，以帮助理解趋势和管理 5G 网络。我们建议创建一个指标来衡量流量负载。我们使用多种机器学习模型对该指标进行预测，并选择 LightGBM 作为最佳方法。我们发现，这种方法获得的结果准确性较高，优于其他机器学习方法，但如果模式中包含突发事件，其性能就会下降。此外，我们还引入了移动性数据，并将其与之前的流量负载指标相结合，通过使用移动性数据了解其相关性并预测 5G 指标。我们再次证明，LightGBM 是预测两种类型的 5G 切换（GNB 内切换和 GNB 间切换）的最佳模型，它使用了 5G 小区附近几条道路和车道上的雷达提供的移动信息。

{"title":"A machine learning approach to forecast 5G metrics in a commercial and operational 5G platform: 5G and mobility","authors":"Ana Almeida , Pedro Rito , Susana Brás , Filipe Cabral Pinto , Susana Sargento","doi":"10.1016/j.comcom.2024.107974","DOIUrl":"10.1016/j.comcom.2024.107974","url":null,"abstract":"<div><div>The demand for more secure, available, reliable, and fast networks emerges in a more interconnected society. In this context, 5G networks aim to transform how we communicate and interact. However, studies using 5G data are sparse since there are only a few number of publicly available 5G datasets (especially about commercial 5G network metrics with real users).</div><div>In this work, we analyze the data of a commercial 5G deployment with real users, and propose forecasting techniques to help understand the trends and to manage 5G networks. We propose the creation of a metric to measure the traffic load. We forecast the metric using several machine learning models, and we choose LightGBM as the best approach. We observe that this approach obtains results with a good accuracy, and better than other machine learning approaches, but its performance decreases if the patterns contain unexpected events. Taking advantage of the lower accuracy in the performance, this is used to detect changes in the patterns and manage the network in real-time, supporting network resource elasticity by generating alarms and automating the scaling during these unpredictable fluctuations.</div><div>Moreover, we introduce mobility data and integrate it with the previously traffic load metric, understanding its correlation and the prediction of 5G metrics through the use of the mobility data. We show again that LightGBM is the best model in predicting both types of 5G handovers, intra- and inter-gNB handovers, using the mobility information through Radars in the several roads, and lanes, near the 5G cells.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107974"},"PeriodicalIF":4.5,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526129","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

Proactive Scheduling for mmWave Wireless LANs 毫米波无线局域网的主动调度

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

Computer Communications

Pub Date : 2024-10-20 DOI: 10.1016/j.comcom.2024.107979

Ang Deng , Douglas M. Blough

To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.

为了满足日益增长的无线带宽需求，毫米波（mmWave）通信被认为是一种有希望提供 Gbps 吞吐量的技术。然而，由于毫米波信号易受阻塞影响，当用户四处移动时，信道条件会发生快速而显著的变化，应用程序的性能也会随之发生很大的变化。在这种情况下，与传统调度器相比，利用未来数据速率预测的主动调度器有可能显著提高性能。在这项工作中，我们探索了利用移动性预测和一些环境知识来预测未来信道条件的主动调度的可能性。我们提出了一种基于整数线性规划公式的最优主动调度器，为主动调度性能提供了一个上限，同时还提出了一种适合实际应用的贪婪启发式主动调度器。广泛的仿真结果表明，与传统的比例公平调度器相比，主动调度有可能将用户平均数据传输速率提高 35%，而不会损失任何公平性，只会导致抖动的少量增加。结果还显示，高效的主动启发式调度器的性能收益是最优主动调度器的 60% 至 75%。最后，研究结果表明，主动调度性能对移动性预测的质量非常敏感，因此必须使用最先进的移动性预测技术才能充分发挥其潜力。

{"title":"Proactive Scheduling for mmWave Wireless LANs","authors":"Ang Deng , Douglas M. Blough","doi":"10.1016/j.comcom.2024.107979","DOIUrl":"10.1016/j.comcom.2024.107979","url":null,"abstract":"<div><div>To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107979"},"PeriodicalIF":4.5,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142552126","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

Optimizing Key Value Indicators in Intent-Based Networks through Digital Twins aided service orchestration mechanisms 通过数字孪生辅助服务协调机制优化基于意图的网络中的关键价值指标

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

Computer Communications

Pub Date : 2024-10-19 DOI: 10.1016/j.comcom.2024.107977

Federica de Trizio , Giancarlo Sciddurlo , Ilaria Cianci , Giuseppe Piro , Gennaro Boggia

For many years, the orchestration of network resources and services has been addressed by considering homogeneous communication infrastructures and simple Service Level Agreements (SLAs), generally defined through a list of traditional Key Performance Indicators (KPIs). Unfortunately, state-of-the-art solutions risk being quite ineffective for future telecommunication systems. Beyond 5G networks, for instance, are emerging as complex and heterogeneous ecosystems where resources belonging to diverse network domains with evolving capabilities can be dynamically exposed to support much more complex and cross-domain services and applications. At the same time, SLAs will be defined by also considering novel performance demands, including security, economic, and environmental needs. Based on these premises, this work proposes a novel orchestration strategy designed to fulfill service requirements expressed through Key Value Indicators (KVIs), while combining the potentials of both Network Digital Twins and Intent-Based Networking. Leveraging insights from Network Digital Twins, multiple service orchestration options are explored to optimize resource utilization. Simultaneously, Intent-Based Networking is adopted to streamline network management via intents, specifying Beyond 5G requirements through KPIs and KVIs. An optimal orchestration scheme has been conceived through a multi-criteria decision-making algorithm and a many-to-many matching game between domains and service requests mapped into intents, aiming to minimize SLA violations over time. The performance of the conceived solution has been investigated through computer simulations in realistic scenarios. The obtained results clearly highlight its effectiveness and demonstrate that it is able to reduce SLA violations (related to latency, throughput, costs, and cyber risk requirements) by up to 22.44% compared to other baseline techniques.

多年来，网络资源和服务的协调一直是通过考虑同质通信基础设施和简单的服务水平协议（SLA）来解决的，这些协议通常是通过一系列传统的关键性能指标（KPI）来定义的。遗憾的是，对于未来的电信系统而言，最先进的解决方案有可能无法奏效。例如，超越 5G 的网络正在形成一个复杂的异构生态系统，在这个生态系统中，属于不同网络域的资源具有不断发展的能力，可以动态地暴露出来，以支持更加复杂的跨域服务和应用。同时，在定义 SLA 时还要考虑新的性能需求，包括安全、经济和环境需求。基于这些前提，本研究提出了一种新颖的协调策略，旨在满足通过关键价值指标（KVI）表达的服务要求，同时结合网络数字孪生和基于意图的网络的潜力。利用网络数字孪生的洞察力，探索多种服务协调选项，以优化资源利用率。同时，采用基于意图的网络技术，通过意图简化网络管理，通过 KPI 和 KVI 明确超越 5G 的要求。通过多标准决策算法以及映射到意图中的域和服务请求之间的多对多匹配游戏，构想出了一种最佳协调方案，旨在最大限度地减少随着时间推移违反服务水平协议的情况。在现实场景中通过计算机模拟对所构想解决方案的性能进行了研究。所获得的结果清楚地表明了它的有效性，并证明与其他基准技术相比，它能够将违反服务水平协议的情况（与延迟、吞吐量、成本和网络风险要求相关）减少 22.44%。

{"title":"Optimizing Key Value Indicators in Intent-Based Networks through Digital Twins aided service orchestration mechanisms","authors":"Federica de Trizio , Giancarlo Sciddurlo , Ilaria Cianci , Giuseppe Piro , Gennaro Boggia","doi":"10.1016/j.comcom.2024.107977","DOIUrl":"10.1016/j.comcom.2024.107977","url":null,"abstract":"<div><div>For many years, the orchestration of network resources and services has been addressed by considering homogeneous communication infrastructures and simple Service Level Agreements (SLAs), generally defined through a list of traditional Key Performance Indicators (KPIs). Unfortunately, state-of-the-art solutions risk being quite ineffective for future telecommunication systems. Beyond 5G networks, for instance, are emerging as complex and heterogeneous ecosystems where resources belonging to diverse network domains with evolving capabilities can be dynamically exposed to support much more complex and cross-domain services and applications. At the same time, SLAs will be defined by also considering novel performance demands, including security, economic, and environmental needs. Based on these premises, this work proposes a novel orchestration strategy designed to fulfill service requirements expressed through Key Value Indicators (KVIs), while combining the potentials of both Network Digital Twins and Intent-Based Networking. Leveraging insights from Network Digital Twins, multiple service orchestration options are explored to optimize resource utilization. Simultaneously, Intent-Based Networking is adopted to streamline network management via intents, specifying Beyond 5G requirements through KPIs and KVIs. An optimal orchestration scheme has been conceived through a multi-criteria decision-making algorithm and a many-to-many matching game between domains and service requests mapped into intents, aiming to minimize SLA violations over time. The performance of the conceived solution has been investigated through computer simulations in realistic scenarios. The obtained results clearly highlight its effectiveness and demonstrate that it is able to reduce SLA violations (related to latency, throughput, costs, and cyber risk requirements) by up to 22.44% compared to other baseline techniques.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107977"},"PeriodicalIF":4.5,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526126","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

An efficient Proof-of-Authority consensus scheme against cloning attacks 对抗克隆攻击的高效权威证明共识方案

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

Computer Communications

Pub Date : 2024-10-18 DOI: 10.1016/j.comcom.2024.107975

Shu-Ping Lu , Chin-Laung Lei , Meng-Han Tsai

Proof-of-Authorization (PoA) consensus algorithms are widely used in permissioned blockchain networks due to their high throughput, security, and efficiency. However, PoA is susceptible to cloning attacks, where attackers copy the authenticator identity and key, thereby compromising the consensus integrity. This study proposes a novel randomized authenticator within the PoA framework to mitigate cloning attacks and solve the leader selection bottleneck. The main contributions include 1) Introducing unpredictability in leader selection through Verifiable Random Functions (VRFs) to prevent identity duplication.2) Dynamic group management using a hierarchical decentralized architecture of distributed ledgers that balances security and performance.3) Using threshold signatures to avoid a single point of failure among validators.4) Comprehensively analyzing attacks, security, randomness, and availability.5) Evaluating the effectiveness of a randomized authenticator by means of OMNET++ simulations to assess efficiency. By integrating randomness into leader selection and robust consensus design, the approach enables reliable and secure dynamic group management in decentralized networks.

授权证明（PoA）共识算法因其高吞吐量、安全性和高效性而被广泛应用于许可区块链网络中。然而，PoA 容易受到克隆攻击，即攻击者复制验证器身份和密钥，从而破坏共识的完整性。本研究在 PoA 框架内提出了一种新型随机验证器，以缓解克隆攻击，解决领导者选择瓶颈。主要贡献包括：1）通过可验证随机函数（VRF）在领导者选择中引入不可预测性，以防止身份重复；2）使用分布式账本的分层分散架构进行动态组管理，以平衡安全性和性能；3）使用阈值签名以避免验证者之间的单点故障；4）全面分析攻击、安全性、随机性和可用性；5）通过 OMNET++ 模拟评估随机验证器的有效性，以评估效率。通过将随机性整合到领导者选择和稳健共识设计中，该方法实现了分散网络中可靠、安全的动态群组管理。

{"title":"An efficient Proof-of-Authority consensus scheme against cloning attacks","authors":"Shu-Ping Lu , Chin-Laung Lei , Meng-Han Tsai","doi":"10.1016/j.comcom.2024.107975","DOIUrl":"10.1016/j.comcom.2024.107975","url":null,"abstract":"<div><div>Proof-of-Authorization (PoA) consensus algorithms are widely used in permissioned blockchain networks due to their high throughput, security, and efficiency. However, PoA is susceptible to cloning attacks, where attackers copy the authenticator identity and key, thereby compromising the consensus integrity. This study proposes a novel randomized authenticator within the PoA framework to mitigate cloning attacks and solve the leader selection bottleneck. The main contributions include 1) Introducing unpredictability in leader selection through Verifiable Random Functions (VRFs) to prevent identity duplication.2) Dynamic group management using a hierarchical decentralized architecture of distributed ledgers that balances security and performance.3) Using threshold signatures to avoid a single point of failure among validators.4) Comprehensively analyzing attacks, security, randomness, and availability.5) Evaluating the effectiveness of a randomized authenticator by means of OMNET++ simulations to assess efficiency. By integrating randomness into leader selection and robust consensus design, the approach enables reliable and secure dynamic group management in decentralized networks.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107975"},"PeriodicalIF":4.5,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526123","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

Practical and lightweight defense against website fingerprinting 实用轻便的网站指纹识别防御系统

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

Computer Communications

Pub Date : 2024-10-16 DOI: 10.1016/j.comcom.2024.107976

Colman McGuan , Chansu Yu , Kyoungwon Suh

Website fingerprinting is a passive network traffic analysis technique that enables an adversary to identify the website visited by a user despite encryption and the use of privacy services such as Tor. Several website fingerprinting defenses built on top of Tor have been proposed to guarantee a user’s privacy by concealing trace features that are important to classification. However, some of the best defenses incur a high bandwidth and/or latency overhead. To combat this, new defenses have sought to be both lightweight — i.e., introduce a small amount of bandwidth overhead — and zero-delay to real network traffic. This work introduces a novel zero-delay and lightweight website fingerprinting defense, called BRO, which conceals the feature-rich beginning of a trace while still enabling the obfuscation of features deeper into the trace without spreading the padding budget thin. BRO schedules padding with a randomized beta distribution that can skew to both the extreme left and right, keeping the applied padding clustered to a finite portion of a trace. This work specifically targets deep learning attacks, which continue to be among the most accurate website fingerprinting attacks. Results show that BRO outperforms other well-known website fingerprinting defenses, such as FRONT, with similar bandwidth overhead.

网站指纹识别是一种被动网络流量分析技术，它能让对手在加密和使用 Tor 等隐私服务的情况下识别用户访问的网站。在 Tor 的基础上提出了几种网站指纹识别防御技术，通过隐藏对分类很重要的跟踪特征来保证用户的隐私。然而，一些最好的防御方法会产生很高的带宽和/或延迟开销。为了解决这个问题，新的防御系统力求做到轻量级（即引入少量带宽开销）和对真实网络流量零延迟。这项工作引入了一种新型零延迟轻量级网站指纹防御技术，称为 BRO，它可以隐藏跟踪的开头部分丰富的特征，同时还能混淆跟踪的更深处的特征，而不会分散填充预算。BRO 采用随机贝塔分布调度填充，可向极左和极右倾斜，从而将应用的填充集中在轨迹的有限部分。这项工作专门针对深度学习攻击，这种攻击仍然是最准确的网站指纹攻击之一。结果表明，在带宽开销相似的情况下，BRO 的性能优于 FRONT 等其他著名的网站指纹识别防御系统。

{"title":"Practical and lightweight defense against website fingerprinting","authors":"Colman McGuan , Chansu Yu , Kyoungwon Suh","doi":"10.1016/j.comcom.2024.107976","DOIUrl":"10.1016/j.comcom.2024.107976","url":null,"abstract":"<div><div>Website fingerprinting is a passive network traffic analysis technique that enables an adversary to identify the website visited by a user despite encryption and the use of privacy services such as Tor. Several website fingerprinting defenses built on top of Tor have been proposed to guarantee a user’s privacy by concealing trace features that are important to classification. However, some of the best defenses incur a high bandwidth and/or latency overhead. To combat this, new defenses have sought to be both lightweight — i.e., introduce a small amount of bandwidth overhead — and zero-delay to real network traffic. This work introduces a novel zero-delay and lightweight website fingerprinting defense, called BRO, which conceals the feature-rich beginning of a trace while still enabling the obfuscation of features deeper into the trace without spreading the padding budget thin. BRO schedules padding with a randomized beta distribution that can skew to both the extreme left and right, keeping the applied padding clustered to a finite portion of a trace. This work specifically targets deep learning attacks, which continue to be among the most accurate website fingerprinting attacks. Results show that BRO outperforms other well-known website fingerprinting defenses, such as FRONT, with similar bandwidth overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107976"},"PeriodicalIF":4.5,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526124","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

Probing-aided spectrum sensing-based hybrid access strategy for energy harvesting CRNs 基于探测辅助频谱传感的混合接入策略，适用于能量收集 CRN

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

Computer Communications

Pub Date : 2024-10-15 DOI: 10.1016/j.comcom.2024.107973

Xiaoying Liu , Xinyu Kuang , Yuxin Chen , Kechen Zheng , Jia Liu

To address the issues of energy supply and spectrum scarcity in Internet of Things (IoT), energy harvesting (EH) and cognitive radio (CR) technologies have been proposed and widely applied. In EH-CR networks (EH-CRNs), miss detection causes significant energy and time wastage of IoT devices, especially secondary users (SUs), and causes serious interference to primary users (PUs). To alleviate this concern, we propose a probing-aided spectrum sensing (PaSS) model for EH-CRNs, where

M

pairs of PUs and one pair of SUs coexist. The secondary transmitter (ST) harvests energy from the radio frequency (RF) signals of PUs for opportunistic spectrum access. In the PaSS model, probing operation is employed to further confirm the real state of the spectrum that has been sensed as free in order to avoid the waste of time and energy resulting from miss detection. Based on the PaSS model, we propose a novel hybrid access strategy, where the ST’s actions (i.e., sensing, probing, EH, underlay/overlay transmission mode) depend on the belief vector of

M

channels, energy state and data buffer state of the ST. By developing an adjusted double deep Q-network (ADDQN) reinforcement learning algorithm, we aim to find the optimal strategy that minimizes the long-term average number of packet losses (ANPL) and the ANPL minimization problem is an integer programming problem. Simulation results validate the ANPL performance of the ST in the ADDQN-PaSS model, and reveal impacts of network parameters on the performance of the ST, and find that at least 7.9% reduction of ANPL is achieved by using the ADDQN-PaSS model.

为解决物联网（IoT）中的能源供应和频谱稀缺问题，人们提出并广泛应用了能量收集（EH）和认知无线电（CR）技术。在 EH-CR 网络（EH-CRN）中，漏检会造成物联网设备（尤其是二级用户（SU））大量的能源和时间浪费，并对一级用户（PU）造成严重干扰。为了缓解这一问题，我们为 EH-CRNs 提出了一种探测辅助频谱感知（PaSS）模型，在该模型中，M 对 PU 和一对 SU 共存。辅助发射机（ST）从 PU 的射频（RF）信号中获取能量，以实现机会性频谱接入。在 PaSS 模型中，探测操作被用来进一步确认已感知为空闲的频谱的真实状态，以避免漏检造成的时间和能量浪费。基于 PaSS 模型，我们提出了一种新型混合接入策略，ST 的操作（即感知、探测、EH、下叠/上叠传输模式）取决于 M 信道的信念向量、ST 的能量状态和数据缓冲器状态。通过开发调整后的双深度 Q 网络（ADDQN）强化学习算法，我们的目标是找到使长期平均丢包数（ANPL）最小的最优策略，而 ANPL 最小化问题是一个整数编程问题。仿真结果验证了 ST 在 ADDQN-PaSS 模型中的 ANPL 性能，揭示了网络参数对 ST 性能的影响，并发现使用 ADDQN-PaSS 模型至少能降低 7.9% 的 ANPL。

{"title":"Probing-aided spectrum sensing-based hybrid access strategy for energy harvesting CRNs","authors":"Xiaoying Liu , Xinyu Kuang , Yuxin Chen , Kechen Zheng , Jia Liu","doi":"10.1016/j.comcom.2024.107973","DOIUrl":"10.1016/j.comcom.2024.107973","url":null,"abstract":"<div><div>To address the issues of energy supply and spectrum scarcity in Internet of Things (IoT), energy harvesting (EH) and cognitive radio (CR) technologies have been proposed and widely applied. In EH-CR networks (EH-CRNs), miss detection causes significant energy and time wastage of IoT devices, especially secondary users (SUs), and causes serious interference to primary users (PUs). To alleviate this concern, we propose a probing-aided spectrum sensing (PaSS) model for EH-CRNs, where <span><math><mi>M</mi></math></span> pairs of PUs and one pair of SUs coexist. The secondary transmitter (ST) harvests energy from the radio frequency (RF) signals of PUs for opportunistic spectrum access. In the PaSS model, probing operation is employed to further confirm the real state of the spectrum that has been sensed as free in order to avoid the waste of time and energy resulting from miss detection. Based on the PaSS model, we propose a novel hybrid access strategy, where the ST’s actions (i.e., sensing, probing, EH, underlay/overlay transmission mode) depend on the belief vector of <span><math><mi>M</mi></math></span> channels, energy state and data buffer state of the ST. By developing an adjusted double deep Q-network (ADDQN) reinforcement learning algorithm, we aim to find the optimal strategy that minimizes the long-term average number of packet losses (ANPL) and the ANPL minimization problem is an integer programming problem. Simulation results validate the ANPL performance of the ST in the ADDQN-PaSS model, and reveal impacts of network parameters on the performance of the ST, and find that at least 7.9% reduction of ANPL is achieved by using the ADDQN-PaSS model.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107973"},"PeriodicalIF":4.5,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526122","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

Optimizing point-of-sale services in MEC enabled near field wireless communications using multi-agent reinforcement learning 利用多代理强化学习优化支持 MEC 的近场无线通信中的销售点服务

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

Computer Communications

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

Ateeq Ur Rehman , Mashael Maashi , Jamal Alsamri , Hany Mahgoub , Randa Allafi , Ashit Kumar Dutta , Wali Ullah Khan , Ali Nauman

In the next-generation communication system, near-field communication (NFC) is a key enabler of contactless transactions, including mobile payments, ticketing, and access control. With the growing demand for contactless solutions, NFC technology will play a pivotal role in enabling secure and convenient payment experiences across various sectors. In contrast, Internet of Things (IoT) devices such as phones’ Point of Sale (PoS) constitute limited battery life and finite computational resources that act as a bottleneck to doing the authentication in a minimal amount of time. Because of this, it garnered considerable attention in both academic and industrial realms. To overcome this, in this work we consider the Multiple Mobile Edge Computing (MEC) as an effective solution that provides extensive computation to PoS connected to it. To address the above, this work considers the PoS-enabled multi-MEC network to guarantee NFC communication reliably and effectively. For this, we formulate the joint optimization problem to maximize the probability of successful authentication while minimizing the queueing delay by jointly optimizing the computation and communication resources by utilizing a multi-agent reinforcement learning optimization approach. Through extensive simulations based on real-world scenarios, the effectiveness of the proposed approach was demonstrated. The results demonstrate that adjusting the complexity and learning rates of the model, coupled with strategic allocation of edge resources, significantly increased authentication success rates. Furthermore, the optimal allocation strategy was found to be crucial in reducing latency and improving authentication success by approximately 9.75%, surpassing other approaches. This study highlights the importance of resource management in optimizing MEC systems, paving the way for advancements in establishing secure, efficient, and dependable systems within the Internet of Things framework.

在下一代通信系统中，近场通信（NFC）是实现移动支付、票务和门禁等非接触式交易的关键因素。随着人们对非接触式解决方案的需求日益增长，NFC 技术将在各行各业实现安全、便捷的支付体验方面发挥关键作用。相比之下，手机销售点（PoS）等物联网（IoT）设备的电池寿命和计算资源有限，成为在最短时间内完成身份验证的瓶颈。正因为如此，它在学术界和工业界都引起了相当大的关注。为了克服这一问题，我们在这项工作中考虑将多重移动边缘计算（MEC）作为一种有效的解决方案，为与其连接的 PoS 提供大量计算资源。为解决上述问题，本研究考虑了支持 PoS 的多 MEC 网络，以确保 NFC 通信的可靠性和有效性。为此，我们提出了一个联合优化问题，即利用多代理强化学习优化方法，通过联合优化计算和通信资源，最大化成功验证的概率，同时最小化排队延迟。通过基于真实世界场景的大量模拟，证明了所提方法的有效性。结果表明，调整模型的复杂度和学习率，再加上边缘资源的战略性分配，大大提高了认证成功率。此外，研究还发现最优分配策略在减少延迟和提高认证成功率方面发挥了至关重要的作用，成功率提高了约 9.75%，超过了其他方法。这项研究强调了资源管理在优化 MEC 系统中的重要性，为在物联网框架内建立安全、高效、可靠的系统铺平了道路。

{"title":"Optimizing point-of-sale services in MEC enabled near field wireless communications using multi-agent reinforcement learning","authors":"Ateeq Ur Rehman , Mashael Maashi , Jamal Alsamri , Hany Mahgoub , Randa Allafi , Ashit Kumar Dutta , Wali Ullah Khan , Ali Nauman","doi":"10.1016/j.comcom.2024.107962","DOIUrl":"10.1016/j.comcom.2024.107962","url":null,"abstract":"<div><div>In the next-generation communication system, near-field communication (NFC) is a key enabler of contactless transactions, including mobile payments, ticketing, and access control. With the growing demand for contactless solutions, NFC technology will play a pivotal role in enabling secure and convenient payment experiences across various sectors. In contrast, Internet of Things (IoT) devices such as phones’ Point of Sale (PoS) constitute limited battery life and finite computational resources that act as a bottleneck to doing the authentication in a minimal amount of time. Because of this, it garnered considerable attention in both academic and industrial realms. To overcome this, in this work we consider the Multiple Mobile Edge Computing (MEC) as an effective solution that provides extensive computation to PoS connected to it. To address the above, this work considers the PoS-enabled multi-MEC network to guarantee NFC communication reliably and effectively. For this, we formulate the joint optimization problem to maximize the probability of successful authentication while minimizing the queueing delay by jointly optimizing the computation and communication resources by utilizing a multi-agent reinforcement learning optimization approach. Through extensive simulations based on real-world scenarios, the effectiveness of the proposed approach was demonstrated. The results demonstrate that adjusting the complexity and learning rates of the model, coupled with strategic allocation of edge resources, significantly increased authentication success rates. Furthermore, the optimal allocation strategy was found to be crucial in reducing latency and improving authentication success by approximately 9.75%, surpassing other approaches. This study highlights the importance of resource management in optimizing MEC systems, paving the way for advancements in establishing secure, efficient, and dependable systems within the Internet of Things framework.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107962"},"PeriodicalIF":4.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142438243","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

Design of Provably Secure and Lightweight Authentication Protocol for Unmanned Aerial Vehicle systems 为无人机系统设计可证明安全的轻量级认证协议

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

Computer Communications

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

Mohd Shariq , Mauro Conti , Karan Singh , Sanjeev Kumar Dwivedi , Mohammad Abdussami , Ruhul Amin , Mehedi Masud

Drones also called Unmanned Aerial Vehicles (UAVs) have become more prominent in several applications such as package delivery, real-time object detection, tracking, traffic monitoring, security surveillance systems, and many others. As a key member of IoT, the group of Radio Frequency IDentification (RFID) technologies is referred to as Automatic Identification and Data Capturing (AIDC). In particular, RFID technology is becoming a contactless and wireless technique used to automatically identify and track the tagged objects via radio frequency signals. It also has drawn a lot of attention among researchers, scientists, industries, and practitioners due to its broad range of real-world applications in various fields. However, RFID systems face two key concerns related to security and privacy, where an adversary performs eavesdropping, tampering, modification, and even interception of the secret information of the RFID tags, which may cause forgery and privacy problems. In contrast to security and privacy, RFID tags have very limited computational power capability. To deal with these issues, this paper puts forward an RFID-based Lightweight and Provably Secure Authentication Protocol (LPSAP) for Unmanned Aerial Vehicle Systems. The proposed protocol uses secure Physically Unclonable Functions (PUFs), Elliptic-Curve Cryptography (ECC), secure one-way hash, bitwise XOR, and concatenation operations. We use Ouafi and Phan’s formal security model for analyzing security and privacy features such as traceability and mutual authentication. The rigorous informal analysis is carried out which ensures that our proposed protocol achieves various security and privacy features as well as resists various known security attacks. The performance analysis demonstrates that our proposed protocol outperforms other existing protocols. In addition, Scyther and Automated Validation of Internet Security Protocols and Applications (AVISPA) tool simulation results demonstrates that there is no security attack possible within bounds. Therefore, our proposed LPSAP protocol achieves an acceptable high level of security with the least computational, communication, and storage costs on passive RFID tags.

无人机又称无人驾驶飞行器（UAV），在包裹递送、实时物体检测、跟踪、交通监控、安全监控系统等多种应用中的作用日益突出。作为物联网的重要成员，射频识别（RFID）技术被称为自动识别和数据采集（AIDC）。其中，RFID 技术正成为一种非接触式无线技术，用于通过射频信号自动识别和跟踪被标记的物体。由于其在各个领域的广泛实际应用，它也引起了研究人员、科学家、工业界和从业人员的广泛关注。然而，RFID 系统面临着与安全和隐私相关的两个关键问题，即对手对 RFID 标签的秘密信息进行窃听、篡改、修改甚至截获，从而可能导致伪造和隐私问题。与安全和隐私问题相反，RFID 标签的计算能力非常有限。针对这些问题，本文提出了一种基于 RFID 的无人机系统轻量级可证明安全认证协议（LPSAP）。所提出的协议使用了安全的物理不可克隆函数（PUF）、椭圆曲线加密算法（ECC）、安全单向散列、位向 XOR 和连接操作。我们使用 Ouafi 和 Phan 的正式安全模型来分析可追溯性和相互验证等安全和隐私特性。我们进行了严格的非正式分析，确保我们提出的协议能够实现各种安全和隐私特性，并抵御各种已知的安全攻击。性能分析表明，我们提出的协议优于其他现有协议。此外，Scyther 和互联网安全协议与应用自动验证（AVISPA）工具的仿真结果表明，在一定范围内不存在任何安全攻击。因此，我们提出的 LPSAP 协议以最低的计算、通信和存储成本在无源 RFID 标签上实现了可接受的高水平安全性。

{"title":"Design of Provably Secure and Lightweight Authentication Protocol for Unmanned Aerial Vehicle systems","authors":"Mohd Shariq , Mauro Conti , Karan Singh , Sanjeev Kumar Dwivedi , Mohammad Abdussami , Ruhul Amin , Mehedi Masud","doi":"10.1016/j.comcom.2024.107971","DOIUrl":"10.1016/j.comcom.2024.107971","url":null,"abstract":"<div><div>Drones also called Unmanned Aerial Vehicles (UAVs) have become more prominent in several applications such as package delivery, real-time object detection, tracking, traffic monitoring, security surveillance systems, and many others. As a key member of IoT, the group of Radio Frequency IDentification (RFID) technologies is referred to as Automatic Identification and Data Capturing (AIDC). In particular, RFID technology is becoming a contactless and wireless technique used to automatically identify and track the tagged objects via radio frequency signals. It also has drawn a lot of attention among researchers, scientists, industries, and practitioners due to its broad range of real-world applications in various fields. However, RFID systems face two key concerns related to security and privacy, where an adversary performs eavesdropping, tampering, modification, and even interception of the secret information of the RFID tags, which may cause forgery and privacy problems. In contrast to security and privacy, RFID tags have very limited computational power capability. To deal with these issues, this paper puts forward an RFID-based Lightweight and Provably Secure Authentication Protocol (LPSAP) for Unmanned Aerial Vehicle Systems. The proposed protocol uses secure Physically Unclonable Functions (PUFs), Elliptic-Curve Cryptography (ECC), secure one-way hash, bitwise XOR, and concatenation operations. We use Ouafi and Phan’s formal security model for analyzing security and privacy features such as traceability and mutual authentication. The rigorous informal analysis is carried out which ensures that our proposed protocol achieves various security and privacy features as well as resists various known security attacks. The performance analysis demonstrates that our proposed protocol outperforms other existing protocols. In addition, Scyther and Automated Validation of Internet Security Protocols and Applications (AVISPA) tool simulation results demonstrates that there is no security attack possible within bounds. Therefore, our proposed LPSAP protocol achieves an acceptable high level of security with the least computational, communication, and storage costs on passive RFID tags.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107971"},"PeriodicalIF":4.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445513","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