False Routing Information Research Articles

Detection of Data imbalance in MANET network based on ADSY-AEAMBi-LSTM with DBO Feature selection

<p>A Mobile Ad Hoc Network (MANET) is a temporary wireless network formed by mobile nodes. These nodes cooperate to relay information in a multi-hop fashion, but some malicious nodes can disrupt the network by providing false routing information. Traditional firewalls and encryption methods can’t keep up with the increasing diversity of network threats. To address these issues, Intrusion Detection Systems (IDS) have been developed. In this paper, a new intrusion detection framework named ADSY-AEAMBi-LSTM is introduced. This acronym stands for a bidirectional Long Short-Term Memory (LSTM) model and an adaptive synthetic auto-encoder attention mechanism. The Dung Beetle Optimizer is used to identify optimal features after data preprocessing, followed by classification using ADSY-AEAMBi-LSTM. The study evaluates this model using three datasets: CIC-IDS 2017, UNSW-NB15, and WSN-DS.</p>

Use of Node credibility and Andrews plot to detect and prevent BHA in MANET

The MANET wireless network operates independently of any infrastructure and can establish connections dynamically, making it highly accessible regardless of the environment. However, the network is vulnerable to attacks such as the BHA, which can cause the depletion of the network. This attack introduces MNs into the network, providing false routing information to the source node. This leads to the drop of data packets and ultimately damages the network. To address this issue, we propose a node credibility-based approach that utilizes Andrew's plot to assess node credibility after several transactions. This method enables us to identify highly credible nodes which can be considered trustworthy in the network. We utilized Network Simulator software to create various MANET scenarios and test the effectiveness of our proposed approach against the BHA.

The Impact of Mobile DIS and Rank-Decreased Attacks in Internet of Things Networks

With a predicted 50 billion devices by the end of 2020, the Internet of things has grown exponentially in the last few years. This growth has seen an increasing demand for mobility support in low power and lossy sensor networks, a type of network characterized by several limitations in terms of their resources including CPU, memory and batter, causing manufactures to push products out to the market faster, without the necessary security features. IoT networks rely on the Routing Protocol for Low Power and Lossy Network (RPL) for communication, designed by the Internet Engineering Task Force (IETF). This protocol has been proven to be efficient in relation to the handling of routing in such constrained networks, However, research studies revealed that RPL was inherently designed for static networks, indicating poor handling of mobile or dynamic topologies which is worsen when introducing mobile attacker. In this paper, two IoT routing attacks are evaluated under a mobile attacker with the aim of providing a critical evaluation of the impact the attacks have on the network in comparison to the case with static attacker. The first attack is the Rank attack in which the attacker announces false routing information to its neighbour attracting them to forward their data via the attacker. The second attack is the DIS attack in which the attacker floods the network with DIS messages triggering them to reset their transmission timers and sending messages more frequently. The comparison were conducted in terms of average power consumption and also the packet delivery ratio (PDR). Based on the results collected from the simulations, it was established that when an attacking node is mobile, there’s an average increase of 36.6 in power consumption and a decrease of 14 for packet delivery ratios when compared to a static attacking node.

A Blackhole Attack Mitigation Algorithm in MANET based on Standard Deviation Outlier Detection

A mobile ad hoc network (MANET) performs a routing and data forwarding obligations in a trustless environment where mobile nodes are not controlled and administered by third parties, it usually suffers from multiple attacks such as the blackhole attacks. This blackhole attacks cause two extreme effects on the network if the malicious nodes are not eliminated. Firstly, it deliberately alters the original data route sequence with an injection of false routing information comprises of the counterfeit destination sequence number and smallest hop count. Secondly, it becomes too greedy to send data to other nodes after receiving from a genuine node. Therefore, this may delay the data transmission process in the act of data dropping. To protect the routing discovery process of an ad hoc on-demand distance vector (AODV) protocol from the blackhole attack, we present a mitigation algorithm based on standard deviation outlier detection to determine a threshold value for validating the route reply (RREP) destination sequence number before route establishment. The simulation shows that the algorithm can detect the malicious nodes and performs better than AODV in a blackhole attack environment.

DRI-Based Implementation for Detecting and Eliminating Cooperative Black Hole Nodes in MANET

Mobile Ad hoc Networks is configured by itself using the Mobile nodes in the Network, the maintenance also done by the wireless nodes itself. Dynamic topology, hop-to-hop communication and open-to-all are the features of MANETS, but these features made security of network highly challengeable. From security concern, routing protocols are highly vulnerable to many security threats like black hole attack. In black hole attack malicious node generates false routing information to the path requests about the route it asked for, which results all data packets forward toward it-self by the source and the black hole node manipulate its data. The cooperative black hole nodes in the other hand cooperate within the malicious nodes to fool the single black hole attack prevention algorithms. Here an approach is proposed to detecting the cooperative black holes nodes and eliminate them by broad casting there information into the network.

