An efficient stream region sink position analysis model for routing attack detection in mobile ad hoc networks

https://doi.org/10.1016/j.compeleceng.2019.02.005Get rights and content

Abstract

Under real-world conditions, simply finding the congestion or energy parameter in the hops of routes does not lead to efficient performance. Hence an efficient stream region sink position analysis (ESRSPA) model for improving attack detection in mobile ad hoc networks (MANETs) is developed. Attack detection is the process of identifying malicious nodes which are located in the system. A MANET has numerous nodes, which are free to move in any direction. The mobile nodes perform cooperative routing and elect the head node for receiving updates; this is known as sink position analysis. The nodes come under the stream position and send updates to the sink and other controlling nodes. In this manner, complete information can be traced and a set of actions be performed in various applications. The ESPRA reduces the routing overhead by 50% with a 96.86% throughput claims the ESPRA over other existing methods namely G-Hazard, FBRD, LFR-TA.

Introduction

A MANET, being a highly frequent and loosely coupled type of network, increases the feasibility of different attacks by adversaries. Among various attacks, sinkhole attack is the attack which affects the overall traffic passing through a particular node.

Routing attacks may also be upturned by malicious nodes which make traffic follow data to an affected frequency where a straight route exists. The malicious node may propose that traffic passes through a particular node which generates an attack in the network. Likewise, various incidents happen in the form of routing attacks.

Based on the network scenario, nodes easily choose the shortest path during data transmission time, if it is an attacker node, it exposes the base station to the source; otherwise, normal processes will happen in the network. On receiving this information, the neighboring nodes conclude that the adversary is located as the closest neighbor. Hereafter, the neighboring nodes forward the packet via the sink, which can carry out an attack in the network. The attacker can read packets coming from compromised nodes and initiate the selective packet modification process in the network. Thus, there is a higher demand for protocols to detect the mitigation of Sybil attacks.

In networks, the intermediate nodes take an interest in sending data packets to realize the desired goal. Once a group of nodes trade off with the attacker, the packets pursue a similar path to achieve the objective. A higher designed foe has more energy to produce an assault and could take an interest in a significant number of transmissions and directing procedures. Along these lines, the activity example and stream data could be utilized to distinguish assaults. In our view, all attackers are only focused on damaging packets, rather than considering route management in the network.

The network's obliged node acts as a unique sensor node which moves around the sensor network. As an individual sensor node is centered on a specific location, this means that it should follow the base station procedure for data transmission in the network. Each sensor node must consider the transmission medium, such that intermediate nodes can be chosen.

This implicates the issue of vitality streamlining in mobile remote sensor networks. Nodes are battery sourced and devour vitality as the computations begin. The nodes perform various computations to transmit data, to be in the transmission region and move to another location.

The amount of energy in nodes depends on the distance traveled or transmitted and the span of information to be sent. The objective is to locate the ideal places of nodes along a transmission path in order to maximize the aggregate energy spent. Easily dispensable and versatile transfers are utilized to diminish the total energy utilization information escalated in a MANET. This iterative calculation unites the ideal position for every node, provided that the directing tree topology does not change. Efficiently conveyed usage is displayed for every calculation requiring constrained and limited synchronization. Since it does not compute an ideal topology, the last steering tree is not ideal. Consequently, the correspondence deferrals can be altogether diminished and contrasted, to utilize portable sinks.

The organization of this article is as follows. Section 1 introduces the need of this article, Section 2 reviews the survey on related literature, Section 3 sets out the methodology of the proposed work, Section 4 analyze the obtained results and Section 5 concludes the article.

Section snippets

Related work

Malicious nodes dispatch dynamic assaults to increase unapproved access to the network by embedding artificial packets or changing the current packet transmission. Active attacks can be categorized as outer assaults and inward assaults. In an attack from outside, the nodes are part of an external network endeavor to upset an internal network [1], [2], [3]. In a residential attack, both traded-off or captured nodes and assaulting nodes can be found within a similar system [4].

