Tracing Jammed Area in Wireless Ad-hoc Network using Boundary Node Detection
01 Dec 2018-pp 1-4
TL;DR: An algorithm is proposed which can locate the the jammed region without needing to rely on receiving messages from any jammed node, and traces the boundary nodes with high accuracy in less amount of time.
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.
Citations
More filters
01 Jan 2021
TL;DR: In this article, the authors designed a cross-layer attack solution, where attackers attack two different layers at a time, and the proposed solutions perform in reducing these two attacks and significantly reduce the attack probability and increase channel utilization by primary users.
Abstract: Cognitive radio networks are the self-configuring and mainly solve the problem of spectrum utilization. Cognitive radio networks always try to identify Occupied or un-occupied channels for transmission. Cognitive radio networks (CRN’s) are an enabling technology for multiple features like dynamic spectrum access, spectrum sharing, and dynamic allocation. The existing research of security issues in CRN’s mainly considers attacks in individual layers and provides significant solutions but attacker cannot propagates his attacks in single layer. In this work, we designed a cross-layer attack solution, where attackers attack two different layers at a time. The attacks we considered are report false sensing data (RFSD) attack in physical layer and small backoff window (SBW) attack in MAC layer. Simulation results shows that our proposed solutions perform in reducing these two attacks and significantly reduce the attack probability and increase channel utilization by primary users.
3 citations
01 Jan 2021
TL;DR: In this article, Artificial Neural Networks (ANNs), Metaheuristic algorithms, RBSs, ontology-based systems (OBSs), and case based systems (CBSs) are used to increase the usage of underutilized channels.
Abstract: The Cognitive radio networks are the networks that are configured dynamically and are used to increase the usage of underutilized channels. Cognitive radio networks always try to identify idle or free channels for transmission. Cognitive radio (CR) is an enabling technology for multiple features like dynamic spectrum access, spectrum sharing, and dynamic allocation. To realize this application, a number of Artificial Intelligence (AI) techniques can be used. The AI techniques are artificial neural networks (ANNs), Metaheuristic algorithms, rule-based systems (RBSs), ontology-based systems (OBSs), and case-based systems (CBSs). Responsiveness, security, robustness these features are gaining more importance to the AI techniques and made them popular in the current scenario.
Patent•
03 Sep 2019
TL;DR: In this article, a cascading action candidate box generation method based on action boundary probability is proposed, which comprises the following steps of using a feature extraction network to obtain the features of an input video to be detected, and predicting the probability of belonging to an action boundary point at each position through a cascade model, wherein the cascade model is divided into two stages, the first stage model performs rough boundary prediction on input characteristics, and predicts the probability that each position belongs to a starting point, an action ending point and an action interior; serially connects the output of the first-
Abstract: The invention discloses a cascading action candidate box generation method based on action boundary probability, which comprises the following steps of using a feature extraction network to obtain thefeatures of an input video to be detected, and predicting the probability of belonging to an action boundary point at each position through a cascading model, wherein the cascade model is divided into two stages, the first stage model performs rough boundary prediction on input characteristics, and predicts the probability that each position belongs to an action starting point, an action ending point and an action interior; serially connects the output of the first-stage model with the original characteristics to serve as new characteristics and inputs the new characteristics into the second-stage model, so that the second-stage model predicts the probability that each position belongs to an action starting point, an action ending point and an action interior, and after the prediction probability of the cascade model is obtained, the positions of which the probability of the starting point or the ending point is greater than a set threshold are combined to obtain the action candidatebox. The method is simple and easy to implement and high in popularization capability, the quality of the generated candidate frames is high, and the influence of disordered video backgrounds and large target motion speed change range on adverse factors can be effectively overcome.
References
More filters
01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Abstract: Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.
3,819 citations
"Tracing Jammed Area in Wireless Ad-..." refers background in this paper
...Moreover, the query also caused flooding in the network[7]....
[...]
TL;DR: This survey presents a detailed up-to-date discussion on the jamming attacks recorded in the literature and describes various techniques proposed for detecting the presence of jammers.
Abstract: The shared nature of the medium in wireless networks makes it easy for an adversary to launch a Wireless Denial of Service (WDoS) attack. Recent studies, demonstrate that such attacks can be very easily accomplished using off-the-shelf equipment. To give a simple example, a malicious node can continually transmit a radio signal in order to block any legitimate access to the medium and/or interfere with reception. This act is called jamming and the malicious nodes are referred to as jammers. Jamming techniques vary from simple ones based on the continual transmission of interference signals, to more sophisticated attacks that aim at exploiting vulnerabilities of the particular protocol used. In this survey, we present a detailed up-to-date discussion on the jamming attacks recorded in the literature. We also describe various techniques proposed for detecting the presence of jammers. Finally, we survey numerous mechanisms which attempt to protect the network from jamming attacks. We conclude with a summary and by suggesting future directions.
638 citations
"Tracing Jammed Area in Wireless Ad-..." refers background in this paper
...Jamming[4], [5] in a network degrades its performance as it does not allow a packet to be received by the intended receiver or to be sent by the intended node....
[...]
03 Dec 2003
TL;DR: A mapping protocol for nodes that surround a jammer which allows network applications to reason about the region as an entity, rather than as a collection of broken links and congested nodes is described.
Abstract: Preventing denial-of-service attacks in wireless sensor networks is difficult primarily because of the limited resources available to network nodes and the ease with which attacks are perpetrated Rather than jeopardize design requirements which call for simple, inexpensive, mass-producible devices, we propose a coping strategy that detects and maps jammed regions We describe a mapping protocol for nodes that surround a jammer which allows network applications to reason about the region as an entity, rather than as a collection of broken links and congested nodes This solution is enabled by a set of design principles: loose group semantics, eager eavesdropping, supremacy of local information, robustness to packet loss and failure, and early use of results Performance results show that regions can be mapped in 1-5 seconds, fast enough for real-time response With a moderately connected network, the protocol is robust to failure rates as high as 25 percent
400 citations
Additional excerpts
...Wood[1] proposed a jammed area mapping (J....
[...]
TL;DR: This paper provides a comprehensive survey and a taxonomic classification to help interested researchers find the gaps in the literature and guide them to research areas that need to be explored.
103 citations
"Tracing Jammed Area in Wireless Ad-..." refers background in this paper
...Jamming[4], [5] in a network degrades its performance as it does not allow a packet to be received by the intended receiver or to be sent by the intended node....
[...]
TL;DR: This paper proposes a novel randomized protocol FRIEND, which is a prehandshaking ND protocol, to initialize synchronous full-duplex wireless ad hoc networks and shows that FRIEND can adapt to various scenarios and significantly decrease the duration of ND.
Abstract: Neighbor discovery (ND) is a basic and crucial step for initializing wireless ad hoc networks. A fast, precise, and energy-efficient ND protocol has significant importance to subsequent operations in wireless networks. However, many existing protocols have a high probability of generating idle slots in their neighbor discovering processes, which prolongs the executing duration, thus compromising their performance. In this paper, we propose a novel randomized protocol FRIEND, which is a prehandshaking ND protocol, to initialize synchronous full-duplex wireless ad hoc networks. By introducing a prehandshaking strategy to help each node be aware of activities of its neighborhood, we significantly reduce the probabilities of generating idle slots and collisions. Moreover, with the development of single-channel full-duplex communication technology, we further decrease the processing time needed in FRIEND and construct the first fullduplex ND protocol. Our theoretical analysis proves that FRIEND can decrease the duration of ND by up to 48% in comparison with classical ALOHA-like protocols. In addition, we propose HD-FRIEND for half-duplex networks and variants of FRIEND for multihop and duty-cycled networks. Both theoretical analysis and simulation results show that FRIEND can adapt to various scenarios and significantly decrease the duration of ND.
38 citations
"Tracing Jammed Area in Wireless Ad-..." refers methods in this paper
...We assume that each node has knowledge of its number of neighbors using some neighbor discovery protocol[3]....
[...]