A Dual Attack Detection Technique to Identify Black and Gray Hole Attacks Using an Intrusion Detection System and a Connected Dominating Set in MANETs

A mobile ad-hoc network (MANET) is a temporary network of wireless mobile nodes. In a MANET, it is assumed that all of the nodes cooperate with each other to transfer data packets in a multi-hop fashion. However, some malicious nodes don’t cooperate with other nodes and disturb the network through false routing information. In this paper, we propose a prominent technique, called dual attack detection for black and gray hole attacks (DDBG), for MANETs. The proposed DDBG technique selects the intrusion detection system (IDS) node using the connected dominating set (CDS) technique with two additional features; the energy and its nonexistence in the blacklist are also checked before putting the nodes into the IDS set. The CDS is an effective, distinguished, and localized approach for detecting nearly-connected dominating sets of nodes in a small range in mobile ad hoc networks. The selected IDS nodes broadcast a kind of status packet within a size of the dominating set for retrieving the complete behavioral information from their nodes. Later, IDS nodes use our DDBG technique to analyze the collected behavioral information to detect the malicious nodes and add them to the blacklist if the behavior of the node is suspicious. Our experimental results show that the quality of the service parameters of the proposed technique outperforms the existing routing schemes.

EDIS: an effective method for detection and isolation of sinkhole attacks in mobile ad hoc networks

Reactive routing protocols in Mobile Ad Hoc Networks MANETs such as Ad Hoc On-Demand Distance Vector AODV and Dynamic Source Routing DSR are vulnerable to sinkhole attack. Sinkhole attack is a route disruption attack. The malicious sinkhole nodes attempt to lure almost all the traffic by propagating false routing information and disrupting the normal operation of the network. The sinkhole nodes should be detected and isolated from the MANET as early as possible. Hence, a consistent, reliable and effective method of detecting sinkhole nodes is required. We have developed a method to detect the sinkhole nodes by observing the behaviour of the mobile nodes in the neighbourhood and isolating them from the MANET. The proposed method was simulated and the experimental analysis was carried out. The results show that the proposed method is consistent, reliable and effective in detecting and isolating the sinkhole nodes in MANET.

A Fortify Approach to Secure AODV Protocol against Black Hole Attacks

The advent of mobile and miniature devices in wireless technology gives rise to new paradigm called Mobile Ad-hoc Network (MANET). MANETs are self-maintaining, self administered dynamic network. MANETs are vulnerabilities in the MANET due to its intrinsic characteristic that make it insecure against various security threats.The black hole attack is forthcoming among them that are launched on AODV protocol. In these attacks, a malicious node disrupts data transmission by sending false routing information containing very high sequence numbers. To deal with these attacks, we proposed an incentive mechanism that protects network against this attack. This mechanism is integrated into route decision making process of the AODV protocol to defend the black-hole attack.

A New Intrusion Detection System Based on KNN Classification Algorithm in Wireless Sensor Network

The Internet of Things has broad application in military field, commerce, environmental monitoring, and many other fields. However, the open nature of the information media and the poor deployment environment have brought great risks to the security of wireless sensor networks, seriously restricting the application of wireless sensor network. Internet of Things composed of wireless sensor network faces security threats mainly from Dos attack, replay attack, integrity attack, false routing information attack, and flooding attack. In this paper, we proposed a new intrusion detection system based onK-nearest neighbor (K-nearest neighbor, referred to as KNN below) classification algorithm in wireless sensor network. This system can separate abnormal nodes from normal nodes by observing their abnormal behaviors, and we analyse parameter selection and error rate of the intrusion detection system. The paper elaborates on the design and implementation of the detection system. This system has achieved efficient, rapid intrusion detection by improving the wireless ad hoc on-demand distance vector routing protocol (Ad hoc On-Demand Distance the Vector Routing, AODV). Finally, the test results show that: the system has high detection accuracy and speed, in accordance with the requirement of wireless sensor network intrusion detection.

Using Trust to Secure Geographic and Energy Aware Routing against Multiple Attacks

To address the vulnerability of geographic routing to multiple security threats such as false routing information, selective forwarding and the Sybil attack in wireless sensor networks, this paper proposes a trust-based defending model against above-mentioned multiple attacks. Considering the characteristics of resource-constrained sensor nodes, trust values of neighboring nodes on the routing path can be calculated through the Dirichlet distribution function, which is based on data packets' acknowledgements in a certain period instead of energy-consuming monitoring. Trust is combined with the cost of geographic and energy aware routing for selecting the next hop of routing. At the same time, the initial trust is dynamically determined, service requests are restricted for malicious nodes in accordance with trust values, and the impact of node mobility is weakened by the trust evolution. The simulation results and analysis show that the proposed model under multiple attacks has advantages in packet delivery ratio and network lifetime over the existing models.

A Safety Algorithm of P2P Routing based on Multiple-Encryption Detecting Technology