Meanwhile, complex

Methodology

The Efficient Stream Region Sink Position Analysis (ESRSPA) method is proposed to overcome the above discussed issues. The ESRSPA method concerns traces about sink nodes present in each stream. The related process has a number of stages: stream region discovery, sink position analysis and attack detection. Each of the functional components are detailed in this section, including data which are fetched at an earlier time window, data availability and the presence of few supporting data sinks.

Result and discussion

Attack detection has been executed in the NS 2.28 network test system format under different situations. The conduct of the recommended approaches is examined with an assortment of recreation parameters. In terms of portability display, the versatility of a node from a location to another location can be empowered using the watchword “setdest” in the tool command language (TCL) content. Nodes are arranged with the following parts of the channel: networking interface, radio engendering model,

Conclusion

Routing attacks in MANETs have been considered in several articles and shown to affect the quality of service of these networks. Previous approaches have considered routing congestion, which only monitors the congestion ratio in the routes available. Detection is performed based on the computed value of the ESRSPA. The terms of the region have to be collected in a particular node, which is capable of more energy and other factors. Here, the behavior of every node is evaluated and calculates the

M. Vigenesh received his BE and ME, both in computer science and engineering, from Vinayaka Missions Kirupananda Variyar Engineering College, India in 2009 and 2011, respectively. He is currently pursuing a PhD in computer science and engineering at the Karpagam Academy of Higher Education in Coimbatore. His research areas of interest include wireless networks and network security.

References (25)

  • N. Fareena et al.

    Mobility based energy efficient multicast protocol for MANET

    Proc. Eng

    (2012)
  • M. Bloch et al.

    Wireless information-theoretic security

    IEEE Trans Inf Theory

    (2008)
  • B.G. Choi et al.

    A sinkhole attack detection mechanism for LQI based mesh routing in WSN

  • T. Halonen et al.

    GSM, GPRS and EDGE performance: evolution towards 3G/UMTS

    (2004)
  • Y.-Ch. Hu et al.

    Ariadne: a secure on-demand routing protocol for ad hoc networks

    Wireless Netw

    (2005)
  • B. Kannhavong et al.

    A survey of routing attacks in mobile ad hoc networks

    IEEE Wirel Commun

    (2007)
  • M. Khabbazian et al.

    Severity analysis and countermeasure for the wormhole attack in wireless ad hoc networks

    IEEE Trans Wirel Commun

    (2009)
  • G. Lavanya et al.

    Secured backup routing protocol for ad hoc networks

  • A. Le et al.

    On detecting pollution attacks in inter-session network coding

  • S. Mishra et al.

    Energy efficiency in ad hoc networks

    Int J Ad hoc Sen Ubiquit Comput

    (2011)
  • F. Nait-Abdesselam et al.

    Detecting and avoiding wormhole attacks in wireless ad hoc networks

    IEEE Commun Mag

    (2008)
  • K. Nayak et al.

    Energy efficient consumption based performance of AODV, DSR and ZRP routing protocol in MANET

    Energy

    (2015)
  • Cited by (12)

    View all citing articles on Scopus

    M. Vigenesh received his BE and ME, both in computer science and engineering, from Vinayaka Missions Kirupananda Variyar Engineering College, India in 2009 and 2011, respectively. He is currently pursuing a PhD in computer science and engineering at the Karpagam Academy of Higher Education in Coimbatore. His research areas of interest include wireless networks and network security.

    R. Santhosh received his PhD in computer science and engineering from the Karpagam Academy of Higher Education in 2016. He is currently working as an Associate Professor in the Department of Computer Science and Engineering at the Karpagam Academy of Higher Education. His current research interests include cloud computing and computer networks.

    Reviews processed and recommended for publication to the Editor-in-Chief by Guest Editor Dr. P. Pandian.

    View full text