JamBIT: RL-based framework for disrupting adversarial information in battlefields

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Muhammad Salman , Taehong Lee , Ali Hassan , Muhammad Yasin , Kiran Khurshid , Youngtae Noh
{"title":"JamBIT: RL-based framework for disrupting adversarial information in battlefields","authors":"Muhammad Salman ,&nbsp;Taehong Lee ,&nbsp;Ali Hassan ,&nbsp;Muhammad Yasin ,&nbsp;Kiran Khurshid ,&nbsp;Youngtae Noh","doi":"10.1016/j.adhoc.2024.103697","DOIUrl":null,"url":null,"abstract":"<div><div>During battlefield operations, military radios (hereafter nodes) exchange information among various units using a mobile ad-hoc network (MANET) due to its infrastructure-less and self-healing capabilities. Adversarial cyberwarfare plays a crucial role in modern combat by disrupting communication between critical nodes (i.e., nodes mainly responsible for propagating important information) to gain dominance over the opposing side. However, determining critical nodes within a complex network is an NP-hard problem. This paper formulates a mathematical model to identify important links and their connected nodes, and presents JamBIT, a reinforcement learning-based framework with an encoder–decoder architecture, for efficiently detecting and jamming critical nodes. The encoder transforms network structures into embedding vectors, while the decoder assigns a score to the embedding vector with the highest reward. Our framework is trained and tested on custom-built MANET topologies using the Named Data Networking (NDN) protocol. JamBIT has been evaluated across various scales and weighting methods for both connected node and network dismantling problems. Our proposed method outperformed existing RL-based baselines, with a 24% performance gain for smaller topologies (50–100 nodes) and 8% for larger ones (400–500 nodes) in connected node problems, and a 7% gain for smaller topologies and 15% for larger ones in network dismantling problems.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"167 ","pages":"Article 103697"},"PeriodicalIF":4.4000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524003081","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

During battlefield operations, military radios (hereafter nodes) exchange information among various units using a mobile ad-hoc network (MANET) due to its infrastructure-less and self-healing capabilities. Adversarial cyberwarfare plays a crucial role in modern combat by disrupting communication between critical nodes (i.e., nodes mainly responsible for propagating important information) to gain dominance over the opposing side. However, determining critical nodes within a complex network is an NP-hard problem. This paper formulates a mathematical model to identify important links and their connected nodes, and presents JamBIT, a reinforcement learning-based framework with an encoder–decoder architecture, for efficiently detecting and jamming critical nodes. The encoder transforms network structures into embedding vectors, while the decoder assigns a score to the embedding vector with the highest reward. Our framework is trained and tested on custom-built MANET topologies using the Named Data Networking (NDN) protocol. JamBIT has been evaluated across various scales and weighting methods for both connected node and network dismantling problems. Our proposed method outperformed existing RL-based baselines, with a 24% performance gain for smaller topologies (50–100 nodes) and 8% for larger ones (400–500 nodes) in connected node problems, and a 7% gain for smaller topologies and 15% for larger ones in network dismantling problems.
JamBIT:基于 RL 的战场对抗信息干扰框架
在战场行动中,军用无线电(以下简称节点)利用移动特设网络(MANET)在不同单位之间交换信息,因为该网络不需要基础设施,而且具有自愈能力。对抗性网络战通过破坏关键节点(即主要负责传播重要信息的节点)之间的通信,在现代作战中发挥着至关重要的作用,从而获得对对方的主导权。然而,在复杂的网络中确定关键节点是一个 NP 难度很高的问题。本文提出了一个数学模型来识别重要链接及其连接的节点,并介绍了基于强化学习、采用编码器-解码器架构的框架 JamBIT,用于高效地检测和干扰关键节点。编码器将网络结构转换为嵌入向量,而解码器则为奖励最高的嵌入向量分配分数。我们的框架使用命名数据网络(NDN)协议在定制的城域网拓扑上进行了训练和测试。JamBIT 针对连接节点和网络解体问题的不同规模和加权方法进行了评估。我们提出的方法优于现有的基于 RL 的基线方法,在连接节点问题中,较小拓扑(50-100 个节点)的性能提高了 24%,较大拓扑(400-500 个节点)的性能提高了 8%;在网络拆除问题中,较小拓扑的性能提高了 7%,较大拓扑的性能提高了 15%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信