The nodes can freely join or leave the P2P network, which will lead to much false routing information that can cripple the performance of P2P network. Many hackers also utilize the weaken point to attack the P2P network. We propose a safety routing algorithm for P2P network to resist the routing attack. The algorithm adopts the multiple-encryption detecting technology. The node which launches the communicating connection will periodically detect every node in its routing path by sending some multiple-encryption detecting packets. By the responding message of the detected nodes, the malicious or disable nodes in its routing path will be accurately located and kicked out of the routing table. Simulation experiments demonstrate the algorithm can effectively improve the safety of the P2P routing and topology stability of the P2P network. DOI: http://dx.doi.org/10.11591/telkomnika.v11i10.3411

애드혹 네트워크에서의 one-time 전자 서명을 이용한 라우팅 보안 메커니즘

애드혹 네트워크는 기존의 유무선 네트워크의 고정된 기반시설(infrastructure) 없이 이동 호스트들만으로 구성된 무선 환경의 네트워크이다. 애드혹 네트워크의 기본 특성, 즉, 링크의 불안정성, 각 노드의 물리적 보호의 한계, 노드간 연결의 산재성, 토폴로지의 동적인 변화 뿐 아니라 악의적인 노드의 활동으로 인해 라우팅 보안에 대한 위험성은 매우 높다 따라서 본 논문에서는 애드혹 네트워크에서 경로 탐색이나 설정 과정중 악의적인 노드가 라우팅 메시지를 변조, 위조하거나 다른 노드를 가장하여 잘못된 라우팅 정보를 네트워크에 주입시키는 공격을 방지하기 위하여 일방향 해쉬 함수를 기초로 한 one-time 전자 서명을 이용한 라우팅 보안 메커니즘을 제안한다. 제안하는 메커니즘에서 노드들은 라우팅 메시지를 서명하기 위하여 공개키 요소의 첫 세트를 반복적으로 해쉬 함수에 적용함으로써 해쉬 체인을 생성하고, 생성된 해쉬 체인으로부터 공개키 요소들을 여러 세트 유도하여 해쉬 테이블을 생성한다. 해쉬 테이블 생성 후, 노드들은 자신의 공개키 요소를 다른 노드들에게 공표하고 라우팅 메시지를 전송할 경우 one-time 전자 서명을 포함한다. 이러한 one-time 전자 서명은 라우팅 메시지를 인증하고 메시지에 무결성을 제공한다. 제안하는 라우팅 보안 메커니즘은 이동성이 높은 네트워크 환경에서는 보안을 고려하지 않은 라우팅 메커니즘에 비해 라우팅 오버헤드가 좀더 높아지지만, 경로를 탐색하고 설정하는 과정에서 악의적인 노드의 공격에 대하여 훨씬 높은 안전성을 제공함을 시뮬레이션을 통해서 확인할 수 있다. In ad-hoc network, there is no fixed infrastructure such as base stations or mobile switching centers. The security of ad-hoc network is more vulnerable than traditional networks because of the basic characteristics of ad-hoc network, and current muting protocols for ad-hoc networks allow many different types of attacks by malicious nodes. Malicious nodes can disrupt the correct functioning of a routing protocol by modifying routing information, by fabricating false routing information and by impersonating other nodes. We propose a routing suity mechanism based on one-time digital signature. In our proposal, we use one-time digital signatures based on one-way hash functions in order to limit or prevent attacks of malicious nodes. For the purpose of generating and keeping a large number of public key sets, we derive multiple sets of the keys from hash chains by repeated hashing of the public key elements in the first set. After that, each node publishes its own public keys, broadcasts routing message including one-time digital signature during route discovery and route setup. This mechanism provides authentication and message integrity and prevents attacks from malicious nodes. Simulation results indicate that our mechanism increases the routing overhead in a highly mobile environment, but provides great security in the route discovery process and increases the network efficiency.

Securing the Internet routing infrastructure

The unprecedented growth of the Internet over the last years, and the expectation of an even faster increase in the numbers of users and networked systems, resulted in the Internet assuming its position as a mass communication medium. At the same time, the emergence of an increasingly large number of application areas and the evolution of the networking technology suggest that in the near future the Internet may become the single integrated communication infrastructure. However, as the dependence on the networking infrastructure grows, its security becomes a major concern, in light of the increased attempt to compromise the infrastructure. In particular, the routing operation is a highly visible target that must be shielded against a wide range of attacks. The injection of false routing information can easily degrade network performance, or even cause denial of service for a large number of hosts and networks over a long period of time. Different approaches have been proposed to secure the routing protocols, with a variety of countermeasures, which, nonetheless, have not eradicated the vulnerability of the routing infrastructure. In this article, we survey the up-to-date secure routing schemes. that appeared over the last few years. Our critical point of view and thorough review of the literature are an attempt to identify directions for future research on an indeed difficult and still largely open problem.