首页 > 最新文献

International Journal of Network Management最新文献

英文 中文
Secure cross‐chain transactions for medical data sharing in blockchain‐based Internet of Medical Things 基于区块链的医疗物联网中医疗数据共享的安全跨链交易
IF 1.5 4区 计算机科学 Q2 Computer Science Pub Date : 2024-05-23 DOI: 10.1002/nem.2279
Bohao Jiang, Chaoyang Li, Yu Tang, Xiangjun Xin
Blockchain technology has greatly promoted the development of the Internet of Medical Things (IoMT) from a centralized form to a distributed form. However, with many independent blockchain‐based IoMT (BIoMT) systems being established by different institutions, these heterogeneous blockchain systems have created a new “data islands” problem. This paper proposes a multi‐chain fusion (MCF) multi‐party governance model based on relay chain technology. The MCF model helps establish cross‐chain interaction and communication among the multiple heterogeneous blockchain systems in different medical institutions through the cross‐chain gateway. Meanwhile, by utilizing the inter‐blockchain transfer protocol (IBTP), the MCF model takes responsibility for legitimacy verification and reliable routing of cross‐chain transactions, thus addressing the “data islands problem” inherent in traditional blockchain‐based medical systems. Then, an elliptic curve signature scheme is adopted to protect user privacy in cross‐chain transactions, which helps establish transaction verification for the MCF model in BIoMT systems. Finally, several experiments are carried out to prove the feasibility of the cross‐chain scheme and the security of the elliptic curve signature scheme, and the performance index of the cross‐chain system is evaluated. The performance results show that the MCF model can provide secure and efficient cross‐chain services for sharing medical data among heterogeneous BIoMT systems, thus addressing the “data islands problem” inherent in traditional blockchain‐based medical systems.
区块链技术极大地推动了医疗物联网(IoMT)从集中式向分布式的发展。然而,由于不同机构建立了许多独立的基于区块链的物联网医疗系统(BIoMT),这些异构的区块链系统造成了新的 "数据孤岛 "问题。本文提出了一种基于中继链技术的多链融合(MCF)多方治理模型。MCF 模型通过跨链网关,帮助不同医疗机构的多个异构区块链系统之间建立跨链交互和通信。同时,MCF 模型利用区块链间传输协议(IBTP),负责跨链交易的合法性验证和可靠路由,从而解决了传统区块链医疗系统固有的 "数据孤岛问题"。然后,采用椭圆曲线签名方案保护跨链交易中的用户隐私,这有助于在 BIoMT 系统中建立 MCF 模型的交易验证。最后,通过多个实验证明了跨链方案的可行性和椭圆曲线签名方案的安全性,并对跨链系统的性能指标进行了评估。性能结果表明,MCF 模型可以为异构 BIoMT 系统之间共享医疗数据提供安全高效的跨链服务,从而解决传统基于区块链的医疗系统固有的 "数据孤岛问题"。
{"title":"Secure cross‐chain transactions for medical data sharing in blockchain‐based Internet of Medical Things","authors":"Bohao Jiang, Chaoyang Li, Yu Tang, Xiangjun Xin","doi":"10.1002/nem.2279","DOIUrl":"https://doi.org/10.1002/nem.2279","url":null,"abstract":"Blockchain technology has greatly promoted the development of the Internet of Medical Things (IoMT) from a centralized form to a distributed form. However, with many independent blockchain‐based IoMT (BIoMT) systems being established by different institutions, these heterogeneous blockchain systems have created a new “data islands” problem. This paper proposes a multi‐chain fusion (MCF) multi‐party governance model based on relay chain technology. The MCF model helps establish cross‐chain interaction and communication among the multiple heterogeneous blockchain systems in different medical institutions through the cross‐chain gateway. Meanwhile, by utilizing the inter‐blockchain transfer protocol (IBTP), the MCF model takes responsibility for legitimacy verification and reliable routing of cross‐chain transactions, thus addressing the “data islands problem” inherent in traditional blockchain‐based medical systems. Then, an elliptic curve signature scheme is adopted to protect user privacy in cross‐chain transactions, which helps establish transaction verification for the MCF model in BIoMT systems. Finally, several experiments are carried out to prove the feasibility of the cross‐chain scheme and the security of the elliptic curve signature scheme, and the performance index of the cross‐chain system is evaluated. The performance results show that the MCF model can provide secure and efficient cross‐chain services for sharing medical data among heterogeneous BIoMT systems, thus addressing the “data islands problem” inherent in traditional blockchain‐based medical systems.","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"11 9","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141106809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Transaction fee mechanisms with farsighted miners 有远见的矿工的交易费用机制
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-21 DOI: 10.1002/nem.2275
Jens Leth Hougaard, Mohsen Pourpouneh, Haiting Han

We investigate the recent fee mechanism EIP1559 of the Ethereum network. Whereas previous studies have focused on myopic miners, we here focus on strategic miners in the sense of miners being able to reason about the future blocks. We derive expressions for optimal miner behavior (in terms of setting block sizes) in the case of two-block foresight and varying degrees of hashing power. Results indicate that a sufficiently large mining pool will have enough hashing power to gain by strategic foresight. We further use a simulation study to examine the impact of both two-block and three-block foresight. In particular, the simulation study indicates that for realistic levels of hashing power, mining pools do not gain from being able to reason more than two blocks ahead. Moreover, even though the presence of strategic miners increases the variation in block sizes and potentially empty blocks, overall system throughput tends to increase slightly compared with myopic mining. We further analyze the effect of varying the base fee updating rule.

我们研究了以太坊网络最近的收费机制 EIP1559。以往的研究主要针对近视型矿工,而我们在此主要针对策略型矿工,即能够推理未来区块的矿工。我们推导出了在两个区块预见和不同程度哈希能力的情况下矿工行为(在设置区块大小方面)的最优表达式。结果表明,一个足够大的矿池将拥有足够的哈希计算能力,从而通过战略预见获得收益。我们还通过模拟研究进一步考察了两区块和三区块预见的影响。模拟研究尤其表明,在哈希计算能力处于现实水平的情况下,矿池并不会从提前两个区块以上的推理中获益。此外,尽管策略矿工的存在增加了区块大小和潜在空区块的变化,但与近视挖矿相比,系统的总体吞吐量往往会略有增加。我们进一步分析了改变基本费用更新规则的效果。
{"title":"Transaction fee mechanisms with farsighted miners","authors":"Jens Leth Hougaard,&nbsp;Mohsen Pourpouneh,&nbsp;Haiting Han","doi":"10.1002/nem.2275","DOIUrl":"10.1002/nem.2275","url":null,"abstract":"<p>We investigate the recent fee mechanism EIP1559 of the Ethereum network. Whereas previous studies have focused on myopic miners, we here focus on strategic miners in the sense of miners being able to reason about the future blocks. We derive expressions for optimal miner behavior (in terms of setting block sizes) in the case of two-block foresight and varying degrees of hashing power. Results indicate that a sufficiently large mining pool will have enough hashing power to gain by strategic foresight. We further use a simulation study to examine the impact of both two-block and three-block foresight. In particular, the simulation study indicates that for realistic levels of hashing power, mining pools do not gain from being able to reason more than two blocks ahead. Moreover, even though the presence of strategic miners increases the variation in block sizes and potentially empty blocks, overall system throughput tends to increase slightly compared with myopic mining. We further analyze the effect of varying the base fee updating rule.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Leveraging Ponzi-like designs in stablecoins 利用稳定币中类似庞氏骗局的设计
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-19 DOI: 10.1002/nem.2277
Shange Fu, Qin Wang, Jiangshan Yu, Shiping Chen

Stablecoin represents a unique subset of cryptocurrencies designed to offer price stability, achieved either through backing by specific assets or by employing algorithms that adjust their supply in response to market demand. In its landscape, algorithmic stablecoin is one special type that is not backed by any asset, and it stands to revolutionize the way a sovereign fiat operates. As implemented, algorithmic stablecoins are poorly stabilized in most cases; their prices easily deviate from the target or even fall into a catastrophic collapse and are as a result often dismissed as a Ponzi scheme. However, what is the essence of Ponzi? In this paper, we try to clarify such a deceptive concept and reveal how algorithmic stablecoin works from a higher level. We find that Ponzi is basically a financial protocol that pays existing investors with funds collected from new ones. Running a Ponzi, however, does not necessarily imply that any participant is in any sense losing out, as long as the game can be perpetually rolled over. Economists call such realization as a rational Ponzi game. We accordingly propose a rational model in the context of algorithmic stablecoin and draw its holding conditions. We apply the model and use historical data to examine if the major types of algorithmic stablecoins meet the criteria for being a rational Ponzi game.

稳定币是加密货币中的一个独特子集,旨在通过特定资产支持或采用算法根据市场需求调整供应来实现价格稳定。算法稳定币是一种没有任何资产支持的特殊类型,它将彻底改变主权法币的运行方式。在大多数情况下,算法稳定币的稳定性很差,其价格很容易偏离目标,甚至陷入灾难性的崩溃,因此常常被视为庞氏骗局。然而,庞氏骗局的本质是什么?在本文中,我们试图澄清这样一个具有欺骗性的概念,并从更高的层面揭示算法稳定币是如何运作的。我们发现,庞氏骗局基本上是一种金融协议,用从新投资者那里收集的资金来支付现有投资者。然而,庞氏骗局的运行并不一定意味着任何参与者在任何意义上都是亏损的,只要游戏可以永久翻转。经济学家称这种实现方式为理性庞氏游戏。因此,我们在算法稳定币的背景下提出了一个理性模型,并得出其持有条件。我们应用该模型并利用历史数据来研究主要类型的算法稳定币是否符合理性庞氏游戏的标准。
{"title":"Leveraging Ponzi-like designs in stablecoins","authors":"Shange Fu,&nbsp;Qin Wang,&nbsp;Jiangshan Yu,&nbsp;Shiping Chen","doi":"10.1002/nem.2277","DOIUrl":"10.1002/nem.2277","url":null,"abstract":"<p>Stablecoin represents a unique subset of cryptocurrencies designed to offer price stability, achieved either through backing by specific assets or by employing algorithms that adjust their supply in response to market demand. In its landscape, algorithmic stablecoin is one special type that is not backed by any asset, and it stands to revolutionize the way a sovereign fiat operates. As implemented, algorithmic stablecoins are poorly stabilized in most cases; their prices easily deviate from the target or even fall into a catastrophic collapse and are as a result often dismissed as a Ponzi scheme. However, what is the essence of Ponzi? In this paper, we try to clarify such a deceptive concept and reveal how algorithmic stablecoin works from a higher level. We find that Ponzi is basically a financial protocol that pays existing investors with funds collected from new ones. Running a Ponzi, however, does not necessarily imply that any participant is in any sense losing out, as long as the game can be perpetually rolled over. Economists call such realization as a <i>rational Ponzi game</i>. We accordingly propose a rational model in the context of algorithmic stablecoin and draw its holding conditions. We apply the model and use historical data to examine if the major types of algorithmic stablecoins meet the criteria for being a rational Ponzi game.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 4","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2277","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141123335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A distributed algorithm with network‐independent step‐size and event‐triggered mechanism for economic dispatch problem 经济调度问题的分布式算法,步长与网络无关,采用事件触发机制
IF 1.5 4区 计算机科学 Q2 Computer Science Pub Date : 2024-05-16 DOI: 10.1002/nem.2276
Baitong Chen, Jianhua Yang, Wei Lu, W. Pedrycz, Changhai Sun
The economic dispatch problem (EDP) poses a significant challenge in energy management for modern power systems, particularly as these systems undergo expansion. This growth escalates the demand for communication resources and increases the risk of communication failures. To address this challenge, we propose a distributed algorithm with network‐independent step sizes and an event‐triggered mechanism, which reduces communication requirements and enhances adaptability. Unlike traditional methods, our algorithm uses network‐independent step sizes derived from each agent's local cost functions, thus eliminating the need for detailed network topology knowledge. The theoretical derivation identifies a range of step size values that depend solely on the objective function's strong convexity and the gradient's Lipschitz continuity. Furthermore, the proposed algorithm is shown to achieve a linear convergence rate, assuming the event triggering threshold criteria are met for linear convergence. Numerical experiments further validate the effectiveness and advantages of our proposed distributed algorithm by demonstrating its ability to maintain good convergence characteristics while reducing communication frequency.
经济调度问题(EDP)对现代电力系统的能源管理提出了重大挑战,尤其是在这些系统不断扩展的情况下。这种增长加剧了对通信资源的需求,并增加了通信故障的风险。为了应对这一挑战,我们提出了一种具有与网络无关的步长和事件触发机制的分布式算法,该算法可降低通信要求并增强适应性。与传统方法不同,我们的算法采用与网络无关的步长,这些步长来自每个代理的本地成本函数,因此无需详细的网络拓扑知识。理论推导确定了一系列步长值,这些值完全取决于目标函数的强凸性和梯度的 Lipschitz 连续性。此外,假设符合线性收敛的事件触发阈值标准,所提出的算法可实现线性收敛率。数值实验进一步验证了我们提出的分布式算法的有效性和优势,证明该算法能够在降低通信频率的同时保持良好的收敛特性。
{"title":"A distributed algorithm with network‐independent step‐size and event‐triggered mechanism for economic dispatch problem","authors":"Baitong Chen, Jianhua Yang, Wei Lu, W. Pedrycz, Changhai Sun","doi":"10.1002/nem.2276","DOIUrl":"https://doi.org/10.1002/nem.2276","url":null,"abstract":"The economic dispatch problem (EDP) poses a significant challenge in energy management for modern power systems, particularly as these systems undergo expansion. This growth escalates the demand for communication resources and increases the risk of communication failures. To address this challenge, we propose a distributed algorithm with network‐independent step sizes and an event‐triggered mechanism, which reduces communication requirements and enhances adaptability. Unlike traditional methods, our algorithm uses network‐independent step sizes derived from each agent's local cost functions, thus eliminating the need for detailed network topology knowledge. The theoretical derivation identifies a range of step size values that depend solely on the objective function's strong convexity and the gradient's Lipschitz continuity. Furthermore, the proposed algorithm is shown to achieve a linear convergence rate, assuming the event triggering threshold criteria are met for linear convergence. Numerical experiments further validate the effectiveness and advantages of our proposed distributed algorithm by demonstrating its ability to maintain good convergence characteristics while reducing communication frequency.","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"25 7","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140969790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving data aggregation achieving completeness of data queries in smart grid 保护隐私的数据聚合实现智能电网数据查询的完整性
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-13 DOI: 10.1002/nem.2273
Xinyang Li, Meng Zhao, Yong Ding, Changsong Yang, Huiyong Wang, Hai Liang, Yujue Wang

In smart grid systems, the control center formulates strategies and provides services by analyzing electricity consumption data. However, ensuring the privacy and security of user data is a critical concern. While traditional data aggregation schemes can provide a certain level of privacy protection for users, they also impose limitations on the control center's access to fine-grained data. To address these challenges, we propose a privacy-preserving data aggregation scheme supporting data query (PAQ). We designed a multi-level data aggregation mechanism based on Paillier semi-homomorphic encryption to achieve efficient aggregation of user data in the control center. Additionally, a data query mechanism based on electricity consumption intervals is introduced, allowing the control center to query aggregated ciphertexts for different user categories from outsourced data on the cloud server. Security analysis demonstrates that PAQ design effectively solves security issues in data aggregation and query processes. Performance analysis indicates that the proposed scheme outperforms existing solutions in terms of efficiency.

在智能电网系统中,控制中心通过分析用电数据来制定策略和提供服务。然而,确保用户数据的隐私和安全是一个至关重要的问题。虽然传统的数据聚合方案可以为用户提供一定程度的隐私保护,但也对控制中心访问细粒度数据造成了限制。为了应对这些挑战,我们提出了一种支持数据查询(PAQ)的隐私保护数据聚合方案。我们设计了一种基于 Paillier 半同态加密的多级数据聚合机制,以实现控制中心对用户数据的有效聚合。此外,我们还引入了基于用电间隔的数据查询机制,使控制中心可以从云服务器上的外包数据中查询不同用户类别的聚合密文。安全分析表明,PAQ 设计有效地解决了数据聚合和查询过程中的安全问题。性能分析表明,所提出的方案在效率方面优于现有解决方案。
{"title":"Privacy-preserving data aggregation achieving completeness of data queries in smart grid","authors":"Xinyang Li,&nbsp;Meng Zhao,&nbsp;Yong Ding,&nbsp;Changsong Yang,&nbsp;Huiyong Wang,&nbsp;Hai Liang,&nbsp;Yujue Wang","doi":"10.1002/nem.2273","DOIUrl":"10.1002/nem.2273","url":null,"abstract":"<p>In smart grid systems, the control center formulates strategies and provides services by analyzing electricity consumption data. However, ensuring the privacy and security of user data is a critical concern. While traditional data aggregation schemes can provide a certain level of privacy protection for users, they also impose limitations on the control center's access to fine-grained data. To address these challenges, we propose a privacy-preserving data aggregation scheme supporting data query (PAQ). We designed a multi-level data aggregation mechanism based on Paillier semi-homomorphic encryption to achieve efficient aggregation of user data in the control center. Additionally, a data query mechanism based on electricity consumption intervals is introduced, allowing the control center to query aggregated ciphertexts for different user categories from outsourced data on the cloud server. Security analysis demonstrates that PAQ design effectively solves security issues in data aggregation and query processes. Performance analysis indicates that the proposed scheme outperforms existing solutions in terms of efficiency.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140941009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance of security options for message protocols: A comparative analysis 信息协议安全选项的性能:比较分析
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-13 DOI: 10.1002/nem.2274
Wesley dos Reis Bezerra, Fernando Koch, Carlos Becker Westphall

We explore the challenges around security configuration and performance while utilizing publish–subscribe protocols in the Internet of Things, edge computing, and fog computing. Issues in security configuration can lead to disruptions and higher operation costs. These issues can be prevented by selecting the appropriate transmission technology for each configuration, considering the variations in sizing, installation, sensor profile, distribution, security, networking, and locality. We introduce a comparative analysis of different configurations around a smart agriculture use case. For that, we implemented a simulation environment to generate datasets relevant to research and compare the results in terms of performance, resource utilization, security, and resilience—focused on authentication process. This analysis provides a blueprint to decision support for fog computing engineers on the best practices around security configurations.

我们探讨了在物联网、边缘计算和雾计算中使用发布-订阅协议时围绕安全配置和性能的挑战。安全配置方面的问题会导致中断和更高的运营成本。考虑到尺寸、安装、传感器配置文件、分布、安全性、网络和位置的变化,为每种配置选择合适的传输技术,就能避免这些问题。我们围绕智能农业用例对不同配置进行了比较分析。为此,我们实施了一个模拟环境,以生成与研究相关的数据集,并在性能、资源利用率、安全性和复原力方面对结果进行比较,重点关注认证过程。这项分析为雾计算工程师在安全配置方面的最佳实践提供了决策支持蓝图。
{"title":"Performance of security options for message protocols: A comparative analysis","authors":"Wesley dos Reis Bezerra,&nbsp;Fernando Koch,&nbsp;Carlos Becker Westphall","doi":"10.1002/nem.2274","DOIUrl":"10.1002/nem.2274","url":null,"abstract":"<p>We explore the challenges around security configuration and performance while utilizing publish–subscribe protocols in the Internet of Things, edge computing, and fog computing. Issues in security configuration can lead to disruptions and higher operation costs. These issues can be prevented by selecting the appropriate transmission technology for each configuration, considering the variations in sizing, installation, sensor profile, distribution, security, networking, and locality. We introduce a comparative analysis of different configurations around a smart agriculture use case. For that, we implemented a simulation environment to generate datasets relevant to research and compare the results in terms of performance, resource utilization, security, and resilience—focused on authentication process. This analysis provides a blueprint to decision support for fog computing engineers on the best practices around security configurations.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140941111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ASMTP: Anonymous secure messaging token-based protocol assisted data security in swarm of unmanned aerial vehicles ASMTP:基于匿名安全信息令牌的协议,辅助无人机群的数据安全
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-10 DOI: 10.1002/nem.2271
Kayalvizhi Manikandan, Ramamoorthy Sriramulu

Swarm of Unmanned Aerial Vehicles (UAVs) broaden the field of application in various fields like military surveillance, crop monitoring in agriculture, combat operations, etc. Unfortunately, they are becoming increasingly susceptible to security attacks, such as jamming, information leakage and spoofing, as they become more common and in more demand. So, there is a wider need for UAVs, which requires the design of strong security procedures to fend off such attacks and security dangers. Even though several studies focused on security aspects, many questions remain unanswered, particularly in the areas of secure UAV-to-UAV communication, support for perfect forward secrecy and non-repudiation. In a battle situation, it is extremely important to close these gaps. The security requirements for the UAV communication protocol in a military setting were the focus of this study. In this paper, we present the issues faced by the UAV swarm, especially during military surveillance operations. To secure the communication link in UAV, a new protocol for UAV Swarm communication is proposed with anonymous secure messaging token-based protocol (ASMTP). The proposed protocol secures UAV-to-base station communication and safeguards the metadata of the sender and receiver nodes. The proposed model maintains the confidentiality, integrity and availability of data in the UAV Swarm and achieves robustness. In addition, it provides a different strategy for the cybersecurity gaps in the swarm of UAVs during military surveillance and combat operations.

成群的无人驾驶飞行器(UAVs)拓宽了军事侦察、农业作物监测、作战行动等各个领域的应用范围。遗憾的是,随着无人飞行器的普及和需求的增加,它们越来越容易受到干扰、信息泄露和欺骗等安全攻击。因此,对无人机的需求更加广泛,这就需要设计强大的安全程序来抵御此类攻击和安全危险。尽管有多项研究侧重于安全方面,但许多问题仍未得到解答,特别是在无人机与无人机之间的安全通信、支持完美的前向保密和不可抵赖性方面。在战斗情况下,弥补这些差距极为重要。军事环境下无人机通信协议的安全要求是本研究的重点。在本文中,我们介绍了无人机群面临的问题,特别是在军事侦察行动中。为了确保无人机通信链路的安全,我们提出了一种基于匿名安全信息令牌协议(ASMTP)的无人机群通信新协议。该协议可确保无人机与基站之间的通信安全,并保护发送方和接收方节点的元数据。所提出的模型可保持无人机群中数据的机密性、完整性和可用性,并实现稳健性。此外,它还为军事侦察和作战行动中无人机群的网络安全缺口提供了一种不同的策略。
{"title":"ASMTP: Anonymous secure messaging token-based protocol assisted data security in swarm of unmanned aerial vehicles","authors":"Kayalvizhi Manikandan,&nbsp;Ramamoorthy Sriramulu","doi":"10.1002/nem.2271","DOIUrl":"10.1002/nem.2271","url":null,"abstract":"<p>Swarm of Unmanned Aerial Vehicles (UAVs) broaden the field of application in various fields like military surveillance, crop monitoring in agriculture, combat operations, etc. Unfortunately, they are becoming increasingly susceptible to security attacks, such as jamming, information leakage and spoofing, as they become more common and in more demand. So, there is a wider need for UAVs, which requires the design of strong security procedures to fend off such attacks and security dangers. Even though several studies focused on security aspects, many questions remain unanswered, particularly in the areas of secure UAV-to-UAV communication, support for perfect forward secrecy and non-repudiation. In a battle situation, it is extremely important to close these gaps. The security requirements for the UAV communication protocol in a military setting were the focus of this study. In this paper, we present the issues faced by the UAV swarm, especially during military surveillance operations. To secure the communication link in UAV, a new protocol for UAV Swarm communication is proposed with anonymous secure messaging token-based protocol (ASMTP). The proposed protocol secures UAV-to-base station communication and safeguards the metadata of the sender and receiver nodes. The proposed model maintains the confidentiality, integrity and availability of data in the UAV Swarm and achieves robustness. In addition, it provides a different strategy for the cybersecurity gaps in the swarm of UAVs during military surveillance and combat operations.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140941110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-protected object detection through trustworthy image fusion 通过可信图像融合进行受隐私保护的物体检测
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-09 DOI: 10.1002/nem.2270
Chao Zhang, Jinmei Zhang, Lijun Yun, Jun Zhang, Junbo Su

The neural network-based technologies have emerged as a potent method for image fusion, object detection, and other computer vision tasks as the rapid development of deep learning. Multi-band infrared images, in particular, capture a more extensive range of radiation details and information compared to conventional single-band infrared images. Consequently, the fusion of multi-band infrared images can provide more features for object detection. However, it is crucial to consider that infrared images may contain sensitive information, potentially leading to privacy concerns. Ensuring datasets privacy protection plays a crucial role in the fusion and tracking process. To address both the need for improved detection performance and the necessity for privacy protection in the infrared environment, we proposed a procedure for object detection based on multi-band infrared image datasets and utilized the transfer learning technique to migrate knowledge learned from external infrared data to internal infrared data, thereby training the infrared image fusion model and detection model. The procedure consists of several steps: (1) data preprocessing of multi-band infrared images, (2) multi-band infrared image fusion, and (3) object detection. Standard evaluation metrics for image fusion and object detection ensure the authenticity of the experiments. The comprehensive validation experiments demonstrate the effectiveness of the proposed procedure in object detection tasks. Furthermore, the transfer learning can train our datasets and update the model without exposing the original data. This aspect of transfer learning is particularly beneficial for maintaining the privacy of multi-band infrared images during the fusion and detection processes.

随着深度学习的快速发展,基于神经网络的技术已成为图像融合、物体检测和其他计算机视觉任务的有效方法。与传统的单波段红外图像相比,多波段红外图像能捕捉到更多的辐射细节和信息。因此,多波段红外图像的融合可以为物体检测提供更多特征。然而,必须考虑到红外图像可能包含敏感信息,从而可能导致隐私问题。确保数据集的隐私保护在融合和跟踪过程中起着至关重要的作用。为了同时解决红外环境下提高检测性能和保护隐私的需要,我们提出了一种基于多波段红外图像数据集的物体检测程序,并利用迁移学习技术将从外部红外数据中学到的知识迁移到内部红外数据,从而训练红外图像融合模型和检测模型。该过程包括以下几个步骤(1) 多波段红外图像的数据预处理,(2) 多波段红外图像融合,以及 (3) 目标检测。图像融合和物体检测的标准评估指标确保了实验的真实性。综合验证实验证明了所提出的程序在物体检测任务中的有效性。此外,迁移学习可以训练我们的数据集,并在不暴露原始数据的情况下更新模型。在融合和检测过程中,转移学习的这一特性尤其有利于维护多波段红外图像的隐私。
{"title":"Privacy-protected object detection through trustworthy image fusion","authors":"Chao Zhang,&nbsp;Jinmei Zhang,&nbsp;Lijun Yun,&nbsp;Jun Zhang,&nbsp;Junbo Su","doi":"10.1002/nem.2270","DOIUrl":"10.1002/nem.2270","url":null,"abstract":"<p>The neural network-based technologies have emerged as a potent method for image fusion, object detection, and other computer vision tasks as the rapid development of deep learning. Multi-band infrared images, in particular, capture a more extensive range of radiation details and information compared to conventional single-band infrared images. Consequently, the fusion of multi-band infrared images can provide more features for object detection. However, it is crucial to consider that infrared images may contain sensitive information, potentially leading to privacy concerns. Ensuring datasets privacy protection plays a crucial role in the fusion and tracking process. To address both the need for improved detection performance and the necessity for privacy protection in the infrared environment, we proposed a procedure for object detection based on multi-band infrared image datasets and utilized the transfer learning technique to migrate knowledge learned from external infrared data to internal infrared data, thereby training the infrared image fusion model and detection model. The procedure consists of several steps: (1) data preprocessing of multi-band infrared images, (2) multi-band infrared image fusion, and (3) object detection. Standard evaluation metrics for image fusion and object detection ensure the authenticity of the experiments. The comprehensive validation experiments demonstrate the effectiveness of the proposed procedure in object detection tasks. Furthermore, the transfer learning can train our datasets and update the model without exposing the original data. This aspect of transfer learning is particularly beneficial for maintaining the privacy of multi-band infrared images during the fusion and detection processes.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140941079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Workload prediction based on improved error correlation logistic regression algorithm and Cross‐TRCN of spatiotemporal neural network 基于改进的误差相关逻辑回归算法和时空神经网络 Cross-TRCN 的工作量预测
IF 1.5 4区 计算机科学 Q2 Computer Science Pub Date : 2024-04-29 DOI: 10.1002/nem.2272
Xin Wan, Xiang Huang, Fuzhi Wang
In view of the randomness of user network usage behavior in data centers, which leads to a large randomness in power load, and considering that a single randomness processing method is usually difficult to fully characterize the uncertain characteristics of the system, this paper proposes a dual fusion prediction analysis model based on an improved error correlation logic regression algorithm and a novel spatiotemporal neural network structure called Cross‐TRCN. Two weight coefficients λ1 and λ2 are introduced to fuse the prediction results with different long‐term sequence prediction performance, thereby further eliminating the influence of random errors. The results show that it is feasible to predict the workload of data centers based on the improved error correlation logic regression algorithm and the innovative spatiotemporal neural network structure Cross‐TRCN.
鉴于数据中心用户网络使用行为的随机性导致电力负荷具有较大的随机性,同时考虑到单一的随机性处理方法通常难以完全表征系统的不确定性特征,本文提出了一种基于改进的误差相关逻辑回归算法和名为 Cross-TRCN 的新型时空神经网络结构的双重融合预测分析模型。引入两个权重系数 λ1 和 λ2 来融合不同长期序列预测性能的预测结果,从而进一步消除随机误差的影响。结果表明,基于改进的误差相关逻辑回归算法和创新的时空神经网络结构 Cross-TRCN 预测数据中心的工作量是可行的。
{"title":"Workload prediction based on improved error correlation logistic regression algorithm and Cross‐TRCN of spatiotemporal neural network","authors":"Xin Wan, Xiang Huang, Fuzhi Wang","doi":"10.1002/nem.2272","DOIUrl":"https://doi.org/10.1002/nem.2272","url":null,"abstract":"In view of the randomness of user network usage behavior in data centers, which leads to a large randomness in power load, and considering that a single randomness processing method is usually difficult to fully characterize the uncertain characteristics of the system, this paper proposes a dual fusion prediction analysis model based on an improved error correlation logic regression algorithm and a novel spatiotemporal neural network structure called Cross‐TRCN. Two weight coefficients λ1 and λ2 are introduced to fuse the prediction results with different long‐term sequence prediction performance, thereby further eliminating the influence of random errors. The results show that it is feasible to predict the workload of data centers based on the improved error correlation logic regression algorithm and the innovative spatiotemporal neural network structure Cross‐TRCN.","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"6 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140840115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SMS2DC: Synchronous mobile sinks scheduling for data collection in internet of things‐enabled wireless sensor networks SMS2DC:面向物联网无线传感器网络数据收集的同步移动汇调度
IF 1.5 4区 计算机科学 Q2 Computer Science Pub Date : 2024-04-16 DOI: 10.1002/nem.2267
Nagalapuram Selvarajan Swapna, Raguru Jaya Krishna, Avija Vishnuvardhan Reddy, Patike Kiran Rao, Perumalla Suman Prakash
SummaryEnergy‐efficient data collection in wireless sensor networks (WSNs) is crucial due to the limited battery capacity of sensor nodes (SNs). Using a mobile sink (MS) for data collection can lower the energy consumption of SNs to avoid relaying in WSNs. However, a single MS is not a feasible solution for large‐scale WSNs, so it was necessary to use multiple MSs to collect data. A synchronous MS scheduling strategy for data collection (SMS2DC) is proposed in this paper, which uses two types of MS, a local MS to collect data from SN and a global MS to collect data from local MS. In this process, we begin by partitioning the network based on chemical reaction optimization. For each partition, a MS is assigned and scheduled using a path construction strategy according to a geometric path construction approach. In addition, a global MS is scheduled based on a local MS trajectory by identifying the most appropriate collision point to collect data. As a result, the algorithm increases data collection accuracy while minimizing network data loss. The asymptotic time complexity of the proposed SMS2DC algorithm needed . The comparison results show the superiority of the proposed SMS2DC strategy under multiple scenarios under various deployment conditions.
摘要由于传感器节点(SN)的电池容量有限,因此无线传感器网络(WSN)中的节能数据收集至关重要。使用移动汇(MS)进行数据收集可以降低 SN 的能耗,从而避免 WSN 中的中继。但是,单个 MS 对于大规模 WSN 来说并不可行,因此有必要使用多个 MS 来收集数据。本文提出了一种用于数据收集的同步 MS 调度策略(SMS2DC),它使用两种类型的 MS,一种是本地 MS,用于收集来自 SN 的数据;另一种是全局 MS,用于收集来自本地 MS 的数据。在此过程中,我们首先根据化学反应优化对网络进行分区。对于每个分区,根据几何路径构建方法,使用路径构建策略分配和调度一个 MS。此外,通过确定最合适的碰撞点来收集数据,根据局部 MS 轨迹调度全局 MS。因此,该算法提高了数据收集的准确性,同时最大限度地减少了网络数据丢失。所提出的 SMS2DC 算法的渐近时间复杂度为 .对比结果表明,在各种部署条件下的多个场景中,拟议的 SMS2DC 策略都具有优越性。
{"title":"SMS2DC: Synchronous mobile sinks scheduling for data collection in internet of things‐enabled wireless sensor networks","authors":"Nagalapuram Selvarajan Swapna, Raguru Jaya Krishna, Avija Vishnuvardhan Reddy, Patike Kiran Rao, Perumalla Suman Prakash","doi":"10.1002/nem.2267","DOIUrl":"https://doi.org/10.1002/nem.2267","url":null,"abstract":"SummaryEnergy‐efficient data collection in wireless sensor networks (WSNs) is crucial due to the limited battery capacity of sensor nodes (SNs). Using a mobile sink (MS) for data collection can lower the energy consumption of SNs to avoid relaying in WSNs. However, a single MS is not a feasible solution for large‐scale WSNs, so it was necessary to use multiple MSs to collect data. A synchronous MS scheduling strategy for data collection (SMS2DC) is proposed in this paper, which uses two types of MS, a local MS to collect data from SN and a global MS to collect data from local MS. In this process, we begin by partitioning the network based on chemical reaction optimization. For each partition, a MS is assigned and scheduled using a path construction strategy according to a geometric path construction approach. In addition, a global MS is scheduled based on a local MS trajectory by identifying the most appropriate collision point to collect data. As a result, the algorithm increases data collection accuracy while minimizing network data loss. The asymptotic time complexity of the proposed SMS2DC algorithm needed . The comparison results show the superiority of the proposed SMS2DC strategy under multiple scenarios under various deployment conditions.","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"49 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140612709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
International Journal of Network Management
全部 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1