{"title":"基于边界节点检测的无线自组网干扰区跟踪","authors":"S. Saurabh, Rishabh Rustogi","doi":"10.1109/ANTS.2018.8710095","DOIUrl":null,"url":null,"abstract":"Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Tracing Jammed Area in Wireless Ad-hoc Network using Boundary Node Detection\",\"authors\":\"S. Saurabh, Rishabh Rustogi\",\"doi\":\"10.1109/ANTS.2018.8710095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.\",\"PeriodicalId\":273443,\"journal\":{\"name\":\"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ANTS.2018.8710095\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2018.8710095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
基于无线介质的自组织网络容易受到各种安全威胁。其中一种威胁是干扰攻击,攻击者使用高能信号阻塞无线媒体。这就导致了沟通的中断。这种攻击属于DoS (Denial of Service)攻击。对于军事和灾害管理服务来说,持续可靠的通信是至关重要的,这种攻击构成了严重威胁。这个问题的一个潜在解决方案是使用自动阻塞区域制图方案,它可以识别阻塞区域并将其报告给有关当局,以便采取所需的行动。目前存在一些拥堵区域测绘协议,但它们都面临着诸如广泛的洪水、带宽浪费和低准确率等障碍。这些方案是基于接收来自位于阻塞区域的节点的应答,该区域发送和接收消息的概率很低。在本文中,我们提出了一种不依赖于接收来自任何阻塞节点的消息来定位阻塞区域的算法。该算法在较短的时间内以较高的精度跟踪边界节点。我们使用NS3对我们的算法进行了仿真,在识别边界节点时,准确率约为95%,假阳性率为4.6%,假阴性为零。
Tracing Jammed Area in Wireless Ad-hoc Network using Boundary Node Detection
Ad-hoc Networks, which are based on wireless medium, are susceptible to various kinds of security threats. One such threat is the jamming attack where the attacker jams the wireless medium using high energy signals. This leads to the disruption in communication. This attack falls under the category of Denial of Service (DoS) attack. For military and disaster management services, where continuous and reliable communication is of utmost importance, this attack poses a serious threat. A potential solution to this problem is to use the automated jammed area mapping schemes, which can identify the jammed region and report it to the concerned authorities for taking required action. There exists a few jammed area mapping protocols, however they suffer from hurdles like extensive flooding, wasted bandwidth and low accuracy-rate. These schemes are based on receiving replies from the nodes located in the jammed region where the probability of sending and receiving messages is quite low. In this paper, we propose an algorithm which can locate the the jammed region without needing to rely on receiving messages from any jammed node. Our algorithm traces the boundary nodes with high accuracy in less amount of time. We performed the simulation of our algorithms using NS3 and observed an accuracy of around 95%, false-positive rate of 4.6% and zero false-negative in identifying the boundary nodes.